Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729200411.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-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729200411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 839K 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-09a-LTLCardinality-00
FORMULA_NAME ASLink-PT-09a-LTLCardinality-01
FORMULA_NAME ASLink-PT-09a-LTLCardinality-02
FORMULA_NAME ASLink-PT-09a-LTLCardinality-03
FORMULA_NAME ASLink-PT-09a-LTLCardinality-04
FORMULA_NAME ASLink-PT-09a-LTLCardinality-05
FORMULA_NAME ASLink-PT-09a-LTLCardinality-06
FORMULA_NAME ASLink-PT-09a-LTLCardinality-07
FORMULA_NAME ASLink-PT-09a-LTLCardinality-08
FORMULA_NAME ASLink-PT-09a-LTLCardinality-09
FORMULA_NAME ASLink-PT-09a-LTLCardinality-10
FORMULA_NAME ASLink-PT-09a-LTLCardinality-11
FORMULA_NAME ASLink-PT-09a-LTLCardinality-12
FORMULA_NAME ASLink-PT-09a-LTLCardinality-13
FORMULA_NAME ASLink-PT-09a-LTLCardinality-14
FORMULA_NAME ASLink-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748607548091

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-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 12:19:09] [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 12:19:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:19:09] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2025-05-30 12:19:09] [INFO ] Transformed 1991 places.
[2025-05-30 12:19:09] [INFO ] Transformed 2919 transitions.
[2025-05-30 12:19:09] [INFO ] Found NUPN structural information;
[2025-05-30 12:19:09] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-09a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 1991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 1937 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 1924 transition count 2827
Ensure Unique test removed 1 places
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 1923 transition count 2827
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 1923 transition count 2825
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1922 transition count 2817
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1922 transition count 2817
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1921 transition count 2809
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1921 transition count 2809
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1920 transition count 2801
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1920 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1919 transition count 2793
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1919 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1918 transition count 2785
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1918 transition count 2785
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1917 transition count 2777
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1917 transition count 2777
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1916 transition count 2769
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1916 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1915 transition count 2761
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1915 transition count 2761
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1914 transition count 2753
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1914 transition count 2753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1913 transition count 2745
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1913 transition count 2745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1912 transition count 2737
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1912 transition count 2737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1911 transition count 2729
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1911 transition count 2729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1910 transition count 2721
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1910 transition count 2721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1909 transition count 2713
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1909 transition count 2713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1908 transition count 2705
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1908 transition count 2705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1907 transition count 2697
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1907 transition count 2697
Applied a total of 115 rules in 1673 ms. Remains 1907 /1991 variables (removed 84) and now considering 2697/2888 (removed 191) transitions.
// Phase 1: matrix 2697 rows 1907 cols
[2025-05-30 12:19:11] [INFO ] Computed 329 invariants in 201 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:13] [INFO ] Implicit Places using invariants in 1844 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 598, 616, 634, 763, 779, 784, 785, 786, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1328, 1344, 1348, 1349, 1350, 1368, 1386, 1515, 1531, 1536, 1537, 1538, 1556, 1574, 1703, 1708, 1720, 1725, 1726, 1727, 1745, 1747, 1750, 1769, 1770, 1771, 1788, 1796, 1804, 1810, 1816, 1822, 1828, 1836, 1842, 1848, 1856]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 1880 ms to find 85 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1822/1991 places, 2697/2888 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1809 transition count 2684
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1809 transition count 2684
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1799 transition count 2674
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1799 transition count 2674
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1794 transition count 2669
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1794 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1792 transition count 2667
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1792 transition count 2667
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1790 transition count 2665
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1790 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1789 transition count 2664
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1789 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1788 transition count 2663
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1788 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1787 transition count 2662
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1787 transition count 2662
Applied a total of 70 rules in 1033 ms. Remains 1787 /1822 variables (removed 35) and now considering 2662/2697 (removed 35) transitions.
// Phase 1: matrix 2662 rows 1787 cols
[2025-05-30 12:19:14] [INFO ] Computed 244 invariants in 106 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:15] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2025-05-30 12:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:19] [INFO ] Implicit Places using invariants and state equation in 4231 ms returned []
Implicit Place search using SMT with State Equation took 5409 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1787/1991 places, 2662/2888 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10009 ms. Remains : 1787/1991 places, 2662/2888 transitions.
Support contains 25 out of 1787 places after structural reductions.
[2025-05-30 12:19:20] [INFO ] Flatten gal took : 198 ms
[2025-05-30 12:19:20] [INFO ] Flatten gal took : 142 ms
[2025-05-30 12:19:20] [INFO ] Input system was already deterministic with 2662 transitions.
Support contains 22 out of 1787 places (down from 25) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (167 resets) in 1517 ms. (26 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (14 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (15 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (16 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (15 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
[2025-05-30 12:19: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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 179/194 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 582/776 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/776 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1011/1787 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1787 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2662/4449 variables, 1787/2031 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4449 variables, 0/2031 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/4449 variables, 0/2031 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4449/4449 variables, and 2031 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3464 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 186/186 constraints, State Equation: 1787/1787 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 179/194 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 582/776 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/776 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1011/1787 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:19:25] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1787 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1787 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2662/4449 variables, 1787/2032 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4449 variables, 7/2039 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4449/4449 variables, and 2039 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 186/186 constraints, State Equation: 1787/1787 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8542ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 1787 transition count 2332
Reduce places removed 330 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 333 rules applied. Total rules applied 663 place count 1457 transition count 2329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 666 place count 1454 transition count 2329
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 666 place count 1454 transition count 2092
Deduced a syphon composed of 237 places in 2 ms
Ensure Unique test removed 76 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 550 rules applied. Total rules applied 1216 place count 1141 transition count 2092
Discarding 8 places :
Implicit places reduction removed 8 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 3 with 9 rules applied. Total rules applied 1225 place count 1133 transition count 2091
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1226 place count 1132 transition count 2091
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 1226 place count 1132 transition count 2055
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1298 place count 1096 transition count 2055
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1300 place count 1094 transition count 2053
Iterating global reduction 5 with 2 rules applied. Total rules applied 1302 place count 1094 transition count 2053
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 1 rules applied. Total rules applied 1303 place count 1094 transition count 2052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1304 place count 1093 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1304 place count 1093 transition count 2051
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1306 place count 1092 transition count 2051
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 8 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 1498 place count 996 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1499 place count 995 transition count 1954
Iterating global reduction 7 with 1 rules applied. Total rules applied 1500 place count 995 transition count 1954
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1508 place count 995 transition count 1946
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1516 place count 987 transition count 1946
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 8 with 45 rules applied. Total rules applied 1561 place count 987 transition count 1901
Ensure Unique test removed 2 places
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 8 with 47 rules applied. Total rules applied 1608 place count 940 transition count 1901
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1616 place count 940 transition count 1893
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1617 place count 940 transition count 1892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1618 place count 939 transition count 1892
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1644 place count 939 transition count 1892
Applied a total of 1644 rules in 741 ms. Remains 939 /1787 variables (removed 848) and now considering 1892/2662 (removed 770) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 939/1787 places, 1892/2662 transitions.
RANDOM walk for 40000 steps (523 resets) in 481 ms. (82 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (60 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (62 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (58 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
// Phase 1: matrix 1892 rows 939 cols
[2025-05-30 12:19:31] [INFO ] Computed 158 invariants in 16 ms
[2025-05-30 12:19:31] [INFO ] State equation strengthened by 43 read => feed constraints.
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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 153/168 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 596/764 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 175/939 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1892/2831 variables, 939/1097 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2831 variables, 43/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2831 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/2831 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2831/2831 variables, and 1140 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2011 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 939/939 constraints, ReadFeed: 43/43 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 153/168 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 596/764 variables, 94/122 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 12:19:33] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 175/939 variables, 36/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1892/2831 variables, 939/1098 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2831 variables, 43/1141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2831 variables, 6/1147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2831 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2831/2831 variables, and 1147 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 939/939 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47071ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 939 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 939/939 places, 1892/1892 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 939 transition count 1892
Applied a total of 1 rules in 106 ms. Remains 939 /939 variables (removed 0) and now considering 1892/1892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 939/939 places, 1892/1892 transitions.
RANDOM walk for 40000 steps (504 resets) in 466 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (57 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (61 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (61 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 295146 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :2 out of 6
Probabilistic random walk after 295146 steps, saw 64486 distinct states, run finished after 3007 ms. (steps per millisecond=98 ) properties seen :2
// Phase 1: matrix 1892 rows 939 cols
[2025-05-30 12:20:21] [INFO ] Computed 158 invariants in 18 ms
[2025-05-30 12:20:21] [INFO ] State equation strengthened by 43 read => feed constraints.
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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 153/162 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 594/756 variables, 93/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 183/939 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1892/2831 variables, 939/1097 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2831 variables, 43/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2831 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2831 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2831/2831 variables, and 1140 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 939/939 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 153/162 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 594/756 variables, 93/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:23] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 183/939 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1892/2831 variables, 939/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2831 variables, 43/1141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2831 variables, 4/1145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2831 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2831 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2831/2831 variables, and 1145 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44703 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 939/939 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45872ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7854 ms.
Support contains 7 out of 939 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 939/939 places, 1892/1892 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 0 with 1 rules applied. Total rules applied 1 place count 939 transition count 1891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 938 transition count 1891
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 933 transition count 1886
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 933 transition count 1881
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 26 place count 924 transition count 1881
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 29 place count 921 transition count 1878
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 920 transition count 1878
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 920 transition count 1875
Applied a total of 36 rules in 139 ms. Remains 920 /939 variables (removed 19) and now considering 1875/1892 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 920/939 places, 1875/1892 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(p0))'
Support contains 2 out of 1787 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1786 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1786 transition count 2656
Applied a total of 2 rules in 122 ms. Remains 1786 /1787 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
// Phase 1: matrix 2656 rows 1786 cols
[2025-05-30 12:21:16] [INFO ] Computed 244 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:17] [INFO ] Implicit Places using invariants in 1126 ms returned [210, 1696]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1128 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1787 places, 2656/2662 transitions.
Applied a total of 0 rules in 63 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1313 ms. Remains : 1784/1787 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-09a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLCardinality-00 finished in 1593 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((X((F(p1) U X((F(p2) U p3))))||p0)))'
Support contains 4 out of 1787 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1786 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1786 transition count 2656
Applied a total of 2 rules in 125 ms. Remains 1786 /1787 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
[2025-05-30 12:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:18] [INFO ] Implicit Places using invariants in 1134 ms returned [210, 1696]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1137 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1787 places, 2656/2662 transitions.
Applied a total of 0 rules in 66 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1329 ms. Remains : 1784/1787 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-02
Product exploration explored 100000 steps with 475 reset in 495 ms.
Product exploration explored 100000 steps with 423 reset in 427 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 p0 p1 (NOT p3) p2), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (181 resets) in 242 ms. (164 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (15 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (14 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
// Phase 1: matrix 2656 rows 1784 cols
[2025-05-30 12:21:20] [INFO ] Computed 242 invariants in 19 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 684/745 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/745 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1031/1776 variables, 186/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1776 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/1784 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1784 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2656/4440 variables, 1784/2026 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4440 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/4440 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4440/4440 variables, and 2026 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 187/187 constraints, State Equation: 1784/1784 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 684/745 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/745 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1031/1776 variables, 186/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1776 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/1784 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1784 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2656/4440 variables, 1784/2026 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4440 variables, 5/2031 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 12:21:24] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4440 variables, 1/2032 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4440 variables, 0/2032 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/4440 variables, 0/2032 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4440/4440 variables, and 2032 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4429 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 187/187 constraints, State Equation: 1784/1784 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6434ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2961 ms.
Support contains 4 out of 1784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 1784 transition count 2305
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 1433 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 1432 transition count 2304
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 704 place count 1432 transition count 2065
Deduced a syphon composed of 239 places in 2 ms
Ensure Unique test removed 76 places
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 554 rules applied. Total rules applied 1258 place count 1117 transition count 2065
Discarding 13 places :
Implicit places reduction removed 13 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 3 with 22 rules applied. Total rules applied 1280 place count 1104 transition count 2056
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1289 place count 1095 transition count 2056
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 1289 place count 1095 transition count 2021
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1359 place count 1060 transition count 2021
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1364 place count 1055 transition count 2016
Iterating global reduction 5 with 5 rules applied. Total rules applied 1369 place count 1055 transition count 2016
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 5 with 4 rules applied. Total rules applied 1373 place count 1055 transition count 2012
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1374 place count 1054 transition count 2012
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1374 place count 1054 transition count 2011
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 1376 place count 1053 transition count 2011
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 1568 place count 957 transition count 1915
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1577 place count 957 transition count 1906
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1586 place count 948 transition count 1906
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1622 place count 948 transition count 1870
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 1659 place count 911 transition count 1870
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1668 place count 911 transition count 1861
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1695 place count 911 transition count 1861
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1696 place count 910 transition count 1860
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1704 place count 902 transition count 1860
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 16 Pre rules applied. Total rules applied 1704 place count 902 transition count 1844
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1744 place count 878 transition count 1844
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1752 place count 870 transition count 1836
Iterating global reduction 10 with 8 rules applied. Total rules applied 1760 place count 870 transition count 1836
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1768 place count 870 transition count 1828
Applied a total of 1768 rules in 403 ms. Remains 870 /1784 variables (removed 914) and now considering 1828/2656 (removed 828) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 870/1784 places, 1828/2656 transitions.
RANDOM walk for 40000 steps (587 resets) in 302 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (77 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (72 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (74 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (73 resets) in 78 ms. (506 steps per ms) remains 4/5 properties
// Phase 1: matrix 1828 rows 870 cols
[2025-05-30 12:21:30] [INFO ] Computed 136 invariants in 14 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 176/199 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 32/231 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 370/601 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/610 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 201/811 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/811 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/816 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/816 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/817 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/817 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 53/870 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/870 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1828/2698 variables, 870/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2698 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/2698 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2698/2698 variables, and 1006 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 176/199 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 32/231 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 370/601 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/610 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 201/811 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/811 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/816 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/816 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/817 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/817 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 53/870 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/870 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1828/2698 variables, 870/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2698 variables, 4/1010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2698 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/2698 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2698/2698 variables, and 1010 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2434 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3533ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 282 steps, including 1 resets, run visited all 4 properties in 3 ms. (steps per millisecond=94 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT p0)), (F (NOT (OR p1 p3 p2))), (F (NOT p2)), (F (NOT (OR p1 p3))), (F p3)]
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Applied a total of 0 rules in 60 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
// Phase 1: matrix 2656 rows 1784 cols
[2025-05-30 12:21:34] [INFO ] Computed 242 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:36] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2025-05-30 12:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:41] [INFO ] Implicit Places using invariants and state equation in 5876 ms returned []
Implicit Place search using SMT with State Equation took 6962 ms to find 0 implicit places.
Running 2655 sub problems to find dead transitions.
[2025-05-30 12:21:41] [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/1783 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 2655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1783/4440 variables, and 172 constraints, problems are : Problem set: 0 solved, 2655 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 172/187 constraints, State Equation: 0/1784 constraints, PredecessorRefiner: 2655/2655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2655 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1783 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 2655 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 16)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 11)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 7)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 8)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 12)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 2)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 3)
(s201 1)
(s202 2)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 11)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 1)
(s232 1)
(s233 1)
(s234 0)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 11)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 7)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 8)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 12)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 2)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 16)
(s368 1)
(s369 1)
(s370 16)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 3)
(s382 1)
(s383 1)
(s384 1)
(s385 2)
(s386 1)
(s387 1)
(s388 3)
(s389 1)
(s390 1)
(s391 11)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 0)
(s415 0)timeout

(s416 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1783/4440 variables, and 172 constraints, problems are : Problem set: 0 solved, 2655 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 172/187 constraints, State Equation: 0/1784 constraints, PredecessorRefiner: 0/2655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61281ms problems are : Problem set: 0 solved, 2655 unsolved
Search for dead transitions found 0 dead transitions in 61292ms
Finished structural reductions in LTL mode , in 1 iterations and 68328 ms. Remains : 1784/1784 places, 2656/2656 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 p0 p1 (NOT p3) p2), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (181 resets) in 470 ms. (84 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 83 ms. (476 steps per ms) remains 2/3 properties
[2025-05-30 12:22:43] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 684/745 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/745 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1031/1776 variables, 186/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1776 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/1784 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1784 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2656/4440 variables, 1784/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4440 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/4440 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4440/4440 variables, and 2026 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 187/187 constraints, State Equation: 1784/1784 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 684/745 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:45] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:45] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/745 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1031/1776 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1776 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/1784 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1784 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2656/4440 variables, 1784/2028 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4440 variables, 2/2030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4440 variables, 0/2030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4440 variables, 0/2030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4440/4440 variables, and 2030 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2590 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 187/187 constraints, State Equation: 1784/1784 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3825ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 567 ms.
Support contains 4 out of 1784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 1784 transition count 2305
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 1433 transition count 2304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 1432 transition count 2304
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 704 place count 1432 transition count 2065
Deduced a syphon composed of 239 places in 2 ms
Ensure Unique test removed 76 places
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 554 rules applied. Total rules applied 1258 place count 1117 transition count 2065
Discarding 13 places :
Implicit places reduction removed 13 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 3 with 22 rules applied. Total rules applied 1280 place count 1104 transition count 2056
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1289 place count 1095 transition count 2056
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 1289 place count 1095 transition count 2021
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1359 place count 1060 transition count 2021
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1364 place count 1055 transition count 2016
Iterating global reduction 5 with 5 rules applied. Total rules applied 1369 place count 1055 transition count 2016
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 5 with 4 rules applied. Total rules applied 1373 place count 1055 transition count 2012
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1374 place count 1054 transition count 2012
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1374 place count 1054 transition count 2011
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1376 place count 1053 transition count 2011
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 1568 place count 957 transition count 1915
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1577 place count 957 transition count 1906
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1586 place count 948 transition count 1906
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1622 place count 948 transition count 1870
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 1659 place count 911 transition count 1870
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1668 place count 911 transition count 1861
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1695 place count 911 transition count 1861
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1696 place count 910 transition count 1860
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1704 place count 902 transition count 1860
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 16 Pre rules applied. Total rules applied 1704 place count 902 transition count 1844
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1744 place count 878 transition count 1844
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1752 place count 870 transition count 1836
Iterating global reduction 10 with 8 rules applied. Total rules applied 1760 place count 870 transition count 1836
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1768 place count 870 transition count 1828
Applied a total of 1768 rules in 424 ms. Remains 870 /1784 variables (removed 914) and now considering 1828/2656 (removed 828) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 870/1784 places, 1828/2656 transitions.
RANDOM walk for 40000 steps (562 resets) in 291 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (70 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 278683 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 278683 steps, saw 85691 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 1828 rows 870 cols
[2025-05-30 12:22:51] [INFO ] Computed 136 invariants in 25 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 176/199 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/231 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 370/601 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/610 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 201/811 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/811 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/816 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/816 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/817 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/817 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/870 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/870 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1828/2698 variables, 870/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2698 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2698 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2698/2698 variables, and 1006 constraints, problems are : Problem set: 0 solved, 2 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 176/199 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/231 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 370/601 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/610 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 201/811 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/811 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/816 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/816 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/817 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/817 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/870 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/870 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1828/2698 variables, 870/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2698 variables, 2/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2698 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2698 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2698/2698 variables, and 1008 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2444ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 664 ms.
Support contains 4 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1828/1828 transitions.
Applied a total of 0 rules in 35 ms. Remains 870 /870 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 870/870 places, 1828/1828 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1828/1828 transitions.
Applied a total of 0 rules in 29 ms. Remains 870 /870 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
[2025-05-30 12:22:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:55] [INFO ] Implicit Places using invariants in 708 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 274, 275, 280, 281, 333, 350, 356, 359, 361, 362, 367, 368, 420, 437, 443, 446, 448, 449, 454, 455, 507, 524, 531, 534, 536, 537, 542, 543, 612, 618, 621, 623, 627, 634, 635, 688, 705, 711, 714, 716, 717, 722, 723, 775, 792, 798, 801, 804, 807]
[2025-05-30 12:22:55] [INFO ] Actually due to overlaps returned [187, 275, 362, 449, 537, 717, 807, 542, 543, 88, 94, 99, 175, 181, 186, 262, 268, 350, 356, 361, 437, 443, 448, 524, 531, 536, 612, 618, 623, 705, 711, 716, 792, 798, 804, 71, 100, 158, 245, 274, 333, 420, 507, 627, 688, 775]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 722 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 824/870 places, 1828/1828 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 789 transition count 1793
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 789 transition count 1793
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 781 transition count 1785
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 781 transition count 1785
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 120 place count 764 transition count 1768
Free-agglomeration rule applied 26 times.
Iterating global reduction 0 with 26 rules applied. Total rules applied 146 place count 764 transition count 1742
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 172 place count 738 transition count 1742
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 738 transition count 1734
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 188 place count 730 transition count 1734
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 730 transition count 1734
Applied a total of 189 rules in 180 ms. Remains 730 /824 variables (removed 94) and now considering 1734/1828 (removed 94) transitions.
// Phase 1: matrix 1734 rows 730 cols
[2025-05-30 12:22:55] [INFO ] Computed 90 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:56] [INFO ] Implicit Places using invariants in 540 ms returned [88, 89, 159, 160, 232, 233, 303, 304, 374, 375, 523, 524, 595, 596, 663]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 556 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 715/870 places, 1734/1828 transitions.
Applied a total of 0 rules in 28 ms. Remains 715 /715 variables (removed 0) and now considering 1734/1734 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1515 ms. Remains : 715/870 places, 1734/1828 transitions.
RANDOM walk for 40000 steps (651 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (89 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 192308 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 192308 steps, saw 137348 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 1734 rows 715 cols
[2025-05-30 12:22:59] [INFO ] Computed 75 invariants in 13 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 331/373 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/407 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 293/700 variables, 42/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/704 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/704 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/715 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/715 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1734/2449 variables, 715/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2449 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2449 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2449/2449 variables, and 790 constraints, problems are : Problem set: 0 solved, 2 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 715/715 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 331/373 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/407 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 293/700 variables, 42/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/704 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/704 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/715 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/715 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1734/2449 variables, 715/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2449 variables, 2/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2449 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2449 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2449/2449 variables, and 792 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 715/715 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1795ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1383 ms.
Support contains 4 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 1734/1734 transitions.
Applied a total of 0 rules in 25 ms. Remains 715 /715 variables (removed 0) and now considering 1734/1734 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 715/715 places, 1734/1734 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 1734/1734 transitions.
Applied a total of 0 rules in 24 ms. Remains 715 /715 variables (removed 0) and now considering 1734/1734 (removed 0) transitions.
[2025-05-30 12:23:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:23:03] [INFO ] Implicit Places using invariants in 453 ms returned []
[2025-05-30 12:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:23:04] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:23:04] [INFO ] Redundant transitions in 164 ms returned []
Running 1692 sub problems to find dead transitions.
[2025-05-30 12:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/714 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/714 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 1692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 714/2449 variables, and 71 constraints, problems are : Problem set: 0 solved, 1692 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 59/60 constraints, State Equation: 0/715 constraints, PredecessorRefiner: 1692/1692 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1692 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/714 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/714 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 1692 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 714/2449 variables, and 71 constraints, problems are : Problem set: 0 solved, 1692 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 59/60 constraints, State Equation: 0/715 constraints, PredecessorRefiner: 0/1692 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 1692 unsolved
Search for dead transitions found 0 dead transitions in 60685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62884 ms. Remains : 715/715 places, 1734/1734 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 715 transition count 1733
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 714 transition count 1733
Applied a total of 2 rules in 30 ms. Remains 714 /715 variables (removed 1) and now considering 1733/1734 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1733 rows 714 cols
[2025-05-30 12:24:05] [INFO ] Computed 75 invariants in 21 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 12:24:05] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 12:24:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-05-30 12:24:05] [INFO ] [Nat]Absence check using 15 positive and 60 generalized place invariants in 23 ms returned sat
[2025-05-30 12:24:06] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-30 12:24:06] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 12:24:06] [INFO ] After 918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1105 ms.
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p3))), (F p3)]
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 459 reset in 405 ms.
Product exploration explored 100000 steps with 453 reset in 462 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1784 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 1784 transition count 2656
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 128 Pre rules applied. Total rules applied 351 place count 1784 transition count 2697
Deduced a syphon composed of 479 places in 3 ms
Iterating global reduction 1 with 128 rules applied. Total rules applied 479 place count 1784 transition count 2697
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 485 place count 1781 transition count 2697
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 532 place count 1734 transition count 2650
Deduced a syphon composed of 437 places in 3 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 579 place count 1734 transition count 2650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 579 place count 1734 transition count 2650
Deduced a syphon composed of 438 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 580 place count 1734 transition count 2650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 581 place count 1733 transition count 2649
Deduced a syphon composed of 437 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 582 place count 1733 transition count 2649
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 661 places in 3 ms
Iterating global reduction 2 with 224 rules applied. Total rules applied 806 place count 1733 transition count 2679
Discarding 119 places :
Symmetric choice reduction at 2 with 119 rule applications. Total rules 925 place count 1614 transition count 2560
Deduced a syphon composed of 542 places in 2 ms
Iterating global reduction 2 with 119 rules applied. Total rules applied 1044 place count 1614 transition count 2560
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 552 places in 3 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1054 place count 1614 transition count 2612
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 553 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1055 place count 1614 transition count 2616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1057 place count 1612 transition count 2610
Deduced a syphon composed of 551 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1059 place count 1612 transition count 2610
Deduced a syphon composed of 551 places in 2 ms
Applied a total of 1059 rules in 1078 ms. Remains 1612 /1784 variables (removed 172) and now considering 2610/2656 (removed 46) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:24:10] [INFO ] Redundant transitions in 239 ms returned []
Running 2609 sub problems to find dead transitions.
// Phase 1: matrix 2610 rows 1612 cols
[2025-05-30 12:24:10] [INFO ] Computed 239 invariants in 33 ms
[2025-05-30 12:24:10] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 16.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 8.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 2.0)
(s117 1.0)
(s118 1.0)
(s119 13.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 8.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 6.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 3.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.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 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 16.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 8.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 12.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 8.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 2.0)
(s317 1.0)
(s318 7.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 3.0)
(s349 1.0)
(s350 1.0)
(s351 3.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 16.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 8.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 12.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 2.0)
(s464 1.0)
(s465 1.0)
(s466 9.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 2.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 3.0)
(s513 1.0)
(s514 1.0)
(s515 3.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 16.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 8.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 2.0)
(s609 1.0)
(s610 13.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 6.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 2.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 3.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 6.0)
(s675 1.0)
(s676 3.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 16.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1611 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 2609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1611/4222 variables, and 167 constraints, problems are : Problem set: 0 solved, 2609 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/60 constraints, Generalized P Invariants (flows): 167/179 constraints, State Equation: 0/1612 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 2609/2609 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2609 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1611 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 2609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1611/4222 variables, and 167 constraints, problems are : Problem set: 0 solved, 2609 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/60 constraints, Generalized P Invariants (flows): 167/179 constraints, State Equation: 0/1612 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 0/2609 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60950ms problems are : Problem set: 0 solved, 2609 unsolved
Search for dead transitions found 0 dead transitions in 60956ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1612/1784 places, 2610/2656 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62285 ms. Remains : 1612/1784 places, 2610/2656 transitions.
Built C files in :
/tmp/ltsmin3383438404690845182
[2025-05-30 12:25:11] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3383438404690845182
Running compilation step : cd /tmp/ltsmin3383438404690845182;'/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/ltsmin3383438404690845182;'/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/ltsmin3383438404690845182;'/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 1784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Applied a total of 0 rules in 86 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
// Phase 1: matrix 2656 rows 1784 cols
[2025-05-30 12:25:14] [INFO ] Computed 242 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:15] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2025-05-30 12:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:21] [INFO ] Implicit Places using invariants and state equation in 5807 ms returned []
Implicit Place search using SMT with State Equation took 6932 ms to find 0 implicit places.
Running 2655 sub problems to find dead transitions.
[2025-05-30 12:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1783 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 2655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1783/4440 variables, and 172 constraints, problems are : Problem set: 0 solved, 2655 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 172/187 constraints, State Equation: 0/1784 constraints, PredecessorRefiner: 2655/2655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2655 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1783 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 2655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1783/4440 variables, and 172 constraints, problems are : Problem set: 0 solved, 2655 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 172/187 constraints, State Equation: 0/1784 constraints, PredecessorRefiner: 0/2655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60959ms problems are : Problem set: 0 solved, 2655 unsolved
Search for dead transitions found 0 dead transitions in 60965ms
Finished structural reductions in LTL mode , in 1 iterations and 67997 ms. Remains : 1784/1784 places, 2656/2656 transitions.
Built C files in :
/tmp/ltsmin80285385094284869
[2025-05-30 12:26:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin80285385094284869
Running compilation step : cd /tmp/ltsmin80285385094284869;'/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/ltsmin80285385094284869;'/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/ltsmin80285385094284869;'/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 12:26:25] [INFO ] Flatten gal took : 96 ms
[2025-05-30 12:26:25] [INFO ] Flatten gal took : 99 ms
[2025-05-30 12:26:25] [INFO ] Time to serialize gal into /tmp/LTL14518151511896363527.gal : 38 ms
[2025-05-30 12:26:25] [INFO ] Time to serialize properties into /tmp/LTL8729802859150352774.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/LTL14518151511896363527.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15078037116625470971.hoa' '-atoms' '/tmp/LTL8729802859150352774.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/LTL8729802859150352774.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15078037116625470971.hoa
Detected timeout of ITS tools.
[2025-05-30 12:26:41] [INFO ] Flatten gal took : 76 ms
[2025-05-30 12:26:41] [INFO ] Flatten gal took : 76 ms
[2025-05-30 12:26:41] [INFO ] Time to serialize gal into /tmp/LTL329014236822804606.gal : 15 ms
[2025-05-30 12:26:41] [INFO ] Time to serialize properties into /tmp/LTL12638740385376402986.ltl : 6 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/LTL329014236822804606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12638740385376402986.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 : !((G(("((p561==0)||(p1369==1))")||(X((F("((p561==0)||(p1369==1))"))U(X((F("(p1126!=1)"))U("(p1745==1)"))))))))
Formula 0 simplified : F(!"((p561==0)||(p1369==1))" & X(G!"((p561==0)||(p1369==1))" R X(G!"(p1126!=1)" R !"(p1745==1)")))
Detected timeout of ITS tools.
[2025-05-30 12:26:56] [INFO ] Flatten gal took : 117 ms
[2025-05-30 12:26:56] [INFO ] Applying decomposition
[2025-05-30 12:26:56] [INFO ] Flatten gal took : 94 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/graph14727965183231405969.txt' '-o' '/tmp/graph14727965183231405969.bin' '-w' '/tmp/graph14727965183231405969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14727965183231405969.bin' '-l' '-1' '-v' '-w' '/tmp/graph14727965183231405969.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:26:56] [INFO ] Decomposing Gal with order
[2025-05-30 12:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:26:57] [INFO ] Removed a total of 3569 redundant transitions.
[2025-05-30 12:26:57] [INFO ] Flatten gal took : 198 ms
[2025-05-30 12:26:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 34 ms.
[2025-05-30 12:26:57] [INFO ] Time to serialize gal into /tmp/LTL4715424065464400215.gal : 23 ms
[2025-05-30 12:26:57] [INFO ] Time to serialize properties into /tmp/LTL16414100682296173162.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/LTL4715424065464400215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16414100682296173162.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...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i5.u165.p561==0)||(i12.u394.p1369==1))")||(X((F("((i5.u165.p561==0)||(i12.u394.p1369==1))"))U(X((F("(i11.u321.p1126!=1)"))U("...189
Formula 0 simplified : F(!"((i5.u165.p561==0)||(i12.u394.p1369==1))" & X(G!"((i5.u165.p561==0)||(i12.u394.p1369==1))" R X(G!"(i11.u321.p1126!=1)" R !"(i16....179
Detected timeout of ITS tools.
Treatment of property ASLink-PT-09a-LTLCardinality-02 finished in 354819 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 2 out of 1787 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 341 place count 1786 transition count 2320
Reduce places removed 350 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 358 rules applied. Total rules applied 699 place count 1436 transition count 2312
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 709 place count 1428 transition count 2310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 711 place count 1426 transition count 2310
Performed 256 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 256 Pre rules applied. Total rules applied 711 place count 1426 transition count 2054
Deduced a syphon composed of 256 places in 2 ms
Ensure Unique test removed 76 places
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 4 with 588 rules applied. Total rules applied 1299 place count 1094 transition count 2054
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 37 rules applied. Total rules applied 1336 place count 1076 transition count 2035
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1355 place count 1057 transition count 2035
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 1355 place count 1057 transition count 1998
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 1429 place count 1020 transition count 1998
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1441 place count 1008 transition count 1981
Iterating global reduction 6 with 12 rules applied. Total rules applied 1453 place count 1008 transition count 1981
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 11 rules applied. Total rules applied 1464 place count 1007 transition count 1971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1465 place count 1006 transition count 1971
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1465 place count 1006 transition count 1970
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1467 place count 1005 transition count 1970
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 8 with 188 rules applied. Total rules applied 1655 place count 911 transition count 1876
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1656 place count 910 transition count 1875
Iterating global reduction 8 with 1 rules applied. Total rules applied 1657 place count 910 transition count 1875
Applied a total of 1657 rules in 225 ms. Remains 910 /1787 variables (removed 877) and now considering 1875/2662 (removed 787) transitions.
// Phase 1: matrix 1875 rows 910 cols
[2025-05-30 12:27:12] [INFO ] Computed 140 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:13] [INFO ] Implicit Places using invariants in 692 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 346, 363, 369, 374, 376, 436, 453, 459, 464, 466, 526, 543, 549, 554, 556, 616, 633, 639, 644, 646, 706, 723, 729, 734, 736, 796, 813, 820, 825, 827, 875, 890, 903]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 697 ms to find 48 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 862/1787 places, 1875/2662 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 862 transition count 1870
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 857 transition count 1870
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 857 transition count 1866
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 853 transition count 1866
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 36 place count 835 transition count 1848
Iterating global reduction 2 with 18 rules applied. Total rules applied 54 place count 835 transition count 1848
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 71 place count 818 transition count 1831
Iterating global reduction 2 with 17 rules applied. Total rules applied 88 place count 818 transition count 1831
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 96 place count 810 transition count 1823
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 810 transition count 1823
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 142 place count 791 transition count 1804
Applied a total of 142 rules in 130 ms. Remains 791 /862 variables (removed 71) and now considering 1804/1875 (removed 71) transitions.
// Phase 1: matrix 1804 rows 791 cols
[2025-05-30 12:27:13] [INFO ] Computed 92 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:13] [INFO ] Implicit Places using invariants in 614 ms returned [778, 781, 784, 788]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 617 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 787/1787 places, 1804/2662 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 787 transition count 1800
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 783 transition count 1800
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 780 transition count 1797
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 780 transition count 1797
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 780 transition count 1794
Applied a total of 17 rules in 56 ms. Remains 780 /787 variables (removed 7) and now considering 1794/1804 (removed 10) transitions.
// Phase 1: matrix 1794 rows 780 cols
[2025-05-30 12:27:13] [INFO ] Computed 88 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:14] [INFO ] Implicit Places using invariants in 535 ms returned []
[2025-05-30 12:27:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:16] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 780/1787 places, 1794/2662 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3878 ms. Remains : 780/1787 places, 1794/2662 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-08
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-09a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLCardinality-08 finished in 3983 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||X(p0))))&&F(p1)))'
Support contains 3 out of 1787 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1786 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1786 transition count 2656
Applied a total of 2 rules in 124 ms. Remains 1786 /1787 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
// Phase 1: matrix 2656 rows 1786 cols
[2025-05-30 12:27:16] [INFO ] Computed 244 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:17] [INFO ] Implicit Places using invariants in 1095 ms returned [210, 1696]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1787 places, 2656/2662 transitions.
Applied a total of 0 rules in 60 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1296 ms. Remains : 1784/1787 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-09a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLCardinality-09 finished in 1501 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((p0 U (!p1||G(p0)))))'
Support contains 4 out of 1787 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1786 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1786 transition count 2656
Applied a total of 2 rules in 134 ms. Remains 1786 /1787 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
[2025-05-30 12:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:18] [INFO ] Implicit Places using invariants in 1102 ms returned [210, 1696]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1105 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1787 places, 2656/2662 transitions.
Applied a total of 0 rules in 66 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1307 ms. Remains : 1784/1787 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 6003 steps with 25 reset in 49 ms.
FORMULA ASLink-PT-09a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLCardinality-12 finished in 1467 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' '!(((p0 U p1) U X(X(!p0))))'
Support contains 5 out of 1787 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1786 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1786 transition count 2656
Applied a total of 2 rules in 141 ms. Remains 1786 /1787 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
[2025-05-30 12:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:20] [INFO ] Implicit Places using invariants in 1095 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1785/1787 places, 2656/2662 transitions.
Applied a total of 0 rules in 68 ms. Remains 1785 /1785 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1306 ms. Remains : 1785/1787 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p1) p0), p0, p0, true, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 786 ms.
Product exploration explored 100000 steps with 33333 reset in 785 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 11 ms. Reduced automaton from 11 states, 22 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-09a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09a-LTLCardinality-14 finished in 3355 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 2 out of 1787 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1787/1787 places, 2662/2662 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1787 transition count 2322
Reduce places removed 340 places and 0 transitions.
Iterating post reduction 1 with 340 rules applied. Total rules applied 680 place count 1447 transition count 2322
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 680 place count 1447 transition count 2085
Deduced a syphon composed of 237 places in 2 ms
Ensure Unique test removed 76 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 550 rules applied. Total rules applied 1230 place count 1134 transition count 2085
Discarding 8 places :
Implicit places reduction removed 8 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 2 with 9 rules applied. Total rules applied 1239 place count 1126 transition count 2084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1240 place count 1125 transition count 2084
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1240 place count 1125 transition count 2048
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1312 place count 1089 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1314 place count 1087 transition count 2046
Iterating global reduction 4 with 2 rules applied. Total rules applied 1316 place count 1087 transition count 2046
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 1 rules applied. Total rules applied 1317 place count 1087 transition count 2045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1318 place count 1086 transition count 2045
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1318 place count 1086 transition count 2044
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1320 place count 1085 transition count 2044
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 1522 place count 984 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1523 place count 983 transition count 1942
Iterating global reduction 6 with 1 rules applied. Total rules applied 1524 place count 983 transition count 1942
Applied a total of 1524 rules in 272 ms. Remains 983 /1787 variables (removed 804) and now considering 1942/2662 (removed 720) transitions.
// Phase 1: matrix 1942 rows 983 cols
[2025-05-30 12:27:22] [INFO ] Computed 160 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:23] [INFO ] Implicit Places using invariants in 832 ms returned [90, 96, 101, 117, 194, 200, 205, 206, 224, 294, 300, 305, 321, 391, 397, 402, 418, 488, 494, 499, 515, 585, 591, 596, 612, 682, 688, 693, 709, 784, 790, 795, 811, 881, 887, 892, 911, 948, 963, 976]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 833 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 943/1787 places, 1942/2662 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 0 with 1 rules applied. Total rules applied 1 place count 943 transition count 1941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 942 transition count 1941
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 2 place count 942 transition count 1919
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 46 place count 920 transition count 1919
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 65 place count 901 transition count 1900
Iterating global reduction 2 with 19 rules applied. Total rules applied 84 place count 901 transition count 1900
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 102 place count 883 transition count 1882
Iterating global reduction 2 with 18 rules applied. Total rules applied 120 place count 883 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 129 place count 874 transition count 1873
Iterating global reduction 2 with 9 rules applied. Total rules applied 138 place count 874 transition count 1873
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 174 place count 856 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 855 transition count 1853
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 855 transition count 1853
Applied a total of 176 rules in 159 ms. Remains 855 /943 variables (removed 88) and now considering 1853/1942 (removed 89) transitions.
// Phase 1: matrix 1853 rows 855 cols
[2025-05-30 12:27:23] [INFO ] Computed 120 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:24] [INFO ] Implicit Places using invariants in 661 ms returned [93, 96, 184, 187, 268, 271, 352, 355, 436, 439, 520, 523, 604, 607, 693, 696, 777, 780, 842, 845, 848, 852]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 663 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 833/1787 places, 1853/2662 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 833 transition count 1840
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 820 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 808 transition count 1828
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 808 transition count 1828
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 62 place count 808 transition count 1816
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 64 place count 807 transition count 1815
Applied a total of 64 rules in 81 ms. Remains 807 /833 variables (removed 26) and now considering 1815/1853 (removed 38) transitions.
// Phase 1: matrix 1815 rows 807 cols
[2025-05-30 12:27:24] [INFO ] Computed 98 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:25] [INFO ] Implicit Places using invariants in 538 ms returned [72, 154, 238, 318, 398, 478, 558, 639, 723]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 549 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 798/1787 places, 1815/2662 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 789 transition count 1806
Applied a total of 18 rules in 49 ms. Remains 789 /798 variables (removed 9) and now considering 1806/1815 (removed 9) transitions.
// Phase 1: matrix 1806 rows 789 cols
[2025-05-30 12:27:25] [INFO ] Computed 89 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:25] [INFO ] Implicit Places using invariants in 555 ms returned []
[2025-05-30 12:27:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 12:27:27] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2687 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 789/1787 places, 1806/2662 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 5295 ms. Remains : 789/1787 places, 1806/2662 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-15
Product exploration explored 100000 steps with 1195 reset in 249 ms.
Product exploration explored 100000 steps with 1216 reset in 257 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (501 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (71 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6392 steps, run visited all 1 properties in 19 ms. (steps per millisecond=336 )
Probabilistic random walk after 6392 steps, saw 6232 distinct states, run finished after 24 ms. (steps per millisecond=266 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1806/1806 transitions.
Applied a total of 0 rules in 30 ms. Remains 789 /789 variables (removed 0) and now considering 1806/1806 (removed 0) transitions.
[2025-05-30 12:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:29] [INFO ] Implicit Places using invariants in 528 ms returned []
[2025-05-30 12:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 12:27:31] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 2637 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:27:31] [INFO ] Redundant transitions in 131 ms returned []
Running 1805 sub problems to find dead transitions.
[2025-05-30 12:27:31] [INFO ] Invariant cache hit.
[2025-05-30 12:27:31] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/2595 variables, and 48 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 48/75 constraints, State Equation: 0/789 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1805/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1805 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 15)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 3)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 7)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 8)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 3)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 3)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 8)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 3)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/2595 variables, and 48 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 48/75 constraints, State Equation: 0/789 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60619ms problems are : Problem set: 0 solved, 1805 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63441 ms. Remains : 789/789 places, 1806/1806 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (482 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (67 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6392 steps, run visited all 1 properties in 20 ms. (steps per millisecond=319 )
Probabilistic random walk after 6392 steps, saw 6232 distinct states, run finished after 21 ms. (steps per millisecond=304 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1241 reset in 288 ms.
Product exploration explored 100000 steps with 1253 reset in 279 ms.
Built C files in :
/tmp/ltsmin7045579277746209715
[2025-05-30 12:28:33] [INFO ] Too many transitions (1806) to apply POR reductions. Disabling POR matrices.
[2025-05-30 12:28:33] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7045579277746209715
Running compilation step : cd /tmp/ltsmin7045579277746209715;'/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/ltsmin7045579277746209715;'/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/ltsmin7045579277746209715;'/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 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1806/1806 transitions.
Applied a total of 0 rules in 28 ms. Remains 789 /789 variables (removed 0) and now considering 1806/1806 (removed 0) transitions.
[2025-05-30 12:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:37] [INFO ] Implicit Places using invariants in 515 ms returned []
[2025-05-30 12:28:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 12:28:39] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2654 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:28:39] [INFO ] Redundant transitions in 39 ms returned []
Running 1805 sub problems to find dead transitions.
[2025-05-30 12:28:39] [INFO ] Invariant cache hit.
[2025-05-30 12:28:39] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/2595 variables, and 48 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 48/75 constraints, State Equation: 0/789 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1805/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1805 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 15)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 3)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 7)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 8)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 3)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 3)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 8)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 3)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 3)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 8)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/2595 variables, and 48 constraints, problems are : Problem set: 0 solved, 1805 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 48/75 constraints, State Equation: 0/789 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60673ms problems are : Problem set: 0 solved, 1805 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63409 ms. Remains : 789/789 places, 1806/1806 transitions.
Built C files in :
/tmp/ltsmin15595859980303500093
[2025-05-30 12:29:40] [INFO ] Too many transitions (1806) to apply POR reductions. Disabling POR matrices.
[2025-05-30 12:29:40] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15595859980303500093
Running compilation step : cd /tmp/ltsmin15595859980303500093;'/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/ltsmin15595859980303500093;'/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/ltsmin15595859980303500093;'/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 12:29:43] [INFO ] Flatten gal took : 58 ms
[2025-05-30 12:29:43] [INFO ] Flatten gal took : 53 ms
[2025-05-30 12:29:43] [INFO ] Time to serialize gal into /tmp/LTL3894040193191880232.gal : 8 ms
[2025-05-30 12:29:43] [INFO ] Time to serialize properties into /tmp/LTL17424870910986757586.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3894040193191880232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7362485398629437837.hoa' '-atoms' '/tmp/LTL17424870910986757586.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/LTL17424870910986757586.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7362485398629437837.hoa
Detected timeout of ITS tools.
[2025-05-30 12:29:58] [INFO ] Flatten gal took : 47 ms
[2025-05-30 12:29:58] [INFO ] Flatten gal took : 47 ms
[2025-05-30 12:29:58] [INFO ] Time to serialize gal into /tmp/LTL16268039258337246563.gal : 7 ms
[2025-05-30 12:29:58] [INFO ] Time to serialize properties into /tmp/LTL3992797025378199833.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/LTL16268039258337246563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3992797025378199833.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("((p229==0)||(p1417==1))"))))
Formula 0 simplified : FG!"((p229==0)||(p1417==1))"
Detected timeout of ITS tools.
[2025-05-30 12:30:13] [INFO ] Flatten gal took : 69 ms
[2025-05-30 12:30:13] [INFO ] Applying decomposition
[2025-05-30 12:30:13] [INFO ] Flatten gal took : 46 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/graph15940980052737354449.txt' '-o' '/tmp/graph15940980052737354449.bin' '-w' '/tmp/graph15940980052737354449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15940980052737354449.bin' '-l' '-1' '-v' '-w' '/tmp/graph15940980052737354449.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:30:13] [INFO ] Decomposing Gal with order
[2025-05-30 12:30:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:30:14] [INFO ] Removed a total of 3518 redundant transitions.
[2025-05-30 12:30:14] [INFO ] Flatten gal took : 88 ms
[2025-05-30 12:30:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 38 ms.
[2025-05-30 12:30:14] [INFO ] Time to serialize gal into /tmp/LTL17612975267277571521.gal : 10 ms
[2025-05-30 12:30:14] [INFO ] Time to serialize properties into /tmp/LTL4314567125590658311.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/LTL17612975267277571521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4314567125590658311.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u32.p229==0)||(i15.u136.p1417==1))"))))
Formula 0 simplified : FG!"((i1.u32.p229==0)||(i15.u136.p1417==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-09a-LTLCardinality-15 finished in 186702 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((X((F(p1) U X((F(p2) U p3))))||p0)))'
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)))'
[2025-05-30 12:30:29] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8228329169198260688
[2025-05-30 12:30:29] [INFO ] Too many transitions (2662) to apply POR reductions. Disabling POR matrices.
[2025-05-30 12:30:29] [INFO ] Applying decomposition
[2025-05-30 12:30:29] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8228329169198260688
Running compilation step : cd /tmp/ltsmin8228329169198260688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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 12:30:29] [INFO ] Flatten gal took : 66 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/graph14235319862245213261.txt' '-o' '/tmp/graph14235319862245213261.bin' '-w' '/tmp/graph14235319862245213261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14235319862245213261.bin' '-l' '-1' '-v' '-w' '/tmp/graph14235319862245213261.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:30:29] [INFO ] Decomposing Gal with order
[2025-05-30 12:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:30:30] [INFO ] Removed a total of 3574 redundant transitions.
[2025-05-30 12:30:30] [INFO ] Flatten gal took : 245 ms
[2025-05-30 12:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 44 ms.
[2025-05-30 12:30:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality10735143476966232454.gal : 26 ms
[2025-05-30 12:30:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality139100742985209040.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/LTLCardinality10735143476966232454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality139100742985209040.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 2 LTL properties
Checking formula 0 : !((G(("((i6.u156.p561==0)||(i13.u386.p1369==1))")||(X((F("((i6.u156.p561==0)||(i13.u386.p1369==1))"))U(X((F("(i11.u317.p1126!=1)"))U("...189
Formula 0 simplified : F(!"((i6.u156.p561==0)||(i13.u386.p1369==1))" & X(G!"((i6.u156.p561==0)||(i13.u386.p1369==1))" R X(G!"(i11.u317.p1126!=1)" R !"(i18....179
Compilation finished in 6621 ms.
Running link step : cd /tmp/ltsmin8228329169198260688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 180 ms.
Running LTSmin : cd /tmp/ltsmin8228329169198260688;'/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((<>((LTLAPp1==true)) U X((<>((LTLAPp2==true)) U (LTLAPp3==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8228329169198260688;'/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((<>((LTLAPp1==true)) U X((<>((LTLAPp2==true)) U (LTLAPp3==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8228329169198260688;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 12:54:17] [INFO ] Applying decomposition
[2025-05-30 12:54:17] [INFO ] Flatten gal took : 178 ms
[2025-05-30 12:54:17] [INFO ] Decomposing Gal with order
[2025-05-30 12:54:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:54:17] [INFO ] Removed a total of 2973 redundant transitions.
[2025-05-30 12:54:18] [INFO ] Flatten gal took : 359 ms
[2025-05-30 12:54:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1153 labels/synchronizations in 215 ms.
[2025-05-30 12:54:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality4873250221206953242.gal : 18 ms
[2025-05-30 12:54:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality4171509237946411968.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/LTLCardinality4873250221206953242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4171509237946411968.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 2 LTL properties
Checking formula 0 : !((G(("((i21.u93.p561==0)||(i53.u240.p1369==1))")||(X((F("((i21.u93.p561==0)||(i53.u240.p1369==1))"))U(X((F("(i45.u193.p1126!=1)"))U("...186
Formula 0 simplified : F(!"((i21.u93.p561==0)||(i53.u240.p1369==1))" & X(G!"((i21.u93.p561==0)||(i53.u240.p1369==1))" R X(G!"(i45.u193.p1126!=1)" R !"(i69....176
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8228329169198260688;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8228329169198260688;'/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((<>((LTLAPp1==true)) U X((<>((LTLAPp2==true)) U (LTLAPp3==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 13:18:05] [INFO ] Flatten gal took : 212 ms
[2025-05-30 13:18:05] [INFO ] Input system was already deterministic with 2662 transitions.
[2025-05-30 13:18:05] [INFO ] Transformed 1787 places.
[2025-05-30 13:18:05] [INFO ] Transformed 2662 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 13:18:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality4890430378226122430.gal : 21 ms
[2025-05-30 13:18:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality15746097566787826682.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/LTLCardinality4890430378226122430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15746097566787826682.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((p561==0)||(p1369==1))")||(X((F("((p561==0)||(p1369==1))"))U(X((F("(p1126!=1)"))U("(p1745==1)"))))))))
Formula 0 simplified : F(!"((p561==0)||(p1369==1))" & X(G!"((p561==0)||(p1369==1))" R X(G!"(p1126!=1)" R !"(p1745==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-09a"
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-09a, 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-174853729200411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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