Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600353.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:42 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 DoubleExponent-PT-020-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716427493984

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 01:24:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 01:24:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:24:55] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-23 01:24:55] [INFO ] Transformed 1064 places.
[2024-05-23 01:24:55] [INFO ] Transformed 998 transitions.
[2024-05-23 01:24:55] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 112 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2024-05-23 01:24:56] [INFO ] Invariants computation overflowed in 133 ms
[2024-05-23 01:24:56] [INFO ] Implicit Places using invariants in 594 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2024-05-23 01:24:56] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-23 01:25:13] [INFO ] Implicit Places using invariants and state equation in 16985 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17620 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 228 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:25:14] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-23 01:25:14] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:25:14] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-23 01:25:30] [INFO ] Implicit Places using invariants and state equation in 15904 ms returned []
Implicit Place search using SMT with State Equation took 16274 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34234 ms. Remains : 1057/1064 places, 997/998 transitions.
Support contains 54 out of 1057 places after structural reductions.
[2024-05-23 01:25:30] [INFO ] Flatten gal took : 90 ms
[2024-05-23 01:25:30] [INFO ] Flatten gal took : 49 ms
[2024-05-23 01:25:30] [INFO ] Input system was already deterministic with 997 transitions.
Support contains 52 out of 1057 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 32) seen :2
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :2
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:25:31] [INFO ] Invariants computation overflowed in 103 ms
[2024-05-23 01:25:34] [INFO ] After 2179ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:27
[2024-05-23 01:25:35] [INFO ] Deduced a trap composed of 65 places in 308 ms of which 6 ms to minimize.
[2024-05-23 01:25:35] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 2 ms to minimize.
[2024-05-23 01:25:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 746 ms
[2024-05-23 01:25:35] [INFO ] After 2968ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:28
[2024-05-23 01:25:35] [INFO ] After 3891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2024-05-23 01:25:44] [INFO ] After 7608ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :27
[2024-05-23 01:25:44] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 1 ms to minimize.
[2024-05-23 01:25:44] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 2 ms to minimize.
[2024-05-23 01:25:45] [INFO ] Deduced a trap composed of 53 places in 250 ms of which 0 ms to minimize.
[2024-05-23 01:25:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 964 ms
[2024-05-23 01:25:45] [INFO ] Deduced a trap composed of 127 places in 204 ms of which 1 ms to minimize.
[2024-05-23 01:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2024-05-23 01:25:46] [INFO ] Deduced a trap composed of 227 places in 146 ms of which 1 ms to minimize.
[2024-05-23 01:25:46] [INFO ] Deduced a trap composed of 211 places in 159 ms of which 1 ms to minimize.
[2024-05-23 01:25:47] [INFO ] Deduced a trap composed of 223 places in 145 ms of which 0 ms to minimize.
[2024-05-23 01:25:47] [INFO ] Deduced a trap composed of 209 places in 151 ms of which 0 ms to minimize.
[2024-05-23 01:25:47] [INFO ] Deduced a trap composed of 199 places in 141 ms of which 0 ms to minimize.
[2024-05-23 01:25:47] [INFO ] Deduced a trap composed of 186 places in 136 ms of which 0 ms to minimize.
[2024-05-23 01:25:47] [INFO ] Deduced a trap composed of 187 places in 138 ms of which 1 ms to minimize.
[2024-05-23 01:25:48] [INFO ] Deduced a trap composed of 197 places in 135 ms of which 1 ms to minimize.
[2024-05-23 01:25:48] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 0 ms to minimize.
[2024-05-23 01:25:48] [INFO ] Deduced a trap composed of 224 places in 158 ms of which 1 ms to minimize.
[2024-05-23 01:25:49] [INFO ] Deduced a trap composed of 202 places in 153 ms of which 1 ms to minimize.
[2024-05-23 01:25:49] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 0 ms to minimize.
[2024-05-23 01:25:49] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 0 ms to minimize.
[2024-05-23 01:25:49] [INFO ] Deduced a trap composed of 254 places in 162 ms of which 0 ms to minimize.
[2024-05-23 01:25:50] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 0 ms to minimize.
[2024-05-23 01:25:50] [INFO ] Deduced a trap composed of 256 places in 165 ms of which 1 ms to minimize.
[2024-05-23 01:25:50] [INFO ] Deduced a trap composed of 193 places in 161 ms of which 1 ms to minimize.
[2024-05-23 01:25:50] [INFO ] Deduced a trap composed of 113 places in 168 ms of which 0 ms to minimize.
[2024-05-23 01:25:50] [INFO ] Deduced a trap composed of 115 places in 173 ms of which 0 ms to minimize.
[2024-05-23 01:25:51] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 0 ms to minimize.
[2024-05-23 01:25:52] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 1 ms to minimize.
[2024-05-23 01:25:52] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 0 ms to minimize.
[2024-05-23 01:25:53] [INFO ] Deduced a trap composed of 103 places in 193 ms of which 0 ms to minimize.
[2024-05-23 01:25:53] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 0 ms to minimize.
[2024-05-23 01:25:53] [INFO ] Deduced a trap composed of 91 places in 209 ms of which 0 ms to minimize.
[2024-05-23 01:25:54] [INFO ] Deduced a trap composed of 79 places in 214 ms of which 0 ms to minimize.
[2024-05-23 01:25:54] [INFO ] Deduced a trap composed of 77 places in 210 ms of which 1 ms to minimize.
[2024-05-23 01:25:54] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 1 ms to minimize.
[2024-05-23 01:25:54] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8357 ms
[2024-05-23 01:25:55] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 3 ms to minimize.
[2024-05-23 01:25:56] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 0 ms to minimize.
[2024-05-23 01:25:56] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 1 ms to minimize.
[2024-05-23 01:25:56] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
[2024-05-23 01:25:57] [INFO ] Deduced a trap composed of 101 places in 197 ms of which 1 ms to minimize.
[2024-05-23 01:25:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1443 ms
[2024-05-23 01:26:00] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 1 ms to minimize.
[2024-05-23 01:26:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
[2024-05-23 01:26:00] [INFO ] After 24090ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-23 01:26:00] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 30448 ms.
Support contains 48 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 195 rules applied. Total rules applied 196 place count 1055 transition count 801
Reduce places removed 194 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 207 rules applied. Total rules applied 403 place count 861 transition count 788
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 416 place count 848 transition count 788
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 416 place count 848 transition count 745
Deduced a syphon composed of 43 places in 8 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 502 place count 805 transition count 745
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 11 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 3 with 324 rules applied. Total rules applied 826 place count 643 transition count 583
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 894 place count 609 transition count 583
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 896 place count 609 transition count 581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 898 place count 607 transition count 581
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 4 with 80 rules applied. Total rules applied 978 place count 607 transition count 501
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1058 place count 527 transition count 501
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 5 with 79 rules applied. Total rules applied 1137 place count 527 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1138 place count 526 transition count 500
Applied a total of 1138 rules in 324 ms. Remains 526 /1057 variables (removed 531) and now considering 500/997 (removed 497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 526/1057 places, 500/997 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 159770 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{23=1}
Probabilistic random walk after 159770 steps, saw 79903 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :1
Running SMT prover for 26 properties.
// Phase 1: matrix 500 rows 526 cols
[2024-05-23 01:26:35] [INFO ] Invariants computation overflowed in 83 ms
[2024-05-23 01:26:35] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:25
[2024-05-23 01:26:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-23 01:26:36] [INFO ] After 308ms SMT Verify possible using 65 Read/Feed constraints in real domain returned unsat :0 sat :0 real:26
[2024-05-23 01:26:36] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2024-05-23 01:26:38] [INFO ] After 2119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2024-05-23 01:26:42] [INFO ] After 3268ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2024-05-23 01:26:42] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-23 01:26:42] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-23 01:26:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2024-05-23 01:26:43] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 4 ms to minimize.
[2024-05-23 01:26:43] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 0 ms to minimize.
[2024-05-23 01:26:43] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 1 ms to minimize.
[2024-05-23 01:26:43] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2024-05-23 01:26:43] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 1 ms to minimize.
[2024-05-23 01:26:44] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 1 ms to minimize.
[2024-05-23 01:26:44] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 2 ms to minimize.
[2024-05-23 01:26:44] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-23 01:26:44] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 1 ms to minimize.
[2024-05-23 01:26:44] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2024-05-23 01:26:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1927 ms
[2024-05-23 01:26:45] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2024-05-23 01:26:46] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 0 ms to minimize.
[2024-05-23 01:26:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2024-05-23 01:26:46] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 0 ms to minimize.
[2024-05-23 01:26:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-23 01:26:47] [INFO ] After 8949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 2403 ms.
[2024-05-23 01:26:50] [INFO ] After 13924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 30000 ms.
Support contains 46 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 500/500 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 525 transition count 499
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 525 transition count 499
Applied a total of 3 rules in 52 ms. Remains 525 /526 variables (removed 1) and now considering 499/500 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 525/526 places, 499/500 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 31 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:27:20] [INFO ] Invariants computation overflowed in 154 ms
[2024-05-23 01:27:20] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:27:21] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-23 01:27:36] [INFO ] Implicit Places using invariants and state equation in 15972 ms returned []
Implicit Place search using SMT with State Equation took 16446 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:27:36] [INFO ] Invariants computation overflowed in 113 ms
[2024-05-23 01:27:37] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16950 ms. Remains : 1057/1057 places, 997/997 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s922 1) (LT s591 1)), p0:(GEQ s514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3317 reset in 236 ms.
Product exploration explored 100000 steps with 3294 reset in 186 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 222161 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222161 steps, saw 111102 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:27:41] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 01:27:43] [INFO ] After 1944ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-23 01:27:45] [INFO ] After 2064ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-23 01:27:46] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 4 ms to minimize.
[2024-05-23 01:27:46] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 1 ms to minimize.
[2024-05-23 01:27:46] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 0 ms to minimize.
[2024-05-23 01:27:47] [INFO ] Deduced a trap composed of 127 places in 173 ms of which 0 ms to minimize.
[2024-05-23 01:27:47] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 1 ms to minimize.
[2024-05-23 01:27:47] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 0 ms to minimize.
[2024-05-23 01:27:47] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 0 ms to minimize.
[2024-05-23 01:27:47] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 2 ms to minimize.
[2024-05-23 01:27:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2087 ms
[2024-05-23 01:27:48] [INFO ] After 4505ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-23 01:27:48] [INFO ] After 4845ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 947 ms.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 1079 place count 556 transition count 454
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 1158 place count 477 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1237 place count 477 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1238 place count 476 transition count 453
Applied a total of 1238 rules in 118 ms. Remains 476 /1057 variables (removed 581) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 476/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 316376 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316376 steps, saw 158288 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 476 cols
[2024-05-23 01:27:52] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 01:27:53] [INFO ] After 590ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 01:27:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:27:54] [INFO ] After 621ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-23 01:27:54] [INFO ] After 692ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 01:27:54] [INFO ] After 1374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 01:27:54] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 01:27:54] [INFO ] After 114ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-23 01:27:55] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 01:27:55] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 300 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2024-05-23 01:27:55] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 01:27:55] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2024-05-23 01:27:55] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 01:27:56] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:28:19] [INFO ] Implicit Places using invariants and state equation in 23087 ms returned [334, 339, 360, 366, 387, 389, 393, 414, 420, 442, 447, 451, 468, 474]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 23585 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 462/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 462 transition count 447
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 447
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 456 transition count 447
Applied a total of 13 rules in 34 ms. Remains 456 /462 variables (removed 6) and now considering 447/453 (removed 6) transitions.
// Phase 1: matrix 447 rows 456 cols
[2024-05-23 01:28:19] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 01:28:19] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 447 rows 456 cols
[2024-05-23 01:28:19] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 01:28:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:28:37] [INFO ] Implicit Places using invariants and state equation in 18360 ms returned [42, 283, 288, 308, 313]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 18809 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 451/476 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 451 transition count 445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 449 transition count 445
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 449 transition count 445
Applied a total of 5 rules in 34 ms. Remains 449 /451 variables (removed 2) and now considering 445/447 (removed 2) transitions.
// Phase 1: matrix 445 rows 449 cols
[2024-05-23 01:28:37] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 01:28:38] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 445 rows 449 cols
[2024-05-23 01:28:38] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 01:28:38] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:29:01] [INFO ] Implicit Places using invariants and state equation in 23459 ms returned [253]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 23865 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 448/476 places, 445/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 445
Applied a total of 1 rules in 39 ms. Remains 448 /448 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 448 cols
[2024-05-23 01:29:01] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 01:29:02] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 445 rows 448 cols
[2024-05-23 01:29:02] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-23 01:29:02] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:29:25] [INFO ] Implicit Places using invariants and state equation in 23259 ms returned []
Implicit Place search using SMT with State Equation took 23636 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 448/476 places, 445/453 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 90014 ms. Remains : 448/476 places, 445/453 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
Support contains 2 out of 1057 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 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 479 place count 816 transition count 717
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 85 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 01:29:25] [INFO ] Computed 99 invariants in 61 ms
[2024-05-23 01:29:26] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-23 01:29:26] [INFO ] Invariant cache hit.
[2024-05-23 01:29:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:29:45] [INFO ] Implicit Places using invariants and state equation in 19214 ms returned []
Implicit Place search using SMT with State Equation took 19548 ms to find 0 implicit places.
[2024-05-23 01:29:45] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-23 01:29:45] [INFO ] Invariant cache hit.
[2024-05-23 01:29:45] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19910 ms. Remains : 556/1057 places, 533/997 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1356 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 389794 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389794 steps, saw 194951 distinct states, run finished after 3003 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:29:48] [INFO ] Invariant cache hit.
[2024-05-23 01:29:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:29:48] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 42 ms returned sat
[2024-05-23 01:29:49] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:29:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 01:29:49] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 42 ms returned sat
[2024-05-23 01:29:49] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:29:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:29:50] [INFO ] After 208ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:29:50] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 01:29:50] [INFO ] After 901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 555 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 553 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 475 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 240 place count 475 transition count 453
Applied a total of 240 rules in 45 ms. Remains 475 /556 variables (removed 81) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 475/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427526 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427526 steps, saw 213907 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2024-05-23 01:29:53] [INFO ] Computed 99 invariants in 62 ms
[2024-05-23 01:29:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:29:53] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 27 ms returned sat
[2024-05-23 01:29:53] [INFO ] After 231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:29:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:29:54] [INFO ] After 376ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:29:54] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:29:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:29:54] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 26 ms returned sat
[2024-05-23 01:29:54] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:29:54] [INFO ] After 246ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:29:54] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-23 01:29:54] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-23 01:29:54] [INFO ] Invariant cache hit.
[2024-05-23 01:29:56] [INFO ] Implicit Places using invariants in 1327 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1329 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 26 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 01:29:56] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 01:29:56] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 01:29:56] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-23 01:29:56] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:30:14] [INFO ] Implicit Places using invariants and state equation in 17746 ms returned []
Implicit Place search using SMT with State Equation took 18036 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19403 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452337 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452337 steps, saw 226219 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 01:30:17] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:30:17] [INFO ] After 322ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:30:17] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:30:17] [INFO ] After 258ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:30:17] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:30:18] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:30:18] [INFO ] After 534ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:30:18] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-23 01:30:18] [INFO ] After 1000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 13 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 01:30:19] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 01:30:19] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 01:30:19] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-23 01:30:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:30:35] [INFO ] Implicit Places using invariants and state equation in 16114 ms returned []
Implicit Place search using SMT with State Equation took 16386 ms to find 0 implicit places.
[2024-05-23 01:30:35] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 01:30:35] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 01:30:35] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16602 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
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 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 27 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2024-05-23 01:30:35] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-23 01:30:36] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:30:36] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:30:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:30:36] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:30:36] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2024-05-23 01:30:36] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2024-05-23 01:30:36] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-23 01:30:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2024-05-23 01:30:36] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-23 01:30:36] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 13885 reset in 129 ms.
Product exploration explored 100000 steps with 13829 reset in 123 ms.
Built C files in :
/tmp/ltsmin17045552148217046096
[2024-05-23 01:30:37] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2024-05-23 01:30:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:30:37] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2024-05-23 01:30:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:30:37] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2024-05-23 01:30:37] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:30:37] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17045552148217046096
Running compilation step : cd /tmp/ltsmin17045552148217046096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1361 ms.
Running link step : cd /tmp/ltsmin17045552148217046096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17045552148217046096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18360591728645159378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 556 transition count 531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 553 transition count 531
Applied a total of 6 rules in 25 ms. Remains 553 /556 variables (removed 3) and now considering 531/533 (removed 2) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-23 01:30:52] [INFO ] Computed 99 invariants in 44 ms
[2024-05-23 01:30:52] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 01:30:52] [INFO ] Invariant cache hit.
[2024-05-23 01:30:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:31:01] [INFO ] Implicit Places using invariants and state equation in 8483 ms returned []
Implicit Place search using SMT with State Equation took 8786 ms to find 0 implicit places.
[2024-05-23 01:31:01] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-23 01:31:01] [INFO ] Invariant cache hit.
[2024-05-23 01:31:01] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 553/556 places, 531/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9060 ms. Remains : 553/556 places, 531/533 transitions.
Built C files in :
/tmp/ltsmin15550437982666735647
[2024-05-23 01:31:01] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2024-05-23 01:31:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:31:01] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2024-05-23 01:31:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:31:01] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2024-05-23 01:31:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:31:01] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15550437982666735647
Running compilation step : cd /tmp/ltsmin15550437982666735647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1173 ms.
Running link step : cd /tmp/ltsmin15550437982666735647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15550437982666735647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9913171945894490215.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:31:16] [INFO ] Flatten gal took : 26 ms
[2024-05-23 01:31:16] [INFO ] Flatten gal took : 26 ms
[2024-05-23 01:31:16] [INFO ] Time to serialize gal into /tmp/LTL3735616308843199860.gal : 5 ms
[2024-05-23 01:31:16] [INFO ] Time to serialize properties into /tmp/LTL3585216301674350110.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3735616308843199860.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8572186460497529508.hoa' '-atoms' '/tmp/LTL3585216301674350110.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3585216301674350110.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8572186460497529508.hoa
Detected timeout of ITS tools.
[2024-05-23 01:31:31] [INFO ] Flatten gal took : 26 ms
[2024-05-23 01:31:31] [INFO ] Flatten gal took : 22 ms
[2024-05-23 01:31:31] [INFO ] Time to serialize gal into /tmp/LTL10078209673459110586.gal : 3 ms
[2024-05-23 01:31:31] [INFO ] Time to serialize properties into /tmp/LTL6822988580573826809.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10078209673459110586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6822988580573826809.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p509>=1)")U("((p877>=1)||(p579<1))")))))
Formula 0 simplified : XF(!"(p509>=1)" R !"((p877>=1)||(p579<1))")
Detected timeout of ITS tools.
[2024-05-23 01:31:46] [INFO ] Flatten gal took : 22 ms
[2024-05-23 01:31:46] [INFO ] Applying decomposition
[2024-05-23 01:31:46] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7242889879068938479.txt' '-o' '/tmp/graph7242889879068938479.bin' '-w' '/tmp/graph7242889879068938479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7242889879068938479.bin' '-l' '-1' '-v' '-w' '/tmp/graph7242889879068938479.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:31:47] [INFO ] Decomposing Gal with order
[2024-05-23 01:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:31:47] [INFO ] Removed a total of 397 redundant transitions.
[2024-05-23 01:31:47] [INFO ] Flatten gal took : 75 ms
[2024-05-23 01:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 20 ms.
[2024-05-23 01:31:47] [INFO ] Time to serialize gal into /tmp/LTL12169121627477331288.gal : 11 ms
[2024-05-23 01:31:47] [INFO ] Time to serialize properties into /tmp/LTL9171999611444970087.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12169121627477331288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9171999611444970087.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i5.i1.u97.p509>=1)")U("((i9.i0.u175.p877>=1)||(i5.i1.u112.p579<1))")))))
Formula 0 simplified : XF(!"(i5.i1.u97.p509>=1)" R !"((i9.i0.u175.p877>=1)||(i5.i1.u112.p579<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5539918093905707055
[2024-05-23 01:32:02] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5539918093905707055
Running compilation step : cd /tmp/ltsmin5539918093905707055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 838 ms.
Running link step : cd /tmp/ltsmin5539918093905707055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5539918093905707055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 297049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&F(G(p1))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 817 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 481 place count 815 transition count 714
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 999 place count 556 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 556 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1001 place count 555 transition count 532
Applied a total of 1001 rules in 92 ms. Remains 555 /1057 variables (removed 502) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 555 cols
[2024-05-23 01:32:17] [INFO ] Computed 99 invariants in 49 ms
[2024-05-23 01:32:17] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-23 01:32:17] [INFO ] Invariant cache hit.
[2024-05-23 01:32:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:32:48] [INFO ] Performed 331/555 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 01:33:08] [INFO ] Implicit Places using invariants and state equation in 50223 ms returned []
Implicit Place search using SMT with State Equation took 50524 ms to find 0 implicit places.
[2024-05-23 01:33:08] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 01:33:08] [INFO ] Invariant cache hit.
[2024-05-23 01:33:08] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 555/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50964 ms. Remains : 555/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s94 1) (LT s113 1)), p1:(AND (GEQ s396 1) (GEQ s403 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-01 finished in 51123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X((!p0||G(p1)))||F(p2))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 56 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:33:08] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-23 01:33:08] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:33:09] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-23 01:33:25] [INFO ] Implicit Places using invariants and state equation in 16325 ms returned []
Implicit Place search using SMT with State Equation took 16719 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:33:25] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 01:33:25] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17247 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(LT s975 1), p2:(LT s746 1), p1:(OR (LT s717 1) (LT s724 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 580 ms.
Product exploration explored 100000 steps with 50000 reset in 563 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-03 finished in 18785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 927 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1003 place count 554 transition count 532
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1004 place count 554 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1005 place count 553 transition count 531
Applied a total of 1005 rules in 88 ms. Remains 553 /1057 variables (removed 504) and now considering 531/997 (removed 466) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-23 01:33:27] [INFO ] Computed 99 invariants in 54 ms
[2024-05-23 01:33:27] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-23 01:33:27] [INFO ] Invariant cache hit.
[2024-05-23 01:33:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:33:45] [INFO ] Implicit Places using invariants and state equation in 17391 ms returned []
Implicit Place search using SMT with State Equation took 17700 ms to find 0 implicit places.
[2024-05-23 01:33:45] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-23 01:33:45] [INFO ] Invariant cache hit.
[2024-05-23 01:33:45] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 531/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18066 ms. Remains : 553/1057 places, 531/997 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s353 1) (LT s365 1)) (OR (LT s177 1) (LT s185 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13915 reset in 121 ms.
Product exploration explored 100000 steps with 13880 reset in 118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1385 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 378993 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 378993 steps, saw 189546 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:33:48] [INFO ] Invariant cache hit.
[2024-05-23 01:33:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:33:48] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 33 ms returned sat
[2024-05-23 01:33:49] [INFO ] After 504ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:33:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:33:49] [INFO ] After 337ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:33:49] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:33:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:33:49] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2024-05-23 01:33:50] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:33:50] [INFO ] After 515ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:33:51] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2024-05-23 01:33:51] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
[2024-05-23 01:33:51] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:33:51] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-23 01:33:51] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:33:51] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 0 ms to minimize.
[2024-05-23 01:33:51] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 0 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 0 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2024-05-23 01:33:52] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2024-05-23 01:33:53] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-23 01:33:53] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2024-05-23 01:33:53] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-23 01:33:53] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2024-05-23 01:33:53] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2024-05-23 01:33:53] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2024-05-23 01:33:53] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2024-05-23 01:33:54] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-05-23 01:33:54] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-05-23 01:33:54] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3105 ms
[2024-05-23 01:33:54] [INFO ] After 3925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2024-05-23 01:33:54] [INFO ] After 4576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1091 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 32 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1223 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 415009 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 415009 steps, saw 207626 distinct states, run finished after 3002 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2024-05-23 01:33:58] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 01:33:58] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:33:58] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:33:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:33:59] [INFO ] After 937ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 0 ms to minimize.
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2024-05-23 01:34:00] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2024-05-23 01:34:01] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2024-05-23 01:34:01] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2024-05-23 01:34:01] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2024-05-23 01:34:01] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2024-05-23 01:34:01] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 0 ms to minimize.
[2024-05-23 01:34:01] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2024-05-23 01:34:02] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 0 ms to minimize.
[2024-05-23 01:34:02] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2024-05-23 01:34:02] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2024-05-23 01:34:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2521 ms
[2024-05-23 01:34:02] [INFO ] After 3592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 433 ms.
[2024-05-23 01:34:02] [INFO ] After 4344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 674 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2024-05-23 01:34:03] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-23 01:34:04] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2024-05-23 01:34:04] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:34:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:34:23] [INFO ] Implicit Places using invariants and state equation in 19049 ms returned [42, 152, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 338, 343, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 19413 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 452/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 452 transition count 445
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 439 transition count 445
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 439 transition count 445
Applied a total of 28 rules in 27 ms. Remains 439 /452 variables (removed 13) and now considering 445/458 (removed 13) transitions.
// Phase 1: matrix 445 rows 439 cols
[2024-05-23 01:34:23] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 01:34:23] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 445 rows 439 cols
[2024-05-23 01:34:23] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 01:34:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:34:46] [INFO ] Implicit Places using invariants and state equation in 23005 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 23237 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 438/480 places, 445/458 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 445
Applied a total of 1 rules in 15 ms. Remains 438 /438 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 438 cols
[2024-05-23 01:34:46] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 01:34:46] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 445 rows 438 cols
[2024-05-23 01:34:46] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:34:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:35:03] [INFO ] Implicit Places using invariants and state equation in 17240 ms returned []
Implicit Place search using SMT with State Equation took 17500 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 438/480 places, 445/458 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60200 ms. Remains : 438/480 places, 445/458 transitions.
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 446018 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446018 steps, saw 223057 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 445 rows 438 cols
[2024-05-23 01:35:06] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 01:35:07] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:35:07] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:35:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:35:07] [INFO ] After 458ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 0 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2024-05-23 01:35:08] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-05-23 01:35:09] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1686 ms
[2024-05-23 01:35:09] [INFO ] After 2395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-23 01:35:09] [INFO ] After 2872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1469 ms.
Support contains 4 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 445/445 transitions.
Applied a total of 0 rules in 7 ms. Remains 438 /438 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 438/438 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 445/445 transitions.
Applied a total of 0 rules in 7 ms. Remains 438 /438 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 438 cols
[2024-05-23 01:35:11] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 01:35:11] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 445 rows 438 cols
[2024-05-23 01:35:11] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 01:35:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:35:31] [INFO ] Implicit Places using invariants and state equation in 20165 ms returned []
Implicit Place search using SMT with State Equation took 20417 ms to find 0 implicit places.
[2024-05-23 01:35:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 445 rows 438 cols
[2024-05-23 01:35:31] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:35:31] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20635 ms. Remains : 438/438 places, 445/445 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 10 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
[2024-05-23 01:35:32] [INFO ] Invariant cache hit.
[2024-05-23 01:35:32] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-23 01:35:32] [INFO ] Invariant cache hit.
[2024-05-23 01:35:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:35:55] [INFO ] Implicit Places using invariants and state equation in 23015 ms returned []
Implicit Place search using SMT with State Equation took 23263 ms to find 0 implicit places.
[2024-05-23 01:35:55] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-23 01:35:55] [INFO ] Invariant cache hit.
[2024-05-23 01:35:55] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23516 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1382 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 392233 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392233 steps, saw 196164 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:35:58] [INFO ] Invariant cache hit.
[2024-05-23 01:35:58] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:35:58] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 32 ms returned sat
[2024-05-23 01:35:59] [INFO ] After 518ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:35:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:35:59] [INFO ] After 338ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:35:59] [INFO ] After 973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:35:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:35:59] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 30 ms returned sat
[2024-05-23 01:36:00] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:36:00] [INFO ] After 516ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 0 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 0 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 0 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-23 01:36:01] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 0 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 0 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-23 01:36:02] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2024-05-23 01:36:03] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-23 01:36:04] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-23 01:36:04] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3099 ms
[2024-05-23 01:36:04] [INFO ] After 3925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-23 01:36:04] [INFO ] After 4565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1082 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 29 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 412737 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 412737 steps, saw 206483 distinct states, run finished after 3003 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2024-05-23 01:36:08] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 01:36:08] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:36:08] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:36:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:36:09] [INFO ] After 925ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 0 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-23 01:36:10] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2024-05-23 01:36:11] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2024-05-23 01:36:11] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2024-05-23 01:36:11] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-23 01:36:11] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 0 ms to minimize.
[2024-05-23 01:36:11] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2024-05-23 01:36:11] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2024-05-23 01:36:11] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2024-05-23 01:36:12] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-05-23 01:36:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2229 ms
[2024-05-23 01:36:12] [INFO ] After 3286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 424 ms.
[2024-05-23 01:36:12] [INFO ] After 4005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 703 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2024-05-23 01:36:13] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 01:36:13] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2024-05-23 01:36:13] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-23 01:36:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:36:39] [INFO ] Implicit Places using invariants and state equation in 26294 ms returned [48, 228, 233, 262, 284, 289, 310, 338, 343, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 26560 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 459/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 459 transition count 449
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 449
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 450 transition count 449
Applied a total of 21 rules in 23 ms. Remains 450 /459 variables (removed 9) and now considering 449/458 (removed 9) transitions.
// Phase 1: matrix 449 rows 450 cols
[2024-05-23 01:36:39] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:36:40] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 449 rows 450 cols
[2024-05-23 01:36:40] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-23 01:36:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:36:59] [INFO ] Implicit Places using invariants and state equation in 18953 ms returned [42, 72, 179, 200, 206, 213]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 19225 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 444/480 places, 449/458 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 442 transition count 447
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 442 transition count 447
Applied a total of 7 rules in 24 ms. Remains 442 /444 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 442 cols
[2024-05-23 01:36:59] [INFO ] Computed 72 invariants in 57 ms
[2024-05-23 01:36:59] [INFO ] Implicit Places using invariants in 362 ms returned [65, 90, 95, 115, 121, 148, 171, 244]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 363 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 434/480 places, 447/458 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 434 transition count 441
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 428 transition count 441
Applied a total of 12 rules in 15 ms. Remains 428 /434 variables (removed 6) and now considering 441/447 (removed 6) transitions.
// Phase 1: matrix 441 rows 428 cols
[2024-05-23 01:36:59] [INFO ] Computed 64 invariants in 46 ms
[2024-05-23 01:36:59] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-23 01:36:59] [INFO ] Invariant cache hit.
[2024-05-23 01:37:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:37:16] [INFO ] Implicit Places using invariants and state equation in 17119 ms returned []
Implicit Place search using SMT with State Equation took 17436 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 428/480 places, 441/458 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 63656 ms. Remains : 428/480 places, 441/458 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 445639 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 445639 steps, saw 222865 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:37:20] [INFO ] Invariant cache hit.
[2024-05-23 01:37:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:37:20] [INFO ] [Real]Absence check using 3 positive and 61 generalized place invariants in 24 ms returned sat
[2024-05-23 01:37:20] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:37:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 01:37:20] [INFO ] [Nat]Absence check using 3 positive and 61 generalized place invariants in 24 ms returned sat
[2024-05-23 01:37:20] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:37:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:37:21] [INFO ] After 588ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:37:21] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-23 01:37:21] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2024-05-23 01:37:22] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2024-05-23 01:37:23] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2024-05-23 01:37:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2561 ms
[2024-05-23 01:37:24] [INFO ] After 3429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-23 01:37:24] [INFO ] After 4048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1105 ms.
Support contains 4 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 428/428 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 441/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 428 /428 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-23 01:37:25] [INFO ] Invariant cache hit.
[2024-05-23 01:37:25] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-23 01:37:25] [INFO ] Invariant cache hit.
[2024-05-23 01:37:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:37:48] [INFO ] Implicit Places using invariants and state equation in 22876 ms returned []
Implicit Place search using SMT with State Equation took 23132 ms to find 0 implicit places.
[2024-05-23 01:37:48] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:37:48] [INFO ] Invariant cache hit.
[2024-05-23 01:37:48] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23360 ms. Remains : 428/428 places, 441/441 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13833 reset in 113 ms.
Product exploration explored 100000 steps with 13873 reset in 123 ms.
Built C files in :
/tmp/ltsmin7921438312085921762
[2024-05-23 01:37:49] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2024-05-23 01:37:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:37:49] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2024-05-23 01:37:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:37:49] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2024-05-23 01:37:49] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:37:49] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7921438312085921762
Running compilation step : cd /tmp/ltsmin7921438312085921762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1184 ms.
Running link step : cd /tmp/ltsmin7921438312085921762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7921438312085921762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7544410843688047674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 44 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-23 01:38:04] [INFO ] Computed 99 invariants in 56 ms
[2024-05-23 01:38:04] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-23 01:38:04] [INFO ] Invariant cache hit.
[2024-05-23 01:38:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:38:15] [INFO ] Implicit Places using invariants and state equation in 10703 ms returned []
Implicit Place search using SMT with State Equation took 11084 ms to find 0 implicit places.
[2024-05-23 01:38:15] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:38:15] [INFO ] Invariant cache hit.
[2024-05-23 01:38:15] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11398 ms. Remains : 553/553 places, 531/531 transitions.
Built C files in :
/tmp/ltsmin18181321951496021798
[2024-05-23 01:38:15] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2024-05-23 01:38:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:38:15] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2024-05-23 01:38:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:38:15] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2024-05-23 01:38:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:38:15] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18181321951496021798
Running compilation step : cd /tmp/ltsmin18181321951496021798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1201 ms.
Running link step : cd /tmp/ltsmin18181321951496021798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18181321951496021798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3149759117303998007.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:38:31] [INFO ] Flatten gal took : 31 ms
[2024-05-23 01:38:31] [INFO ] Flatten gal took : 18 ms
[2024-05-23 01:38:31] [INFO ] Time to serialize gal into /tmp/LTL1589555856760282488.gal : 7 ms
[2024-05-23 01:38:31] [INFO ] Time to serialize properties into /tmp/LTL13144042766427517243.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1589555856760282488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8375541085516883710.hoa' '-atoms' '/tmp/LTL13144042766427517243.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13144042766427517243.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8375541085516883710.hoa
Detected timeout of ITS tools.
[2024-05-23 01:38:46] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:38:46] [INFO ] Flatten gal took : 16 ms
[2024-05-23 01:38:46] [INFO ] Time to serialize gal into /tmp/LTL3396409142785035267.gal : 3 ms
[2024-05-23 01:38:46] [INFO ] Time to serialize properties into /tmp/LTL14196681202573241204.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3396409142785035267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14196681202573241204.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p654<1)||(p679<1))&&((p360<1)||(p372<1)))"))))
Formula 0 simplified : GF!"(((p654<1)||(p679<1))&&((p360<1)||(p372<1)))"
Detected timeout of ITS tools.
[2024-05-23 01:39:01] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:39:01] [INFO ] Applying decomposition
[2024-05-23 01:39:01] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5237882933451510737.txt' '-o' '/tmp/graph5237882933451510737.bin' '-w' '/tmp/graph5237882933451510737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5237882933451510737.bin' '-l' '-1' '-v' '-w' '/tmp/graph5237882933451510737.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:39:01] [INFO ] Decomposing Gal with order
[2024-05-23 01:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:39:01] [INFO ] Removed a total of 411 redundant transitions.
[2024-05-23 01:39:01] [INFO ] Flatten gal took : 38 ms
[2024-05-23 01:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 17 ms.
[2024-05-23 01:39:01] [INFO ] Time to serialize gal into /tmp/LTL9125607933425241765.gal : 9 ms
[2024-05-23 01:39:01] [INFO ] Time to serialize properties into /tmp/LTL16647571978973527120.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9125607933425241765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16647571978973527120.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i5.i2.u130.p654<1)||(i7.i0.u137.p679<1))&&((i2.u65.p360<1)||(i2.u50.p372<1)))"))))
Formula 0 simplified : GF!"(((i5.i2.u130.p654<1)||(i7.i0.u137.p679<1))&&((i2.u65.p360<1)||(i2.u50.p372<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4512925763835606939
[2024-05-23 01:39:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4512925763835606939
Running compilation step : cd /tmp/ltsmin4512925763835606939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 850 ms.
Running link step : cd /tmp/ltsmin4512925763835606939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4512925763835606939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 364213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:39:31] [INFO ] Invariants computation overflowed in 103 ms
[2024-05-23 01:39:32] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:39:32] [INFO ] Invariants computation overflowed in 132 ms
[2024-05-23 01:39:49] [INFO ] Implicit Places using invariants and state equation in 17151 ms returned []
Implicit Place search using SMT with State Equation took 17646 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:39:49] [INFO ] Invariants computation overflowed in 106 ms
[2024-05-23 01:39:49] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18186 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s261 1) (GEQ s277 1)), p1:(AND (OR (LT s107 1) (LT s185 1)) (LT s195 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 2 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-05 finished in 18442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1055 transition count 761
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 471 place count 821 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 473 place count 819 transition count 759
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 473 place count 819 transition count 719
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 553 place count 779 transition count 719
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 993 place count 559 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 558 transition count 535
Applied a total of 994 rules in 114 ms. Remains 558 /1057 variables (removed 499) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:39:50] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 01:39:50] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:39:50] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:39:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:40:10] [INFO ] Implicit Places using invariants and state equation in 20462 ms returned []
Implicit Place search using SMT with State Equation took 20767 ms to find 0 implicit places.
[2024-05-23 01:40:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:40:10] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 01:40:11] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21135 ms. Remains : 558/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s159 1) (LT s166 1)), p1:(GEQ s137 1), p2:(LT s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13959 reset in 200 ms.
Product exploration explored 100000 steps with 13930 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 1360 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 802 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 797 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:40:11] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 01:40:12] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 01:40:13] [INFO ] After 730ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-23 01:40:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:40:13] [INFO ] After 260ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2024-05-23 01:40:14] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2024-05-23 01:40:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1140 ms
[2024-05-23 01:40:15] [INFO ] After 1494ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 272 ms.
[2024-05-23 01:40:15] [INFO ] After 2584ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 39 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1301 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 430230 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430230 steps, saw 215241 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2024-05-23 01:40:18] [INFO ] Computed 99 invariants in 51 ms
[2024-05-23 01:40:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:40:18] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 44 ms returned sat
[2024-05-23 01:40:18] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:40:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:40:18] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 43 ms returned sat
[2024-05-23 01:40:19] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:40:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:40:19] [INFO ] After 276ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2024-05-23 01:40:19] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 1 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2024-05-23 01:40:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 909 ms
[2024-05-23 01:40:20] [INFO ] After 1228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-23 01:40:20] [INFO ] After 1607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-23 01:40:20] [INFO ] Invariant cache hit.
[2024-05-23 01:40:21] [INFO ] Implicit Places using invariants in 1328 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1330 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 20 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:40:21] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-23 01:40:22] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:40:22] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-23 01:40:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:40:39] [INFO ] Implicit Places using invariants and state equation in 17023 ms returned []
Implicit Place search using SMT with State Equation took 17286 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18647 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 448183 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 448183 steps, saw 224143 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:40:42] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 01:40:42] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:40:43] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:40:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:40:43] [INFO ] After 603ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:40:43] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2024-05-23 01:40:43] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2024-05-23 01:40:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2024-05-23 01:40:43] [INFO ] After 927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 428 ms.
[2024-05-23 01:40:44] [INFO ] After 1814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:40:44] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 01:40:44] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:40:44] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-23 01:40:44] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:40:59] [INFO ] Implicit Places using invariants and state equation in 15161 ms returned []
Implicit Place search using SMT with State Equation took 15423 ms to find 0 implicit places.
[2024-05-23 01:40:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:40:59] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-23 01:41:00] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15625 ms. Remains : 418/418 places, 434/434 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 418 transition count 397
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 381 transition count 397
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 93 place count 362 transition count 378
Iterating global reduction 0 with 19 rules applied. Total rules applied 112 place count 362 transition count 378
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 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 29 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2024-05-23 01:41:00] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-23 01:41:00] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:41:00] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:41:00] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:01] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-05-23 01:41:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-23 01:41:01] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-23 01:41:01] [INFO ] After 779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 10 factoid took 192 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 558 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 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 13 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:41:01] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 01:41:01] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:41:01] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:41:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:41:18] [INFO ] Implicit Places using invariants and state equation in 16741 ms returned []
Implicit Place search using SMT with State Equation took 16998 ms to find 0 implicit places.
[2024-05-23 01:41:18] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:41:18] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 01:41:18] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17252 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 535 rows 558 cols
[2024-05-23 01:41:19] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 01:41:19] [INFO ] After 744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:41:20] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:41:21] [INFO ] After 765ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:21] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2024-05-23 01:41:21] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2024-05-23 01:41:21] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-23 01:41:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 985 ms
[2024-05-23 01:41:22] [INFO ] After 1783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-23 01:41:22] [INFO ] After 2619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 39 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 428810 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 428810 steps, saw 214538 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:41:25] [INFO ] Invariant cache hit.
[2024-05-23 01:41:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 01:41:25] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 42 ms returned sat
[2024-05-23 01:41:26] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:41:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:41:26] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 43 ms returned sat
[2024-05-23 01:41:26] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:26] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:41:27] [INFO ] After 780ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2024-05-23 01:41:27] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2024-05-23 01:41:28] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2024-05-23 01:41:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 928 ms
[2024-05-23 01:41:28] [INFO ] After 1766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-23 01:41:28] [INFO ] After 2238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 17 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-23 01:41:28] [INFO ] Invariant cache hit.
[2024-05-23 01:41:29] [INFO ] Implicit Places using invariants in 1350 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1351 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 18 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:41:29] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 01:41:29] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:41:29] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-23 01:41:30] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:41:44] [INFO ] Implicit Places using invariants and state equation in 14967 ms returned []
Implicit Place search using SMT with State Equation took 15235 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16621 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 449163 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449163 steps, saw 224634 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:41:47] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:41:48] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:41:48] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:41:49] [INFO ] After 608ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:41:49] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-23 01:41:49] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-23 01:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2024-05-23 01:41:49] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 428 ms.
[2024-05-23 01:41:50] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:41:50] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 01:41:50] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:41:50] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-23 01:41:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 01:42:02] [INFO ] Implicit Places using invariants and state equation in 11572 ms returned []
Implicit Place search using SMT with State Equation took 11844 ms to find 0 implicit places.
[2024-05-23 01:42:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2024-05-23 01:42:02] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-23 01:42:02] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12052 ms. Remains : 418/418 places, 434/434 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 418 transition count 397
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 381 transition count 397
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 93 place count 362 transition count 378
Iterating global reduction 0 with 19 rules applied. Total rules applied 112 place count 362 transition count 378
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 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 24 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2024-05-23 01:42:02] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-23 01:42:02] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:42:03] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:42:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:42:03] [INFO ] After 107ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:42:03] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-23 01:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-23 01:42:03] [INFO ] After 350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-23 01:42:03] [INFO ] After 769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13998 reset in 117 ms.
Product exploration explored 100000 steps with 13919 reset in 122 ms.
Built C files in :
/tmp/ltsmin12175307727090447800
[2024-05-23 01:42:04] [INFO ] Computing symmetric may disable matrix : 535 transitions.
[2024-05-23 01:42:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:04] [INFO ] Computing symmetric may enable matrix : 535 transitions.
[2024-05-23 01:42:04] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:04] [INFO ] Computing Do-Not-Accords matrix : 535 transitions.
[2024-05-23 01:42:04] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:04] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12175307727090447800
Running compilation step : cd /tmp/ltsmin12175307727090447800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1208 ms.
Running link step : cd /tmp/ltsmin12175307727090447800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12175307727090447800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5052089591976867539.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 558 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Applied a total of 2 rules in 18 ms. Remains 557 /558 variables (removed 1) and now considering 534/535 (removed 1) transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 01:42:19] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 01:42:19] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 01:42:19] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 01:42:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:42:32] [INFO ] Implicit Places using invariants and state equation in 12565 ms returned []
Implicit Place search using SMT with State Equation took 12821 ms to find 0 implicit places.
[2024-05-23 01:42:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 01:42:32] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 01:42:32] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/558 places, 534/535 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13084 ms. Remains : 557/558 places, 534/535 transitions.
Built C files in :
/tmp/ltsmin14874137340499773887
[2024-05-23 01:42:32] [INFO ] Computing symmetric may disable matrix : 534 transitions.
[2024-05-23 01:42:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:32] [INFO ] Computing symmetric may enable matrix : 534 transitions.
[2024-05-23 01:42:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:32] [INFO ] Computing Do-Not-Accords matrix : 534 transitions.
[2024-05-23 01:42:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:42:32] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14874137340499773887
Running compilation step : cd /tmp/ltsmin14874137340499773887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1176 ms.
Running link step : cd /tmp/ltsmin14874137340499773887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14874137340499773887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15055078868044077694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:42:47] [INFO ] Flatten gal took : 18 ms
[2024-05-23 01:42:47] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:42:47] [INFO ] Time to serialize gal into /tmp/LTL12436148011422733874.gal : 5 ms
[2024-05-23 01:42:47] [INFO ] Time to serialize properties into /tmp/LTL11597807545021655620.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12436148011422733874.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2172830139345712707.hoa' '-atoms' '/tmp/LTL11597807545021655620.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11597807545021655620.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2172830139345712707.hoa
Detected timeout of ITS tools.
[2024-05-23 01:43:02] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:43:02] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:43:02] [INFO ] Time to serialize gal into /tmp/LTL10410059170919042233.gal : 4 ms
[2024-05-23 01:43:02] [INFO ] Time to serialize properties into /tmp/LTL9268355684305598442.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10410059170919042233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9268355684305598442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p321<1)||(p328<1))")&&(("(p284>=1)")||(F("(p38<1)")))))))
Formula 0 simplified : GF(!"((p321<1)||(p328<1))" | (!"(p284>=1)" & G!"(p38<1)"))
Detected timeout of ITS tools.
[2024-05-23 01:43:17] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:43:17] [INFO ] Applying decomposition
[2024-05-23 01:43:17] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6029768258810543635.txt' '-o' '/tmp/graph6029768258810543635.bin' '-w' '/tmp/graph6029768258810543635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6029768258810543635.bin' '-l' '-1' '-v' '-w' '/tmp/graph6029768258810543635.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:43:17] [INFO ] Decomposing Gal with order
[2024-05-23 01:43:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:43:17] [INFO ] Removed a total of 405 redundant transitions.
[2024-05-23 01:43:17] [INFO ] Flatten gal took : 34 ms
[2024-05-23 01:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2024-05-23 01:43:17] [INFO ] Time to serialize gal into /tmp/LTL1473135946451013880.gal : 6 ms
[2024-05-23 01:43:17] [INFO ] Time to serialize properties into /tmp/LTL16662327326738130299.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1473135946451013880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16662327326738130299.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i4.u61.p321<1)||(i4.u60.p328<1))")&&(("(i4.u50.p284>=1)")||(F("(i0.u71.p38<1)")))))))
Formula 0 simplified : GF(!"((i4.u61.p321<1)||(i4.u60.p328<1))" | (!"(i4.u50.p284>=1)" & G!"(i0.u71.p38<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10536735290406316940
[2024-05-23 01:43:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10536735290406316940
Running compilation step : cd /tmp/ltsmin10536735290406316940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 826 ms.
Running link step : cd /tmp/ltsmin10536735290406316940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10536735290406316940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 237950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(((F(p0) U p1)||!p0) U X(p2))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:43:48] [INFO ] Invariants computation overflowed in 109 ms
[2024-05-23 01:43:48] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:43:48] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-23 01:44:04] [INFO ] Implicit Places using invariants and state equation in 16594 ms returned []
Implicit Place search using SMT with State Equation took 16968 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:44:05] [INFO ] Invariants computation overflowed in 116 ms
[2024-05-23 01:44:05] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17480 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 383 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s231 1) (GEQ s244 1)), p1:(GEQ s867 1), p2:(GEQ s668 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33263 reset in 412 ms.
Product exploration explored 100000 steps with 33311 reset in 470 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 266 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 660 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 58783 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58783 steps, saw 29398 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:44:12] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-23 01:44:16] [INFO ] After 3474ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2024-05-23 01:44:17] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 1 ms to minimize.
[2024-05-23 01:44:17] [INFO ] Deduced a trap composed of 149 places in 252 ms of which 1 ms to minimize.
[2024-05-23 01:44:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 721 ms
[2024-05-23 01:44:18] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 0 ms to minimize.
[2024-05-23 01:44:18] [INFO ] Deduced a trap composed of 186 places in 154 ms of which 1 ms to minimize.
[2024-05-23 01:44:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2024-05-23 01:44:18] [INFO ] After 6178ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2024-05-23 01:44:18] [INFO ] After 6733ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2024-05-23 01:44:31] [INFO ] After 12448ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 0 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 199 places in 161 ms of which 0 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Deduced a trap composed of 205 places in 154 ms of which 0 ms to minimize.
[2024-05-23 01:44:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2024-05-23 01:44:38] [INFO ] Deduced a trap composed of 191 places in 159 ms of which 0 ms to minimize.
[2024-05-23 01:44:38] [INFO ] Deduced a trap composed of 194 places in 158 ms of which 2 ms to minimize.
[2024-05-23 01:44:39] [INFO ] Deduced a trap composed of 213 places in 177 ms of which 1 ms to minimize.
[2024-05-23 01:44:39] [INFO ] Deduced a trap composed of 187 places in 160 ms of which 1 ms to minimize.
[2024-05-23 01:44:39] [INFO ] Deduced a trap composed of 186 places in 154 ms of which 0 ms to minimize.
[2024-05-23 01:44:39] [INFO ] Deduced a trap composed of 200 places in 157 ms of which 1 ms to minimize.
[2024-05-23 01:44:40] [INFO ] Deduced a trap composed of 216 places in 151 ms of which 1 ms to minimize.
[2024-05-23 01:44:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1664 ms
[2024-05-23 01:44:42] [INFO ] After 23032ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :13
Attempting to minimize the solution found.
Minimization took 1415 ms.
[2024-05-23 01:44:43] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :12
Fused 19 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 8191 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 89 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 478/1057 places, 455/997 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 182479 steps, run timeout after 3004 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182479 steps, saw 91269 distinct states, run finished after 3004 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 01:44:56] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 01:44:56] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-23 01:44:58] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-23 01:44:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:45:00] [INFO ] After 2163ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 0 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:45:01] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 0 ms to minimize.
[2024-05-23 01:45:02] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2024-05-23 01:45:02] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 0 ms to minimize.
[2024-05-23 01:45:02] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 1 ms to minimize.
[2024-05-23 01:45:02] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 0 ms to minimize.
[2024-05-23 01:45:02] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:45:03] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2024-05-23 01:45:03] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-23 01:45:03] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:45:03] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 0 ms to minimize.
[2024-05-23 01:45:03] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2024-05-23 01:45:04] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2024-05-23 01:45:04] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2024-05-23 01:45:04] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-23 01:45:04] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-23 01:45:04] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 0 ms to minimize.
[2024-05-23 01:45:04] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 0 ms to minimize.
[2024-05-23 01:45:05] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-23 01:45:05] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 0 ms to minimize.
[2024-05-23 01:45:05] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 0 ms to minimize.
[2024-05-23 01:45:05] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4437 ms
[2024-05-23 01:45:07] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2024-05-23 01:45:07] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2024-05-23 01:45:07] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2024-05-23 01:45:07] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:45:07] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 0 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2024-05-23 01:45:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1553 ms
[2024-05-23 01:45:09] [INFO ] After 10914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1285 ms.
[2024-05-23 01:45:10] [INFO ] After 13907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 01:45:20] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 01:45:21] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 01:45:21] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 01:45:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:45:38] [INFO ] Implicit Places using invariants and state equation in 17704 ms returned [122, 262, 284, 289, 310, 315, 336, 341, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 18057 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 459/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 459 transition count 447
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 451 transition count 447
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 451 transition count 447
Applied a total of 19 rules in 25 ms. Remains 451 /459 variables (removed 8) and now considering 447/455 (removed 8) transitions.
// Phase 1: matrix 447 rows 451 cols
[2024-05-23 01:45:38] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 01:45:39] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 447 rows 451 cols
[2024-05-23 01:45:39] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 01:45:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:46:07] [INFO ] Implicit Places using invariants and state equation in 27968 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28266 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 450/478 places, 447/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 447
Applied a total of 1 rules in 16 ms. Remains 450 /450 variables (removed 0) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 450 cols
[2024-05-23 01:46:07] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 01:46:07] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 447 rows 450 cols
[2024-05-23 01:46:07] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-23 01:46:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:46:24] [INFO ] Implicit Places using invariants and state equation in 17173 ms returned [350]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 17490 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 449/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 446
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 448 cols
[2024-05-23 01:46:24] [INFO ] Computed 78 invariants in 50 ms
[2024-05-23 01:46:25] [INFO ] Implicit Places using invariants in 614 ms returned [47, 67, 72, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 231, 254]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 615 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 433/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 433 transition count 437
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 424 transition count 437
Applied a total of 18 rules in 16 ms. Remains 424 /433 variables (removed 9) and now considering 437/446 (removed 9) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:46:25] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 01:46:25] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:46:25] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 01:46:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:46:40] [INFO ] Implicit Places using invariants and state equation in 15095 ms returned []
Implicit Place search using SMT with State Equation took 15343 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 79853 ms. Remains : 424/478 places, 437/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 p2 (NOT p1)))), (G (NOT (AND p2 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 741 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 338 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:46:42] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-23 01:46:42] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:46:42] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-23 01:46:59] [INFO ] Implicit Places using invariants and state equation in 16750 ms returned []
Implicit Place search using SMT with State Equation took 17118 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:46:59] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-23 01:46:59] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17611 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 747 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 331 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 161994 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161994 steps, saw 81018 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:47:04] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-23 01:47:07] [INFO ] After 2679ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 1 ms to minimize.
[2024-05-23 01:47:07] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 1 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 1 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 1 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 103 places in 198 ms of which 0 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 120 places in 189 ms of which 0 ms to minimize.
[2024-05-23 01:47:08] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 1 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 127 places in 184 ms of which 0 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 199 places in 171 ms of which 0 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Deduced a trap composed of 209 places in 140 ms of which 0 ms to minimize.
[2024-05-23 01:47:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2516 ms
[2024-05-23 01:47:09] [INFO ] After 5241ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 01:47:09] [INFO ] After 5479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 01:47:15] [INFO ] After 5364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 01:47:16] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 1 ms to minimize.
[2024-05-23 01:47:16] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 1 ms to minimize.
[2024-05-23 01:47:17] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 1 ms to minimize.
[2024-05-23 01:47:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1035 ms
[2024-05-23 01:47:18] [INFO ] After 8912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4647 ms.
[2024-05-23 01:47:23] [INFO ] After 13818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 10078 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 99 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 478/1057 places, 455/997 transitions.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 200196 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200196 steps, saw 100160 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 01:47:37] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 01:47:38] [INFO ] After 401ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-23 01:47:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:47:38] [INFO ] After 216ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 01:47:38] [INFO ] After 746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 01:47:39] [INFO ] After 751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 01:47:42] [INFO ] After 2808ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-23 01:47:42] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2024-05-23 01:47:42] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 0 ms to minimize.
[2024-05-23 01:47:42] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2024-05-23 01:47:42] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2024-05-23 01:47:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1365 ms
[2024-05-23 01:47:44] [INFO ] After 5162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 735 ms.
[2024-05-23 01:47:45] [INFO ] After 6783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 01:47:55] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 01:47:55] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 01:47:55] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 01:47:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:48:12] [INFO ] Implicit Places using invariants and state equation in 16901 ms returned [201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 17254 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 453/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 453 transition count 443
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 441 transition count 443
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 441 transition count 443
Applied a total of 25 rules in 26 ms. Remains 441 /453 variables (removed 12) and now considering 443/455 (removed 12) transitions.
// Phase 1: matrix 443 rows 441 cols
[2024-05-23 01:48:12] [INFO ] Computed 74 invariants in 48 ms
[2024-05-23 01:48:12] [INFO ] Implicit Places using invariants in 492 ms returned [42, 48, 68, 73, 122, 128, 149, 154, 155, 175, 180]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 496 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 430/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 430 transition count 437
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 424 transition count 437
Applied a total of 12 rules in 14 ms. Remains 424 /430 variables (removed 6) and now considering 437/443 (removed 6) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:48:12] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:48:13] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:48:13] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 01:48:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:48:29] [INFO ] Implicit Places using invariants and state equation in 16747 ms returned []
Implicit Place search using SMT with State Equation took 17005 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 34807 ms. Remains : 424/478 places, 437/455 transitions.
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 224705 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224705 steps, saw 112374 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:48:33] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-23 01:48:34] [INFO ] After 579ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-23 01:48:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:48:34] [INFO ] After 390ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 01:48:34] [INFO ] After 1075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 01:48:35] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 01:48:38] [INFO ] After 2742ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-23 01:48:38] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:48:38] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2024-05-23 01:48:38] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2024-05-23 01:48:38] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:48:39] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 0 ms to minimize.
[2024-05-23 01:48:39] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:48:39] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2024-05-23 01:48:39] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2024-05-23 01:48:39] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2024-05-23 01:48:40] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 0 ms to minimize.
[2024-05-23 01:48:40] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2024-05-23 01:48:40] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2024-05-23 01:48:40] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2024-05-23 01:48:41] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2024-05-23 01:48:42] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2024-05-23 01:48:43] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2024-05-23 01:48:43] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 0 ms to minimize.
[2024-05-23 01:48:43] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-23 01:48:43] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2024-05-23 01:48:43] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5352 ms
[2024-05-23 01:48:44] [INFO ] After 8895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 779 ms.
[2024-05-23 01:48:44] [INFO ] After 10539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8000 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 424 /424 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 424/424 places, 437/437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 437/437 transitions.
Applied a total of 0 rules in 6 ms. Remains 424 /424 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:48:53] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:48:53] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:48:53] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:48:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:49:21] [INFO ] Implicit Places using invariants and state equation in 28296 ms returned []
Implicit Place search using SMT with State Equation took 28575 ms to find 0 implicit places.
[2024-05-23 01:49:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 01:49:21] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:49:21] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28819 ms. Remains : 424/424 places, 437/437 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 750 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 332 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 332 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33385 reset in 406 ms.
Product exploration explored 100000 steps with 33532 reset in 410 ms.
Built C files in :
/tmp/ltsmin14650868456118618206
[2024-05-23 01:49:24] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14650868456118618206
Running compilation step : cd /tmp/ltsmin14650868456118618206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1756 ms.
Running link step : cd /tmp/ltsmin14650868456118618206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14650868456118618206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11830544138793082690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 39 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:49:39] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 01:49:40] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:49:40] [INFO ] Invariants computation overflowed in 97 ms
[2024-05-23 01:49:56] [INFO ] Implicit Places using invariants and state equation in 16694 ms returned []
Implicit Place search using SMT with State Equation took 17092 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:49:56] [INFO ] Invariants computation overflowed in 123 ms
[2024-05-23 01:49:57] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17620 ms. Remains : 1057/1057 places, 997/997 transitions.
Built C files in :
/tmp/ltsmin14169660379817630156
[2024-05-23 01:49:57] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14169660379817630156
Running compilation step : cd /tmp/ltsmin14169660379817630156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1569 ms.
Running link step : cd /tmp/ltsmin14169660379817630156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14169660379817630156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4987947213684601587.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:50:12] [INFO ] Flatten gal took : 26 ms
[2024-05-23 01:50:12] [INFO ] Flatten gal took : 21 ms
[2024-05-23 01:50:12] [INFO ] Time to serialize gal into /tmp/LTL863255202387871439.gal : 5 ms
[2024-05-23 01:50:12] [INFO ] Time to serialize properties into /tmp/LTL3186777345691478507.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL863255202387871439.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7449532124558713050.hoa' '-atoms' '/tmp/LTL3186777345691478507.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3186777345691478507.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7449532124558713050.hoa
Detected timeout of ITS tools.
[2024-05-23 01:50:27] [INFO ] Flatten gal took : 21 ms
[2024-05-23 01:50:27] [INFO ] Flatten gal took : 21 ms
[2024-05-23 01:50:27] [INFO ] Time to serialize gal into /tmp/LTL5420657706151564462.gal : 4 ms
[2024-05-23 01:50:27] [INFO ] Time to serialize properties into /tmp/LTL8389569210979289354.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5420657706151564462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8389569210979289354.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((p254>=1)&&(p266>=1))"))U("(p827>=1)"))||(!("((p254>=1)&&(p266>=1))")))U(X("(p648>=1)"))))))
Formula 0 simplified : G((!"((p254>=1)&&(p266>=1))" | (F"((p254>=1)&&(p266>=1))" U "(p827>=1)")) U X"(p648>=1)")
Detected timeout of ITS tools.
[2024-05-23 01:50:42] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:50:42] [INFO ] Applying decomposition
[2024-05-23 01:50:42] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph749193274464039559.txt' '-o' '/tmp/graph749193274464039559.bin' '-w' '/tmp/graph749193274464039559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph749193274464039559.bin' '-l' '-1' '-v' '-w' '/tmp/graph749193274464039559.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:50:42] [INFO ] Decomposing Gal with order
[2024-05-23 01:50:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:50:42] [INFO ] Removed a total of 280 redundant transitions.
[2024-05-23 01:50:42] [INFO ] Flatten gal took : 68 ms
[2024-05-23 01:50:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 11 ms.
[2024-05-23 01:50:42] [INFO ] Time to serialize gal into /tmp/LTL1049302334293761957.gal : 8 ms
[2024-05-23 01:50:42] [INFO ] Time to serialize properties into /tmp/LTL16395374196346163437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1049302334293761957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16395374196346163437.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((i2.u99.p254>=1)&&(i0.u102.p266>=1))"))U("(i10.u372.p827>=1)"))||(!("((i2.u99.p254>=1)&&(i0.u102.p266>=1))")))U(X("(i8.u...174
Formula 0 simplified : G((!"((i2.u99.p254>=1)&&(i0.u102.p266>=1))" | (F"((i2.u99.p254>=1)&&(i0.u102.p266>=1))" U "(i10.u372.p827>=1)")) U X"(i8.u285.p648>=...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12400456773120478801
[2024-05-23 01:50:58] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12400456773120478801
Running compilation step : cd /tmp/ltsmin12400456773120478801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1607 ms.
Running link step : cd /tmp/ltsmin12400456773120478801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12400456773120478801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(((<>((LTLAPp0==true)) U (LTLAPp1==true))||!(LTLAPp0==true)) U X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 445187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 818 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 477 place count 817 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 477 place count 817 transition count 717
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 995 place count 558 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 557 transition count 535
Applied a total of 996 rules in 69 ms. Remains 557 /1057 variables (removed 500) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-23 01:51:13] [INFO ] Computed 99 invariants in 60 ms
[2024-05-23 01:51:13] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 01:51:13] [INFO ] Invariant cache hit.
[2024-05-23 01:51:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:51:36] [INFO ] Implicit Places using invariants and state equation in 22870 ms returned []
Implicit Place search using SMT with State Equation took 23182 ms to find 0 implicit places.
[2024-05-23 01:51:36] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 01:51:36] [INFO ] Invariant cache hit.
[2024-05-23 01:51:36] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23493 ms. Remains : 557/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s134 1), p2:(AND (GEQ s167 1) (NOT (AND (GEQ s104 1) (GEQ s114 1)))), p1:(AND (GEQ s104 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13843 reset in 121 ms.
Product exploration explored 100000 steps with 13758 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 1359 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 801 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 227839 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227839 steps, saw 113953 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-23 01:51:40] [INFO ] Invariant cache hit.
[2024-05-23 01:51:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:51:40] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 30 ms returned sat
[2024-05-23 01:51:40] [INFO ] After 182ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:51:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:51:40] [INFO ] After 47ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:51:40] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 01:51:40] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:51:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:51:40] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 28 ms returned sat
[2024-05-23 01:51:41] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:51:41] [INFO ] After 424ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2024-05-23 01:51:43] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2024-05-23 01:51:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1207 ms
[2024-05-23 01:51:43] [INFO ] After 1859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-05-23 01:51:43] [INFO ] After 2645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 413 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 535/535 transitions.
Graph (complete) has 1660 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 534
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 556 transition count 455
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 477 transition count 455
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 242 place count 477 transition count 455
Applied a total of 242 rules in 30 ms. Remains 477 /557 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 477/557 places, 455/535 transitions.
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 248558 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248558 steps, saw 124340 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 455 rows 477 cols
[2024-05-23 01:51:47] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:51:47] [INFO ] After 305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:51:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:51:48] [INFO ] After 236ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:51:48] [INFO ] After 274ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-23 01:51:48] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:51:48] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:51:49] [INFO ] After 592ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-23 01:51:49] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 0 ms to minimize.
[2024-05-23 01:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-23 01:51:49] [INFO ] After 1026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 318 ms.
[2024-05-23 01:51:50] [INFO ] After 1955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-23 01:51:50] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 01:51:50] [INFO ] Implicit Places using invariants in 473 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-23 01:51:50] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 01:51:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:52:11] [INFO ] Implicit Places using invariants and state equation in 20646 ms returned [95, 202, 215, 229, 234, 257, 263, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 21132 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 452/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 452 transition count 444
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 22 place count 441 transition count 444
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 441 transition count 444
Applied a total of 25 rules in 24 ms. Remains 441 /452 variables (removed 11) and now considering 444/455 (removed 11) transitions.
// Phase 1: matrix 444 rows 441 cols
[2024-05-23 01:52:11] [INFO ] Computed 74 invariants in 65 ms
[2024-05-23 01:52:12] [INFO ] Implicit Places using invariants in 794 ms returned [42, 48, 68, 73, 99, 121, 127, 149, 154, 155, 175, 180, 206]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 796 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 428/477 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 428 transition count 437
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 421 transition count 437
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 421 transition count 437
Applied a total of 16 rules in 23 ms. Remains 421 /428 variables (removed 7) and now considering 437/444 (removed 7) transitions.
// Phase 1: matrix 437 rows 421 cols
[2024-05-23 01:52:12] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 01:52:12] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2024-05-23 01:52:12] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 01:52:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:52:29] [INFO ] Implicit Places using invariants and state equation in 17019 ms returned []
Implicit Place search using SMT with State Equation took 17295 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 421/477 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 39281 ms. Remains : 421/477 places, 437/455 transitions.
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 254063 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254063 steps, saw 127054 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 437 rows 421 cols
[2024-05-23 01:52:32] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 01:52:33] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 01:52:33] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:52:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:52:34] [INFO ] After 1132ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-23 01:52:34] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2024-05-23 01:52:35] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-05-23 01:52:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2024-05-23 01:52:35] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2024-05-23 01:52:35] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-23 01:52:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2024-05-23 01:52:36] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-05-23 01:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2024-05-23 01:52:36] [INFO ] After 2562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 316 ms.
[2024-05-23 01:52:36] [INFO ] After 3413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 174 ms.
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 421/421 places, 437/437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 421 cols
[2024-05-23 01:52:36] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 01:52:36] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2024-05-23 01:52:37] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 01:52:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:52:50] [INFO ] Implicit Places using invariants and state equation in 13783 ms returned []
Implicit Place search using SMT with State Equation took 14069 ms to find 0 implicit places.
[2024-05-23 01:52:50] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2024-05-23 01:52:50] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 01:52:50] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14288 ms. Remains : 421/421 places, 437/437 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 421 transition count 400
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 384 transition count 400
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 93 place count 365 transition count 381
Iterating global reduction 0 with 19 rules applied. Total rules applied 112 place count 365 transition count 381
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 364 transition count 380
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 364 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 362 transition count 378
Applied a total of 118 rules in 31 ms. Remains 362 /421 variables (removed 59) and now considering 378/437 (removed 59) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 378 rows 362 cols
[2024-05-23 01:52:51] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-23 01:52:51] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 01:52:51] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:52:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:52:51] [INFO ] After 83ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-23 01:52:51] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2024-05-23 01:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-23 01:52:52] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2024-05-23 01:52:52] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-23 01:52:52] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2024-05-23 01:52:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2024-05-23 01:52:53] [INFO ] After 1718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-23 01:52:53] [INFO ] After 2173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 111 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 535/535 transitions.
Applied a total of 0 rules in 14 ms. Remains 557 /557 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 557 cols
[2024-05-23 01:52:53] [INFO ] Computed 99 invariants in 50 ms
[2024-05-23 01:52:54] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-23 01:52:54] [INFO ] Invariant cache hit.
[2024-05-23 01:52:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:53:10] [INFO ] Implicit Places using invariants and state equation in 16761 ms returned []
Implicit Place search using SMT with State Equation took 17050 ms to find 0 implicit places.
[2024-05-23 01:53:10] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:53:10] [INFO ] Invariant cache hit.
[2024-05-23 01:53:11] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17294 ms. Remains : 557/557 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) p0))), (X p0), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 230435 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230435 steps, saw 115251 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-23 01:53:14] [INFO ] Invariant cache hit.
[2024-05-23 01:53:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:53:14] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 32 ms returned sat
[2024-05-23 01:53:15] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:53:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:53:15] [INFO ] After 57ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:53:15] [INFO ] After 101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-23 01:53:15] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:53:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:53:15] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 30 ms returned sat
[2024-05-23 01:53:15] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:53:16] [INFO ] After 415ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-23 01:53:16] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2024-05-23 01:53:16] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2024-05-23 01:53:16] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2024-05-23 01:53:16] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2024-05-23 01:53:17] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2024-05-23 01:53:17] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2024-05-23 01:53:17] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2024-05-23 01:53:17] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2024-05-23 01:53:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1247 ms
[2024-05-23 01:53:17] [INFO ] After 1900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 144 ms.
[2024-05-23 01:53:17] [INFO ] After 2647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 268 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 535/535 transitions.
Graph (complete) has 1660 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 534
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 556 transition count 455
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 477 transition count 455
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 242 place count 477 transition count 455
Applied a total of 242 rules in 29 ms. Remains 477 /557 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 477/557 places, 455/535 transitions.
Incomplete random walk after 10000 steps, including 1308 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 239946 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239946 steps, saw 120031 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 455 rows 477 cols
[2024-05-23 01:53:21] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:53:22] [INFO ] After 297ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:53:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:53:22] [INFO ] After 237ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:53:22] [INFO ] After 273ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 01:53:22] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:53:22] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:53:23] [INFO ] After 551ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-23 01:53:23] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2024-05-23 01:53:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-05-23 01:53:23] [INFO ] After 967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 315 ms.
[2024-05-23 01:53:24] [INFO ] After 1855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 477/477 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2024-05-23 01:53:24] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 01:53:24] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 455 rows 477 cols
[2024-05-23 01:53:24] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 01:53:24] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:53:41] [INFO ] Implicit Places using invariants and state equation in 16533 ms returned [48, 68, 73, 100, 122, 128, 150, 155, 176, 202, 208, 215, 229, 234, 285, 290, 310, 315, 336, 341, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 16995 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 446/477 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 446 transition count 443
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 434 transition count 443
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 434 transition count 443
Applied a total of 31 rules in 23 ms. Remains 434 /446 variables (removed 12) and now considering 443/455 (removed 12) transitions.
// Phase 1: matrix 443 rows 434 cols
[2024-05-23 01:53:41] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 01:53:41] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 443 rows 434 cols
[2024-05-23 01:53:41] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 01:53:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:54:11] [INFO ] Performed 411/434 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 01:54:13] [INFO ] Implicit Places using invariants and state equation in 31669 ms returned []
Implicit Place search using SMT with State Equation took 31977 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/477 places, 443/455 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49004 ms. Remains : 434/477 places, 443/455 transitions.
Incomplete random walk after 10000 steps, including 1406 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 244011 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244011 steps, saw 122053 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 443 rows 434 cols
[2024-05-23 01:54:16] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 01:54:16] [INFO ] After 178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 01:54:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:54:17] [INFO ] After 436ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 01:54:17] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 01:54:18] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 01:54:18] [INFO ] After 228ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-23 01:54:18] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2024-05-23 01:54:18] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-23 01:54:18] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2024-05-23 01:54:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2024-05-23 01:54:18] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2024-05-23 01:54:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-23 01:54:19] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2024-05-23 01:54:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2024-05-23 01:54:19] [INFO ] After 1188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-23 01:54:19] [INFO ] After 2114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 443/443 transitions.
Applied a total of 0 rules in 8 ms. Remains 434 /434 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 434/434 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 443/443 transitions.
Applied a total of 0 rules in 7 ms. Remains 434 /434 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 434 cols
[2024-05-23 01:54:19] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 01:54:19] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 443 rows 434 cols
[2024-05-23 01:54:19] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-23 01:54:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:54:50] [INFO ] Performed 381/434 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 01:54:53] [INFO ] Implicit Places using invariants and state equation in 33872 ms returned []
Implicit Place search using SMT with State Equation took 34168 ms to find 0 implicit places.
[2024-05-23 01:54:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 443 rows 434 cols
[2024-05-23 01:54:53] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 01:54:53] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34403 ms. Remains : 434/434 places, 443/443 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) p0))), (X p0), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 13929 reset in 113 ms.
Product exploration explored 100000 steps with 13806 reset in 119 ms.
Built C files in :
/tmp/ltsmin15287659117023975222
[2024-05-23 01:54:54] [INFO ] Computing symmetric may disable matrix : 535 transitions.
[2024-05-23 01:54:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:54:54] [INFO ] Computing symmetric may enable matrix : 535 transitions.
[2024-05-23 01:54:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:54:54] [INFO ] Computing Do-Not-Accords matrix : 535 transitions.
[2024-05-23 01:54:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:54:54] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15287659117023975222
Running compilation step : cd /tmp/ltsmin15287659117023975222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1200 ms.
Running link step : cd /tmp/ltsmin15287659117023975222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15287659117023975222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4126788341324781570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 535/535 transitions.
Applied a total of 0 rules in 14 ms. Remains 557 /557 variables (removed 0) and now considering 535/535 (removed 0) transitions.
[2024-05-23 01:55:09] [INFO ] Invariant cache hit.
[2024-05-23 01:55:09] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 01:55:09] [INFO ] Invariant cache hit.
[2024-05-23 01:55:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:55:40] [INFO ] Performed 339/557 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 01:55:57] [INFO ] Implicit Places using invariants and state equation in 47757 ms returned []
Implicit Place search using SMT with State Equation took 48020 ms to find 0 implicit places.
[2024-05-23 01:55:57] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-23 01:55:57] [INFO ] Invariant cache hit.
[2024-05-23 01:55:57] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48267 ms. Remains : 557/557 places, 535/535 transitions.
Built C files in :
/tmp/ltsmin9544045375708804114
[2024-05-23 01:55:57] [INFO ] Computing symmetric may disable matrix : 535 transitions.
[2024-05-23 01:55:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:55:57] [INFO ] Computing symmetric may enable matrix : 535 transitions.
[2024-05-23 01:55:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:55:57] [INFO ] Computing Do-Not-Accords matrix : 535 transitions.
[2024-05-23 01:55:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:55:57] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9544045375708804114
Running compilation step : cd /tmp/ltsmin9544045375708804114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1203 ms.
Running link step : cd /tmp/ltsmin9544045375708804114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9544045375708804114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13504081539143173463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:56:13] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:56:13] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:56:13] [INFO ] Time to serialize gal into /tmp/LTL11628418216612500391.gal : 3 ms
[2024-05-23 01:56:13] [INFO ] Time to serialize properties into /tmp/LTL11485453445986768360.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11628418216612500391.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14907699077320166302.hoa' '-atoms' '/tmp/LTL11485453445986768360.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11485453445986768360.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14907699077320166302.hoa
Detected timeout of ITS tools.
[2024-05-23 01:56:28] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:56:28] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:56:28] [INFO ] Time to serialize gal into /tmp/LTL10061672298064503377.gal : 3 ms
[2024-05-23 01:56:28] [INFO ] Time to serialize properties into /tmp/LTL14121902693083478119.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10061672298064503377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14121902693083478119.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(p277<1)")&&(F((!("((p230>=1)&&(p248>=1))"))U(("((p330>=1)&&(!((p230>=1)&&(p248>=1))))")||(G(!("((p230>=1)&&(p248>=1))"))))))))...156
Formula 0 simplified : F(!"(p277<1)" | G("((p230>=1)&&(p248>=1))" M !"((p330>=1)&&(!((p230>=1)&&(p248>=1))))"))
Detected timeout of ITS tools.
[2024-05-23 01:56:43] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:56:43] [INFO ] Applying decomposition
[2024-05-23 01:56:43] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10168356399326465579.txt' '-o' '/tmp/graph10168356399326465579.bin' '-w' '/tmp/graph10168356399326465579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10168356399326465579.bin' '-l' '-1' '-v' '-w' '/tmp/graph10168356399326465579.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:56:43] [INFO ] Decomposing Gal with order
[2024-05-23 01:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:56:43] [INFO ] Removed a total of 386 redundant transitions.
[2024-05-23 01:56:43] [INFO ] Flatten gal took : 28 ms
[2024-05-23 01:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2024-05-23 01:56:43] [INFO ] Time to serialize gal into /tmp/LTL1980350033022019878.gal : 6 ms
[2024-05-23 01:56:43] [INFO ] Time to serialize properties into /tmp/LTL5640143880042131240.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1980350033022019878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5640143880042131240.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i3.i0.u40.p277<1)")&&(F((!("((i2.u31.p230>=1)&&(i2.u35.p248>=1))"))U(("((i3.i1.u52.p330>=1)&&(!((i2.u31.p230>=1)&&(i2.u35.p248...218
Formula 0 simplified : F(!"(i3.i0.u40.p277<1)" | G("((i2.u31.p230>=1)&&(i2.u35.p248>=1))" M !"((i3.i1.u52.p330>=1)&&(!((i2.u31.p230>=1)&&(i2.u35.p248>=1)))...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17336970523361544742
[2024-05-23 01:56:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17336970523361544742
Running compilation step : cd /tmp/ltsmin17336970523361544742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 939 ms.
Running link step : cd /tmp/ltsmin17336970523361544742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17336970523361544742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)&&<>((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-10 finished in 360335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(!p1) U p2))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 33 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:57:13] [INFO ] Invariants computation overflowed in 127 ms
[2024-05-23 01:57:13] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:57:13] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-23 01:57:30] [INFO ] Implicit Places using invariants and state equation in 16698 ms returned []
Implicit Place search using SMT with State Equation took 17095 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 01:57:30] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-23 01:57:31] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17645 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (OR (NOT p2) p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s437 1), p2:(AND (GEQ s249 1) (GEQ s285 1)), p1:(AND (GEQ s368 1) (GEQ s414 1))], 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]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-11 finished in 17938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||((G(F(!p0))||(F(!p0)&&F(p1)))&&F(p2))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 481 place count 815 transition count 716
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 559 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 70 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 01:57:31] [INFO ] Computed 99 invariants in 54 ms
[2024-05-23 01:57:31] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-23 01:57:31] [INFO ] Invariant cache hit.
[2024-05-23 01:57:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:57:56] [INFO ] Implicit Places using invariants and state equation in 24353 ms returned []
Implicit Place search using SMT with State Equation took 24662 ms to find 0 implicit places.
[2024-05-23 01:57:56] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 01:57:56] [INFO ] Invariant cache hit.
[2024-05-23 01:57:56] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24971 ms. Remains : 556/1057 places, 533/997 transitions.
Stuttering acceptance computed with spot in 226 ms :[p0, p0, (AND (NOT p2) p0), (AND (NOT p1) p0), (AND p0 (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s307 1) (GEQ s396 1)), p2:(GEQ s396 1), p1:(LT s340 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 13940 reset in 124 ms.
Product exploration explored 100000 steps with 13830 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), false, false]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 802 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 01:57:57] [INFO ] Invariant cache hit.
[2024-05-23 01:57:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:57:57] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2024-05-23 01:57:58] [INFO ] After 681ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-23 01:57:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:57:58] [INFO ] After 212ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 01:57:58] [INFO ] After 1003ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 01:57:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:57:58] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 33 ms returned sat
[2024-05-23 01:57:59] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-23 01:57:59] [INFO ] After 299ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 0 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-23 01:57:59] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-23 01:57:59] [INFO ] After 1294ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1660 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 555 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 554 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 81 place count 554 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 158 place count 477 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 238 place count 477 transition count 454
Applied a total of 238 rules in 32 ms. Remains 477 /556 variables (removed 79) and now considering 454/533 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 477/556 places, 454/533 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 435117 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 435117 steps, saw 217675 distinct states, run finished after 3003 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 477 cols
[2024-05-23 01:58:02] [INFO ] Computed 99 invariants in 55 ms
[2024-05-23 01:58:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:58:02] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 37 ms returned sat
[2024-05-23 01:58:03] [INFO ] After 253ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:58:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:58:03] [INFO ] After 214ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:58:03] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:58:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:58:03] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2024-05-23 01:58:03] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:58:04] [INFO ] After 311ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:58:04] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2024-05-23 01:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-05-23 01:58:04] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-23 01:58:04] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 477/477 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-05-23 01:58:04] [INFO ] Invariant cache hit.
[2024-05-23 01:58:05] [INFO ] Implicit Places using invariants in 1348 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 231, 254, 260, 283, 288, 308, 313, 335, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1357 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/477 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 439 transition count 435
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 420 transition count 435
Applied a total of 38 rules in 16 ms. Remains 420 /439 variables (removed 19) and now considering 435/454 (removed 19) transitions.
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:58:05] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 01:58:06] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:58:06] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 01:58:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:58:31] [INFO ] Implicit Places using invariants and state equation in 25768 ms returned []
Implicit Place search using SMT with State Equation took 26044 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 420/477 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27426 ms. Remains : 420/477 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 456480 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 456480 steps, saw 228292 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:58:34] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 01:58:35] [INFO ] After 517ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:58:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:58:36] [INFO ] After 623ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:58:36] [INFO ] After 1205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:58:36] [INFO ] After 734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:58:37] [INFO ] After 51ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:58:37] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-23 01:58:37] [INFO ] After 900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 420/420 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 19 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:58:37] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 01:58:37] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:58:37] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 01:58:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:59:02] [INFO ] Implicit Places using invariants and state equation in 24743 ms returned []
Implicit Place search using SMT with State Equation took 25016 ms to find 0 implicit places.
[2024-05-23 01:59:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:59:02] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 01:59:02] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25247 ms. Remains : 420/420 places, 435/435 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 420 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 419 transition count 434
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 2 place count 419 transition count 397
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 76 place count 382 transition count 397
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 95 place count 363 transition count 378
Iterating global reduction 2 with 19 rules applied. Total rules applied 114 place count 363 transition count 378
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 2 with 2 rules applied. Total rules applied 116 place count 362 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 362 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 360 transition count 375
Applied a total of 120 rules in 28 ms. Remains 360 /420 variables (removed 60) and now considering 375/435 (removed 60) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 360 cols
[2024-05-23 01:59:02] [INFO ] Computed 61 invariants in 44 ms
[2024-05-23 01:59:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:59:02] [INFO ] [Real]Absence check using 3 positive and 58 generalized place invariants in 13 ms returned sat
[2024-05-23 01:59:02] [INFO ] After 287ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:59:02] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:59:02] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:59:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 01:59:02] [INFO ] [Nat]Absence check using 3 positive and 58 generalized place invariants in 12 ms returned sat
[2024-05-23 01:59:03] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:59:03] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:59:03] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2024-05-23 01:59:03] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2024-05-23 01:59:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2024-05-23 01:59:03] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-23 01:59:03] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0))), (G (NOT (AND p2 (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND p2 p0))]
Knowledge based reduction with 12 factoid took 214 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), false, false]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), false, false]
Support contains 2 out of 556 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 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 18 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 01:59:04] [INFO ] Computed 99 invariants in 53 ms
[2024-05-23 01:59:04] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 01:59:04] [INFO ] Invariant cache hit.
[2024-05-23 01:59:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:59:19] [INFO ] Implicit Places using invariants and state equation in 14996 ms returned []
Implicit Place search using SMT with State Equation took 15314 ms to find 0 implicit places.
[2024-05-23 01:59:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:59:19] [INFO ] Invariant cache hit.
[2024-05-23 01:59:19] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15579 ms. Remains : 556/556 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 802 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 01:59:20] [INFO ] Invariant cache hit.
[2024-05-23 01:59:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:59:20] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2024-05-23 01:59:21] [INFO ] After 691ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-23 01:59:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:59:21] [INFO ] After 214ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 01:59:21] [INFO ] After 1019ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 01:59:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:59:21] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2024-05-23 01:59:22] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-23 01:59:22] [INFO ] After 304ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-23 01:59:22] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 0 ms to minimize.
[2024-05-23 01:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-05-23 01:59:22] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-23 01:59:22] [INFO ] After 1329ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1660 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 555 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 554 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 81 place count 554 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 158 place count 477 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 238 place count 477 transition count 454
Applied a total of 238 rules in 32 ms. Remains 477 /556 variables (removed 79) and now considering 454/533 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 477/556 places, 454/533 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 436310 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436310 steps, saw 218272 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 477 cols
[2024-05-23 01:59:25] [INFO ] Computed 99 invariants in 54 ms
[2024-05-23 01:59:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:59:25] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 37 ms returned sat
[2024-05-23 01:59:26] [INFO ] After 252ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 01:59:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:59:26] [INFO ] After 210ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:59:26] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:59:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:59:26] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2024-05-23 01:59:26] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:59:27] [INFO ] After 313ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:59:27] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2024-05-23 01:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-05-23 01:59:27] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 01:59:27] [INFO ] After 983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 82 ms.
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 477/477 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-05-23 01:59:27] [INFO ] Invariant cache hit.
[2024-05-23 01:59:28] [INFO ] Implicit Places using invariants in 1312 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 231, 254, 260, 283, 288, 308, 313, 335, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1314 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/477 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 439 transition count 435
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 420 transition count 435
Applied a total of 38 rules in 18 ms. Remains 420 /439 variables (removed 19) and now considering 435/454 (removed 19) transitions.
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:59:28] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 01:59:29] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 01:59:29] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 01:59:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 01:59:59] [INFO ] Performed 370/420 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 02:00:04] [INFO ] Implicit Places using invariants and state equation in 35941 ms returned []
Implicit Place search using SMT with State Equation took 36206 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 420/477 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37547 ms. Remains : 420/477 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 455628 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 455628 steps, saw 227862 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 02:00:08] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:00:08] [INFO ] After 532ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:00:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:00:09] [INFO ] After 637ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:00:09] [INFO ] After 1238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:00:10] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:00:10] [INFO ] After 51ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:00:10] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-23 02:00:10] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 420/420 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 02:00:10] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:00:10] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 02:00:10] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-23 02:00:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:00:37] [INFO ] Implicit Places using invariants and state equation in 26823 ms returned []
Implicit Place search using SMT with State Equation took 27086 ms to find 0 implicit places.
[2024-05-23 02:00:37] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2024-05-23 02:00:37] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 02:00:37] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27305 ms. Remains : 420/420 places, 435/435 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 420 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 419 transition count 434
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 2 place count 419 transition count 397
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 76 place count 382 transition count 397
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 95 place count 363 transition count 378
Iterating global reduction 2 with 19 rules applied. Total rules applied 114 place count 363 transition count 378
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 2 with 2 rules applied. Total rules applied 116 place count 362 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 362 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 360 transition count 375
Applied a total of 120 rules in 27 ms. Remains 360 /420 variables (removed 60) and now considering 375/435 (removed 60) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 360 cols
[2024-05-23 02:00:37] [INFO ] Computed 61 invariants in 49 ms
[2024-05-23 02:00:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:00:37] [INFO ] [Real]Absence check using 3 positive and 58 generalized place invariants in 12 ms returned sat
[2024-05-23 02:00:38] [INFO ] After 277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 02:00:38] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:00:38] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:00:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:00:38] [INFO ] [Nat]Absence check using 3 positive and 58 generalized place invariants in 12 ms returned sat
[2024-05-23 02:00:38] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:00:38] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:00:38] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2024-05-23 02:00:38] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2024-05-23 02:00:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-05-23 02:00:38] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-23 02:00:38] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p2), (F (AND p0 p2))]
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 13938 reset in 106 ms.
Product exploration explored 100000 steps with 13837 reset in 115 ms.
Built C files in :
/tmp/ltsmin8546502390830472710
[2024-05-23 02:00:39] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2024-05-23 02:00:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:00:39] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2024-05-23 02:00:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:00:39] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2024-05-23 02:00:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:00:39] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8546502390830472710
Running compilation step : cd /tmp/ltsmin8546502390830472710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1271 ms.
Running link step : cd /tmp/ltsmin8546502390830472710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8546502390830472710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4577248043362747035.hoa' '--buchi-type=spotba'
LTSmin run took 4481 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 194090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 33 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 02:00:45] [INFO ] Invariants computation overflowed in 106 ms
[2024-05-23 02:00:45] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 02:00:45] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 02:01:02] [INFO ] Implicit Places using invariants and state equation in 16346 ms returned []
Implicit Place search using SMT with State Equation took 16713 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 02:01:02] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-23 02:01:02] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17230 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s417 1) (OR (LT s838 1) (LT s873 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3341 reset in 108 ms.
Product exploration explored 100000 steps with 3369 reset in 117 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244982 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244982 steps, saw 122508 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 02:01:06] [INFO ] Invariants computation overflowed in 114 ms
[2024-05-23 02:01:06] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:01:09] [INFO ] After 2637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:01:09] [INFO ] Deduced a trap composed of 103 places in 212 ms of which 0 ms to minimize.
[2024-05-23 02:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 502 ms
[2024-05-23 02:01:10] [INFO ] After 3736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1500 ms.
[2024-05-23 02:01:11] [INFO ] After 5359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 817 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 480 place count 816 transition count 714
Deduced a syphon composed of 42 places in 7 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1001 place count 556 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1002 place count 555 transition count 532
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1082 place count 555 transition count 452
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1162 place count 475 transition count 452
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 5 with 79 rules applied. Total rules applied 1241 place count 475 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1242 place count 474 transition count 451
Applied a total of 1242 rules in 89 ms. Remains 474 /1057 variables (removed 583) and now considering 451/997 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 474/1057 places, 451/997 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427804 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427804 steps, saw 214031 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 451 rows 474 cols
[2024-05-23 02:01:16] [INFO ] Computed 99 invariants in 67 ms
[2024-05-23 02:01:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:01:17] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 46 ms returned sat
[2024-05-23 02:01:17] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:01:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 02:01:17] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 46 ms returned sat
[2024-05-23 02:01:17] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:01:17] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:01:18] [INFO ] After 397ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:01:18] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-23 02:01:18] [INFO ] After 890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 474/474 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-23 02:01:18] [INFO ] Invariant cache hit.
[2024-05-23 02:01:19] [INFO ] Implicit Places using invariants in 1323 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 199, 205, 212, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1332 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/474 places, 451/451 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 436 transition count 432
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 417 transition count 432
Applied a total of 38 rules in 15 ms. Remains 417 /436 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:01:19] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-23 02:01:19] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:01:19] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:01:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:01:36] [INFO ] Implicit Places using invariants and state equation in 16859 ms returned []
Implicit Place search using SMT with State Equation took 17122 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/474 places, 432/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18478 ms. Remains : 417/474 places, 432/451 transitions.
Incomplete random walk after 10000 steps, including 1458 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 450374 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 450374 steps, saw 225233 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:01:39] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:01:39] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:01:40] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:01:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:01:40] [INFO ] After 353ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:01:40] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-23 02:01:40] [INFO ] After 814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 417/417 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:01:40] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 02:01:41] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:01:41] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:01:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:02:06] [INFO ] Implicit Places using invariants and state equation in 25925 ms returned []
Implicit Place search using SMT with State Equation took 26191 ms to find 0 implicit places.
[2024-05-23 02:02:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:02:07] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-23 02:02:07] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26400 ms. Remains : 417/417 places, 432/432 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 417 transition count 395
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 380 transition count 395
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 92 place count 362 transition count 377
Iterating global reduction 0 with 18 rules applied. Total rules applied 110 place count 362 transition count 377
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 0 with 2 rules applied. Total rules applied 112 place count 361 transition count 376
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 361 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 114 place count 360 transition count 375
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 360 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 358 transition count 373
Applied a total of 118 rules in 30 ms. Remains 358 /417 variables (removed 59) and now considering 373/432 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 358 cols
[2024-05-23 02:02:07] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:02:07] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:02:07] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 02:02:07] [INFO ] After 112ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:02:07] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2024-05-23 02:02:07] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2024-05-23 02:02:08] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2024-05-23 02:02:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2024-05-23 02:02:08] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-23 02:02:08] [INFO ] After 757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 817 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 479 place count 816 transition count 715
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 998 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 999 place count 556 transition count 533
Applied a total of 999 rules in 74 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 02:02:08] [INFO ] Computed 99 invariants in 46 ms
[2024-05-23 02:02:08] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-23 02:02:08] [INFO ] Invariant cache hit.
[2024-05-23 02:02:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:02:26] [INFO ] Implicit Places using invariants and state equation in 17624 ms returned []
Implicit Place search using SMT with State Equation took 17921 ms to find 0 implicit places.
[2024-05-23 02:02:26] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-23 02:02:26] [INFO ] Invariant cache hit.
[2024-05-23 02:02:26] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18237 ms. Remains : 556/1057 places, 533/997 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1393 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 387620 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 387620 steps, saw 193860 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 02:02:29] [INFO ] Invariant cache hit.
[2024-05-23 02:02:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:02:29] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 43 ms returned sat
[2024-05-23 02:02:29] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:02:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:02:29] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2024-05-23 02:02:30] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:02:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:02:31] [INFO ] After 875ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:02:31] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 0 ms to minimize.
[2024-05-23 02:02:31] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 0 ms to minimize.
[2024-05-23 02:02:31] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2024-05-23 02:02:31] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 0 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 0 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 0 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 0 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2024-05-23 02:02:32] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-23 02:02:33] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2024-05-23 02:02:33] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2024-05-23 02:02:33] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2024-05-23 02:02:33] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-23 02:02:33] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-05-23 02:02:34] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 0 ms to minimize.
[2024-05-23 02:02:34] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
[2024-05-23 02:02:34] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 0 ms to minimize.
[2024-05-23 02:02:34] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 0 ms to minimize.
[2024-05-23 02:02:34] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:02:34] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-23 02:02:35] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-05-23 02:02:35] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3955 ms
[2024-05-23 02:02:35] [INFO ] After 4942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-23 02:02:35] [INFO ] After 5827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1663 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 555 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 554 transition count 531
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 84 place count 554 transition count 451
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 164 place count 474 transition count 451
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 242 place count 474 transition count 451
Applied a total of 242 rules in 40 ms. Remains 474 /556 variables (removed 82) and now considering 451/533 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 474/556 places, 451/533 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 413184 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 413184 steps, saw 206715 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 451 rows 474 cols
[2024-05-23 02:02:40] [INFO ] Computed 99 invariants in 63 ms
[2024-05-23 02:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:02:40] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 48 ms returned sat
[2024-05-23 02:02:41] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:02:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:02:41] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 45 ms returned sat
[2024-05-23 02:02:41] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:02:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:02:41] [INFO ] After 252ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2024-05-23 02:02:42] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 0 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 1 ms to minimize.
[2024-05-23 02:02:43] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 1 ms to minimize.
[2024-05-23 02:02:44] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2024-05-23 02:02:44] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-23 02:02:44] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 0 ms to minimize.
[2024-05-23 02:02:44] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2024-05-23 02:02:44] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-23 02:02:44] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2607 ms
[2024-05-23 02:02:44] [INFO ] After 3104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-23 02:02:44] [INFO ] After 3520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 474/474 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-23 02:02:46] [INFO ] Invariant cache hit.
[2024-05-23 02:02:48] [INFO ] Implicit Places using invariants in 1282 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 199, 205, 212, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1283 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/474 places, 451/451 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 436 transition count 432
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 417 transition count 432
Applied a total of 38 rules in 15 ms. Remains 417 /436 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:02:48] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 02:02:48] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:02:48] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:02:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:03:02] [INFO ] Implicit Places using invariants and state equation in 14044 ms returned []
Implicit Place search using SMT with State Equation took 14303 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/474 places, 432/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15609 ms. Remains : 417/474 places, 432/451 transitions.
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 438349 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 438349 steps, saw 219221 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:03:05] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:03:05] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:03:06] [INFO ] After 891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:03:06] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:03:06] [INFO ] After 286ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:03:06] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2024-05-23 02:03:07] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2024-05-23 02:03:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2024-05-23 02:03:07] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-23 02:03:07] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 8 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 417/417 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:03:07] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 02:03:07] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:03:07] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 02:03:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:03:23] [INFO ] Implicit Places using invariants and state equation in 15794 ms returned []
Implicit Place search using SMT with State Equation took 16066 ms to find 0 implicit places.
[2024-05-23 02:03:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:03:23] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-23 02:03:23] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16274 ms. Remains : 417/417 places, 432/432 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 417 transition count 395
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 380 transition count 395
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 92 place count 362 transition count 377
Iterating global reduction 0 with 18 rules applied. Total rules applied 110 place count 362 transition count 377
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 0 with 2 rules applied. Total rules applied 112 place count 361 transition count 376
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 361 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 114 place count 360 transition count 375
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 360 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 358 transition count 373
Applied a total of 118 rules in 32 ms. Remains 358 /417 variables (removed 59) and now considering 373/432 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 358 cols
[2024-05-23 02:03:23] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:03:23] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:03:23] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:03:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 02:03:23] [INFO ] After 53ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:03:24] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2024-05-23 02:03:24] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2024-05-23 02:03:24] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2024-05-23 02:03:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 281 ms
[2024-05-23 02:03:24] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 02:03:24] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13919 reset in 116 ms.
Product exploration explored 100000 steps with 13892 reset in 123 ms.
Built C files in :
/tmp/ltsmin11226329837334187109
[2024-05-23 02:03:24] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2024-05-23 02:03:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:03:24] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2024-05-23 02:03:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:03:24] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2024-05-23 02:03:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:03:24] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11226329837334187109
Running compilation step : cd /tmp/ltsmin11226329837334187109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1195 ms.
Running link step : cd /tmp/ltsmin11226329837334187109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11226329837334187109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15152258649259526997.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 17 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 02:03:39] [INFO ] Computed 99 invariants in 48 ms
[2024-05-23 02:03:40] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-23 02:03:40] [INFO ] Invariant cache hit.
[2024-05-23 02:03:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:03:57] [INFO ] Implicit Places using invariants and state equation in 16848 ms returned []
Implicit Place search using SMT with State Equation took 17174 ms to find 0 implicit places.
[2024-05-23 02:03:57] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-23 02:03:57] [INFO ] Invariant cache hit.
[2024-05-23 02:03:57] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17431 ms. Remains : 556/556 places, 533/533 transitions.
Built C files in :
/tmp/ltsmin7926733967163355051
[2024-05-23 02:03:57] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2024-05-23 02:03:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:03:57] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2024-05-23 02:03:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:03:57] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2024-05-23 02:03:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:03:57] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7926733967163355051
Running compilation step : cd /tmp/ltsmin7926733967163355051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1205 ms.
Running link step : cd /tmp/ltsmin7926733967163355051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7926733967163355051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased801291999813121934.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 02:04:12] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:04:12] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:04:12] [INFO ] Time to serialize gal into /tmp/LTL2786899684254563221.gal : 6 ms
[2024-05-23 02:04:12] [INFO ] Time to serialize properties into /tmp/LTL8548314898024712203.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2786899684254563221.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5030981782469411762.hoa' '-atoms' '/tmp/LTL8548314898024712203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8548314898024712203.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5030981782469411762.hoa
Detected timeout of ITS tools.
[2024-05-23 02:04:27] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:04:27] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:04:27] [INFO ] Time to serialize gal into /tmp/LTL3775528062181646407.gal : 2 ms
[2024-05-23 02:04:27] [INFO ] Time to serialize properties into /tmp/LTL9468252825997604209.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3775528062181646407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9468252825997604209.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((p421<1)&&((p800<1)||(p832<1)))"))))
Formula 0 simplified : XF!"((p421<1)&&((p800<1)||(p832<1)))"
Detected timeout of ITS tools.
[2024-05-23 02:04:42] [INFO ] Flatten gal took : 19 ms
[2024-05-23 02:04:42] [INFO ] Applying decomposition
[2024-05-23 02:04:42] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14998498058992998586.txt' '-o' '/tmp/graph14998498058992998586.bin' '-w' '/tmp/graph14998498058992998586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14998498058992998586.bin' '-l' '-1' '-v' '-w' '/tmp/graph14998498058992998586.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:04:42] [INFO ] Decomposing Gal with order
[2024-05-23 02:04:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:04:42] [INFO ] Removed a total of 393 redundant transitions.
[2024-05-23 02:04:42] [INFO ] Flatten gal took : 26 ms
[2024-05-23 02:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 8 ms.
[2024-05-23 02:04:42] [INFO ] Time to serialize gal into /tmp/LTL1621672575065511735.gal : 5 ms
[2024-05-23 02:04:42] [INFO ] Time to serialize properties into /tmp/LTL11967088619763946090.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1621672575065511735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11967088619763946090.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((i3.u71.p421<1)&&((i7.i0.i0.u154.p800<1)||(i7.i0.i2.u162.p832<1)))"))))
Formula 0 simplified : XF!"((i3.u71.p421<1)&&((i7.i0.i0.u154.p800<1)||(i7.i0.i2.u162.p832<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14733562474004622904
[2024-05-23 02:04:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14733562474004622904
Running compilation step : cd /tmp/ltsmin14733562474004622904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 835 ms.
Running link step : cd /tmp/ltsmin14733562474004622904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14733562474004622904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-13 finished in 267326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 479 place count 816 transition count 715
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 66 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2024-05-23 02:05:12] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:05:13] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2024-05-23 02:05:13] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:05:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:05:28] [INFO ] Implicit Places using invariants and state equation in 15671 ms returned []
Implicit Place search using SMT with State Equation took 15946 ms to find 0 implicit places.
[2024-05-23 02:05:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2024-05-23 02:05:28] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:05:29] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16257 ms. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s217 1) (GEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-14 finished in 16309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 02:05:29] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-23 02:05:29] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 02:05:29] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 02:05:45] [INFO ] Implicit Places using invariants and state equation in 16388 ms returned []
Implicit Place search using SMT with State Equation took 16745 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-23 02:05:46] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-23 02:05:46] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17264 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s840 1) (GEQ s885 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-15 finished in 17360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Found a Lengthening insensitive property : DoubleExponent-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 479 place count 816 transition count 717
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 72 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 02:05:46] [INFO ] Computed 99 invariants in 53 ms
[2024-05-23 02:05:47] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 02:05:47] [INFO ] Invariant cache hit.
[2024-05-23 02:05:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:06:00] [INFO ] Implicit Places using invariants and state equation in 13757 ms returned []
Implicit Place search using SMT with State Equation took 14061 ms to find 0 implicit places.
[2024-05-23 02:06:00] [INFO ] Invariant cache hit.
[2024-05-23 02:06:01] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14365 ms. Remains : 556/1057 places, 533/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s482 1) (LT s308 1)), p0:(GEQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13838 reset in 113 ms.
Product exploration explored 100000 steps with 13957 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 83 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1366 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 802 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 257287 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257287 steps, saw 128682 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 02:06:04] [INFO ] Invariant cache hit.
[2024-05-23 02:06:04] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 02:06:04] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 37 ms returned sat
[2024-05-23 02:06:05] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-23 02:06:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:06:05] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 33 ms returned sat
[2024-05-23 02:06:05] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-23 02:06:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:06:06] [INFO ] After 366ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-23 02:06:06] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 0 ms to minimize.
[2024-05-23 02:06:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-05-23 02:06:06] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-23 02:06:06] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 454 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 555 transition count 453
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 476 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 238 place count 476 transition count 453
Applied a total of 238 rules in 29 ms. Remains 476 /556 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 476/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 298694 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298694 steps, saw 149449 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 476 cols
[2024-05-23 02:06:10] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-23 02:06:10] [INFO ] After 676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 02:06:10] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:06:11] [INFO ] After 374ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:06:11] [INFO ] After 1133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:06:11] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 02:06:12] [INFO ] After 375ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-23 02:06:12] [INFO ] After 463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-23 02:06:12] [INFO ] After 1055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 308 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2024-05-23 02:06:12] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 02:06:12] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2024-05-23 02:06:13] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 02:06:13] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:06:26] [INFO ] Implicit Places using invariants and state equation in 13917 ms returned [99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 231, 260, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 414, 420, 442, 447, 451, 468, 474]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 14376 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 444/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 444 transition count 439
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 28 place count 430 transition count 439
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 430 transition count 439
Applied a total of 31 rules in 25 ms. Remains 430 /444 variables (removed 14) and now considering 439/453 (removed 14) transitions.
// Phase 1: matrix 439 rows 430 cols
[2024-05-23 02:06:27] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-23 02:06:27] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 439 rows 430 cols
[2024-05-23 02:06:27] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:06:27] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:06:48] [INFO ] Implicit Places using invariants and state equation in 21615 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 21933 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 429/476 places, 439/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 439
Applied a total of 1 rules in 14 ms. Remains 429 /429 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 429 cols
[2024-05-23 02:06:48] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 02:06:49] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2024-05-23 02:06:49] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:06:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:07:09] [INFO ] Implicit Places using invariants and state equation in 20397 ms returned []
Implicit Place search using SMT with State Equation took 20686 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 429/476 places, 439/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57044 ms. Remains : 429/476 places, 439/453 transitions.
Incomplete random walk after 10000 steps, including 1457 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 319904 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319904 steps, saw 160019 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 439 rows 429 cols
[2024-05-23 02:07:12] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 02:07:13] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 02:07:13] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 02:07:13] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:07:14] [INFO ] After 558ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-23 02:07:14] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-23 02:07:14] [INFO ] After 1185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 279 ms.
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 439/439 transitions.
Applied a total of 0 rules in 8 ms. Remains 429 /429 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 429/429 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 439/439 transitions.
Applied a total of 0 rules in 7 ms. Remains 429 /429 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 429 cols
[2024-05-23 02:07:14] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:07:15] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2024-05-23 02:07:15] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 02:07:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:07:26] [INFO ] Implicit Places using invariants and state equation in 11303 ms returned []
Implicit Place search using SMT with State Equation took 11589 ms to find 0 implicit places.
[2024-05-23 02:07:26] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2024-05-23 02:07:26] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 02:07:26] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11812 ms. Remains : 429/429 places, 439/439 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 428 transition count 438
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 2 place count 428 transition count 401
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 76 place count 391 transition count 401
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 90 place count 377 transition count 387
Iterating global reduction 2 with 14 rules applied. Total rules applied 104 place count 377 transition count 387
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 2 with 2 rules applied. Total rules applied 106 place count 376 transition count 386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 376 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 374 transition count 384
Applied a total of 110 rules in 28 ms. Remains 374 /429 variables (removed 55) and now considering 384/439 (removed 55) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 384 rows 374 cols
[2024-05-23 02:07:26] [INFO ] Computed 66 invariants in 43 ms
[2024-05-23 02:07:26] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 02:07:26] [INFO ] [Real]Absence check using 2 positive and 64 generalized place invariants in 22 ms returned sat
[2024-05-23 02:07:27] [INFO ] After 235ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 02:07:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 02:07:27] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2
[2024-05-23 02:07:27] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-23 02:07:27] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p1)]
Support contains 2 out of 556 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 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 15 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 02:07:27] [INFO ] Computed 99 invariants in 55 ms
[2024-05-23 02:07:27] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 02:07:27] [INFO ] Invariant cache hit.
[2024-05-23 02:07:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:07:45] [INFO ] Implicit Places using invariants and state equation in 17593 ms returned []
Implicit Place search using SMT with State Equation took 17902 ms to find 0 implicit places.
[2024-05-23 02:07:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 02:07:45] [INFO ] Invariant cache hit.
[2024-05-23 02:07:45] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18157 ms. Remains : 556/556 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1371 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 803 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 388917 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388917 steps, saw 194507 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 02:07:48] [INFO ] Invariant cache hit.
[2024-05-23 02:07:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:07:48] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2024-05-23 02:07:49] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:07:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:07:49] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 32 ms returned sat
[2024-05-23 02:07:49] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:07:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:07:50] [INFO ] After 199ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:07:50] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-23 02:07:50] [INFO ] After 912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 93 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 555 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 553 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 475 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 240 place count 475 transition count 453
Applied a total of 240 rules in 38 ms. Remains 475 /556 variables (removed 81) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 475/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426696 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426696 steps, saw 213479 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2024-05-23 02:07:53] [INFO ] Computed 99 invariants in 37 ms
[2024-05-23 02:07:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:07:53] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 27 ms returned sat
[2024-05-23 02:07:53] [INFO ] After 228ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:07:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:07:54] [INFO ] After 364ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:07:54] [INFO ] After 687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:07:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 02:07:54] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2024-05-23 02:07:54] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:07:54] [INFO ] After 236ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:07:54] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 02:07:54] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 76 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-23 02:07:54] [INFO ] Invariant cache hit.
[2024-05-23 02:07:56] [INFO ] Implicit Places using invariants in 1337 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1338 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 23 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 02:07:56] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 02:07:56] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 02:07:56] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 02:07:56] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:08:13] [INFO ] Implicit Places using invariants and state equation in 16980 ms returned []
Implicit Place search using SMT with State Equation took 17255 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18626 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 439519 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439519 steps, saw 219810 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 02:08:16] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:08:16] [INFO ] After 328ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:08:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:08:17] [INFO ] After 257ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:08:17] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:08:17] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:08:18] [INFO ] After 540ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:08:18] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-23 02:08:18] [INFO ] After 1005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 02:08:18] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 02:08:18] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 02:08:18] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:08:18] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:08:34] [INFO ] Implicit Places using invariants and state equation in 15596 ms returned []
Implicit Place search using SMT with State Equation took 15855 ms to find 0 implicit places.
[2024-05-23 02:08:34] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2024-05-23 02:08:34] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-23 02:08:34] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16080 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
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 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 24 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2024-05-23 02:08:34] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-23 02:08:34] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:08:35] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:08:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 02:08:35] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:08:35] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2024-05-23 02:08:35] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-23 02:08:35] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2024-05-23 02:08:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 285 ms
[2024-05-23 02:08:35] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-23 02:08:35] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 13789 reset in 115 ms.
Product exploration explored 100000 steps with 13923 reset in 116 ms.
Built C files in :
/tmp/ltsmin4345048770259111950
[2024-05-23 02:08:35] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2024-05-23 02:08:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:08:35] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2024-05-23 02:08:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:08:35] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2024-05-23 02:08:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:08:35] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4345048770259111950
Running compilation step : cd /tmp/ltsmin4345048770259111950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1198 ms.
Running link step : cd /tmp/ltsmin4345048770259111950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4345048770259111950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12032214538526800568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 556 transition count 531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 553 transition count 531
Applied a total of 6 rules in 27 ms. Remains 553 /556 variables (removed 3) and now considering 531/533 (removed 2) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-23 02:08:51] [INFO ] Computed 99 invariants in 48 ms
[2024-05-23 02:08:51] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 02:08:51] [INFO ] Invariant cache hit.
[2024-05-23 02:08:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:09:08] [INFO ] Implicit Places using invariants and state equation in 16997 ms returned []
Implicit Place search using SMT with State Equation took 17302 ms to find 0 implicit places.
[2024-05-23 02:09:08] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-23 02:09:08] [INFO ] Invariant cache hit.
[2024-05-23 02:09:08] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 553/556 places, 531/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17598 ms. Remains : 553/556 places, 531/533 transitions.
Built C files in :
/tmp/ltsmin9361498211926725207
[2024-05-23 02:09:08] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2024-05-23 02:09:08] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:09:08] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2024-05-23 02:09:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:09:08] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2024-05-23 02:09:08] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:09:08] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9361498211926725207
Running compilation step : cd /tmp/ltsmin9361498211926725207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1155 ms.
Running link step : cd /tmp/ltsmin9361498211926725207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9361498211926725207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13375859981062976756.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 02:09:23] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:09:23] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:09:23] [INFO ] Time to serialize gal into /tmp/LTL12972336666954628972.gal : 3 ms
[2024-05-23 02:09:23] [INFO ] Time to serialize properties into /tmp/LTL14362827024684560678.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12972336666954628972.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16432323265954217388.hoa' '-atoms' '/tmp/LTL14362827024684560678.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14362827024684560678.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16432323265954217388.hoa
Detected timeout of ITS tools.
[2024-05-23 02:09:38] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:09:38] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:09:38] [INFO ] Time to serialize gal into /tmp/LTL6081289561361828932.gal : 3 ms
[2024-05-23 02:09:38] [INFO ] Time to serialize properties into /tmp/LTL9795380335910148561.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6081289561361828932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9795380335910148561.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p509>=1)")U("((p877>=1)||(p579<1))")))))
Formula 0 simplified : XF(!"(p509>=1)" R !"((p877>=1)||(p579<1))")
Detected timeout of ITS tools.
[2024-05-23 02:09:53] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:09:53] [INFO ] Applying decomposition
[2024-05-23 02:09:53] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph588520609220192120.txt' '-o' '/tmp/graph588520609220192120.bin' '-w' '/tmp/graph588520609220192120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph588520609220192120.bin' '-l' '-1' '-v' '-w' '/tmp/graph588520609220192120.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:09:53] [INFO ] Decomposing Gal with order
[2024-05-23 02:09:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:09:53] [INFO ] Removed a total of 403 redundant transitions.
[2024-05-23 02:09:53] [INFO ] Flatten gal took : 27 ms
[2024-05-23 02:09:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8 ms.
[2024-05-23 02:09:54] [INFO ] Time to serialize gal into /tmp/LTL2997069593029444383.gal : 6 ms
[2024-05-23 02:09:54] [INFO ] Time to serialize properties into /tmp/LTL3613833386561986827.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2997069593029444383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3613833386561986827.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i5.i0.u91.p509>=1)")U("((i8.u176.p877>=1)||(i5.i0.u106.p579<1))")))))
Formula 0 simplified : XF(!"(i5.i0.u91.p509>=1)" R !"((i8.u176.p877>=1)||(i5.i0.u106.p579<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8326238673681483454
[2024-05-23 02:10:09] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8326238673681483454
Running compilation step : cd /tmp/ltsmin8326238673681483454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 832 ms.
Running link step : cd /tmp/ltsmin8326238673681483454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8326238673681483454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 277672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(((F(p0) U p1)||!p0) U X(p2))))'
Found a Shortening insensitive property : DoubleExponent-PT-020-LTLFireability-08
Stuttering acceptance computed with spot in 325 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 479 place count 816 transition count 717
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 921 place count 595 transition count 535
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 995 place count 558 transition count 535
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 996 place count 558 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 997 place count 557 transition count 534
Applied a total of 997 rules in 71 ms. Remains 557 /1057 variables (removed 500) and now considering 534/997 (removed 463) transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:10:24] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:10:25] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:10:25] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:10:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:10:40] [INFO ] Implicit Places using invariants and state equation in 15303 ms returned []
Implicit Place search using SMT with State Equation took 15552 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:10:40] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:10:40] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 557/1057 places, 534/997 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15851 ms. Remains : 557/1057 places, 534/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s116 1) (GEQ s123 1)), p1:(GEQ s453 1), p2:(GEQ s352 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33980 reset in 303 ms.
Product exploration explored 100000 steps with 33993 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 300 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 164501 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164501 steps, saw 82286 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:10:45] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 02:10:45] [INFO ] After 539ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2024-05-23 02:10:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:10:46] [INFO ] After 663ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :2 sat :3 real:14
[2024-05-23 02:10:46] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2024-05-23 02:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-23 02:10:46] [INFO ] After 1069ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2024-05-23 02:10:46] [INFO ] After 1864ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2024-05-23 02:10:49] [INFO ] After 2062ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2024-05-23 02:10:54] [INFO ] After 5326ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :6 sat :13
[2024-05-23 02:10:54] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 0 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 0 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 0 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:10:55] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 0 ms to minimize.
[2024-05-23 02:10:56] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2024-05-23 02:10:56] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-05-23 02:10:57] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-23 02:10:57] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-05-23 02:10:57] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-23 02:10:57] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2024-05-23 02:10:57] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-05-23 02:10:58] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2024-05-23 02:10:58] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 0 ms to minimize.
[2024-05-23 02:10:58] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2024-05-23 02:10:58] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2024-05-23 02:10:58] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2024-05-23 02:10:58] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2024-05-23 02:10:58] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 3 ms to minimize.
[2024-05-23 02:10:59] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2024-05-23 02:10:59] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-05-23 02:10:59] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2024-05-23 02:10:59] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2024-05-23 02:10:59] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2024-05-23 02:10:59] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2024-05-23 02:10:59] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2024-05-23 02:11:00] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2024-05-23 02:11:00] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5193 ms
[2024-05-23 02:11:00] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-23 02:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-23 02:11:01] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 0 ms to minimize.
[2024-05-23 02:11:01] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-23 02:11:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2024-05-23 02:11:01] [INFO ] After 12534ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :13
Attempting to minimize the solution found.
Minimization took 941 ms.
[2024-05-23 02:11:02] [INFO ] After 15840ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :13
Fused 19 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 18000 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 27 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 177007 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 177007 steps, saw 88534 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 02:11:25] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:11:26] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-23 02:11:27] [INFO ] After 1143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-23 02:11:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:11:29] [INFO ] After 2176ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-23 02:11:30] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2024-05-23 02:11:30] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-05-23 02:11:30] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-05-23 02:11:30] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2024-05-23 02:11:30] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2024-05-23 02:11:30] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2024-05-23 02:11:31] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2024-05-23 02:11:31] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:11:31] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-23 02:11:31] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 0 ms to minimize.
[2024-05-23 02:11:31] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
[2024-05-23 02:11:31] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-05-23 02:11:31] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2024-05-23 02:11:32] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2024-05-23 02:11:32] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2024-05-23 02:11:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2027 ms
[2024-05-23 02:11:34] [INFO ] After 6866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 2064 ms.
[2024-05-23 02:11:36] [INFO ] After 10291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 13727 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 02:11:50] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:11:50] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 02:11:50] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:11:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:12:07] [INFO ] Implicit Places using invariants and state equation in 16865 ms returned [48, 68, 73, 122, 128, 149, 154, 155, 175, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 17231 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 444/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 444 transition count 439
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 32 place count 428 transition count 439
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 428 transition count 439
Applied a total of 34 rules in 26 ms. Remains 428 /444 variables (removed 16) and now considering 439/455 (removed 16) transitions.
// Phase 1: matrix 439 rows 428 cols
[2024-05-23 02:12:07] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:12:07] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 439 rows 428 cols
[2024-05-23 02:12:08] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:12:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:12:32] [INFO ] Implicit Places using invariants and state equation in 24368 ms returned []
Implicit Place search using SMT with State Equation took 24630 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 428/478 places, 439/455 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41895 ms. Remains : 428/478 places, 439/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 p2 (NOT p1)))), (G (NOT (AND p2 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 732 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 340 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 10 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:12:33] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:12:34] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:12:34] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:12:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:13:03] [INFO ] Implicit Places using invariants and state equation in 29619 ms returned []
Implicit Place search using SMT with State Equation took 29882 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:13:03] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:13:03] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30115 ms. Remains : 557/557 places, 534/534 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 720 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 1384 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 790 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 200459 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200459 steps, saw 100266 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:13:08] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 02:13:08] [INFO ] After 449ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-23 02:13:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:13:09] [INFO ] After 534ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 02:13:09] [INFO ] After 1099ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 02:13:11] [INFO ] After 1472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 02:13:15] [INFO ] After 4007ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-23 02:13:15] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 0 ms to minimize.
[2024-05-23 02:13:15] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 0 ms to minimize.
[2024-05-23 02:13:16] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 0 ms to minimize.
[2024-05-23 02:13:16] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-23 02:13:16] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2024-05-23 02:13:16] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2024-05-23 02:13:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 729 ms
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 0 ms to minimize.
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-23 02:13:17] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2024-05-23 02:13:18] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-23 02:13:19] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:13:19] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-23 02:13:19] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2179 ms
[2024-05-23 02:13:19] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 0 ms to minimize.
[2024-05-23 02:13:19] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 0 ms to minimize.
[2024-05-23 02:13:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2024-05-23 02:13:20] [INFO ] After 9256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 535 ms.
[2024-05-23 02:13:20] [INFO ] After 11407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10000 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 29 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1226 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 878 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 212251 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212251 steps, saw 106188 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 02:13:34] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:13:35] [INFO ] After 283ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-23 02:13:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:13:35] [INFO ] After 831ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 02:13:35] [INFO ] After 1232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 02:13:36] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 02:13:38] [INFO ] After 1431ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-23 02:13:38] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 0 ms to minimize.
[2024-05-23 02:13:38] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2024-05-23 02:13:38] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-23 02:13:38] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2024-05-23 02:13:38] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2024-05-23 02:13:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1603 ms
[2024-05-23 02:13:40] [INFO ] After 3597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-23 02:13:40] [INFO ] After 4872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 02:13:48] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:13:49] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-23 02:13:49] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:13:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:14:09] [INFO ] Implicit Places using invariants and state equation in 20572 ms returned [122, 233, 256, 262, 284, 289, 310, 315, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 453, 470, 476]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 20930 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 456 transition count 445
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 445
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 446 transition count 445
Applied a total of 22 rules in 22 ms. Remains 446 /456 variables (removed 10) and now considering 445/455 (removed 10) transitions.
// Phase 1: matrix 445 rows 446 cols
[2024-05-23 02:14:09] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:14:09] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2024-05-23 02:14:10] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:14:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:14:26] [INFO ] Implicit Places using invariants and state equation in 16912 ms returned [68, 153, 200, 206, 213, 227]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 17205 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 440/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 440 transition count 442
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 437 transition count 442
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 437 transition count 442
Applied a total of 7 rules in 22 ms. Remains 437 /440 variables (removed 3) and now considering 442/445 (removed 3) transitions.
// Phase 1: matrix 442 rows 437 cols
[2024-05-23 02:14:26] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:14:27] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 442 rows 437 cols
[2024-05-23 02:14:27] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 02:14:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:14:41] [INFO ] Implicit Places using invariants and state equation in 14541 ms returned [72, 147]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14805 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 435/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 434 transition count 441
Applied a total of 3 rules in 22 ms. Remains 434 /435 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 434 cols
[2024-05-23 02:14:41] [INFO ] Computed 69 invariants in 54 ms
[2024-05-23 02:14:42] [INFO ] Implicit Places using invariants in 479 ms returned [42, 48, 124, 149, 169, 174]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 479 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 428/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 428 transition count 437
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 424 transition count 437
Applied a total of 8 rules in 15 ms. Remains 424 /428 variables (removed 4) and now considering 437/441 (removed 4) transitions.
// Phase 1: matrix 437 rows 424 cols
[2024-05-23 02:14:42] [INFO ] Computed 63 invariants in 59 ms
[2024-05-23 02:14:42] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-23 02:14:42] [INFO ] Invariant cache hit.
[2024-05-23 02:14:42] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 02:14:50] [INFO ] Implicit Places using invariants and state equation in 8275 ms returned []
Implicit Place search using SMT with State Equation took 8657 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 62165 ms. Remains : 424/478 places, 437/455 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 727 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 289 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 366 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 34062 reset in 259 ms.
Product exploration explored 100000 steps with 33856 reset in 266 ms.
Built C files in :
/tmp/ltsmin2566208120308678066
[2024-05-23 02:14:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2566208120308678066
Running compilation step : cd /tmp/ltsmin2566208120308678066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 854 ms.
Running link step : cd /tmp/ltsmin2566208120308678066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2566208120308678066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13599552029804648217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 11 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:15:08] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:15:08] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:15:08] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:15:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:15:21] [INFO ] Implicit Places using invariants and state equation in 12553 ms returned []
Implicit Place search using SMT with State Equation took 12815 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2024-05-23 02:15:21] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:15:21] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13049 ms. Remains : 557/557 places, 534/534 transitions.
Built C files in :
/tmp/ltsmin4169787375092940740
[2024-05-23 02:15:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4169787375092940740
Running compilation step : cd /tmp/ltsmin4169787375092940740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 839 ms.
Running link step : cd /tmp/ltsmin4169787375092940740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4169787375092940740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased284204445568319599.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 02:15:36] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:15:36] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:15:36] [INFO ] Time to serialize gal into /tmp/LTL12401984298670802789.gal : 2 ms
[2024-05-23 02:15:36] [INFO ] Time to serialize properties into /tmp/LTL3872044887215543815.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12401984298670802789.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16454544200667845317.hoa' '-atoms' '/tmp/LTL3872044887215543815.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3872044887215543815.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16454544200667845317.hoa
Detected timeout of ITS tools.
[2024-05-23 02:15:51] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:15:51] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:15:51] [INFO ] Time to serialize gal into /tmp/LTL17518885127442869562.gal : 3 ms
[2024-05-23 02:15:51] [INFO ] Time to serialize properties into /tmp/LTL11002968969843736124.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17518885127442869562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11002968969843736124.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((p254>=1)&&(p266>=1))"))U("(p827>=1)"))||(!("((p254>=1)&&(p266>=1))")))U(X("(p648>=1)"))))))
Formula 0 simplified : G((!"((p254>=1)&&(p266>=1))" | (F"((p254>=1)&&(p266>=1))" U "(p827>=1)")) U X"(p648>=1)")
Detected timeout of ITS tools.
[2024-05-23 02:16:06] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:16:06] [INFO ] Applying decomposition
[2024-05-23 02:16:06] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14717890767535965285.txt' '-o' '/tmp/graph14717890767535965285.bin' '-w' '/tmp/graph14717890767535965285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14717890767535965285.bin' '-l' '-1' '-v' '-w' '/tmp/graph14717890767535965285.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:16:06] [INFO ] Decomposing Gal with order
[2024-05-23 02:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:16:06] [INFO ] Removed a total of 384 redundant transitions.
[2024-05-23 02:16:06] [INFO ] Flatten gal took : 26 ms
[2024-05-23 02:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 9 ms.
[2024-05-23 02:16:06] [INFO ] Time to serialize gal into /tmp/LTL16699728803100255817.gal : 5 ms
[2024-05-23 02:16:06] [INFO ] Time to serialize properties into /tmp/LTL12156285198191973043.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16699728803100255817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12156285198191973043.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((i3.u44.p254>=1)&&(i2.u45.p266>=1))"))U("(i7.u165.p827>=1)"))||(!("((i3.u44.p254>=1)&&(i2.u45.p266>=1))")))U(X("(i6.i1.i...177
Formula 0 simplified : G((!"((i3.u44.p254>=1)&&(i2.u45.p266>=1))" | (F"((i3.u44.p254>=1)&&(i2.u45.p266>=1))" U "(i7.u165.p827>=1)")) U X"(i6.i1.i0.u130.p64...162
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin529470666416888969
[2024-05-23 02:16:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin529470666416888969
Running compilation step : cd /tmp/ltsmin529470666416888969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1552 ms.
Running link step : cd /tmp/ltsmin529470666416888969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin529470666416888969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(((<>((LTLAPp0==true)) U (LTLAPp1==true))||!(LTLAPp0==true)) U X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 372694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F((!p1 U (p2||G(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : DoubleExponent-PT-020-LTLFireability-13
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 817 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 479 place count 816 transition count 715
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 998 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 999 place count 556 transition count 533
Applied a total of 999 rules in 75 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 02:16:37] [INFO ] Computed 99 invariants in 54 ms
[2024-05-23 02:16:37] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-23 02:16:37] [INFO ] Invariant cache hit.
[2024-05-23 02:16:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:16:58] [INFO ] Implicit Places using invariants and state equation in 21246 ms returned []
Implicit Place search using SMT with State Equation took 21589 ms to find 0 implicit places.
[2024-05-23 02:16:58] [INFO ] Invariant cache hit.
[2024-05-23 02:16:59] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 21906 ms. Remains : 556/1057 places, 533/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s212 1) (OR (LT s436 1) (LT s455 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13825 reset in 119 ms.
Product exploration explored 100000 steps with 14002 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1366 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 385772 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385772 steps, saw 192935 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 02:17:02] [INFO ] Invariant cache hit.
[2024-05-23 02:17:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:17:02] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 36 ms returned sat
[2024-05-23 02:17:02] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:17:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:17:02] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2024-05-23 02:17:03] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:17:04] [INFO ] After 878ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:04] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 0 ms to minimize.
[2024-05-23 02:17:04] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 0 ms to minimize.
[2024-05-23 02:17:04] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2024-05-23 02:17:04] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 0 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 0 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 0 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 0 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 0 ms to minimize.
[2024-05-23 02:17:05] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2024-05-23 02:17:06] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2024-05-23 02:17:06] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2024-05-23 02:17:06] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2024-05-23 02:17:06] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2024-05-23 02:17:06] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2024-05-23 02:17:07] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 0 ms to minimize.
[2024-05-23 02:17:07] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-23 02:17:07] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 0 ms to minimize.
[2024-05-23 02:17:07] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2024-05-23 02:17:07] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 0 ms to minimize.
[2024-05-23 02:17:07] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2024-05-23 02:17:08] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 0 ms to minimize.
[2024-05-23 02:17:08] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4024 ms
[2024-05-23 02:17:08] [INFO ] After 5038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-23 02:17:08] [INFO ] After 5977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1663 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 555 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 554 transition count 531
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 84 place count 554 transition count 451
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 164 place count 474 transition count 451
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 242 place count 474 transition count 451
Applied a total of 242 rules in 38 ms. Remains 474 /556 variables (removed 82) and now considering 451/533 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 474/556 places, 451/533 transitions.
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 424439 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 424439 steps, saw 212339 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 451 rows 474 cols
[2024-05-23 02:17:13] [INFO ] Computed 99 invariants in 67 ms
[2024-05-23 02:17:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:17:13] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 47 ms returned sat
[2024-05-23 02:17:14] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:17:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 02:17:14] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 45 ms returned sat
[2024-05-23 02:17:14] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:17:14] [INFO ] After 257ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:15] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2024-05-23 02:17:15] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-23 02:17:15] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-23 02:17:15] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2024-05-23 02:17:15] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:17:15] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 0 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 0 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 0 ms to minimize.
[2024-05-23 02:17:16] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 0 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 1 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2024-05-23 02:17:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2776 ms
[2024-05-23 02:17:17] [INFO ] After 3276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-23 02:17:18] [INFO ] After 3716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 474/474 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 19 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-23 02:17:20] [INFO ] Invariant cache hit.
[2024-05-23 02:17:21] [INFO ] Implicit Places using invariants in 1363 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 199, 205, 212, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1364 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/474 places, 451/451 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 436 transition count 432
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 417 transition count 432
Applied a total of 38 rules in 16 ms. Remains 417 /436 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:17:21] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-23 02:17:21] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:17:21] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:17:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:17:38] [INFO ] Implicit Places using invariants and state equation in 16468 ms returned []
Implicit Place search using SMT with State Equation took 16744 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/474 places, 432/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18143 ms. Remains : 417/474 places, 432/451 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 443093 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 443093 steps, saw 221593 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:17:41] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-23 02:17:41] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:17:42] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:17:42] [INFO ] After 294ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:42] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2024-05-23 02:17:42] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2024-05-23 02:17:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2024-05-23 02:17:42] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 02:17:42] [INFO ] After 1621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 417/417 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:17:42] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 02:17:43] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:17:43] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:17:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:17:56] [INFO ] Implicit Places using invariants and state equation in 13148 ms returned []
Implicit Place search using SMT with State Equation took 13419 ms to find 0 implicit places.
[2024-05-23 02:17:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:17:56] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-23 02:17:56] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13628 ms. Remains : 417/417 places, 432/432 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 417 transition count 395
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 380 transition count 395
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 92 place count 362 transition count 377
Iterating global reduction 0 with 18 rules applied. Total rules applied 110 place count 362 transition count 377
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 0 with 2 rules applied. Total rules applied 112 place count 361 transition count 376
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 361 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 114 place count 360 transition count 375
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 360 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 358 transition count 373
Applied a total of 118 rules in 31 ms. Remains 358 /417 variables (removed 59) and now considering 373/432 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 358 cols
[2024-05-23 02:17:56] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:17:56] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:17:57] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 02:17:57] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:17:57] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-23 02:17:57] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-05-23 02:17:57] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2024-05-23 02:17:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2024-05-23 02:17:57] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-23 02:17:57] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 15 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 02:17:57] [INFO ] Computed 99 invariants in 52 ms
[2024-05-23 02:17:57] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-23 02:17:58] [INFO ] Invariant cache hit.
[2024-05-23 02:17:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:18:09] [INFO ] Implicit Places using invariants and state equation in 11267 ms returned []
Implicit Place search using SMT with State Equation took 11602 ms to find 0 implicit places.
[2024-05-23 02:18:09] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-23 02:18:09] [INFO ] Invariant cache hit.
[2024-05-23 02:18:09] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11867 ms. Remains : 556/556 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 391543 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 391543 steps, saw 195825 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 02:18:12] [INFO ] Invariant cache hit.
[2024-05-23 02:18:12] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 02:18:12] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2024-05-23 02:18:12] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:18:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:18:12] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2024-05-23 02:18:13] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:18:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:18:14] [INFO ] After 949ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:18:14] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2024-05-23 02:18:14] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 0 ms to minimize.
[2024-05-23 02:18:14] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 0 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 0 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2024-05-23 02:18:15] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 0 ms to minimize.
[2024-05-23 02:18:16] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 0 ms to minimize.
[2024-05-23 02:18:16] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-23 02:18:16] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2024-05-23 02:18:16] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2024-05-23 02:18:16] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-23 02:18:16] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2024-05-23 02:18:17] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-23 02:18:17] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 0 ms to minimize.
[2024-05-23 02:18:17] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:18:17] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 0 ms to minimize.
[2024-05-23 02:18:17] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-23 02:18:18] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 0 ms to minimize.
[2024-05-23 02:18:18] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 0 ms to minimize.
[2024-05-23 02:18:18] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3968 ms
[2024-05-23 02:18:18] [INFO ] After 5047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-23 02:18:18] [INFO ] After 5958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1663 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 555 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 554 transition count 531
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 84 place count 554 transition count 451
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 164 place count 474 transition count 451
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 242 place count 474 transition count 451
Applied a total of 242 rules in 39 ms. Remains 474 /556 variables (removed 82) and now considering 451/533 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 474/556 places, 451/533 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427755 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427755 steps, saw 214004 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 451 rows 474 cols
[2024-05-23 02:18:23] [INFO ] Computed 99 invariants in 63 ms
[2024-05-23 02:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:18:24] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 48 ms returned sat
[2024-05-23 02:18:24] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:18:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 02:18:24] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 44 ms returned sat
[2024-05-23 02:18:24] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:18:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:18:25] [INFO ] After 268ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:18:25] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2024-05-23 02:18:25] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-23 02:18:25] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2024-05-23 02:18:25] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2024-05-23 02:18:25] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 0 ms to minimize.
[2024-05-23 02:18:25] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 0 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 0 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 0 ms to minimize.
[2024-05-23 02:18:26] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 0 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 0 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 0 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-23 02:18:27] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2633 ms
[2024-05-23 02:18:27] [INFO ] After 3165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-23 02:18:27] [INFO ] After 3587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 474/474 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 451/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 474 /474 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-23 02:18:30] [INFO ] Invariant cache hit.
[2024-05-23 02:18:31] [INFO ] Implicit Places using invariants in 1265 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 199, 205, 212, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1266 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/474 places, 451/451 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 436 transition count 432
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 417 transition count 432
Applied a total of 38 rules in 16 ms. Remains 417 /436 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:18:31] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-23 02:18:31] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:18:31] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:18:31] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:18:48] [INFO ] Implicit Places using invariants and state equation in 17428 ms returned []
Implicit Place search using SMT with State Equation took 17687 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/474 places, 432/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18977 ms. Remains : 417/474 places, 432/451 transitions.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 449009 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449009 steps, saw 224550 distinct states, run finished after 3002 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:18:52] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:18:52] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:18:53] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:18:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:18:53] [INFO ] After 277ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:18:53] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2024-05-23 02:18:53] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-23 02:18:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2024-05-23 02:18:53] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-23 02:18:53] [INFO ] After 1540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 417/417 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:18:53] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:18:53] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:18:53] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-23 02:18:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 02:19:13] [INFO ] Implicit Places using invariants and state equation in 19834 ms returned []
Implicit Place search using SMT with State Equation took 20101 ms to find 0 implicit places.
[2024-05-23 02:19:13] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 432 rows 417 cols
[2024-05-23 02:19:13] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-23 02:19:13] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20316 ms. Remains : 417/417 places, 432/432 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 417 transition count 395
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 380 transition count 395
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 92 place count 362 transition count 377
Iterating global reduction 0 with 18 rules applied. Total rules applied 110 place count 362 transition count 377
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 0 with 2 rules applied. Total rules applied 112 place count 361 transition count 376
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 361 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 114 place count 360 transition count 375
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 360 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 358 transition count 373
Applied a total of 118 rules in 32 ms. Remains 358 /417 variables (removed 59) and now considering 373/432 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 358 cols
[2024-05-23 02:19:14] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:19:14] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:19:14] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 02:19:14] [INFO ] After 58ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:19:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-23 02:19:14] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2024-05-23 02:19:14] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:19:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2024-05-23 02:19:14] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-23 02:19:14] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13808 reset in 115 ms.
Product exploration explored 100000 steps with 13936 reset in 123 ms.
Built C files in :
/tmp/ltsmin6667353937454296663
[2024-05-23 02:19:15] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2024-05-23 02:19:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:19:15] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2024-05-23 02:19:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:19:15] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2024-05-23 02:19:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:19:15] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6667353937454296663
Running compilation step : cd /tmp/ltsmin6667353937454296663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1218 ms.
Running link step : cd /tmp/ltsmin6667353937454296663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6667353937454296663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15548705339619993297.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 17 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2024-05-23 02:19:30] [INFO ] Computed 99 invariants in 57 ms
[2024-05-23 02:19:30] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-23 02:19:30] [INFO ] Invariant cache hit.
[2024-05-23 02:19:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 02:19:53] [INFO ] Implicit Places using invariants and state equation in 22625 ms returned []
Implicit Place search using SMT with State Equation took 22953 ms to find 0 implicit places.
[2024-05-23 02:19:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 02:19:53] [INFO ] Invariant cache hit.
[2024-05-23 02:19:53] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23208 ms. Remains : 556/556 places, 533/533 transitions.
Built C files in :
/tmp/ltsmin3319929054279887894
[2024-05-23 02:19:53] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2024-05-23 02:19:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:19:53] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2024-05-23 02:19:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:19:53] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2024-05-23 02:19:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:19:53] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3319929054279887894
Running compilation step : cd /tmp/ltsmin3319929054279887894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1246 ms.
Running link step : cd /tmp/ltsmin3319929054279887894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3319929054279887894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10807404481868639598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 02:20:08] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:20:08] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:20:08] [INFO ] Time to serialize gal into /tmp/LTL10874242247150651808.gal : 2 ms
[2024-05-23 02:20:08] [INFO ] Time to serialize properties into /tmp/LTL17575418129513666992.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10874242247150651808.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16365165036960152074.hoa' '-atoms' '/tmp/LTL17575418129513666992.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17575418129513666992.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16365165036960152074.hoa
Detected timeout of ITS tools.
[2024-05-23 02:20:23] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:20:23] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:20:23] [INFO ] Time to serialize gal into /tmp/LTL8753285922283108748.gal : 4 ms
[2024-05-23 02:20:23] [INFO ] Time to serialize properties into /tmp/LTL14860972406724820042.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8753285922283108748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14860972406724820042.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((p421<1)&&((p800<1)||(p832<1)))"))))
Formula 0 simplified : XF!"((p421<1)&&((p800<1)||(p832<1)))"
Detected timeout of ITS tools.
[2024-05-23 02:20:38] [INFO ] Flatten gal took : 22 ms
[2024-05-23 02:20:38] [INFO ] Applying decomposition
[2024-05-23 02:20:38] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4336242953865765656.txt' '-o' '/tmp/graph4336242953865765656.bin' '-w' '/tmp/graph4336242953865765656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4336242953865765656.bin' '-l' '-1' '-v' '-w' '/tmp/graph4336242953865765656.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:20:38] [INFO ] Decomposing Gal with order
[2024-05-23 02:20:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:20:39] [INFO ] Removed a total of 417 redundant transitions.
[2024-05-23 02:20:39] [INFO ] Flatten gal took : 25 ms
[2024-05-23 02:20:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2024-05-23 02:20:39] [INFO ] Time to serialize gal into /tmp/LTL3792469332967416127.gal : 7 ms
[2024-05-23 02:20:39] [INFO ] Time to serialize properties into /tmp/LTL1593218181371367302.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3792469332967416127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1593218181371367302.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("((i3.i1.u80.p421<1)&&((i7.i2.u169.p800<1)||(i7.i2.u175.p832<1)))"))))
Formula 0 simplified : XF!"((i3.i1.u80.p421<1)&&((i7.i2.u169.p800<1)||(i7.i2.u175.p832<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7721317411699796309
[2024-05-23 02:20:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7721317411699796309
Running compilation step : cd /tmp/ltsmin7721317411699796309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 852 ms.
Running link step : cd /tmp/ltsmin7721317411699796309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7721317411699796309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-13 finished in 272161 ms.
[2024-05-23 02:21:09] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin273806263075188011
[2024-05-23 02:21:09] [INFO ] Applying decomposition
[2024-05-23 02:21:09] [INFO ] Computing symmetric may disable matrix : 997 transitions.
[2024-05-23 02:21:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:21:09] [INFO ] Computing symmetric may enable matrix : 997 transitions.
[2024-05-23 02:21:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:21:09] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6616580098984602978.txt' '-o' '/tmp/graph6616580098984602978.bin' '-w' '/tmp/graph6616580098984602978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6616580098984602978.bin' '-l' '-1' '-v' '-w' '/tmp/graph6616580098984602978.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:21:09] [INFO ] Decomposing Gal with order
[2024-05-23 02:21:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:21:09] [INFO ] Removed a total of 278 redundant transitions.
[2024-05-23 02:21:09] [INFO ] Computing Do-Not-Accords matrix : 997 transitions.
[2024-05-23 02:21:09] [INFO ] Flatten gal took : 39 ms
[2024-05-23 02:21:09] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:21:09] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin273806263075188011
Running compilation step : cd /tmp/ltsmin273806263075188011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 02:21:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2024-05-23 02:21:09] [INFO ] Time to serialize gal into /tmp/LTLFireability15893829519816656910.gal : 7 ms
[2024-05-23 02:21:09] [INFO ] Time to serialize properties into /tmp/LTLFireability6016784337341184772.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15893829519816656910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6016784337341184772.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((X(G(("(i3.u227.p509>=1)")U("((i10.u398.p877>=1)||(i4.u216.p579<1))")))))
Formula 0 simplified : XF(!"(i3.u227.p509>=1)" R !"((i10.u398.p877>=1)||(i4.u216.p579<1))")
Compilation finished in 2739 ms.
Running link step : cd /tmp/ltsmin273806263075188011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin273806263075188011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12148464 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16009388 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DoubleExponent-PT-020, 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 r153-tall-171631151600353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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