Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399300362.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-q3m064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399300362
=====================================================================

--------------------
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 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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-q3m064-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716331943362

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-q3m064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 22:52:24] [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:52:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:52:25] [INFO ] Load time of PNML (sax parser for PT used): 790 ms
[2024-05-21 22:52:25] [INFO ] Transformed 754 places.
[2024-05-21 22:52:25] [INFO ] Transformed 27370 transitions.
[2024-05-21 22:52:25] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 967 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 514 places in 101 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 70 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-21 22:52:25] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-21 22:52:25] [INFO ] Computed 8 invariants in 34 ms
[2024-05-21 22:52:26] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-21 22:52:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 22:52:26] [INFO ] Invariant cache hit.
[2024-05-21 22:52:26] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-21 22:52:27] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-05-21 22:52:27] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 22:52:27] [INFO ] Invariant cache hit.
[2024-05-21 22:52:28] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
[2024-05-21 22:53:03] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 12 ms to minimize.
[2024-05-21 22:53:04] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2024-05-21 22:53:04] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2024-05-21 22:53:11] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 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:53:20] [INFO ] Deduced a trap composed of 21 places in 91 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:53:21] [INFO ] Deduced a trap composed of 12 places in 105 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:53:21] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-05-21 22:53:21] [INFO ] Deduced a trap composed of 9 places in 90 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 236/2863 variables, and 16 constraints, problems are : Problem set: 64 solved, 2684 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/2748 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 64 solved, 2684 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 64 solved, 2684 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
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 8/16 constraints. Problems are: Problem set: 316 solved, 2432 unsolved
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
Problem TDEAD2679 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 TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
Problem TDEAD2705 is UNSAT
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 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 TDEAD2724 is UNSAT
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
Problem TDEAD2725 is UNSAT
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 8/24 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2863 variables, and 24 constraints, problems are : Problem set: 522 solved, 2226 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 0/2748 constraints, Known Traps: 16/16 constraints]
After SMT, in 83860ms problems are : Problem set: 522 solved, 2226 unsolved
Search for dead transitions found 522 dead transitions in 83937ms
Found 522 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 522 transitions
Dead transitions reduction (with SMT) removed 522 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2228/2769 transitions.
Reduce places removed 42 places and 709 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 195 transition count 1519
Reduce places removed 15 places and 265 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 57 place count 180 transition count 1254
Reduce places removed 11 places and 125 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 68 place count 169 transition count 1129
Reduce places removed 5 places and 84 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 73 place count 164 transition count 1045
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 163 transition count 1028
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 85 place count 152 transition count 972
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 14 places and 225 transitions.
Iterating global reduction 5 with 25 rules applied. Total rules applied 110 place count 138 transition count 747
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 117 place count 131 transition count 698
Deduced a syphon composed of 6 places in 2 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 124 place count 131 transition count 698
Deduced a syphon composed of 6 places in 3 ms
Applied a total of 124 rules in 49 ms. Remains 131 /237 variables (removed 106) and now considering 698/2228 (removed 1530) transitions.
[2024-05-21 22:53:51] [INFO ] Flow matrix only has 642 transitions (discarded 56 similar events)
// Phase 1: matrix 642 rows 131 cols
[2024-05-21 22:53:51] [INFO ] Computed 15 invariants in 6 ms
[2024-05-21 22:53:52] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 22:53:52] [INFO ] Flow matrix only has 642 transitions (discarded 56 similar events)
[2024-05-21 22:53:52] [INFO ] Invariant cache hit.
[2024-05-21 22:53:52] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-21 22:53:52] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/240 places, 698/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86582 ms. Remains : 131/240 places, 698/2769 transitions.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Support contains 10 out of 125 places after structural reductions.
FORMULA BugTracking-PT-q3m064-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:53:52] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2024-05-21 22:53:52] [INFO ] Flatten gal took : 96 ms
[2024-05-21 22:53:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m064-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:53:52] [INFO ] Flatten gal took : 57 ms
[2024-05-21 22:53:52] [INFO ] Input system was already deterministic with 698 transitions.
Support contains 3 out of 125 places (down from 10) after GAL structural reductions.
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (37 resets) in 889 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 739315 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 739315 steps, saw 369143 distinct states, run finished after 3004 ms. (steps per millisecond=246 ) properties seen :0
[2024-05-21 22:53:56] [INFO ] Flow matrix only has 642 transitions (discarded 56 similar events)
// Phase 1: matrix 642 rows 125 cols
[2024-05-21 22:53:56] [INFO ] Computed 9 invariants in 12 ms
[2024-05-21 22:53:56] [INFO ] State equation strengthened by 88 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) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/290 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 220/510 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 32/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/512 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/515 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/517 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/517 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 202/719 variables, 48/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/719 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/719 variables, 33/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/719 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/722 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/722 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 43/765 variables, 29/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/765 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/765 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/765 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/767 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/767 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/767 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/767 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 767/767 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 88/88 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) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/290 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 220/510 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 32/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/512 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/515 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/517 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/517 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 202/719 variables, 48/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/719 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/719 variables, 33/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/719 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/719 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/722 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/722 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 43/765 variables, 29/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/765 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/765 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:53:56] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 22:53:57] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:53:57] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/765 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/765 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/767 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/767 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/767 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/767 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1075ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 258 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 698/698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 691
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 692
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 123 transition count 687
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 118 transition count 687
Applied a total of 14 rules in 63 ms. Remains 118 /125 variables (removed 7) and now considering 687/698 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 118/125 places, 687/698 transitions.
RANDOM walk for 40035 steps (43 resets) in 347 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 632185 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 1
Probabilistic random walk after 632185 steps, saw 412183 distinct states, run finished after 3003 ms. (steps per millisecond=210 ) properties seen :0
[2024-05-21 22:54:00] [INFO ] Flow matrix only has 627 transitions (discarded 60 similar events)
// Phase 1: matrix 627 rows 118 cols
[2024-05-21 22:54:00] [INFO ] Computed 9 invariants in 9 ms
[2024-05-21 22:54:00] [INFO ] State equation strengthened by 86 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) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/290 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 217/507 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/509 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/512 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/514 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 193/707 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/707 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/707 variables, 32/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/707 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/708 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/708 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/708 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 37/745 variables, 25/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/745 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/745 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/745 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/745 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 86/86 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) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 271/290 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 217/507 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/509 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/512 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/514 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 193/707 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/707 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/707 variables, 32/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/707 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:54:01] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/707 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/707 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/708 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/708 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/708 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 37/745 variables, 25/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/745 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/745 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/745 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/745 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 745/745 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 213 ms.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 687/687 transitions.
Applied a total of 0 rules in 31 ms. Remains 118 /118 variables (removed 0) and now considering 687/687 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 118/118 places, 687/687 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 687/687 transitions.
Applied a total of 0 rules in 26 ms. Remains 118 /118 variables (removed 0) and now considering 687/687 (removed 0) transitions.
[2024-05-21 22:54:01] [INFO ] Flow matrix only has 627 transitions (discarded 60 similar events)
[2024-05-21 22:54:01] [INFO ] Invariant cache hit.
[2024-05-21 22:54:02] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 22:54:02] [INFO ] Flow matrix only has 627 transitions (discarded 60 similar events)
[2024-05-21 22:54:02] [INFO ] Invariant cache hit.
[2024-05-21 22:54:02] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-21 22:54:02] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-21 22:54:02] [INFO ] Redundant transitions in 49 ms returned []
Running 685 sub problems to find dead transitions.
[2024-05-21 22:54:02] [INFO ] Flow matrix only has 627 transitions (discarded 60 similar events)
[2024-05-21 22:54:02] [INFO ] Invariant cache hit.
[2024-05-21 22:54:02] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-21 22:54:07] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 681 unsolved
At refinement iteration 4 (OVERLAPS) 627/745 variables, 118/128 constraints. Problems are: Problem set: 4 solved, 681 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 86/214 constraints. Problems are: Problem set: 4 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/214 constraints. Problems are: Problem set: 4 solved, 681 unsolved
[2024-05-21 22:54:25] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
[2024-05-21 22:54:25] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
[2024-05-21 22:54:25] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/745 variables, 3/217 constraints. Problems are: Problem set: 98 solved, 587 unsolved
[2024-05-21 22:54:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
[2024-05-21 22:54:31] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
Problem TDEAD572 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 2/219 constraints. Problems are: Problem set: 102 solved, 583 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 745/745 variables, and 219 constraints, problems are : Problem set: 102 solved, 583 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 102 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 5/13 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 4 (OVERLAPS) 3/118 variables, 1/14 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/15 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 7 (OVERLAPS) 627/745 variables, 118/133 constraints. Problems are: Problem set: 102 solved, 583 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 86/219 constraints. Problems are: Problem set: 102 solved, 583 unsolved
Problem TDEAD501 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/745 variables, 583/802 constraints. Problems are: Problem set: 115 solved, 570 unsolved
[2024-05-21 22:54:54] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 1/803 constraints. Problems are: Problem set: 115 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 745/745 variables, and 803 constraints, problems are : Problem set: 115 solved, 570 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 583/685 constraints, Known Traps: 7/7 constraints]
After SMT, in 62202ms problems are : Problem set: 115 solved, 570 unsolved
Search for dead transitions found 115 dead transitions in 62219ms
Found 115 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 115 transitions
Dead transitions reduction (with SMT) removed 115 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/118 places, 572/687 transitions.
Graph (complete) has 838 edges and 118 vertex of which 115 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 156 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 105 transition count 416
Reduce places removed 7 places and 73 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 98 transition count 343
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 94 transition count 314
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 92 transition count 298
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 25 place count 91 transition count 289
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 31 place count 85 transition count 243
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 37 place count 85 transition count 243
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 37 rules in 18 ms. Remains 85 /118 variables (removed 33) and now considering 243/572 (removed 329) transitions.
[2024-05-21 22:55:04] [INFO ] Flow matrix only has 226 transitions (discarded 17 similar events)
// Phase 1: matrix 226 rows 85 cols
[2024-05-21 22:55:04] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 22:55:04] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 22:55:04] [INFO ] Flow matrix only has 226 transitions (discarded 17 similar events)
[2024-05-21 22:55:04] [INFO ] Invariant cache hit.
[2024-05-21 22:55:05] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 22:55:05] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/118 places, 243/687 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63193 ms. Remains : 85/118 places, 243/687 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2024-05-21 22:55:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 22:55:05] [INFO ] Flatten gal took : 39 ms
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:55:05] [INFO ] Flatten gal took : 36 ms
[2024-05-21 22:55:05] [INFO ] Input system was already deterministic with 698 transitions.
Computed a total of 4 stabilizing places and 27 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 698/698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 691
Applied a total of 2 rules in 4 ms. Remains 124 /125 variables (removed 1) and now considering 691/698 (removed 7) transitions.
[2024-05-21 22:55:05] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
// Phase 1: matrix 633 rows 124 cols
[2024-05-21 22:55:05] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 22:55:05] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 22:55:05] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
[2024-05-21 22:55:05] [INFO ] Invariant cache hit.
[2024-05-21 22:55:05] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-21 22:55:05] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 689 sub problems to find dead transitions.
[2024-05-21 22:55:05] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
[2024-05-21 22:55:05] [INFO ] Invariant cache hit.
[2024-05-21 22:55:05] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-05-21 22:55:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 685 unsolved
[2024-05-21 22:55:13] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 685 unsolved
[2024-05-21 22:55:16] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 6 (OVERLAPS) 633/756 variables, 123/135 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 86/221 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 0/221 constraints. Problems are: Problem set: 4 solved, 685 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/757 variables, 1/222 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/757 variables, 0/222 constraints. Problems are: Problem set: 4 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/757 variables, and 222 constraints, problems are : Problem set: 4 solved, 685 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 4 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 633/756 variables, 123/135 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 86/221 constraints. Problems are: Problem set: 4 solved, 685 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 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
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 588/809 constraints. Problems are: Problem set: 43 solved, 646 unsolved
[2024-05-21 22:55:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
Problem TDEAD558 is UNSAT
[2024-05-21 22:55:57] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
[2024-05-21 22:55:57] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
Problem TDEAD618 is UNSAT
[2024-05-21 22:55:57] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:55:57] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
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 7 (INCLUDED_ONLY) 0/756 variables, 5/814 constraints. Problems are: Problem set: 96 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/757 variables, and 814 constraints, problems are : Problem set: 96 solved, 593 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/124 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 588/689 constraints, Known Traps: 8/8 constraints]
After SMT, in 62103ms problems are : Problem set: 96 solved, 593 unsolved
Search for dead transitions found 96 dead transitions in 62113ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 595/698 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 441
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 386
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 368
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 352
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 100 transition count 341
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 95 transition count 295
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 95 transition count 295
Applied a total of 34 rules in 7 ms. Remains 95 /124 variables (removed 29) and now considering 295/595 (removed 300) transitions.
[2024-05-21 22:56:07] [INFO ] Flow matrix only has 278 transitions (discarded 17 similar events)
// Phase 1: matrix 278 rows 95 cols
[2024-05-21 22:56:07] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 22:56:08] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 22:56:08] [INFO ] Flow matrix only has 278 transitions (discarded 17 similar events)
[2024-05-21 22:56:08] [INFO ] Invariant cache hit.
[2024-05-21 22:56:08] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 22:56:08] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/125 places, 295/698 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63041 ms. Remains : 95/125 places, 295/698 transitions.
[2024-05-21 22:56:08] [INFO ] Flatten gal took : 17 ms
[2024-05-21 22:56:08] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:56:08] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-21 22:56:08] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:56:08] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:56:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16712514723816926869.gal : 13 ms
[2024-05-21 22:56:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8947684707843368837.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/CTLFireability16712514723816926869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8947684707843368837.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:38] [INFO ] Flatten gal took : 30 ms
[2024-05-21 22:56:38] [INFO ] Applying decomposition
[2024-05-21 22:56:38] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17931026963875718198.txt' '-o' '/tmp/graph17931026963875718198.bin' '-w' '/tmp/graph17931026963875718198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17931026963875718198.bin' '-l' '-1' '-v' '-w' '/tmp/graph17931026963875718198.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:56:38] [INFO ] Decomposing Gal with order
[2024-05-21 22:56:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:56:38] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-21 22:56:38] [INFO ] Flatten gal took : 76 ms
[2024-05-21 22:56:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 8 ms.
[2024-05-21 22:56:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8746672887654952868.gal : 6 ms
[2024-05-21 22:56:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10854884442876122855.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/CTLFireability8746672887654952868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10854884442876122855.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 : 125/125 places, 698/698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 691
Applied a total of 2 rules in 9 ms. Remains 124 /125 variables (removed 1) and now considering 691/698 (removed 7) transitions.
[2024-05-21 22:57:08] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
// Phase 1: matrix 633 rows 124 cols
[2024-05-21 22:57:08] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 22:57:09] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 22:57:09] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
[2024-05-21 22:57:09] [INFO ] Invariant cache hit.
[2024-05-21 22:57:09] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-21 22:57:09] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 689 sub problems to find dead transitions.
[2024-05-21 22:57:09] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
[2024-05-21 22:57:09] [INFO ] Invariant cache hit.
[2024-05-21 22:57:09] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-05-21 22:57:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 685 unsolved
[2024-05-21 22:57:16] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 685 unsolved
[2024-05-21 22:57:19] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 6 (OVERLAPS) 633/756 variables, 123/135 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 86/221 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 0/221 constraints. Problems are: Problem set: 4 solved, 685 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/757 variables, 1/222 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/757 variables, 0/222 constraints. Problems are: Problem set: 4 solved, 685 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/757 variables, and 222 constraints, problems are : Problem set: 4 solved, 685 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 4 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 633/756 variables, 123/135 constraints. Problems are: Problem set: 4 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 86/221 constraints. Problems are: Problem set: 4 solved, 685 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 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
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 588/809 constraints. Problems are: Problem set: 43 solved, 646 unsolved
[2024-05-21 22:58:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Problem TDEAD558 is UNSAT
[2024-05-21 22:58:02] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
[2024-05-21 22:58:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
Problem TDEAD618 is UNSAT
[2024-05-21 22:58:03] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-21 22:58:03] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
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 7 (INCLUDED_ONLY) 0/756 variables, 5/814 constraints. Problems are: Problem set: 96 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/757 variables, and 814 constraints, problems are : Problem set: 96 solved, 593 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/124 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 588/689 constraints, Known Traps: 8/8 constraints]
After SMT, in 61760ms problems are : Problem set: 96 solved, 593 unsolved
Search for dead transitions found 96 dead transitions in 61779ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 595/698 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 441
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 386
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 368
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 352
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 100 transition count 341
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 95 transition count 295
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 95 transition count 295
Applied a total of 34 rules in 6 ms. Remains 95 /124 variables (removed 29) and now considering 295/595 (removed 300) transitions.
[2024-05-21 22:58:11] [INFO ] Flow matrix only has 278 transitions (discarded 17 similar events)
// Phase 1: matrix 278 rows 95 cols
[2024-05-21 22:58:11] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 22:58:11] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 22:58:11] [INFO ] Flow matrix only has 278 transitions (discarded 17 similar events)
[2024-05-21 22:58:11] [INFO ] Invariant cache hit.
[2024-05-21 22:58:11] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 22:58:11] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/125 places, 295/698 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62798 ms. Remains : 95/125 places, 295/698 transitions.
[2024-05-21 22:58:11] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:58:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:58:11] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-21 22:58:11] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:58:11] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:58:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2547757073207244436.gal : 4 ms
[2024-05-21 22:58:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3507452747134189822.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/CTLFireability2547757073207244436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3507452747134189822.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:58:41] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:58:41] [INFO ] Applying decomposition
[2024-05-21 22:58:41] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11557023341534070227.txt' '-o' '/tmp/graph11557023341534070227.bin' '-w' '/tmp/graph11557023341534070227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11557023341534070227.bin' '-l' '-1' '-v' '-w' '/tmp/graph11557023341534070227.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:58:41] [INFO ] Decomposing Gal with order
[2024-05-21 22:58:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:58:41] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-21 22:58:41] [INFO ] Flatten gal took : 21 ms
[2024-05-21 22:58:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2024-05-21 22:58:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15565019477490175763.gal : 3 ms
[2024-05-21 22:58:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9647664634829950381.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/CTLFireability15565019477490175763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9647664634829950381.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:59:12] [INFO ] Flatten gal took : 49 ms
[2024-05-21 22:59:12] [INFO ] Flatten gal took : 39 ms
[2024-05-21 22:59:12] [INFO ] Applying decomposition
[2024-05-21 22:59:12] [INFO ] Flatten gal took : 31 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/graph14224488805941928423.txt' '-o' '/tmp/graph14224488805941928423.bin' '-w' '/tmp/graph14224488805941928423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14224488805941928423.bin' '-l' '-1' '-v' '-w' '/tmp/graph14224488805941928423.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:59:12] [INFO ] Decomposing Gal with order
[2024-05-21 22:59:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:59:12] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-21 22:59:12] [INFO ] Flatten gal took : 59 ms
[2024-05-21 22:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 6 ms.
[2024-05-21 22:59:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3829136846053534724.gal : 10 ms
[2024-05-21 22:59:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3789334718661491862.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/CTLFireability3829136846053534724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3789334718661491862.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 -...262
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.

BK_STOP 1716332577966

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-q3m064"
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-q3m064, 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-171620399300362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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