Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399300338.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BugTracking-PT-q3m008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399300338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m008-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q3m008-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716331420609

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 22:43:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:43:43] [INFO ] Load time of PNML (sax parser for PT used): 1367 ms
[2024-05-21 22:43:43] [INFO ] Transformed 754 places.
[2024-05-21 22:43:43] [INFO ] Transformed 27370 transitions.
[2024-05-21 22:43:43] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1711 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Deduced a syphon composed of 514 places in 180 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Applied a total of 2 rules in 71 ms. Remains 238 /240 variables (removed 2) and now considering 2769/2769 (removed 0) transitions.
[2024-05-21 22:43:44] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 238 cols
[2024-05-21 22:43:44] [INFO ] Computed 8 invariants in 47 ms
[2024-05-21 22:43:45] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-21 22:43:45] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 22:43:45] [INFO ] Invariant cache hit.
[2024-05-21 22:43:45] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 22:43:47] [INFO ] Implicit Places using invariants and state equation in 2156 ms returned []
Implicit Place search using SMT with State Equation took 2775 ms to find 0 implicit places.
Running 2767 sub problems to find dead transitions.
[2024-05-21 22:43:47] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 22:43:47] [INFO ] Invariant cache hit.
[2024-05-21 22:43:47] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2767 unsolved
[2024-05-21 22:44:25] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 13 ms to minimize.
[2024-05-21 22:44:25] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2024-05-21 22:44:26] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2024-05-21 22:44:26] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-21 22:44:33] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
[2024-05-21 22:44:42] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2333 is UNSAT
[2024-05-21 22:44:43] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
[2024-05-21 22:44:43] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-05-21 22:44:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/2880 variables, and 17 constraints, problems are : Problem set: 64 solved, 2703 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2767/2767 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 64 solved, 2703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 64 solved, 2703 unsolved
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2764 is UNSAT
Problem TDEAD2767 is UNSAT
Problem TDEAD2768 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 9/17 constraints. Problems are: Problem set: 355 solved, 2412 unsolved
[2024-05-21 22:44:46] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-21 22:44:46] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/2880 variables, and 19 constraints, problems are : Problem set: 355 solved, 2412 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 0/2767 constraints, Known Traps: 11/11 constraints]
After SMT, in 87683ms problems are : Problem set: 355 solved, 2412 unsolved
Search for dead transitions found 355 dead transitions in 87750ms
Found 355 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 355 transitions
Dead transitions reduction (with SMT) removed 355 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 2414/2769 transitions.
Reduce places removed 24 places and 622 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 214 transition count 1792
Reduce places removed 16 places and 237 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 40 place count 198 transition count 1555
Reduce places removed 13 places and 249 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 53 place count 185 transition count 1306
Reduce places removed 7 places and 130 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 60 place count 178 transition count 1176
Reduce places removed 4 places and 19 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 64 place count 174 transition count 1157
Reduce places removed 3 places and 69 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 67 place count 171 transition count 1088
Reduce places removed 3 places and 49 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 70 place count 168 transition count 1039
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 81 place count 157 transition count 998
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 16 places and 227 transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 108 place count 141 transition count 771
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 115 place count 134 transition count 722
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 7 with 7 rules applied. Total rules applied 122 place count 134 transition count 722
Deduced a syphon composed of 8 places in 2 ms
Applied a total of 122 rules in 64 ms. Remains 134 /238 variables (removed 104) and now considering 722/2414 (removed 1692) transitions.
[2024-05-21 22:45:15] [INFO ] Flow matrix only has 663 transitions (discarded 59 similar events)
// Phase 1: matrix 663 rows 134 cols
[2024-05-21 22:45:15] [INFO ] Computed 16 invariants in 5 ms
[2024-05-21 22:45:15] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-21 22:45:15] [INFO ] Flow matrix only has 663 transitions (discarded 59 similar events)
[2024-05-21 22:45:15] [INFO ] Invariant cache hit.
[2024-05-21 22:45:15] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 22:45:16] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 134/240 places, 722/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91699 ms. Remains : 134/240 places, 722/2769 transitions.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Support contains 7 out of 126 places after structural reductions.
[2024-05-21 22:45:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 22:45:16] [INFO ] Flatten gal took : 221 ms
[2024-05-21 22:45:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q3m008-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:45:16] [INFO ] Flatten gal took : 119 ms
[2024-05-21 22:45:17] [INFO ] Input system was already deterministic with 722 transitions.
Support contains 3 out of 126 places (down from 7) after GAL structural reductions.
RANDOM walk for 40005 steps (227 resets) in 1949 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (50 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 450008 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 450008 steps, saw 266668 distinct states, run finished after 3009 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-21 22:45:20] [INFO ] Flow matrix only has 663 transitions (discarded 59 similar events)
// Phase 1: matrix 663 rows 126 cols
[2024-05-21 22:45:20] [INFO ] Computed 8 invariants in 7 ms
[2024-05-21 22:45:20] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/79 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 204/283 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 27/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 385/668 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/673 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 111/784 variables, 46/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/784 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/784 variables, 21/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/784 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/789 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/789 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/789 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 789/789 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/79 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 204/283 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 27/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 385/668 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/668 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/673 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/673 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 111/784 variables, 46/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/784 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/784 variables, 21/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/784 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/789 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/789 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/789 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 789/789 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 555ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 722/722 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 705
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 705
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 4 place count 124 transition count 706
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 124 transition count 700
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 118 transition count 700
Applied a total of 16 rules in 80 ms. Remains 118 /126 variables (removed 8) and now considering 700/722 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 118/126 places, 700/722 transitions.
RANDOM walk for 40015 steps (9 resets) in 489 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 686290 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 1
Probabilistic random walk after 686290 steps, saw 413548 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2024-05-21 22:45:24] [INFO ] Flow matrix only has 641 transitions (discarded 59 similar events)
// Phase 1: matrix 641 rows 118 cols
[2024-05-21 22:45:24] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 22:45:24] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/75 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 204/279 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 27/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 378/657 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/660 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/660 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 98/758 variables, 41/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/758 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/758 variables, 14/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/758 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/759 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/759 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/759 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 759/759 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/75 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 204/279 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 27/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 378/657 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:45:25] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/657 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/657 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/660 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/660 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/660 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 98/758 variables, 41/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/758 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/758 variables, 14/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:45:25] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/758 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/758 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/759 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/759 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/759 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 759/759 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 928ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 700/700 transitions.
Applied a total of 0 rules in 19 ms. Remains 118 /118 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 118/118 places, 700/700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 700/700 transitions.
Applied a total of 0 rules in 19 ms. Remains 118 /118 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-21 22:45:25] [INFO ] Flow matrix only has 641 transitions (discarded 59 similar events)
[2024-05-21 22:45:25] [INFO ] Invariant cache hit.
[2024-05-21 22:45:26] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 22:45:26] [INFO ] Flow matrix only has 641 transitions (discarded 59 similar events)
[2024-05-21 22:45:26] [INFO ] Invariant cache hit.
[2024-05-21 22:45:26] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 22:45:26] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2024-05-21 22:45:26] [INFO ] Redundant transitions in 56 ms returned []
Running 699 sub problems to find dead transitions.
[2024-05-21 22:45:26] [INFO ] Flow matrix only has 641 transitions (discarded 59 similar events)
[2024-05-21 22:45:26] [INFO ] Invariant cache hit.
[2024-05-21 22:45:26] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 699 unsolved
[2024-05-21 22:45:31] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:45:32] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
[2024-05-21 22:45:32] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/11 constraints. Problems are: Problem set: 10 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 689 unsolved
At refinement iteration 3 (OVERLAPS) 641/759 variables, 118/129 constraints. Problems are: Problem set: 10 solved, 689 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/759 variables, 91/220 constraints. Problems are: Problem set: 10 solved, 689 unsolved
[2024-05-21 22:45:41] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/759 variables, 1/221 constraints. Problems are: Problem set: 70 solved, 629 unsolved
[2024-05-21 22:45:47] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 1/222 constraints. Problems are: Problem set: 100 solved, 599 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 0/222 constraints. Problems are: Problem set: 100 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 759/759 variables, and 222 constraints, problems are : Problem set: 100 solved, 599 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 100 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 100 solved, 599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 5/12 constraints. Problems are: Problem set: 100 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 100 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 3/118 variables, 1/13 constraints. Problems are: Problem set: 100 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 100 solved, 599 unsolved
At refinement iteration 5 (OVERLAPS) 641/759 variables, 118/131 constraints. Problems are: Problem set: 100 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 91/222 constraints. Problems are: Problem set: 100 solved, 599 unsolved
Problem TDEAD245 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 599/821 constraints. Problems are: Problem set: 122 solved, 577 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/759 variables, 0/821 constraints. Problems are: Problem set: 122 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 759/759 variables, and 821 constraints, problems are : Problem set: 122 solved, 577 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 599/699 constraints, Known Traps: 5/5 constraints]
After SMT, in 63130ms problems are : Problem set: 122 solved, 577 unsolved
Search for dead transitions found 122 dead transitions in 63154ms
Found 122 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 122 transitions
Dead transitions reduction (with SMT) removed 122 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/118 places, 578/700 transitions.
Graph (complete) has 837 edges and 118 vertex of which 115 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 163 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 104 transition count 415
Reduce places removed 7 places and 73 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 19 place count 97 transition count 342
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 23 place count 93 transition count 313
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 91 transition count 297
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 90 transition count 288
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 32 place count 84 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 38 place count 84 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 38 rules in 26 ms. Remains 84 /118 variables (removed 34) and now considering 242/578 (removed 336) transitions.
[2024-05-21 22:46:29] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 84 cols
[2024-05-21 22:46:29] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 22:46:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 22:46:30] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 22:46:30] [INFO ] Invariant cache hit.
[2024-05-21 22:46:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 22:46:30] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/118 places, 242/700 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64511 ms. Remains : 84/118 places, 242/700 transitions.
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2024-05-21 22:46:30] [INFO ] Flatten gal took : 82 ms
[2024-05-21 22:46:30] [INFO ] Flatten gal took : 76 ms
[2024-05-21 22:46:30] [INFO ] Input system was already deterministic with 722 transitions.
Computed a total of 5 stabilizing places and 43 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 722/722 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 698
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 698
Applied a total of 4 rules in 6 ms. Remains 124 /126 variables (removed 2) and now considering 698/722 (removed 24) transitions.
[2024-05-21 22:46:30] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
// Phase 1: matrix 639 rows 124 cols
[2024-05-21 22:46:30] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 22:46:30] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-21 22:46:31] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:46:31] [INFO ] Invariant cache hit.
[2024-05-21 22:46:31] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 22:46:31] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-05-21 22:46:31] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:46:31] [INFO ] Invariant cache hit.
[2024-05-21 22:46:31] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-05-21 22:46:37] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:46:37] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
[2024-05-21 22:46:37] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 26 ms to minimize.
Problem TDEAD691 is UNSAT
[2024-05-21 22:46:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
Problem TDEAD692 is UNSAT
[2024-05-21 22:46:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD693 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 5/13 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:46:39] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 639/762 variables, 123/137 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 89/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 7 (OVERLAPS) 1/763 variables, 1/227 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:47:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
[2024-05-21 22:47:02] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 2/229 constraints. Problems are: Problem set: 43 solved, 653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 229 constraints, problems are : Problem set: 43 solved, 653 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 43 solved, 653 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 43 solved, 653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 43 solved, 653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 43 solved, 653 unsolved
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 3 (OVERLAPS) 639/762 variables, 123/139 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 89/228 constraints. Problems are: Problem set: 88 solved, 608 unsolved
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 511/739 constraints. Problems are: Problem set: 102 solved, 594 unsolved
[2024-05-21 22:47:20] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD605 is UNSAT
[2024-05-21 22:47:20] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
Problem TDEAD618 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 2/741 constraints. Problems are: Problem set: 117 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/763 variables, and 741 constraints, problems are : Problem set: 117 solved, 579 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 511/696 constraints, Known Traps: 10/10 constraints]
After SMT, in 62141ms problems are : Problem set: 117 solved, 579 unsolved
Search for dead transitions found 117 dead transitions in 62152ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 581/722 transitions.
Reduce places removed 13 places and 154 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 111 transition count 427
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 105 transition count 372
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 103 transition count 354
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 101 transition count 338
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 100 transition count 329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 95 transition count 287
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 95 transition count 287
Applied a total of 34 rules in 14 ms. Remains 95 /124 variables (removed 29) and now considering 287/581 (removed 294) transitions.
[2024-05-21 22:47:33] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
// Phase 1: matrix 270 rows 95 cols
[2024-05-21 22:47:33] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 22:47:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 22:47:33] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
[2024-05-21 22:47:33] [INFO ] Invariant cache hit.
[2024-05-21 22:47:33] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 22:47:33] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/126 places, 287/722 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63128 ms. Remains : 95/126 places, 287/722 transitions.
[2024-05-21 22:47:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:47:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:47:33] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-21 22:47:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:47:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:47:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9479835547838762211.gal : 9 ms
[2024-05-21 22:47:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9905938046675114767.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9479835547838762211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9905938046675114767.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 22:48:04] [INFO ] Flatten gal took : 28 ms
[2024-05-21 22:48:04] [INFO ] Applying decomposition
[2024-05-21 22:48:04] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3366900787152927857.txt' '-o' '/tmp/graph3366900787152927857.bin' '-w' '/tmp/graph3366900787152927857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3366900787152927857.bin' '-l' '-1' '-v' '-w' '/tmp/graph3366900787152927857.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:48:04] [INFO ] Decomposing Gal with order
[2024-05-21 22:48:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:48:04] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-21 22:48:04] [INFO ] Flatten gal took : 60 ms
[2024-05-21 22:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2024-05-21 22:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1528434949184519735.gal : 6 ms
[2024-05-21 22:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14264795157126945971.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1528434949184519735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14264795157126945971.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 722/722 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 698
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 698
Applied a total of 4 rules in 10 ms. Remains 124 /126 variables (removed 2) and now considering 698/722 (removed 24) transitions.
[2024-05-21 22:48:34] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
// Phase 1: matrix 639 rows 124 cols
[2024-05-21 22:48:34] [INFO ] Computed 8 invariants in 7 ms
[2024-05-21 22:48:34] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 22:48:34] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:48:34] [INFO ] Invariant cache hit.
[2024-05-21 22:48:34] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 22:48:35] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-05-21 22:48:35] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:48:35] [INFO ] Invariant cache hit.
[2024-05-21 22:48:35] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-05-21 22:48:40] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:48:40] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
[2024-05-21 22:48:40] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD691 is UNSAT
[2024-05-21 22:48:40] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD692 is UNSAT
[2024-05-21 22:48:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD693 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 5/13 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:48:42] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 639/762 variables, 123/137 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 89/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 7 (OVERLAPS) 1/763 variables, 1/227 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:49:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
[2024-05-21 22:49:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 2/229 constraints. Problems are: Problem set: 88 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 229 constraints, problems are : Problem set: 88 solved, 608 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 88 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 3 (OVERLAPS) 639/762 variables, 123/139 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 89/228 constraints. Problems are: Problem set: 88 solved, 608 unsolved
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 511/739 constraints. Problems are: Problem set: 102 solved, 594 unsolved
[2024-05-21 22:49:30] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD605 is UNSAT
[2024-05-21 22:49:31] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
Problem TDEAD618 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 2/741 constraints. Problems are: Problem set: 117 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/763 variables, and 741 constraints, problems are : Problem set: 117 solved, 579 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 511/696 constraints, Known Traps: 10/10 constraints]
After SMT, in 62038ms problems are : Problem set: 117 solved, 579 unsolved
Search for dead transitions found 117 dead transitions in 62051ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 581/722 transitions.
Reduce places removed 13 places and 154 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 111 transition count 427
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 105 transition count 372
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 103 transition count 354
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 101 transition count 338
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 100 transition count 329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 95 transition count 287
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 95 transition count 287
Applied a total of 34 rules in 15 ms. Remains 95 /124 variables (removed 29) and now considering 287/581 (removed 294) transitions.
[2024-05-21 22:49:37] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
// Phase 1: matrix 270 rows 95 cols
[2024-05-21 22:49:37] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 22:49:37] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 22:49:37] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
[2024-05-21 22:49:37] [INFO ] Invariant cache hit.
[2024-05-21 22:49:37] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 22:49:37] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/126 places, 287/722 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63025 ms. Remains : 95/126 places, 287/722 transitions.
[2024-05-21 22:49:37] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:49:37] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:49:37] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-21 22:49:37] [INFO ] Flatten gal took : 17 ms
[2024-05-21 22:49:37] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:49:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13865406129213999411.gal : 3 ms
[2024-05-21 22:49:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9894836950943066315.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13865406129213999411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9894836950943066315.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 22:50:07] [INFO ] Flatten gal took : 25 ms
[2024-05-21 22:50:07] [INFO ] Applying decomposition
[2024-05-21 22:50:07] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17174925199269338430.txt' '-o' '/tmp/graph17174925199269338430.bin' '-w' '/tmp/graph17174925199269338430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17174925199269338430.bin' '-l' '-1' '-v' '-w' '/tmp/graph17174925199269338430.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:50:07] [INFO ] Decomposing Gal with order
[2024-05-21 22:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:50:07] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-21 22:50:07] [INFO ] Flatten gal took : 47 ms
[2024-05-21 22:50:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2024-05-21 22:50:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17285651296056844949.gal : 4 ms
[2024-05-21 22:50:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2781350815765473430.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17285651296056844949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2781350815765473430.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 722/722 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 698
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 698
Applied a total of 4 rules in 15 ms. Remains 124 /126 variables (removed 2) and now considering 698/722 (removed 24) transitions.
[2024-05-21 22:50:37] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
// Phase 1: matrix 639 rows 124 cols
[2024-05-21 22:50:37] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 22:50:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 22:50:38] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:50:38] [INFO ] Invariant cache hit.
[2024-05-21 22:50:38] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 22:50:38] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-05-21 22:50:38] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:50:38] [INFO ] Invariant cache hit.
[2024-05-21 22:50:38] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-05-21 22:50:43] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-21 22:50:43] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
[2024-05-21 22:50:43] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD691 is UNSAT
[2024-05-21 22:50:44] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD692 is UNSAT
[2024-05-21 22:50:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 5 ms to minimize.
Problem TDEAD693 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 5/13 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:50:45] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 639/762 variables, 123/137 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 89/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 7 (OVERLAPS) 1/763 variables, 1/227 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:51:06] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
[2024-05-21 22:51:06] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 2/229 constraints. Problems are: Problem set: 88 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 229 constraints, problems are : Problem set: 88 solved, 608 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 88 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 3 (OVERLAPS) 639/762 variables, 123/139 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 89/228 constraints. Problems are: Problem set: 88 solved, 608 unsolved
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 511/739 constraints. Problems are: Problem set: 102 solved, 594 unsolved
[2024-05-21 22:51:31] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD605 is UNSAT
[2024-05-21 22:51:31] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
Problem TDEAD618 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 2/741 constraints. Problems are: Problem set: 117 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/763 variables, and 741 constraints, problems are : Problem set: 117 solved, 579 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 511/696 constraints, Known Traps: 10/10 constraints]
After SMT, in 62001ms problems are : Problem set: 117 solved, 579 unsolved
Search for dead transitions found 117 dead transitions in 62010ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 581/722 transitions.
Reduce places removed 13 places and 154 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 111 transition count 427
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 105 transition count 372
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 103 transition count 354
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 101 transition count 338
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 100 transition count 329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 95 transition count 287
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 95 transition count 287
Applied a total of 34 rules in 6 ms. Remains 95 /124 variables (removed 29) and now considering 287/581 (removed 294) transitions.
[2024-05-21 22:51:40] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
// Phase 1: matrix 270 rows 95 cols
[2024-05-21 22:51:40] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 22:51:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 22:51:40] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
[2024-05-21 22:51:40] [INFO ] Invariant cache hit.
[2024-05-21 22:51:40] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 22:51:40] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/126 places, 287/722 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62862 ms. Remains : 95/126 places, 287/722 transitions.
[2024-05-21 22:51:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:51:40] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:51:40] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-21 22:51:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:51:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:51:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1943807017288733619.gal : 3 ms
[2024-05-21 22:51:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6479193602033899643.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1943807017288733619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6479193602033899643.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 22:52:10] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:52:10] [INFO ] Applying decomposition
[2024-05-21 22:52:10] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph12235113636521631560.txt' '-o' '/tmp/graph12235113636521631560.bin' '-w' '/tmp/graph12235113636521631560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12235113636521631560.bin' '-l' '-1' '-v' '-w' '/tmp/graph12235113636521631560.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:52:11] [INFO ] Decomposing Gal with order
[2024-05-21 22:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:52:11] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-21 22:52:11] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 1 ms.
[2024-05-21 22:52:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10734459706233759694.gal : 4 ms
[2024-05-21 22:52:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3252503015438436355.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10734459706233759694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3252503015438436355.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 722/722 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 698
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 698
Applied a total of 4 rules in 14 ms. Remains 124 /126 variables (removed 2) and now considering 698/722 (removed 24) transitions.
[2024-05-21 22:52:41] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
// Phase 1: matrix 639 rows 124 cols
[2024-05-21 22:52:41] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 22:52:41] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 22:52:41] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:52:41] [INFO ] Invariant cache hit.
[2024-05-21 22:52:41] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 22:52:41] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-05-21 22:52:41] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:52:41] [INFO ] Invariant cache hit.
[2024-05-21 22:52:41] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-05-21 22:52:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:52:46] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
[2024-05-21 22:52:47] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD691 is UNSAT
[2024-05-21 22:52:47] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD692 is UNSAT
[2024-05-21 22:52:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD693 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 5/13 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:52:48] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 639/762 variables, 123/137 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 89/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 7 (OVERLAPS) 1/763 variables, 1/227 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:53:07] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
[2024-05-21 22:53:07] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 2/229 constraints. Problems are: Problem set: 88 solved, 608 unsolved
[2024-05-21 22:53:12] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
[2024-05-21 22:53:12] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
Problem TDEAD547 is UNSAT
[2024-05-21 22:53:12] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
Problem TDEAD555 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 3/232 constraints. Problems are: Problem set: 112 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 232 constraints, problems are : Problem set: 112 solved, 584 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 112 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 112 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 9/16 constraints. Problems are: Problem set: 112 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 112 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 3/123 variables, 1/17 constraints. Problems are: Problem set: 112 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/19 constraints. Problems are: Problem set: 112 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/19 constraints. Problems are: Problem set: 112 solved, 584 unsolved
At refinement iteration 6 (OVERLAPS) 639/762 variables, 123/142 constraints. Problems are: Problem set: 112 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 89/231 constraints. Problems are: Problem set: 112 solved, 584 unsolved
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/762 variables, 487/718 constraints. Problems are: Problem set: 117 solved, 579 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 0/718 constraints. Problems are: Problem set: 117 solved, 579 unsolved
At refinement iteration 10 (OVERLAPS) 1/763 variables, 1/719 constraints. Problems are: Problem set: 117 solved, 579 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/763 variables, 97/816 constraints. Problems are: Problem set: 117 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 816 constraints, problems are : Problem set: 117 solved, 579 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 584/696 constraints, Known Traps: 11/11 constraints]
After SMT, in 62176ms problems are : Problem set: 117 solved, 579 unsolved
Search for dead transitions found 117 dead transitions in 62188ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 581/722 transitions.
Reduce places removed 13 places and 154 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 111 transition count 427
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 105 transition count 372
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 103 transition count 354
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 101 transition count 338
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 100 transition count 329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 95 transition count 287
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 95 transition count 287
Applied a total of 34 rules in 20 ms. Remains 95 /124 variables (removed 29) and now considering 287/581 (removed 294) transitions.
[2024-05-21 22:53:43] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
// Phase 1: matrix 270 rows 95 cols
[2024-05-21 22:53:43] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 22:53:44] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 22:53:44] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
[2024-05-21 22:53:44] [INFO ] Invariant cache hit.
[2024-05-21 22:53:44] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 22:53:44] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/126 places, 287/722 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63098 ms. Remains : 95/126 places, 287/722 transitions.
[2024-05-21 22:53:44] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:53:44] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:53:44] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-21 22:53:44] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:53:44] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:53:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11536834986668699039.gal : 2 ms
[2024-05-21 22:53:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6114346888674467788.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11536834986668699039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6114346888674467788.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 22:54:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:54:14] [INFO ] Applying decomposition
[2024-05-21 22:54:14] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15223165529238203099.txt' '-o' '/tmp/graph15223165529238203099.bin' '-w' '/tmp/graph15223165529238203099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15223165529238203099.bin' '-l' '-1' '-v' '-w' '/tmp/graph15223165529238203099.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:54:14] [INFO ] Decomposing Gal with order
[2024-05-21 22:54:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:54:14] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-21 22:54:14] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:54:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 1 ms.
[2024-05-21 22:54:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14384262808239757571.gal : 3 ms
[2024-05-21 22:54:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7779974842433583185.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14384262808239757571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7779974842433583185.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 722/722 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 698
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 698
Applied a total of 4 rules in 5 ms. Remains 124 /126 variables (removed 2) and now considering 698/722 (removed 24) transitions.
[2024-05-21 22:54:44] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
// Phase 1: matrix 639 rows 124 cols
[2024-05-21 22:54:44] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 22:54:44] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 22:54:44] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:54:44] [INFO ] Invariant cache hit.
[2024-05-21 22:54:44] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 22:54:45] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-05-21 22:54:45] [INFO ] Flow matrix only has 639 transitions (discarded 59 similar events)
[2024-05-21 22:54:45] [INFO ] Invariant cache hit.
[2024-05-21 22:54:45] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-05-21 22:54:50] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:54:50] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
[2024-05-21 22:54:50] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Problem TDEAD691 is UNSAT
[2024-05-21 22:54:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD692 is UNSAT
[2024-05-21 22:54:50] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD693 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 5/13 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:54:52] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 639/762 variables, 123/137 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 89/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 689 unsolved
At refinement iteration 7 (OVERLAPS) 1/763 variables, 1/227 constraints. Problems are: Problem set: 7 solved, 689 unsolved
[2024-05-21 22:55:11] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
[2024-05-21 22:55:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 2/229 constraints. Problems are: Problem set: 88 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 229 constraints, problems are : Problem set: 88 solved, 608 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 88 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 3 (OVERLAPS) 639/762 variables, 123/139 constraints. Problems are: Problem set: 88 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 89/228 constraints. Problems are: Problem set: 88 solved, 608 unsolved
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 511/739 constraints. Problems are: Problem set: 102 solved, 594 unsolved
[2024-05-21 22:55:36] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD605 is UNSAT
[2024-05-21 22:55:37] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
Problem TDEAD618 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 2/741 constraints. Problems are: Problem set: 117 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/763 variables, and 741 constraints, problems are : Problem set: 117 solved, 579 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/124 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 511/696 constraints, Known Traps: 10/10 constraints]
After SMT, in 61857ms problems are : Problem set: 117 solved, 579 unsolved
Search for dead transitions found 117 dead transitions in 61868ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 581/722 transitions.
Reduce places removed 13 places and 154 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 111 transition count 427
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 105 transition count 372
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 103 transition count 354
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 101 transition count 338
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 100 transition count 329
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 95 transition count 287
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 95 transition count 287
Applied a total of 34 rules in 6 ms. Remains 95 /124 variables (removed 29) and now considering 287/581 (removed 294) transitions.
[2024-05-21 22:55:46] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
// Phase 1: matrix 270 rows 95 cols
[2024-05-21 22:55:46] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 22:55:47] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 22:55:47] [INFO ] Flow matrix only has 270 transitions (discarded 17 similar events)
[2024-05-21 22:55:47] [INFO ] Invariant cache hit.
[2024-05-21 22:55:47] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 22:55:47] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/126 places, 287/722 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62801 ms. Remains : 95/126 places, 287/722 transitions.
[2024-05-21 22:55:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:55:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:55:47] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-21 22:55:47] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:55:47] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:55:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5470084392887271944.gal : 2 ms
[2024-05-21 22:55:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15445643017387891696.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5470084392887271944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15445643017387891696.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 22:56:17] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:56:17] [INFO ] Applying decomposition
[2024-05-21 22:56:17] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5927301887761856068.txt' '-o' '/tmp/graph5927301887761856068.bin' '-w' '/tmp/graph5927301887761856068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5927301887761856068.bin' '-l' '-1' '-v' '-w' '/tmp/graph5927301887761856068.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:56:17] [INFO ] Decomposing Gal with order
[2024-05-21 22:56:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:56:17] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-21 22:56:17] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2024-05-21 22:56:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1480490470705722550.gal : 4 ms
[2024-05-21 22:56:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12125216906757122635.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1480490470705722550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12125216906757122635.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 22:56:47] [INFO ] Flatten gal took : 51 ms
[2024-05-21 22:56:47] [INFO ] Flatten gal took : 39 ms
[2024-05-21 22:56:47] [INFO ] Applying decomposition
[2024-05-21 22:56:47] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8242414252366170239.txt' '-o' '/tmp/graph8242414252366170239.bin' '-w' '/tmp/graph8242414252366170239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8242414252366170239.bin' '-l' '-1' '-v' '-w' '/tmp/graph8242414252366170239.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:56:47] [INFO ] Decomposing Gal with order
[2024-05-21 22:56:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:56:47] [INFO ] Removed a total of 192 redundant transitions.
[2024-05-21 22:56:47] [INFO ] Flatten gal took : 54 ms
[2024-05-21 22:56:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 5 ms.
[2024-05-21 22:56:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12339639523587345277.gal : 6 ms
[2024-05-21 22:56:47] [INFO ] Time to serialize properties into /tmp/CTLFireability5494220580258258231.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12339639523587345277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5494220580258258231.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.

BK_STOP 1716332455916

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="BugTracking-PT-q3m008"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m008, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399300338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m008.tgz
mv BugTracking-PT-q3m008 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;