Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729200427.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ASLink-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729200427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 920K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-10a-LTLCardinality-00
FORMULA_NAME ASLink-PT-10a-LTLCardinality-01
FORMULA_NAME ASLink-PT-10a-LTLCardinality-02
FORMULA_NAME ASLink-PT-10a-LTLCardinality-03
FORMULA_NAME ASLink-PT-10a-LTLCardinality-04
FORMULA_NAME ASLink-PT-10a-LTLCardinality-05
FORMULA_NAME ASLink-PT-10a-LTLCardinality-06
FORMULA_NAME ASLink-PT-10a-LTLCardinality-07
FORMULA_NAME ASLink-PT-10a-LTLCardinality-08
FORMULA_NAME ASLink-PT-10a-LTLCardinality-09
FORMULA_NAME ASLink-PT-10a-LTLCardinality-10
FORMULA_NAME ASLink-PT-10a-LTLCardinality-11
FORMULA_NAME ASLink-PT-10a-LTLCardinality-12
FORMULA_NAME ASLink-PT-10a-LTLCardinality-13
FORMULA_NAME ASLink-PT-10a-LTLCardinality-14
FORMULA_NAME ASLink-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748614771083

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 14:19:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 14:19:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 14:19:32] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-05-30 14:19:32] [INFO ] Transformed 2186 places.
[2025-05-30 14:19:32] [INFO ] Transformed 3192 transitions.
[2025-05-30 14:19:32] [INFO ] Found NUPN structural information;
[2025-05-30 14:19:32] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2126 transition count 3158
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 74 place count 2112 transition count 3091
Ensure Unique test removed 1 places
Iterating global reduction 1 with 15 rules applied. Total rules applied 89 place count 2111 transition count 3091
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 2111 transition count 3089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 2110 transition count 3081
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 2110 transition count 3081
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 2109 transition count 3073
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 2109 transition count 3073
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 2108 transition count 3065
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 2108 transition count 3065
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 2107 transition count 3057
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 2107 transition count 3057
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 2106 transition count 3049
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 2106 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 2105 transition count 3041
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 2105 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 2104 transition count 3033
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 2104 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 2103 transition count 3025
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 2103 transition count 3025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 2102 transition count 3017
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 2102 transition count 3017
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 2101 transition count 3009
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 2101 transition count 3009
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 2100 transition count 3001
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 2100 transition count 3001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 2099 transition count 2993
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 2099 transition count 2993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 2098 transition count 2985
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 2098 transition count 2985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 2097 transition count 2977
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 2097 transition count 2977
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 2096 transition count 2969
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 2096 transition count 2969
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 2095 transition count 2961
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 2095 transition count 2961
Applied a total of 123 rules in 1947 ms. Remains 2095 /2186 variables (removed 91) and now considering 2961/3158 (removed 197) transitions.
// Phase 1: matrix 2961 rows 2095 cols
[2025-05-30 14:19:34] [INFO ] Computed 361 invariants in 110 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:19:36] [INFO ] Implicit Places using invariants in 1917 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1326, 1342, 1347, 1348, 1368, 1386, 1515, 1531, 1536, 1537, 1538, 1556, 1574, 1703, 1719, 1724, 1725, 1726, 1744, 1762, 1891, 1896, 1908, 1913, 1914, 1915, 1933, 1935, 1938, 1956, 1957, 1958, 1959, 1976, 1984, 1992, 1998, 2004, 2010, 2016, 2024, 2030, 2036, 2044]
Discarding 93 places :
Implicit Place search using SMT only with invariants took 1954 ms to find 93 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2002/2186 places, 2961/3158 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1990 transition count 2949
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1990 transition count 2949
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1980 transition count 2939
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1980 transition count 2939
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1975 transition count 2934
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1975 transition count 2934
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1973 transition count 2932
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1973 transition count 2932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1972 transition count 2931
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1972 transition count 2931
Applied a total of 60 rules in 452 ms. Remains 1972 /2002 variables (removed 30) and now considering 2931/2961 (removed 30) transitions.
// Phase 1: matrix 2931 rows 1972 cols
[2025-05-30 14:19:37] [INFO ] Computed 268 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:19:38] [INFO ] Implicit Places using invariants in 1177 ms returned []
[2025-05-30 14:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:19:42] [INFO ] Implicit Places using invariants and state equation in 4394 ms returned []
Implicit Place search using SMT with State Equation took 5576 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1972/2186 places, 2931/3158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9946 ms. Remains : 1972/2186 places, 2931/3158 transitions.
Support contains 25 out of 1972 places after structural reductions.
[2025-05-30 14:19:43] [INFO ] Flatten gal took : 203 ms
[2025-05-30 14:19:43] [INFO ] Flatten gal took : 143 ms
[2025-05-30 14:19:43] [INFO ] Input system was already deterministic with 2931 transitions.
RANDOM walk for 40000 steps (159 resets) in 1306 ms. (30 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40003 steps (12 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
[2025-05-30 14:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 185/195 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 648/843 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/843 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1121/1964 variables, 208/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1964 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/1972 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1972 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2931/4903 variables, 1972/2240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4903 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/4903 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4903/4903 variables, and 2240 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3576 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 209/209 constraints, State Equation: 1972/1972 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 185/195 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 648/843 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/843 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1121/1964 variables, 208/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1964 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/1972 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1972 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2931/4903 variables, 1972/2240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4903 variables, 6/2246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:19:52] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 17 ms to minimize.
SMT process timed out in 8746ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 1972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 1972 transition count 2544
Reduce places removed 387 places and 0 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 774 place count 1585 transition count 2544
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 774 place count 1585 transition count 2280
Deduced a syphon composed of 264 places in 2 ms
Ensure Unique test removed 85 places
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 613 rules applied. Total rules applied 1387 place count 1236 transition count 2280
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 21 rules applied. Total rules applied 1408 place count 1224 transition count 2271
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1417 place count 1215 transition count 2271
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1417 place count 1215 transition count 2231
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1497 place count 1175 transition count 2231
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1502 place count 1170 transition count 2226
Iterating global reduction 4 with 5 rules applied. Total rules applied 1507 place count 1170 transition count 2226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1511 place count 1170 transition count 2222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1512 place count 1169 transition count 2222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1512 place count 1169 transition count 2221
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1514 place count 1168 transition count 2221
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 1716 place count 1067 transition count 2120
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1717 place count 1066 transition count 2119
Iterating global reduction 6 with 1 rules applied. Total rules applied 1718 place count 1066 transition count 2119
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1726 place count 1066 transition count 2111
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1734 place count 1058 transition count 2111
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 7 with 39 rules applied. Total rules applied 1773 place count 1058 transition count 2072
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 1813 place count 1018 transition count 2072
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1821 place count 1018 transition count 2064
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 8 with 29 rules applied. Total rules applied 1850 place count 1018 transition count 2064
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1851 place count 1017 transition count 2063
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1861 place count 1007 transition count 2063
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 1861 place count 1007 transition count 2043
Deduced a syphon composed of 20 places in 5 ms
Ensure Unique test removed 9 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 9 with 49 rules applied. Total rules applied 1910 place count 978 transition count 2043
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1919 place count 969 transition count 2034
Iterating global reduction 9 with 9 rules applied. Total rules applied 1928 place count 969 transition count 2034
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1937 place count 969 transition count 2025
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1939 place count 968 transition count 2024
Applied a total of 1939 rules in 1023 ms. Remains 968 /1972 variables (removed 1004) and now considering 2024/2931 (removed 907) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 968/1972 places, 2024/2931 transitions.
RANDOM walk for 40000 steps (565 resets) in 423 ms. (94 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (67 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (65 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (66 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (63 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
// Phase 1: matrix 2024 rows 968 cols
[2025-05-30 14:19:54] [INFO ] Computed 151 invariants in 21 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 253/289 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 62/351 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 380/732 variables, 72/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/732 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 18/750 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 182/932 variables, 23/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 18/950 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/950 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 18/968 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/968 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2024/2992 variables, 968/1119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2992 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2992 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2992/2992 variables, and 1119 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1960 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 127/127 constraints, State Equation: 968/968 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 253/289 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 62/351 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 380/732 variables, 72/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:19:56] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/732 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/732 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 18/750 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/750 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 182/932 variables, 23/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 18/950 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:19:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/950 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/950 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 18/968 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/968 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2024/2992 variables, 968/1121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2992 variables, 5/1126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2992 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/2992 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2992/2992 variables, and 1126 constraints, problems are : Problem set: 0 solved, 5 unsolved in 27274 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 127/127 constraints, State Equation: 968/968 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29274ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 16946 ms.
Support contains 5 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 2024/2024 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 968 transition count 2022
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 966 transition count 2022
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 965 transition count 2016
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 965 transition count 2016
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 964 transition count 2016
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 3 with 2 rules applied. Total rules applied 9 place count 963 transition count 2015
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 962 transition count 2014
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 962 transition count 2014
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 962 transition count 2013
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 14 place count 961 transition count 2012
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 16 place count 961 transition count 2012
Applied a total of 16 rules in 236 ms. Remains 961 /968 variables (removed 7) and now considering 2012/2024 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 961/968 places, 2012/2024 transitions.
RANDOM walk for 40000 steps (569 resets) in 314 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (66 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 287712 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 3
Probabilistic random walk after 287712 steps, saw 64334 distinct states, run finished after 3007 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 2012 rows 961 cols
[2025-05-30 14:20:44] [INFO ] Computed 150 invariants in 23 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 209/224 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/263 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/264 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 330/594 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 23/617 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/617 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 110/727 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/727 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/728 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 73/801 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/801 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 17/818 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/818 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 108/926 variables, 14/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/926 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 22/948 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/948 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 13/961 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/961 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 2012/2973 variables, 961/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2973 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/2973 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2973/2973 variables, and 1111 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 961/961 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 209/224 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/263 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/264 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 330/594 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 23/617 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/617 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 110/727 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/727 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/728 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 73/801 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/801 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 17/818 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/818 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 108/926 variables, 14/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/926 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 22/948 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/948 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 13/961 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:20:47] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 43 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/961 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/961 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 2012/2973 variables, 961/1112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2973 variables, 3/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2973 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2973 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2973/2973 variables, and 1115 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7604 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 961/961 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9382ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1356 ms.
Support contains 5 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 2012/2012 transitions.
Applied a total of 0 rules in 35 ms. Remains 961 /961 variables (removed 0) and now considering 2012/2012 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 961/961 places, 2012/2012 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 2012/2012 transitions.
Applied a total of 0 rules in 33 ms. Remains 961 /961 variables (removed 0) and now considering 2012/2012 (removed 0) transitions.
[2025-05-30 14:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:55] [INFO ] Implicit Places using invariants in 817 ms returned [88, 94, 97, 99, 100, 103, 108, 109, 161, 178, 184, 187, 189, 190, 195, 196, 248, 266, 272, 275, 277, 278, 283, 284, 336, 353, 359, 362, 364, 365, 370, 371, 423, 440, 446, 449, 451, 456, 461, 462, 514, 531, 537, 540, 544, 549, 550, 602, 619, 625, 628, 630, 631, 636, 637, 638, 691, 712, 718, 721, 723, 724, 729, 730, 782, 799, 805, 808, 810, 811, 816, 817, 869, 886, 892, 895, 897, 898]
[2025-05-30 14:20:55] [INFO ] Actually due to overlaps returned [278, 365, 456, 544, 631, 724, 811, 898, 190, 638, 88, 94, 99, 178, 184, 189, 266, 272, 277, 353, 359, 364, 440, 446, 451, 531, 537, 619, 625, 630, 712, 718, 723, 799, 805, 810, 886, 892, 897, 100, 103, 161, 248, 336, 423, 514, 540, 602, 782, 869]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 820 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 911/961 places, 2012/2012 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 911 transition count 2007
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 906 transition count 2007
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 48 place count 868 transition count 1969
Iterating global reduction 2 with 38 rules applied. Total rules applied 86 place count 868 transition count 1969
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 96 place count 858 transition count 1959
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 858 transition count 1959
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 144 place count 839 transition count 1940
Free-agglomeration rule applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 173 place count 839 transition count 1911
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 202 place count 810 transition count 1911
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 210 place count 810 transition count 1903
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 218 place count 802 transition count 1903
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 802 transition count 1903
Applied a total of 219 rules in 204 ms. Remains 802 /911 variables (removed 109) and now considering 1903/2012 (removed 109) transitions.
// Phase 1: matrix 1903 rows 802 cols
[2025-05-30 14:20:55] [INFO ] Computed 100 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:56] [INFO ] Implicit Places using invariants in 561 ms returned [93, 94, 164, 165, 236, 237, 307, 308, 382, 383, 457, 458, 528, 529, 581, 602, 603, 673, 674]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 564 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 783/961 places, 1903/2012 transitions.
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 2 place count 782 transition count 1902
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 782 transition count 1901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 781 transition count 1901
Applied a total of 4 rules in 83 ms. Remains 781 /783 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 781 cols
[2025-05-30 14:20:56] [INFO ] Computed 81 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:57] [INFO ] Implicit Places using invariants in 486 ms returned []
[2025-05-30 14:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:58] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 781/961 places, 1901/2012 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3868 ms. Remains : 781/961 places, 1901/2012 transitions.
RANDOM walk for 40000 steps (642 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (82 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (84 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (86 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 181258 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 3
Probabilistic random walk after 181258 steps, saw 111570 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
[2025-05-30 14:21:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 268/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/286 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 298/584 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/588 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 110/698 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 34/732 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/732 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 49/781 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/781 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1901/2682 variables, 781/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2682 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2682 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2682/2682 variables, and 862 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 268/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/286 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 298/584 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/588 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 110/698 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 34/732 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/732 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 49/781 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:21:03] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/781 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/781 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1901/2682 variables, 781/863 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2682 variables, 3/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2682 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2682 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2682/2682 variables, and 866 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26176 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27575ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7413 ms.
Support contains 5 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1901/1901 transitions.
Applied a total of 0 rules in 33 ms. Remains 781 /781 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 781/781 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1901/1901 transitions.
Applied a total of 0 rules in 29 ms. Remains 781 /781 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2025-05-30 14:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:21:37] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-05-30 14:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:21:39] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2280 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:21:39] [INFO ] Redundant transitions in 157 ms returned []
Running 1854 sub problems to find dead transitions.
[2025-05-30 14:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/780 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 780/2682 variables, and 75 constraints, problems are : Problem set: 0 solved, 1854 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 63/66 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 1854/1854 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1854 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/780 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 780/2682 variables, and 75 constraints, problems are : Problem set: 0 solved, 1854 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 63/66 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 0/1854 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60865ms problems are : Problem set: 0 solved, 1854 unsolved
Search for dead transitions found 0 dead transitions in 60877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63365 ms. Remains : 781/781 places, 1901/1901 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0)) U (!p1&&X(X(!p0))))))'
Support contains 4 out of 1972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1970 transition count 2924
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1970 transition count 2924
Applied a total of 4 rules in 128 ms. Remains 1970 /1972 variables (removed 2) and now considering 2924/2931 (removed 7) transitions.
// Phase 1: matrix 2924 rows 1970 cols
[2025-05-30 14:22:40] [INFO ] Computed 268 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:41] [INFO ] Implicit Places using invariants in 1185 ms returned [1296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1191 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1969/1972 places, 2924/2931 transitions.
Applied a total of 0 rules in 73 ms. Remains 1969 /1969 variables (removed 0) and now considering 2924/2924 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1393 ms. Remains : 1969/1972 places, 2924/2931 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR p0 p1), (OR p0 p1), p0, p0, true]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-00 finished in 1772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p1))))'
Support contains 3 out of 1972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1969 transition count 2923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1969 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1968 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1968 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1967 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1967 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1966 transition count 2920
Applied a total of 12 rules in 331 ms. Remains 1966 /1972 variables (removed 6) and now considering 2920/2931 (removed 11) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2025-05-30 14:22:42] [INFO ] Computed 268 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:43] [INFO ] Implicit Places using invariants in 1169 ms returned [1296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1972 places, 2920/2931 transitions.
Applied a total of 0 rules in 65 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1569 ms. Remains : 1965/1972 places, 2920/2931 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-01
Stuttering criterion allowed to conclude after 204 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-01 finished in 1734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1971 transition count 2540
Reduce places removed 400 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 409 rules applied. Total rules applied 799 place count 1571 transition count 2531
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 809 place count 1562 transition count 2530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 1561 transition count 2530
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 285 Pre rules applied. Total rules applied 810 place count 1561 transition count 2245
Deduced a syphon composed of 285 places in 2 ms
Ensure Unique test removed 84 places
Reduce places removed 369 places and 0 transitions.
Iterating global reduction 4 with 654 rules applied. Total rules applied 1464 place count 1192 transition count 2245
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 4 with 53 rules applied. Total rules applied 1517 place count 1168 transition count 2216
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1546 place count 1139 transition count 2216
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 1546 place count 1139 transition count 2176
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 1626 place count 1099 transition count 2176
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1642 place count 1083 transition count 2155
Iterating global reduction 6 with 16 rules applied. Total rules applied 1658 place count 1083 transition count 2155
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 15 rules applied. Total rules applied 1673 place count 1082 transition count 2141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1674 place count 1081 transition count 2141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1674 place count 1081 transition count 2140
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1676 place count 1080 transition count 2140
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 3 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 8 with 188 rules applied. Total rules applied 1864 place count 986 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1866 place count 984 transition count 2044
Iterating global reduction 8 with 2 rules applied. Total rules applied 1868 place count 984 transition count 2044
Applied a total of 1868 rules in 268 ms. Remains 984 /1972 variables (removed 988) and now considering 2044/2931 (removed 887) transitions.
// Phase 1: matrix 2044 rows 984 cols
[2025-05-30 14:22:44] [INFO ] Computed 149 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:44] [INFO ] Implicit Places using invariants in 683 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 542, 547, 549, 609, 626, 632, 637, 639, 648, 701, 722, 728, 733, 735, 795, 805, 815, 821, 826, 828, 888, 905, 911, 916, 918, 981]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 686 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 932/1972 places, 2044/2931 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 932 transition count 2039
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 927 transition count 2039
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 30 place count 907 transition count 2019
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 907 transition count 2019
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 70 place count 887 transition count 1999
Iterating global reduction 2 with 20 rules applied. Total rules applied 90 place count 887 transition count 1999
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 877 transition count 1989
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 877 transition count 1989
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 152 place count 856 transition count 1968
Applied a total of 152 rules in 139 ms. Remains 856 /932 variables (removed 76) and now considering 1968/2044 (removed 76) transitions.
// Phase 1: matrix 1968 rows 856 cols
[2025-05-30 14:22:45] [INFO ] Computed 97 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:45] [INFO ] Implicit Places using invariants in 545 ms returned []
[2025-05-30 14:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:47] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 856/1972 places, 1968/2931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3449 ms. Remains : 856/1972 places, 1968/2931 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-02
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-02 finished in 3501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 2 out of 1972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1969 transition count 2923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1969 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1968 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1968 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1967 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1967 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1966 transition count 2920
Applied a total of 12 rules in 325 ms. Remains 1966 /1972 variables (removed 6) and now considering 2920/2931 (removed 11) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2025-05-30 14:22:47] [INFO ] Computed 268 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:48] [INFO ] Implicit Places using invariants in 1191 ms returned [1296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1972 places, 2920/2931 transitions.
Applied a total of 0 rules in 69 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1589 ms. Remains : 1965/1972 places, 2920/2931 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-05
Product exploration explored 100000 steps with 20006 reset in 871 ms.
Product exploration explored 100000 steps with 20024 reset in 760 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 34231 steps (136 resets) in 345 ms. (98 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 2920/2920 transitions.
Applied a total of 0 rules in 68 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2025-05-30 14:22:51] [INFO ] Computed 267 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:52] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2025-05-30 14:22:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:22:58] [INFO ] Implicit Places using invariants and state equation in 5643 ms returned []
Implicit Place search using SMT with State Equation took 6826 ms to find 0 implicit places.
Running 2919 sub problems to find dead transitions.
[2025-05-30 14:22:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 2919/2919 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2919 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 0/2919 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61110ms problems are : Problem set: 0 solved, 2919 unsolved
Search for dead transitions found 0 dead transitions in 61117ms
Finished structural reductions in LTL mode , in 1 iterations and 68027 ms. Remains : 1965/1965 places, 2920/2920 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 35231 steps (159 resets) in 229 ms. (153 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 19949 reset in 643 ms.
Product exploration explored 100000 steps with 20045 reset in 665 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1965/1965 places, 2920/2920 transitions.
Performed 390 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1965 transition count 2920
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 141 Pre rules applied. Total rules applied 390 place count 1965 transition count 2964
Deduced a syphon composed of 531 places in 3 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 531 place count 1965 transition count 2964
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 537 place count 1962 transition count 2964
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 589 place count 1910 transition count 2912
Deduced a syphon composed of 484 places in 3 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 641 place count 1910 transition count 2912
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 641 place count 1910 transition count 2912
Deduced a syphon composed of 485 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 642 place count 1910 transition count 2912
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 643 place count 1909 transition count 2911
Deduced a syphon composed of 484 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 644 place count 1909 transition count 2911
Performed 247 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 731 places in 4 ms
Iterating global reduction 2 with 247 rules applied. Total rules applied 891 place count 1909 transition count 2943
Discarding 132 places :
Symmetric choice reduction at 2 with 132 rule applications. Total rules 1023 place count 1777 transition count 2811
Deduced a syphon composed of 599 places in 3 ms
Iterating global reduction 2 with 132 rules applied. Total rules applied 1155 place count 1777 transition count 2811
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 610 places in 3 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1166 place count 1777 transition count 2867
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 611 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1167 place count 1777 transition count 2871
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1169 place count 1775 transition count 2865
Deduced a syphon composed of 609 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1171 place count 1775 transition count 2865
Deduced a syphon composed of 609 places in 3 ms
Applied a total of 1171 rules in 824 ms. Remains 1775 /1965 variables (removed 190) and now considering 2865/2920 (removed 55) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:24:03] [INFO ] Redundant transitions in 289 ms returned []
Running 2864 sub problems to find dead transitions.
// Phase 1: matrix 2865 rows 1775 cols
[2025-05-30 14:24:03] [INFO ] Computed 264 invariants in 24 ms
[2025-05-30 14:24:03] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1774 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 2864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1774/4640 variables, and 188 constraints, problems are : Problem set: 0 solved, 2864 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/61 constraints, Generalized P Invariants (flows): 188/203 constraints, State Equation: 0/1775 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2864/2864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1774 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 2864 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 Int declared 1774/4640 variables, and 188 constraints, problems are : Problem set: 0 solved, 2864 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/61 constraints, Generalized P Invariants (flows): 188/203 constraints, State Equation: 0/1775 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 0/2864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61156ms problems are : Problem set: 0 solved, 2864 unsolved
Search for dead transitions found 0 dead transitions in 61162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1775/1965 places, 2865/2920 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62289 ms. Remains : 1775/1965 places, 2865/2920 transitions.
Built C files in :
/tmp/ltsmin15137047986916189990
[2025-05-30 14:25:04] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15137047986916189990
Running compilation step : cd /tmp/ltsmin15137047986916189990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15137047986916189990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15137047986916189990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1965 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1965/1965 places, 2920/2920 transitions.
Applied a total of 0 rules in 100 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2025-05-30 14:25:07] [INFO ] Computed 267 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:25:09] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2025-05-30 14:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:25:14] [INFO ] Implicit Places using invariants and state equation in 5699 ms returned []
Implicit Place search using SMT with State Equation took 6961 ms to find 0 implicit places.
Running 2919 sub problems to find dead transitions.
[2025-05-30 14:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 2919/2919 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2919 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 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 Int declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 0/2919 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61068ms problems are : Problem set: 0 solved, 2919 unsolved
Search for dead transitions found 0 dead transitions in 61075ms
Finished structural reductions in LTL mode , in 1 iterations and 68145 ms. Remains : 1965/1965 places, 2920/2920 transitions.
Built C files in :
/tmp/ltsmin10092983119289990490
[2025-05-30 14:26:15] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10092983119289990490
Running compilation step : cd /tmp/ltsmin10092983119289990490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10092983119289990490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10092983119289990490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 14:26:19] [INFO ] Flatten gal took : 96 ms
[2025-05-30 14:26:19] [INFO ] Flatten gal took : 92 ms
[2025-05-30 14:26:19] [INFO ] Time to serialize gal into /tmp/LTL176900413067735640.gal : 27 ms
[2025-05-30 14:26:19] [INFO ] Time to serialize properties into /tmp/LTL10605068929511701299.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL176900413067735640.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3629362697833600670.hoa' '-atoms' '/tmp/LTL10605068929511701299.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10605068929511701299.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3629362697833600670.hoa
Detected timeout of ITS tools.
[2025-05-30 14:26:34] [INFO ] Flatten gal took : 86 ms
[2025-05-30 14:26:34] [INFO ] Flatten gal took : 84 ms
[2025-05-30 14:26:34] [INFO ] Time to serialize gal into /tmp/LTL3404960986789426483.gal : 17 ms
[2025-05-30 14:26:34] [INFO ] Time to serialize properties into /tmp/LTL6945996974954675202.ltl : 4 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3404960986789426483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6945996974954675202.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X("((p707==0)||(p847==1))")))||("((p847==0)&&(p707==1))")))))
Formula 0 simplified : XF(!"((p847==0)&&(p707==1))" & XX!"((p707==0)||(p847==1))")
Detected timeout of ITS tools.
[2025-05-30 14:26:49] [INFO ] Flatten gal took : 78 ms
[2025-05-30 14:26:49] [INFO ] Applying decomposition
[2025-05-30 14:26:49] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11704453681877953493.txt' '-o' '/tmp/graph11704453681877953493.bin' '-w' '/tmp/graph11704453681877953493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11704453681877953493.bin' '-l' '-1' '-v' '-w' '/tmp/graph11704453681877953493.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:26:50] [INFO ] Decomposing Gal with order
[2025-05-30 14:26:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:26:50] [INFO ] Removed a total of 3906 redundant transitions.
[2025-05-30 14:26:50] [INFO ] Flatten gal took : 252 ms
[2025-05-30 14:26:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2025-05-30 14:26:50] [INFO ] Time to serialize gal into /tmp/LTL13732361694880694654.gal : 28 ms
[2025-05-30 14:26:50] [INFO ] Time to serialize properties into /tmp/LTL14552213572574239836.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13732361694880694654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14552213572574239836.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X("((i7.u202.p707==0)||(i9.u282.p847==1))")))||("((i9.u282.p847==0)&&(i7.u202.p707==1))")))))
Formula 0 simplified : XF(!"((i9.u282.p847==0)&&(i7.u202.p707==1))" & XX!"((i7.u202.p707==0)||(i9.u282.p847==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10a-LTLCardinality-05 finished in 258342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 1971 transition count 2539
Reduce places removed 401 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 410 rules applied. Total rules applied 801 place count 1570 transition count 2530
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 810 place count 1561 transition count 2530
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 810 place count 1561 transition count 2244
Deduced a syphon composed of 286 places in 3 ms
Ensure Unique test removed 85 places
Reduce places removed 371 places and 0 transitions.
Iterating global reduction 3 with 657 rules applied. Total rules applied 1467 place count 1190 transition count 2244
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 53 rules applied. Total rules applied 1520 place count 1166 transition count 2215
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1549 place count 1137 transition count 2215
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1549 place count 1137 transition count 2174
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1631 place count 1096 transition count 2174
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1647 place count 1080 transition count 2153
Iterating global reduction 5 with 16 rules applied. Total rules applied 1663 place count 1080 transition count 2153
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 15 rules applied. Total rules applied 1678 place count 1079 transition count 2139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1679 place count 1078 transition count 2139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1679 place count 1078 transition count 2138
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1681 place count 1077 transition count 2138
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 7 with 188 rules applied. Total rules applied 1869 place count 983 transition count 2044
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1871 place count 981 transition count 2042
Iterating global reduction 7 with 2 rules applied. Total rules applied 1873 place count 981 transition count 2042
Applied a total of 1873 rules in 213 ms. Remains 981 /1972 variables (removed 991) and now considering 2042/2931 (removed 889) transitions.
// Phase 1: matrix 2042 rows 981 cols
[2025-05-30 14:27:06] [INFO ] Computed 148 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:06] [INFO ] Implicit Places using invariants in 707 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 542, 547, 549, 609, 626, 632, 637, 639, 648, 701, 722, 728, 733, 735, 795, 812, 818, 823, 825, 885, 902, 908, 913, 915, 978]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 710 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1972 places, 2042/2931 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 930 transition count 2037
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 925 transition count 2037
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 30 place count 905 transition count 2017
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 905 transition count 2017
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 70 place count 885 transition count 1997
Iterating global reduction 2 with 20 rules applied. Total rules applied 90 place count 885 transition count 1997
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 875 transition count 1987
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 875 transition count 1987
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 152 place count 854 transition count 1966
Applied a total of 152 rules in 152 ms. Remains 854 /930 variables (removed 76) and now considering 1966/2042 (removed 76) transitions.
// Phase 1: matrix 1966 rows 854 cols
[2025-05-30 14:27:06] [INFO ] Computed 97 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:07] [INFO ] Implicit Places using invariants in 563 ms returned []
[2025-05-30 14:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:09] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2664 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 854/1972 places, 1966/2931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3739 ms. Remains : 854/1972 places, 1966/2931 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-09
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-09 finished in 3842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1971 transition count 2540
Reduce places removed 400 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 409 rules applied. Total rules applied 799 place count 1571 transition count 2531
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 808 place count 1562 transition count 2531
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 285 Pre rules applied. Total rules applied 808 place count 1562 transition count 2246
Deduced a syphon composed of 285 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 369 places and 0 transitions.
Iterating global reduction 3 with 654 rules applied. Total rules applied 1462 place count 1193 transition count 2246
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 53 rules applied. Total rules applied 1515 place count 1168 transition count 2218
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 29 rules applied. Total rules applied 1544 place count 1140 transition count 2217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1545 place count 1139 transition count 2217
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 1545 place count 1139 transition count 2176
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 1627 place count 1098 transition count 2176
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1642 place count 1083 transition count 2161
Iterating global reduction 6 with 15 rules applied. Total rules applied 1657 place count 1083 transition count 2161
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 14 rules applied. Total rules applied 1671 place count 1083 transition count 2147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1672 place count 1082 transition count 2147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1672 place count 1082 transition count 2146
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1674 place count 1081 transition count 2146
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 8 with 184 rules applied. Total rules applied 1858 place count 989 transition count 2054
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1859 place count 988 transition count 2053
Iterating global reduction 8 with 1 rules applied. Total rules applied 1860 place count 988 transition count 2053
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1861 place count 988 transition count 2053
Applied a total of 1861 rules in 304 ms. Remains 988 /1972 variables (removed 984) and now considering 2053/2931 (removed 878) transitions.
// Phase 1: matrix 2053 rows 988 cols
[2025-05-30 14:27:09] [INFO ] Computed 149 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:10] [INFO ] Implicit Places using invariants in 699 ms returned [72, 91, 97, 102, 161, 178, 184, 189, 191, 251, 268, 274, 279, 281, 341, 358, 364, 369, 371, 431, 448, 454, 459, 461, 521, 538, 544, 549, 551, 611, 628, 634, 639, 641, 704, 725, 731, 736, 737, 741, 801, 818, 824, 829, 831, 891, 908, 914, 919, 921, 985]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 701 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 937/1972 places, 2053/2931 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 916 transition count 2032
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 916 transition count 2032
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 62 place count 896 transition count 2012
Iterating global reduction 0 with 20 rules applied. Total rules applied 82 place count 896 transition count 2012
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 886 transition count 2002
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 886 transition count 2002
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 142 place count 866 transition count 1982
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 865 transition count 1980
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 865 transition count 1980
Applied a total of 144 rules in 174 ms. Remains 865 /937 variables (removed 72) and now considering 1980/2053 (removed 73) transitions.
// Phase 1: matrix 1980 rows 865 cols
[2025-05-30 14:27:10] [INFO ] Computed 98 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:11] [INFO ] Implicit Places using invariants in 534 ms returned []
[2025-05-30 14:27:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:13] [INFO ] Implicit Places using invariants and state equation in 1977 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 865/1972 places, 1980/2931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3691 ms. Remains : 865/1972 places, 1980/2931 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-11
Product exploration explored 100000 steps with 1342 reset in 292 ms.
Product exploration explored 100000 steps with 1324 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (464 resets) in 208 ms. (191 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (59 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2025-05-30 14:27:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 208/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/230 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/629 variables, 45/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/661 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 171/832 variables, 25/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/832 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/854 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/854 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/865 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/865 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1980/2845 variables, 865/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2845 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2845 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2845/2845 variables, and 963 constraints, problems are : Problem set: 0 solved, 1 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 865/865 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 208/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/230 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/629 variables, 45/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:27:15] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/661 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 171/832 variables, 25/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/854 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/854 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/865 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/865 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1980/2845 variables, 865/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2845 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2845 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2845 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2845/2845 variables, and 965 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 865/865 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1820ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 865 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 865/865 places, 1980/1980 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 865 transition count 1978
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 863 transition count 1978
Free-agglomeration rule applied 40 times.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 863 transition count 1938
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 93 place count 823 transition count 1929
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 121 place count 823 transition count 1901
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 149 place count 795 transition count 1901
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 795 transition count 1901
Applied a total of 150 rules in 139 ms. Remains 795 /865 variables (removed 70) and now considering 1901/1980 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 795/865 places, 1901/1980 transitions.
RANDOM walk for 40000 steps (654 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (89 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 55479 steps, run visited all 1 properties in 714 ms. (steps per millisecond=77 )
Probabilistic random walk after 55479 steps, saw 40665 distinct states, run finished after 717 ms. (steps per millisecond=77 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 1980/1980 transitions.
Applied a total of 0 rules in 41 ms. Remains 865 /865 variables (removed 0) and now considering 1980/1980 (removed 0) transitions.
[2025-05-30 14:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:18] [INFO ] Implicit Places using invariants in 565 ms returned []
[2025-05-30 14:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:27:20] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2680 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:27:20] [INFO ] Redundant transitions in 146 ms returned []
Running 1924 sub problems to find dead transitions.
[2025-05-30 14:27:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/864 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 1924 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 864/2845 variables, and 94 constraints, problems are : Problem set: 0 solved, 1924 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 81/82 constraints, State Equation: 0/865 constraints, PredecessorRefiner: 1924/1924 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1924 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/864 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:27:56] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 10 ms to minimize.
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 Int declared 864/2845 variables, and 95 constraints, problems are : Problem set: 0 solved, 1924 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 81/82 constraints, State Equation: 0/865 constraints, PredecessorRefiner: 0/1924 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 1924 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63523 ms. Remains : 865/865 places, 1980/1980 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (474 resets) in 124 ms. (320 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (58 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2025-05-30 14:28:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 208/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/230 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/629 variables, 45/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/661 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 171/832 variables, 25/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/832 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/854 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/854 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/865 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/865 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1980/2845 variables, 865/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2845 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2845 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2845/2845 variables, and 963 constraints, problems are : Problem set: 0 solved, 1 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 865/865 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 208/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/230 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/629 variables, 45/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:28:22] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/661 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 171/832 variables, 25/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/854 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/854 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/865 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/865 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1980/2845 variables, 865/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2845 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2845 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2845 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2845/2845 variables, and 965 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 865/865 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1865ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 150 ms.
Support contains 2 out of 865 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 865/865 places, 1980/1980 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 865 transition count 1978
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 863 transition count 1978
Free-agglomeration rule applied 40 times.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 863 transition count 1938
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 93 place count 823 transition count 1929
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 121 place count 823 transition count 1901
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 149 place count 795 transition count 1901
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 795 transition count 1901
Applied a total of 150 rules in 135 ms. Remains 795 /865 variables (removed 70) and now considering 1901/1980 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 795/865 places, 1901/1980 transitions.
RANDOM walk for 40000 steps (591 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (88 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 55479 steps, run visited all 1 properties in 721 ms. (steps per millisecond=76 )
Probabilistic random walk after 55479 steps, saw 40665 distinct states, run finished after 721 ms. (steps per millisecond=76 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1340 reset in 248 ms.
Product exploration explored 100000 steps with 1339 reset in 387 ms.
Built C files in :
/tmp/ltsmin1617066168952924727
[2025-05-30 14:28:25] [INFO ] Too many transitions (1980) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:28:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1617066168952924727
Running compilation step : cd /tmp/ltsmin1617066168952924727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1617066168952924727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1617066168952924727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 1980/1980 transitions.
Applied a total of 0 rules in 39 ms. Remains 865 /865 variables (removed 0) and now considering 1980/1980 (removed 0) transitions.
[2025-05-30 14:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:28:29] [INFO ] Implicit Places using invariants in 540 ms returned []
[2025-05-30 14:28:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:28:31] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:28:31] [INFO ] Redundant transitions in 44 ms returned []
Running 1924 sub problems to find dead transitions.
[2025-05-30 14:28:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/864 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/2845 variables, and 94 constraints, problems are : Problem set: 0 solved, 1924 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 81/82 constraints, State Equation: 0/865 constraints, PredecessorRefiner: 1924/1924 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1924 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/864 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:29:06] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/2845 variables, and 95 constraints, problems are : Problem set: 0 solved, 1924 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 81/82 constraints, State Equation: 0/865 constraints, PredecessorRefiner: 0/1924 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60650ms problems are : Problem set: 0 solved, 1924 unsolved
Search for dead transitions found 0 dead transitions in 60653ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63281 ms. Remains : 865/865 places, 1980/1980 transitions.
Built C files in :
/tmp/ltsmin6090820078931708758
[2025-05-30 14:29:31] [INFO ] Too many transitions (1980) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:29:31] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6090820078931708758
Running compilation step : cd /tmp/ltsmin6090820078931708758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6090820078931708758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6090820078931708758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 14:29:35] [INFO ] Flatten gal took : 62 ms
[2025-05-30 14:29:35] [INFO ] Flatten gal took : 60 ms
[2025-05-30 14:29:35] [INFO ] Time to serialize gal into /tmp/LTL15082262965748813711.gal : 10 ms
[2025-05-30 14:29:35] [INFO ] Time to serialize properties into /tmp/LTL3727911065762576165.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15082262965748813711.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9457794659067208917.hoa' '-atoms' '/tmp/LTL3727911065762576165.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3727911065762576165.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9457794659067208917.hoa
Detected timeout of ITS tools.
[2025-05-30 14:29:50] [INFO ] Flatten gal took : 54 ms
[2025-05-30 14:29:50] [INFO ] Flatten gal took : 55 ms
[2025-05-30 14:29:50] [INFO ] Time to serialize gal into /tmp/LTL14283165805914737965.gal : 9 ms
[2025-05-30 14:29:50] [INFO ] Time to serialize properties into /tmp/LTL8326337784540897655.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14283165805914737965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8326337784540897655.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(p2165!=1)"))&&(F(G("((p1400==0)||(p132==1))"))))))
Formula 0 simplified : F(G!"(p2165!=1)" | GF!"((p1400==0)||(p132==1))")
Detected timeout of ITS tools.
[2025-05-30 14:30:05] [INFO ] Flatten gal took : 55 ms
[2025-05-30 14:30:05] [INFO ] Applying decomposition
[2025-05-30 14:30:05] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5400466902890328663.txt' '-o' '/tmp/graph5400466902890328663.bin' '-w' '/tmp/graph5400466902890328663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5400466902890328663.bin' '-l' '-1' '-v' '-w' '/tmp/graph5400466902890328663.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:30:05] [INFO ] Decomposing Gal with order
[2025-05-30 14:30:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:30:05] [INFO ] Removed a total of 3907 redundant transitions.
[2025-05-30 14:30:05] [INFO ] Flatten gal took : 131 ms
[2025-05-30 14:30:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 38 ms.
[2025-05-30 14:30:05] [INFO ] Time to serialize gal into /tmp/LTL18217809550223011369.gal : 13 ms
[2025-05-30 14:30:05] [INFO ] Time to serialize properties into /tmp/LTL17435376656547586376.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18217809550223011369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17435376656547586376.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("(i20.u213.p2165!=1)"))&&(F(G("((i14.u145.p1400==0)||(i1.u27.p132==1))"))))))
Formula 0 simplified : F(G!"(i20.u213.p2165!=1)" | GF!"((i14.u145.p1400==0)||(i1.u27.p132==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10a-LTLCardinality-11 finished in 191430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
Support contains 4 out of 1972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 1971 transition count 2543
Reduce places removed 397 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 406 rules applied. Total rules applied 793 place count 1574 transition count 2534
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 802 place count 1565 transition count 2534
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 802 place count 1565 transition count 2250
Deduced a syphon composed of 284 places in 2 ms
Ensure Unique test removed 84 places
Reduce places removed 368 places and 0 transitions.
Iterating global reduction 3 with 652 rules applied. Total rules applied 1454 place count 1197 transition count 2250
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 54 rules applied. Total rules applied 1508 place count 1172 transition count 2221
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1537 place count 1143 transition count 2221
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1537 place count 1143 transition count 2180
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1619 place count 1102 transition count 2180
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1634 place count 1087 transition count 2160
Iterating global reduction 5 with 15 rules applied. Total rules applied 1649 place count 1087 transition count 2160
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 15 rules applied. Total rules applied 1664 place count 1086 transition count 2146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1665 place count 1085 transition count 2146
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 7 with 184 rules applied. Total rules applied 1849 place count 993 transition count 2054
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1851 place count 991 transition count 2052
Iterating global reduction 7 with 2 rules applied. Total rules applied 1853 place count 991 transition count 2052
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1854 place count 991 transition count 2052
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1855 place count 990 transition count 2051
Iterating global reduction 7 with 1 rules applied. Total rules applied 1856 place count 990 transition count 2051
Applied a total of 1856 rules in 327 ms. Remains 990 /1972 variables (removed 982) and now considering 2051/2931 (removed 880) transitions.
// Phase 1: matrix 2051 rows 990 cols
[2025-05-30 14:30:21] [INFO ] Computed 148 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:30:22] [INFO ] Implicit Places using invariants in 675 ms returned [72, 89, 95, 100, 160, 177, 183, 188, 190, 250, 267, 273, 278, 280, 340, 357, 363, 368, 370, 430, 447, 453, 458, 460, 520, 537, 543, 548, 550, 610, 635, 640, 642, 651, 704, 725, 731, 738, 740, 800, 817, 823, 828, 830, 890, 907, 913, 918, 920, 987]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 686 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1972 places, 2051/2931 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 940 transition count 2046
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 935 transition count 2045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 934 transition count 2045
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 30 place count 916 transition count 2027
Iterating global reduction 3 with 18 rules applied. Total rules applied 48 place count 916 transition count 2027
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 66 place count 898 transition count 2009
Iterating global reduction 3 with 18 rules applied. Total rules applied 84 place count 898 transition count 2009
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 93 place count 889 transition count 2000
Iterating global reduction 3 with 9 rules applied. Total rules applied 102 place count 889 transition count 2000
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 144 place count 868 transition count 1979
Applied a total of 144 rules in 171 ms. Remains 868 /940 variables (removed 72) and now considering 1979/2051 (removed 72) transitions.
// Phase 1: matrix 1979 rows 868 cols
[2025-05-30 14:30:22] [INFO ] Computed 98 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:30:22] [INFO ] Implicit Places using invariants in 557 ms returned []
[2025-05-30 14:30:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:30:24] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 868/1972 places, 1979/2931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3747 ms. Remains : 868/1972 places, 1979/2931 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-12
Product exploration explored 100000 steps with 1169 reset in 277 ms.
Product exploration explored 100000 steps with 1243 reset in 291 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 30961 steps (372 resets) in 196 ms. (157 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 44 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2025-05-30 14:30:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:30:26] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-05-30 14:30:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:30:28] [INFO ] Implicit Places using invariants and state equation in 1984 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:30:28] [INFO ] Redundant transitions in 48 ms returned []
Running 1923 sub problems to find dead transitions.
[2025-05-30 14:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 867/2847 variables, and 92 constraints, problems are : Problem set: 0 solved, 1923 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 78/81 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1923/1923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1923 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
timeout
(s523 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 867/2847 variables, and 92 constraints, problems are : Problem set: 0 solved, 1923 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 78/81 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 0/1923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 1923 unsolved
Search for dead transitions found 0 dead transitions in 60633ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63279 ms. Remains : 868/868 places, 1979/1979 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 27591 steps (332 resets) in 110 ms. (248 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1237 reset in 256 ms.
Product exploration explored 100000 steps with 1248 reset in 278 ms.
Built C files in :
/tmp/ltsmin2657121442624213066
[2025-05-30 14:31:30] [INFO ] Too many transitions (1979) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:31:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2657121442624213066
Running compilation step : cd /tmp/ltsmin2657121442624213066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2657121442624213066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2657121442624213066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 34 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2025-05-30 14:31:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:31:34] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-05-30 14:31:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:31:36] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:31:36] [INFO ] Redundant transitions in 42 ms returned []
Running 1923 sub problems to find dead transitions.
[2025-05-30 14:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)timeout

(s335 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 867/2847 variables, and 92 constraints, problems are : Problem set: 0 solved, 1923 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 78/81 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1923/1923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1923 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 1923 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 Int declared 867/2847 variables, and 92 constraints, problems are : Problem set: 0 solved, 1923 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 78/81 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 0/1923 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 1923 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63249 ms. Remains : 868/868 places, 1979/1979 transitions.
Built C files in :
/tmp/ltsmin12044183660510015480
[2025-05-30 14:32:36] [INFO ] Too many transitions (1979) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:32:36] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12044183660510015480
Running compilation step : cd /tmp/ltsmin12044183660510015480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12044183660510015480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12044183660510015480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 14:32:40] [INFO ] Flatten gal took : 55 ms
[2025-05-30 14:32:40] [INFO ] Flatten gal took : 57 ms
[2025-05-30 14:32:40] [INFO ] Time to serialize gal into /tmp/LTL5558588768801966767.gal : 12 ms
[2025-05-30 14:32:40] [INFO ] Time to serialize properties into /tmp/LTL14250513236123868987.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5558588768801966767.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10114178913437523282.hoa' '-atoms' '/tmp/LTL14250513236123868987.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14250513236123868987.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10114178913437523282.hoa
Detected timeout of ITS tools.
[2025-05-30 14:32:55] [INFO ] Flatten gal took : 52 ms
[2025-05-30 14:32:55] [INFO ] Flatten gal took : 54 ms
[2025-05-30 14:32:55] [INFO ] Time to serialize gal into /tmp/LTL1260992584782411566.gal : 8 ms
[2025-05-30 14:32:55] [INFO ] Time to serialize properties into /tmp/LTL12102186329161459075.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1260992584782411566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12102186329161459075.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p216==0)||(p1314==1))")||((("((p216==0)||(p1314==1))")U("(((p216==0)||(p1314==1))&&(!((p1535==0)||(p2067==1))))"))||("((p15...181
Formula 0 simplified : FG(!"((p216==0)||(p1314==1))" & !"((p1535!=0)&&(p2067!=1))" & (!"((p216==0)||(p1314==1))" R !"(((p216==0)||(p1314==1))&&(!((p1535==0...174
Detected timeout of ITS tools.
[2025-05-30 14:33:10] [INFO ] Flatten gal took : 53 ms
[2025-05-30 14:33:10] [INFO ] Applying decomposition
[2025-05-30 14:33:10] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13282014175904157495.txt' '-o' '/tmp/graph13282014175904157495.bin' '-w' '/tmp/graph13282014175904157495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13282014175904157495.bin' '-l' '-1' '-v' '-w' '/tmp/graph13282014175904157495.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:33:10] [INFO ] Decomposing Gal with order
[2025-05-30 14:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:33:10] [INFO ] Removed a total of 3922 redundant transitions.
[2025-05-30 14:33:10] [INFO ] Flatten gal took : 92 ms
[2025-05-30 14:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 29 ms.
[2025-05-30 14:33:10] [INFO ] Time to serialize gal into /tmp/LTL14432407594661401783.gal : 12 ms
[2025-05-30 14:33:10] [INFO ] Time to serialize properties into /tmp/LTL17966946903817532804.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14432407594661401783.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17966946903817532804.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.u26.p216==0)||(i14.u138.p1314==1))")||((("((i1.u26.p216==0)||(i14.u138.p1314==1))")U("(((i1.u26.p216==0)||(i14.u138.p131...265
Formula 0 simplified : FG(!"((i1.u26.p216==0)||(i14.u138.p1314==1))" & !"((i15.u157.p1535!=0)&&(i20.u215.p2067!=1))" & (!"((i1.u26.p216==0)||(i14.u138.p131...258
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10a-LTLCardinality-12 finished in 184828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 4 out of 1972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1969 transition count 2923
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1969 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1968 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1968 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1967 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1967 transition count 2921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1966 transition count 2920
Applied a total of 12 rules in 452 ms. Remains 1966 /1972 variables (removed 6) and now considering 2920/2931 (removed 11) transitions.
// Phase 1: matrix 2920 rows 1966 cols
[2025-05-30 14:33:26] [INFO ] Computed 268 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:33:27] [INFO ] Implicit Places using invariants in 1176 ms returned [1296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1972 places, 2920/2931 transitions.
Applied a total of 0 rules in 89 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1721 ms. Remains : 1965/1972 places, 2920/2931 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-13 finished in 1872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1972/1972 places, 2931/2931 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1971 transition count 2540
Reduce places removed 400 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 409 rules applied. Total rules applied 799 place count 1571 transition count 2531
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 808 place count 1562 transition count 2531
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 285 Pre rules applied. Total rules applied 808 place count 1562 transition count 2246
Deduced a syphon composed of 285 places in 2 ms
Ensure Unique test removed 84 places
Reduce places removed 369 places and 0 transitions.
Iterating global reduction 3 with 654 rules applied. Total rules applied 1462 place count 1193 transition count 2246
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 53 rules applied. Total rules applied 1515 place count 1169 transition count 2217
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1544 place count 1140 transition count 2217
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1544 place count 1140 transition count 2177
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1624 place count 1100 transition count 2177
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1640 place count 1084 transition count 2156
Iterating global reduction 5 with 16 rules applied. Total rules applied 1656 place count 1084 transition count 2156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 15 rules applied. Total rules applied 1671 place count 1083 transition count 2142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1672 place count 1082 transition count 2142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1672 place count 1082 transition count 2141
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1674 place count 1081 transition count 2141
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 7 with 190 rules applied. Total rules applied 1864 place count 986 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1866 place count 984 transition count 2044
Iterating global reduction 7 with 2 rules applied. Total rules applied 1868 place count 984 transition count 2044
Applied a total of 1868 rules in 241 ms. Remains 984 /1972 variables (removed 988) and now considering 2044/2931 (removed 887) transitions.
// Phase 1: matrix 2044 rows 984 cols
[2025-05-30 14:33:28] [INFO ] Computed 149 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:33:28] [INFO ] Implicit Places using invariants in 685 ms returned [72, 89, 95, 100, 159, 179, 185, 190, 192, 252, 269, 275, 280, 282, 342, 359, 365, 370, 372, 432, 449, 455, 460, 462, 522, 539, 545, 550, 552, 612, 629, 635, 640, 642, 651, 704, 725, 731, 736, 738, 798, 815, 821, 826, 828, 888, 905, 911, 916, 918, 981]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 687 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1972 places, 2044/2931 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 933 transition count 2039
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 928 transition count 2039
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 29 place count 909 transition count 2020
Iterating global reduction 2 with 19 rules applied. Total rules applied 48 place count 909 transition count 2020
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 67 place count 890 transition count 2001
Iterating global reduction 2 with 19 rules applied. Total rules applied 86 place count 890 transition count 2001
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 95 place count 881 transition count 1992
Iterating global reduction 2 with 9 rules applied. Total rules applied 104 place count 881 transition count 1992
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 146 place count 860 transition count 1971
Applied a total of 146 rules in 154 ms. Remains 860 /933 variables (removed 73) and now considering 1971/2044 (removed 73) transitions.
// Phase 1: matrix 1971 rows 860 cols
[2025-05-30 14:33:28] [INFO ] Computed 98 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:33:29] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-05-30 14:33:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:33:31] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2461 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 860/1972 places, 1971/2931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3543 ms. Remains : 860/1972 places, 1971/2931 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-15
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-15 finished in 3661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
[2025-05-30 14:33:31] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2868699139673718112
[2025-05-30 14:33:31] [INFO ] Too many transitions (2931) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:33:31] [INFO ] Applying decomposition
[2025-05-30 14:33:31] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2868699139673718112
Running compilation step : cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 14:33:31] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6464388202299339307.txt' '-o' '/tmp/graph6464388202299339307.bin' '-w' '/tmp/graph6464388202299339307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6464388202299339307.bin' '-l' '-1' '-v' '-w' '/tmp/graph6464388202299339307.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:33:32] [INFO ] Decomposing Gal with order
[2025-05-30 14:33:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:33:32] [INFO ] Removed a total of 3903 redundant transitions.
[2025-05-30 14:33:32] [INFO ] Flatten gal took : 121 ms
[2025-05-30 14:33:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 19 ms.
[2025-05-30 14:33:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality12212957259928759130.gal : 19 ms
[2025-05-30 14:33:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality9027103927762313261.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12212957259928759130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9027103927762313261.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(G(("((i9.u284.p847==0)&&(i7.u202.p707==1))")||(X(X("((i7.u202.p707==0)||(i9.u284.p847==1))")))))))
Formula 0 simplified : XF(!"((i9.u284.p847==0)&&(i7.u202.p707==1))" & XX!"((i7.u202.p707==0)||(i9.u284.p847==1))")
Compilation finished in 6915 ms.
Running link step : cd /tmp/ltsmin2868699139673718112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp2==true))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp2==true))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((((LTLAPp5==true) U (LTLAPp6==true))||(LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((((LTLAPp5==true) U (LTLAPp6==true))||(LTLAPp4==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2868699139673718112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 14:58:11] [INFO ] Applying decomposition
[2025-05-30 14:58:12] [INFO ] Flatten gal took : 192 ms
[2025-05-30 14:58:12] [INFO ] Decomposing Gal with order
[2025-05-30 14:58:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:58:12] [INFO ] Removed a total of 3259 redundant transitions.
[2025-05-30 14:58:12] [INFO ] Flatten gal took : 437 ms
[2025-05-30 14:58:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1268 labels/synchronizations in 155 ms.
[2025-05-30 14:58:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality8371233951646619344.gal : 35 ms
[2025-05-30 14:58:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality3095374860381856037.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8371233951646619344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3095374860381856037.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((X(G(("((u145.p847==0)&&(i29.u118.p707==1))")||(X(X("((i29.u118.p707==0)||(u145.p847==1))")))))))
Formula 0 simplified : XF(!"((u145.p847==0)&&(i29.u118.p707==1))" & XX!"((i29.u118.p707==0)||(u145.p847==1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ASLink-PT-10a"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729200427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;