Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900444.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 MedleyB-PT-B03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.3K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 482K Jun 5 20:08 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 MedleyB-PT-B03-LTLFireability-00
FORMULA_NAME MedleyB-PT-B03-LTLFireability-01
FORMULA_NAME MedleyB-PT-B03-LTLFireability-02
FORMULA_NAME MedleyB-PT-B03-LTLFireability-03
FORMULA_NAME MedleyB-PT-B03-LTLFireability-04
FORMULA_NAME MedleyB-PT-B03-LTLFireability-05
FORMULA_NAME MedleyB-PT-B03-LTLFireability-06
FORMULA_NAME MedleyB-PT-B03-LTLFireability-07
FORMULA_NAME MedleyB-PT-B03-LTLFireability-08
FORMULA_NAME MedleyB-PT-B03-LTLFireability-09
FORMULA_NAME MedleyB-PT-B03-LTLFireability-10
FORMULA_NAME MedleyB-PT-B03-LTLFireability-11
FORMULA_NAME MedleyB-PT-B03-LTLFireability-12
FORMULA_NAME MedleyB-PT-B03-LTLFireability-13
FORMULA_NAME MedleyB-PT-B03-LTLFireability-14
FORMULA_NAME MedleyB-PT-B03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749387854939

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 13:04:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 13:04:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 13:04:16] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2025-06-08 13:04:16] [INFO ] Transformed 1529 places.
[2025-06-08 13:04:16] [INFO ] Transformed 2131 transitions.
[2025-06-08 13:04:16] [INFO ] Found NUPN structural information;
[2025-06-08 13:04:16] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MedleyB-PT-B03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 1529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 1408 transition count 2010
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 1408 transition count 2010
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 316 place count 1334 transition count 1936
Iterating global reduction 0 with 74 rules applied. Total rules applied 390 place count 1334 transition count 1936
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 432 place count 1292 transition count 1894
Iterating global reduction 0 with 42 rules applied. Total rules applied 474 place count 1292 transition count 1894
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 511 place count 1255 transition count 1857
Iterating global reduction 0 with 37 rules applied. Total rules applied 548 place count 1255 transition count 1857
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 580 place count 1223 transition count 1825
Iterating global reduction 0 with 32 rules applied. Total rules applied 612 place count 1223 transition count 1825
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 644 place count 1191 transition count 1793
Iterating global reduction 0 with 32 rules applied. Total rules applied 676 place count 1191 transition count 1793
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 707 place count 1160 transition count 1762
Iterating global reduction 0 with 31 rules applied. Total rules applied 738 place count 1160 transition count 1762
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 769 place count 1129 transition count 1731
Iterating global reduction 0 with 31 rules applied. Total rules applied 800 place count 1129 transition count 1731
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 825 place count 1104 transition count 1706
Iterating global reduction 0 with 25 rules applied. Total rules applied 850 place count 1104 transition count 1706
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 870 place count 1084 transition count 1686
Iterating global reduction 0 with 20 rules applied. Total rules applied 890 place count 1084 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 894 place count 1084 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 902 place count 1076 transition count 1674
Iterating global reduction 1 with 8 rules applied. Total rules applied 910 place count 1076 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 918 place count 1068 transition count 1666
Iterating global reduction 1 with 8 rules applied. Total rules applied 926 place count 1068 transition count 1666
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 930 place count 1064 transition count 1662
Iterating global reduction 1 with 4 rules applied. Total rules applied 934 place count 1064 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 938 place count 1060 transition count 1658
Iterating global reduction 1 with 4 rules applied. Total rules applied 942 place count 1060 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 945 place count 1057 transition count 1655
Iterating global reduction 1 with 3 rules applied. Total rules applied 948 place count 1057 transition count 1655
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 951 place count 1054 transition count 1652
Iterating global reduction 1 with 3 rules applied. Total rules applied 954 place count 1054 transition count 1652
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 957 place count 1051 transition count 1649
Iterating global reduction 1 with 3 rules applied. Total rules applied 960 place count 1051 transition count 1649
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 963 place count 1048 transition count 1646
Iterating global reduction 1 with 3 rules applied. Total rules applied 966 place count 1048 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 969 place count 1045 transition count 1643
Iterating global reduction 1 with 3 rules applied. Total rules applied 972 place count 1045 transition count 1643
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 975 place count 1042 transition count 1640
Iterating global reduction 1 with 3 rules applied. Total rules applied 978 place count 1042 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 981 place count 1039 transition count 1637
Iterating global reduction 1 with 3 rules applied. Total rules applied 984 place count 1039 transition count 1637
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 987 place count 1036 transition count 1634
Iterating global reduction 1 with 3 rules applied. Total rules applied 990 place count 1036 transition count 1634
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 993 place count 1036 transition count 1631
Applied a total of 993 rules in 1417 ms. Remains 1036 /1529 variables (removed 493) and now considering 1631/2131 (removed 500) transitions.
// Phase 1: matrix 1631 rows 1036 cols
[2025-06-08 13:04:18] [INFO ] Computed 6 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:04:18] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-06-08 13:04:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:04:19] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-08 13:04:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1035/2667 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1036 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1035/2667 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1036 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61694ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61716ms
Starting structural reductions in LTL mode, iteration 1 : 1036/1529 places, 1631/2131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64925 ms. Remains : 1036/1529 places, 1631/2131 transitions.
Support contains 49 out of 1036 places after structural reductions.
[2025-06-08 13:05:22] [INFO ] Flatten gal took : 270 ms
[2025-06-08 13:05:22] [INFO ] Flatten gal took : 142 ms
[2025-06-08 13:05:22] [INFO ] Input system was already deterministic with 1631 transitions.
RANDOM walk for 40000 steps (415 resets) in 1362 ms. (29 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
[2025-06-08 13:05:23] [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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 995/1036 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:24] [INFO ] Deduced a trap composed of 303 places in 363 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1036 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 1631/2667 variables, 1036/1043 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2667 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)timeout

(s458 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2667/2667 variables, and 1043 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1036/1036 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 995/1036 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:29] [INFO ] Deduced a trap composed of 308 places in 337 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:29] [INFO ] Deduced a trap composed of 300 places in 445 ms of which 116 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1036 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:30] [INFO ] Deduced a trap composed of 309 places in 332 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:31] [INFO ] Deduced a trap composed of 306 places in 443 ms of which 122 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1036 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 1631/2667 variables, 1036/1047 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2667/2667 variables, and 1068 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1036/1036 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10118ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Graph (trivial) has 960 edges and 1036 vertex of which 73 / 1036 are part of one of the 14 SCC in 16 ms
Free SCC test removed 59 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 1661 edges and 977 vertex of which 972 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 674 transitions
Trivial Post-agglo rules discarded 674 transitions
Performed 674 trivial Post agglomeration. Transition count delta: 674
Iterating post reduction 0 with 679 rules applied. Total rules applied 681 place count 972 transition count 872
Reduce places removed 674 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 687 rules applied. Total rules applied 1368 place count 298 transition count 859
Reduce places removed 6 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 28 rules applied. Total rules applied 1396 place count 292 transition count 837
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 26 rules applied. Total rules applied 1422 place count 270 transition count 833
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1423 place count 269 transition count 833
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 56 Pre rules applied. Total rules applied 1423 place count 269 transition count 777
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 1535 place count 213 transition count 777
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1609 place count 176 transition count 740
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1616 place count 176 transition count 733
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1633 place count 159 transition count 707
Iterating global reduction 6 with 17 rules applied. Total rules applied 1650 place count 159 transition count 707
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1655 place count 159 transition count 702
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1664 place count 150 transition count 693
Iterating global reduction 7 with 9 rules applied. Total rules applied 1673 place count 150 transition count 693
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1680 place count 143 transition count 686
Iterating global reduction 7 with 7 rules applied. Total rules applied 1687 place count 143 transition count 686
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1689 place count 143 transition count 684
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1705 place count 135 transition count 676
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1711 place count 132 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1712 place count 132 transition count 680
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1714 place count 132 transition count 678
Free-agglomeration rule applied 29 times.
Iterating global reduction 9 with 29 rules applied. Total rules applied 1743 place count 132 transition count 649
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 1772 place count 103 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1774 place count 103 transition count 647
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1775 place count 103 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1776 place count 102 transition count 646
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 1782 place count 102 transition count 646
Applied a total of 1782 rules in 390 ms. Remains 102 /1036 variables (removed 934) and now considering 646/1631 (removed 985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 102/1036 places, 646/1631 transitions.
RANDOM walk for 40000 steps (2752 resets) in 410 ms. (97 steps per ms) remains 17/21 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (51 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (46 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (46 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (46 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (44 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 12/17 properties
// Phase 1: matrix 646 rows 102 cols
[2025-06-08 13:05:34] [INFO ] Computed 6 invariants in 6 ms
[2025-06-08 13:05:34] [INFO ] State equation strengthened by 336 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 72/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:34] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 646/748 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 336/445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/748 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 445 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 72/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 646/748 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 336/445 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 12/457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/748 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/748 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 748/748 variables, and 457 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 336/336 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3746ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 11 properties in 543 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 646/646 transitions.
Graph (trivial) has 69 edges and 102 vertex of which 4 / 102 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 100 transition count 632
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 90 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 89 transition count 631
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 23 place count 89 transition count 626
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 33 place count 84 transition count 626
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 84 transition count 625
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 41 place count 77 transition count 317
Iterating global reduction 4 with 7 rules applied. Total rules applied 48 place count 77 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 53 place count 77 transition count 312
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 76 transition count 311
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 76 transition count 311
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 67 place count 70 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 68 place count 70 transition count 304
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 74 place count 64 transition count 298
Iterating global reduction 6 with 6 rules applied. Total rules applied 80 place count 64 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 81 place count 64 transition count 297
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 84 place count 61 transition count 294
Iterating global reduction 7 with 3 rules applied. Total rules applied 87 place count 61 transition count 294
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 92 place count 61 transition count 289
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 93 place count 60 transition count 288
Iterating global reduction 8 with 1 rules applied. Total rules applied 94 place count 60 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 95 place count 60 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 99 place count 60 transition count 283
Free-agglomeration rule applied 23 times with reduction of 92 identical transitions.
Iterating global reduction 9 with 23 rules applied. Total rules applied 122 place count 60 transition count 168
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 9 with 56 rules applied. Total rules applied 178 place count 37 transition count 135
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 183 place count 32 transition count 130
Iterating global reduction 10 with 5 rules applied. Total rules applied 188 place count 32 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 10 with 37 rules applied. Total rules applied 225 place count 32 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 227 place count 31 transition count 92
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 229 place count 31 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 231 place count 31 transition count 90
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 233 place count 29 transition count 86
Iterating global reduction 10 with 2 rules applied. Total rules applied 235 place count 29 transition count 86
Applied a total of 235 rules in 88 ms. Remains 29 /102 variables (removed 73) and now considering 86/646 (removed 560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 29/102 places, 86/646 transitions.
RANDOM walk for 433 steps (0 resets) in 13 ms. (30 steps per ms) remains 0/1 properties
Computed a total of 214 stabilizing places and 224 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' '!(G((X(X(((p1||X(p2))&&p0)))||F(p3))))'
Support contains 4 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1029 transition count 1624
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1029 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 1024 transition count 1619
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 1024 transition count 1619
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1019 transition count 1614
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1019 transition count 1614
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1014 transition count 1609
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1014 transition count 1609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1014 transition count 1608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 1010 transition count 1604
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 1010 transition count 1604
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 1006 transition count 1600
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 1006 transition count 1600
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 1002 transition count 1596
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 1002 transition count 1596
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 998 transition count 1592
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 998 transition count 1592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 998 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 996 transition count 1589
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 996 transition count 1589
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 994 transition count 1587
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 994 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 992 transition count 1585
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 991 transition count 1584
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 990 transition count 1583
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 989 transition count 1582
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 989 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 989 transition count 1581
Applied a total of 97 rules in 436 ms. Remains 989 /1036 variables (removed 47) and now considering 1581/1631 (removed 50) transitions.
// Phase 1: matrix 1581 rows 989 cols
[2025-06-08 13:05:39] [INFO ] Computed 6 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:05:40] [INFO ] Implicit Places using invariants in 592 ms returned []
[2025-06-08 13:05:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:05:41] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
Running 1580 sub problems to find dead transitions.
[2025-06-08 13:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/2570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 1580/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/2570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 0/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61340ms problems are : Problem set: 0 solved, 1580 unsolved
Search for dead transitions found 0 dead transitions in 61346ms
Starting structural reductions in LTL mode, iteration 1 : 989/1036 places, 1581/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63546 ms. Remains : 989/1036 places, 1581/1631 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-00
Product exploration explored 100000 steps with 24999 reset in 295 ms.
Product exploration explored 100000 steps with 24977 reset in 271 ms.
Computed a total of 213 stabilizing places and 223 stable transitions
Computed a total of 213 stabilizing places and 223 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p1 p2), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
RANDOM walk for 40000 steps (420 resets) in 539 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (74 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (77 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (79 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 451832 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 7
Probabilistic random walk after 451832 steps, saw 88657 distinct states, run finished after 3005 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-08 13:06:47] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 586/590 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 399/989 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1581/2570 variables, 989/995 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2570 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/2570 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2570/2570 variables, and 995 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 989/989 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 586/590 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:48] [INFO ] Deduced a trap composed of 298 places in 216 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:49] [INFO ] Deduced a trap composed of 296 places in 214 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 399/989 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:49] [INFO ] Deduced a trap composed of 291 places in 415 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:50] [INFO ] Deduced a trap composed of 293 places in 418 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:50] [INFO ] Deduced a trap composed of 293 places in 320 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:51] [INFO ] Deduced a trap composed of 299 places in 291 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:51] [INFO ] Deduced a trap composed of 293 places in 391 ms of which 112 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1581/2570 variables, 989/1002 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2570 variables, 7/1009 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:06:53] [INFO ] Deduced a trap composed of 291 places in 428 ms of which 126 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2570 variables, 1/1010 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2570/2570 variables, and 1010 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 989/989 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6191ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 1581/1581 transitions.
Graph (trivial) has 972 edges and 989 vertex of which 80 / 989 are part of one of the 15 SCC in 2 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Graph (complete) has 1592 edges and 924 vertex of which 919 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 690 rules applied. Total rules applied 692 place count 919 transition count 802
Reduce places removed 685 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 699 rules applied. Total rules applied 1391 place count 234 transition count 788
Reduce places removed 6 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 14 rules applied. Total rules applied 1405 place count 228 transition count 780
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1415 place count 220 transition count 778
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1415 place count 220 transition count 723
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1525 place count 165 transition count 723
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1526 place count 165 transition count 722
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1596 place count 130 transition count 687
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1605 place count 130 transition count 678
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 1634 place count 101 transition count 228
Iterating global reduction 6 with 29 rules applied. Total rules applied 1663 place count 101 transition count 228
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1679 place count 101 transition count 212
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1692 place count 88 transition count 199
Iterating global reduction 7 with 13 rules applied. Total rules applied 1705 place count 88 transition count 199
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1714 place count 79 transition count 190
Iterating global reduction 7 with 9 rules applied. Total rules applied 1723 place count 79 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1727 place count 79 transition count 186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1739 place count 73 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1747 place count 69 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1748 place count 69 transition count 194
Free-agglomeration rule applied 26 times.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1774 place count 69 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 1817 place count 43 transition count 151
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1822 place count 38 transition count 146
Iterating global reduction 10 with 5 rules applied. Total rules applied 1827 place count 38 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 10 with 30 rules applied. Total rules applied 1857 place count 38 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1859 place count 37 transition count 121
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1864 place count 37 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1866 place count 37 transition count 119
Applied a total of 1866 rules in 67 ms. Remains 37 /989 variables (removed 952) and now considering 119/1581 (removed 1462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 37/989 places, 119/1581 transitions.
RANDOM walk for 7009 steps (2 resets) in 23 ms. (292 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p3) p0 p1 p2), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F p3), (F (NOT p0)), (F (NOT (OR (NOT p0) p3 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p3 p1)))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 989/989 places, 1581/1581 transitions.
Applied a total of 0 rules in 34 ms. Remains 989 /989 variables (removed 0) and now considering 1581/1581 (removed 0) transitions.
[2025-06-08 13:06:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:06:55] [INFO ] Implicit Places using invariants in 579 ms returned []
[2025-06-08 13:06:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:06:56] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
Running 1580 sub problems to find dead transitions.
[2025-06-08 13:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/2570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 1580/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/2570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 0/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61532ms problems are : Problem set: 0 solved, 1580 unsolved
Search for dead transitions found 0 dead transitions in 61536ms
Finished structural reductions in LTL mode , in 1 iterations and 63307 ms. Remains : 989/989 places, 1581/1581 transitions.
Computed a total of 213 stabilizing places and 223 stable transitions
Computed a total of 213 stabilizing places and 223 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p1 p2), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
RANDOM walk for 40000 steps (419 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (77 resets) in 34 ms. (1142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (75 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (77 resets) in 31 ms. (1250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (77 resets) in 29 ms. (1333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 29 ms. (1333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (77 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 471118 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 7
Probabilistic random walk after 471118 steps, saw 92004 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2025-06-08 13:08:01] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 586/590 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 399/989 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1581/2570 variables, 989/995 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2570 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/2570 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2570/2570 variables, and 995 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 989/989 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 586/590 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:02] [INFO ] Deduced a trap composed of 291 places in 204 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:02] [INFO ] Deduced a trap composed of 298 places in 196 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:03] [INFO ] Deduced a trap composed of 296 places in 219 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 399/989 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:04] [INFO ] Deduced a trap composed of 291 places in 518 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:04] [INFO ] Deduced a trap composed of 291 places in 393 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:05] [INFO ] Deduced a trap composed of 293 places in 504 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:05] [INFO ] Deduced a trap composed of 299 places in 468 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:06] [INFO ] Deduced a trap composed of 299 places in 407 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:06] [INFO ] Deduced a trap composed of 293 places in 448 ms of which 151 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1581/2570 variables, 989/1004 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2570 variables, 7/1011 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2570/2570 variables, and 1011 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 989/989 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6152ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 1581/1581 transitions.
Graph (trivial) has 972 edges and 989 vertex of which 80 / 989 are part of one of the 15 SCC in 5 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Graph (complete) has 1592 edges and 924 vertex of which 919 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 690 rules applied. Total rules applied 692 place count 919 transition count 802
Reduce places removed 685 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 699 rules applied. Total rules applied 1391 place count 234 transition count 788
Reduce places removed 6 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 14 rules applied. Total rules applied 1405 place count 228 transition count 780
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1415 place count 220 transition count 778
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1415 place count 220 transition count 723
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1525 place count 165 transition count 723
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1526 place count 165 transition count 722
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1596 place count 130 transition count 687
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1605 place count 130 transition count 678
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 1634 place count 101 transition count 228
Iterating global reduction 6 with 29 rules applied. Total rules applied 1663 place count 101 transition count 228
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1679 place count 101 transition count 212
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1692 place count 88 transition count 199
Iterating global reduction 7 with 13 rules applied. Total rules applied 1705 place count 88 transition count 199
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1714 place count 79 transition count 190
Iterating global reduction 7 with 9 rules applied. Total rules applied 1723 place count 79 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1727 place count 79 transition count 186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1739 place count 73 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1747 place count 69 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1748 place count 69 transition count 194
Free-agglomeration rule applied 26 times.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1774 place count 69 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 1817 place count 43 transition count 151
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1822 place count 38 transition count 146
Iterating global reduction 10 with 5 rules applied. Total rules applied 1827 place count 38 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 10 with 30 rules applied. Total rules applied 1857 place count 38 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1859 place count 37 transition count 121
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1864 place count 37 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1866 place count 37 transition count 119
Applied a total of 1866 rules in 81 ms. Remains 37 /989 variables (removed 952) and now considering 119/1581 (removed 1462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 37/989 places, 119/1581 transitions.
RANDOM walk for 16717 steps (4 resets) in 72 ms. (229 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p3) p0 p1 p2), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F p3), (F (NOT p0)), (F (NOT (OR (NOT p0) p3 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Product exploration explored 100000 steps with 24968 reset in 227 ms.
Product exploration explored 100000 steps with 24944 reset in 223 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 989/989 places, 1581/1581 transitions.
Graph (trivial) has 972 edges and 989 vertex of which 80 / 989 are part of one of the 15 SCC in 3 ms
Free SCC test removed 65 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Performed 684 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 684 rules applied. Total rules applied 685 place count 924 transition count 1507
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 695 place count 924 transition count 1497
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 695 place count 924 transition count 1502
Deduced a syphon composed of 725 places in 1 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 736 place count 924 transition count 1502
Discarding 616 places :
Symmetric choice reduction at 2 with 616 rule applications. Total rules 1352 place count 308 transition count 886
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 2 with 616 rules applied. Total rules applied 1968 place count 308 transition count 886
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 2022 place count 308 transition count 895
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 2111 place count 219 transition count 381
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 2200 place count 219 transition count 381
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2219 place count 219 transition count 362
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2257 place count 181 transition count 320
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 2295 place count 181 transition count 320
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 2308 place count 168 transition count 307
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 2321 place count 168 transition count 307
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2325 place count 168 transition count 303
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 2334 place count 159 transition count 294
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2343 place count 159 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 2344 place count 159 transition count 295
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2345 place count 158 transition count 293
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 2346 place count 158 transition count 293
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 2354 place count 158 transition count 329
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2366 place count 146 transition count 305
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 2378 place count 146 transition count 305
Deduced a syphon composed of 69 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2390 place count 146 transition count 293
Deduced a syphon composed of 69 places in 0 ms
Applied a total of 2390 rules in 153 ms. Remains 146 /989 variables (removed 843) and now considering 293/1581 (removed 1288) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:08:09] [INFO ] Redundant transitions in 14 ms returned []
Running 285 sub problems to find dead transitions.
[2025-06-08 13:08:09] [INFO ] Flow matrix only has 286 transitions (discarded 7 similar events)
// Phase 1: matrix 286 rows 146 cols
[2025-06-08 13:08:09] [INFO ] Computed 2 invariants in 13 ms
[2025-06-08 13:08:09] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:11] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:11] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:12] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:13] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
Problem TDEAD217 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:13] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:13] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:13] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:13] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 16/18 constraints. Problems are: Problem set: 10 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 275 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 4 (OVERLAPS) 285/431 variables, 146/164 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 60/224 constraints. Problems are: Problem set: 94 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:17] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 1/225 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/225 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 1/432 variables, 1/226 constraints. Problems are: Problem set: 94 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 226 constraints, problems are : Problem set: 94 solved, 191 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 146/146 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 94 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 70/146 variables, 2/2 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 17/19 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/19 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 285/431 variables, 146/165 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 60/225 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 191/416 constraints. Problems are: Problem set: 94 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:50] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:52] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:08:52] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 3/419 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/419 constraints. Problems are: Problem set: 94 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 1/432 variables, 1/420 constraints. Problems are: Problem set: 94 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 420 constraints, problems are : Problem set: 94 solved, 191 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 146/146 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 191/285 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 94 solved, 191 unsolved
Search for dead transitions found 94 dead transitions in 60149ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 146/989 places, 199/1581 transitions.
Graph (complete) has 424 edges and 146 vertex of which 77 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.1 ms
Discarding 69 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 77 /146 variables (removed 69) and now considering 207/199 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/989 places, 207/1581 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60336 ms. Remains : 77/989 places, 207/1581 transitions.
Built C files in :
/tmp/ltsmin12660340195067765909
[2025-06-08 13:09:09] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12660340195067765909
Running compilation step : cd /tmp/ltsmin12660340195067765909;'/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/ltsmin12660340195067765909;'/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/ltsmin12660340195067765909;'/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 989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 989/989 places, 1581/1581 transitions.
Applied a total of 0 rules in 26 ms. Remains 989 /989 variables (removed 0) and now considering 1581/1581 (removed 0) transitions.
// Phase 1: matrix 1581 rows 989 cols
[2025-06-08 13:09:12] [INFO ] Computed 6 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:09:13] [INFO ] Implicit Places using invariants in 550 ms returned []
[2025-06-08 13:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:09:14] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
Running 1580 sub problems to find dead transitions.
[2025-06-08 13:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/2570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 1580/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/2570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 0/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61410ms problems are : Problem set: 0 solved, 1580 unsolved
Search for dead transitions found 0 dead transitions in 61413ms
Finished structural reductions in LTL mode , in 1 iterations and 63176 ms. Remains : 989/989 places, 1581/1581 transitions.
Built C files in :
/tmp/ltsmin14852472284031475481
[2025-06-08 13:10:15] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14852472284031475481
Running compilation step : cd /tmp/ltsmin14852472284031475481;'/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/ltsmin14852472284031475481;'/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/ltsmin14852472284031475481;'/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-06-08 13:10:19] [INFO ] Flatten gal took : 106 ms
[2025-06-08 13:10:19] [INFO ] Flatten gal took : 105 ms
[2025-06-08 13:10:19] [INFO ] Time to serialize gal into /tmp/LTL17685338201445063898.gal : 37 ms
[2025-06-08 13:10:19] [INFO ] Time to serialize properties into /tmp/LTL16535037694219058943.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/LTL17685338201445063898.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12650880690502671377.hoa' '-atoms' '/tmp/LTL16535037694219058943.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...320
Loading property file /tmp/LTL16535037694219058943.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12650880690502671377.hoa
Detected timeout of ITS tools.
[2025-06-08 13:10:34] [INFO ] Flatten gal took : 81 ms
[2025-06-08 13:10:34] [INFO ] Flatten gal took : 105 ms
[2025-06-08 13:10:35] [INFO ] Time to serialize gal into /tmp/LTL7397088880169837506.gal : 29 ms
[2025-06-08 13:10:35] [INFO ] Time to serialize properties into /tmp/LTL13562343246738523136.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7397088880169837506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13562343246738523136.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((X(X(("((p1454==0)&&(p1178==0))")&&(("(p852==0)")||(X("(p613==0)"))))))||(F("(p1454==1)")))))
Formula 0 simplified : F(XX(!"((p1454==0)&&(p1178==0))" | (!"(p852==0)" & X!"(p613==0)")) & G!"(p1454==1)")
Detected timeout of ITS tools.
[2025-06-08 13:10:50] [INFO ] Flatten gal took : 50 ms
[2025-06-08 13:10:50] [INFO ] Applying decomposition
[2025-06-08 13:10:50] [INFO ] Flatten gal took : 51 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/graph15622308499758369530.txt' '-o' '/tmp/graph15622308499758369530.bin' '-w' '/tmp/graph15622308499758369530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15622308499758369530.bin' '-l' '-1' '-v' '-w' '/tmp/graph15622308499758369530.weights' '-q' '0' '-e' '0.001'
[2025-06-08 13:10:50] [INFO ] Decomposing Gal with order
[2025-06-08 13:10:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:10:50] [INFO ] Removed a total of 2807 redundant transitions.
[2025-06-08 13:10:50] [INFO ] Flatten gal took : 187 ms
[2025-06-08 13:10:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 29 ms.
[2025-06-08 13:10:50] [INFO ] Time to serialize gal into /tmp/LTL727676265827248798.gal : 17 ms
[2025-06-08 13:10:50] [INFO ] Time to serialize properties into /tmp/LTL1434951299602958391.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL727676265827248798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1434951299602958391.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...253
Read 1 LTL properties
Checking formula 0 : !((G((X(X(("((i36.u381.p1454==0)&&(i30.u313.p1178==0))")&&(("(i21.u217.p852==0)")||(X("(i16.u166.p613==0)"))))))||(F("(i36.u381.p1454=...164
Formula 0 simplified : F(XX(!"((i36.u381.p1454==0)&&(i30.u313.p1178==0))" | (!"(i21.u217.p852==0)" & X!"(i16.u166.p613==0)")) & G!"(i36.u381.p1454==1)")
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B03-LTLFireability-00 finished in 326813 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((p0||X(X(X(X(p1)))))))'
Support contains 2 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1029 transition count 1624
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1029 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 1024 transition count 1619
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 1024 transition count 1619
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1020 transition count 1615
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1020 transition count 1615
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1016 transition count 1611
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1016 transition count 1611
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1012 transition count 1607
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1012 transition count 1607
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1008 transition count 1603
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1008 transition count 1603
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1004 transition count 1599
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1004 transition count 1599
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1000 transition count 1595
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1000 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 998 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 998 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 996 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 996 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 994 transition count 1589
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 994 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 993 transition count 1588
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 993 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 992 transition count 1587
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 992 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 991 transition count 1586
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 991 transition count 1586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 991 transition count 1585
Applied a total of 91 rules in 494 ms. Remains 991 /1036 variables (removed 45) and now considering 1585/1631 (removed 46) transitions.
// Phase 1: matrix 1585 rows 991 cols
[2025-06-08 13:11:06] [INFO ] Computed 6 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:11:06] [INFO ] Implicit Places using invariants in 608 ms returned []
[2025-06-08 13:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:11:08] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2025-06-08 13:11:08] [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: ((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 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.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 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.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 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.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 1.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 1.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 1.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 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.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 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.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 1.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 1.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 1.0)
(s317 1.0)
(s318 1.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 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.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 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.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 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.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 timeout
1.0)
(s444 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2576 variables, and 0 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2576 variables, and 0 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 0/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61386ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 61389ms
Starting structural reductions in LTL mode, iteration 1 : 991/1036 places, 1585/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63623 ms. Remains : 991/1036 places, 1585/1631 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-01 finished in 63825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))||X((F(p2)&&X(p0)))))'
Support contains 3 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1028 transition count 1623
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1028 transition count 1623
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1021 transition count 1616
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1021 transition count 1616
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 1015 transition count 1610
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 1015 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1009 transition count 1604
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1009 transition count 1604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1009 transition count 1603
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 1004 transition count 1598
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 1004 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 999 transition count 1593
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 999 transition count 1593
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 994 transition count 1588
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 994 transition count 1588
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 989 transition count 1583
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 989 transition count 1583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 989 transition count 1582
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 987 transition count 1580
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 987 transition count 1580
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 985 transition count 1578
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 985 transition count 1578
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 983 transition count 1576
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 983 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 982 transition count 1575
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 982 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 981 transition count 1574
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 980 transition count 1573
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 980 transition count 1573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 980 transition count 1572
Applied a total of 115 rules in 428 ms. Remains 980 /1036 variables (removed 56) and now considering 1572/1631 (removed 59) transitions.
// Phase 1: matrix 1572 rows 980 cols
[2025-06-08 13:12:10] [INFO ] Computed 6 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:12:10] [INFO ] Implicit Places using invariants in 566 ms returned []
[2025-06-08 13:12:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:12:11] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
Running 1571 sub problems to find dead transitions.
[2025-06-08 13:12:11] [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: ((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 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.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 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.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 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.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 1.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 1.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 1.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 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.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 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.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 1.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 1.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 1.0)
(s317 1.0)
(s318 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/2552 variables, and 0 constraints, problems are : Problem set: 0 solved, 1571 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1571/1571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1571 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 979/2552 variables, and 0 constraints, problems are : Problem set: 0 solved, 1571 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61208ms problems are : Problem set: 0 solved, 1571 unsolved
Search for dead transitions found 0 dead transitions in 61211ms
Starting structural reductions in LTL mode, iteration 1 : 980/1036 places, 1572/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63420 ms. Remains : 980/1036 places, 1572/1631 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-02
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-02 finished in 63767 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(p0)||F(p1))&&F((p2&&X((F(p3)||G(p2)))))))'
Support contains 4 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1029 transition count 1624
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1029 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 1024 transition count 1619
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 1024 transition count 1619
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1020 transition count 1615
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1020 transition count 1615
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1016 transition count 1611
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1016 transition count 1611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1016 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1013 transition count 1607
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1013 transition count 1607
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1010 transition count 1604
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1010 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1007 transition count 1601
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1007 transition count 1601
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 1004 transition count 1598
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 1004 transition count 1598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1004 transition count 1597
Applied a total of 66 rules in 274 ms. Remains 1004 /1036 variables (removed 32) and now considering 1597/1631 (removed 34) transitions.
// Phase 1: matrix 1597 rows 1004 cols
[2025-06-08 13:13:13] [INFO ] Computed 6 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:13:14] [INFO ] Implicit Places using invariants in 580 ms returned []
[2025-06-08 13:13:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:13:15] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1737 ms to find 0 implicit places.
Running 1596 sub problems to find dead transitions.
[2025-06-08 13:13:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/2601 variables, and 0 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1596 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/2601 variables, and 0 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/1596 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61334ms problems are : Problem set: 0 solved, 1596 unsolved
Search for dead transitions found 0 dead transitions in 61336ms
Starting structural reductions in LTL mode, iteration 1 : 1004/1036 places, 1597/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63353 ms. Remains : 1004/1036 places, 1597/1631 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-03
Product exploration explored 100000 steps with 1054 reset in 168 ms.
Product exploration explored 100000 steps with 1056 reset in 183 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Detected a total of 205/1004 stabilizing places and 215/1597 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1 (NOT p3)), (X (NOT p3)), (X (AND p2 (NOT p3))), (X p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 176 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (423 resets) in 126 ms. (314 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (78 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 22 ms. (1739 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (80 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
[2025-06-08 13:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 410/412 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 592/1004 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:18] [INFO ] Deduced a trap composed of 296 places in 403 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1004 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1004 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1597/2601 variables, 1004/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2601 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2601 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2601/2601 variables, and 1011 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 410/412 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 592/1004 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1004 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:20] [INFO ] Deduced a trap composed of 292 places in 621 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:20] [INFO ] Deduced a trap composed of 307 places in 311 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1004 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1004 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1597/2601 variables, 1004/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2601 variables, 3/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:21] [INFO ] Deduced a trap composed of 296 places in 501 ms of which 152 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2601 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2601 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2601 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2601/2601 variables, and 1017 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3164 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4688ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 230 ms.
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 1597/1597 transitions.
Graph (trivial) has 997 edges and 1004 vertex of which 80 / 1004 are part of one of the 15 SCC in 1 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Graph (complete) has 1615 edges and 939 vertex of which 934 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 0 with 708 rules applied. Total rules applied 710 place count 934 transition count 799
Reduce places removed 703 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 718 rules applied. Total rules applied 1428 place count 231 transition count 784
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1434 place count 226 transition count 783
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1435 place count 225 transition count 783
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1435 place count 225 transition count 725
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1551 place count 167 transition count 725
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1552 place count 167 transition count 724
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1553 place count 166 transition count 723
Iterating global reduction 5 with 1 rules applied. Total rules applied 1554 place count 166 transition count 723
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1555 place count 165 transition count 722
Iterating global reduction 5 with 1 rules applied. Total rules applied 1556 place count 165 transition count 722
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1628 place count 129 transition count 686
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1638 place count 129 transition count 676
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 1669 place count 98 transition count 224
Iterating global reduction 6 with 31 rules applied. Total rules applied 1700 place count 98 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1715 place count 98 transition count 209
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1730 place count 83 transition count 194
Iterating global reduction 7 with 15 rules applied. Total rules applied 1745 place count 83 transition count 194
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1755 place count 73 transition count 184
Iterating global reduction 7 with 10 rules applied. Total rules applied 1765 place count 73 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1770 place count 73 transition count 179
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1780 place count 68 transition count 174
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1786 place count 65 transition count 182
Free-agglomeration rule applied 27 times.
Iterating global reduction 8 with 27 rules applied. Total rules applied 1813 place count 65 transition count 155
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 44 rules applied. Total rules applied 1857 place count 38 transition count 138
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1862 place count 33 transition count 133
Iterating global reduction 9 with 5 rules applied. Total rules applied 1867 place count 33 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 1915 place count 33 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1917 place count 32 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1921 place count 30 transition count 102
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1922 place count 30 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1923 place count 29 transition count 101
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1926 place count 29 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1928 place count 29 transition count 99
Applied a total of 1928 rules in 124 ms. Remains 29 /1004 variables (removed 975) and now considering 99/1597 (removed 1498) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 29/1004 places, 99/1597 transitions.
RANDOM walk for 769 steps (0 resets) in 6 ms. (109 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p0 p1 (NOT p3)), (X (NOT p3)), (X (AND p2 (NOT p3))), (X p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (AND p2 (NOT p3)))), (F p3)]
Knowledge based reduction with 18 factoid took 534 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false]
Support contains 2 out of 1004 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 1597/1597 transitions.
Graph (trivial) has 993 edges and 1004 vertex of which 80 / 1004 are part of one of the 15 SCC in 0 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 688 transitions
Trivial Post-agglo rules discarded 688 transitions
Performed 688 trivial Post agglomeration. Transition count delta: 688
Iterating post reduction 0 with 688 rules applied. Total rules applied 689 place count 938 transition count 833
Reduce places removed 688 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 703 rules applied. Total rules applied 1392 place count 250 transition count 818
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1399 place count 245 transition count 816
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1401 place count 243 transition count 816
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 1401 place count 243 transition count 762
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 1509 place count 189 transition count 762
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1513 place count 185 transition count 758
Iterating global reduction 4 with 4 rules applied. Total rules applied 1517 place count 185 transition count 758
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1595 place count 146 transition count 719
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 1625 place count 116 transition count 272
Iterating global reduction 4 with 30 rules applied. Total rules applied 1655 place count 116 transition count 272
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1668 place count 116 transition count 259
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1683 place count 101 transition count 239
Iterating global reduction 5 with 15 rules applied. Total rules applied 1698 place count 101 transition count 239
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1713 place count 86 transition count 219
Iterating global reduction 5 with 15 rules applied. Total rules applied 1728 place count 86 transition count 219
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1732 place count 86 transition count 215
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1750 place count 77 transition count 229
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1751 place count 76 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 1752 place count 76 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1753 place count 76 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1758 place count 76 transition count 213
Applied a total of 1758 rules in 53 ms. Remains 76 /1004 variables (removed 928) and now considering 213/1597 (removed 1384) transitions.
[2025-06-08 13:14:23] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
// Phase 1: matrix 207 rows 76 cols
[2025-06-08 13:14:23] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:14:24] [INFO ] Implicit Places using invariants in 532 ms returned []
[2025-06-08 13:14:24] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2025-06-08 13:14:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:14:24] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:14:24] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:14:24] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2025-06-08 13:14:24] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2025-06-08 13:14:24] [INFO ] Invariant cache hit.
[2025-06-08 13:14:24] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:25] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:27] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:28] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:28] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:28] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 206/282 variables, 76/101 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 30/131 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:14:31] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 1/283 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 133 constraints, problems are : Problem set: 0 solved, 188 unsolved in 18076 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 206/282 variables, 76/102 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 188/320 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 1/283 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:05] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:05] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:05] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:06] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 325 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48177ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 48178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/1004 places, 213/1597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48924 ms. Remains : 76/1004 places, 213/1597 transitions.
Computed a total of 4 stabilizing places and 28 stable transitions
Computed a total of 4 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 (NOT p3)), (X p2), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (4265 resets) in 727 ms. (54 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (437 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (436 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (437 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
[2025-06-08 13:15:13] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2025-06-08 13:15:13] [INFO ] Invariant cache hit.
[2025-06-08 13:15:13] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:13] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 205/279 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 30/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/282 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/283 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 110 constraints, problems are : Problem set: 0 solved, 3 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:13] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 205/279 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/282 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/283 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 114 constraints, problems are : Problem set: 0 solved, 3 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1440 steps, including 102 resets, run visited all 3 properties in 16 ms. (steps per millisecond=90 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 20 ms.
Knowledge obtained : [(AND p2 (NOT p3)), (X p2), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (AND p2 (NOT p3)))), (F p3)]
Knowledge based reduction with 13 factoid took 402 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false]
Stuttering criterion allowed to conclude after 4663 steps with 490 reset in 23 ms.
FORMULA MedleyB-PT-B03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-03 finished in 121519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(F((X(!(p0 U p1))&&G(p0)))))))'
Support contains 10 out of 1036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Graph (trivial) has 1023 edges and 1036 vertex of which 83 / 1036 are part of one of the 15 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 710 transitions
Trivial Post-agglo rules discarded 710 transitions
Performed 710 trivial Post agglomeration. Transition count delta: 710
Iterating post reduction 0 with 710 rules applied. Total rules applied 711 place count 967 transition count 842
Reduce places removed 710 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 725 rules applied. Total rules applied 1436 place count 257 transition count 827
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1442 place count 251 transition count 827
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 1442 place count 251 transition count 773
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 1550 place count 197 transition count 773
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1558 place count 189 transition count 765
Iterating global reduction 3 with 8 rules applied. Total rules applied 1566 place count 189 transition count 765
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1569 place count 186 transition count 762
Iterating global reduction 3 with 3 rules applied. Total rules applied 1572 place count 186 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1573 place count 186 transition count 761
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1574 place count 185 transition count 760
Iterating global reduction 4 with 1 rules applied. Total rules applied 1575 place count 185 transition count 760
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1576 place count 184 transition count 759
Iterating global reduction 4 with 1 rules applied. Total rules applied 1577 place count 184 transition count 759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1578 place count 184 transition count 758
Performed 39 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1656 place count 145 transition count 717
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1681 place count 120 transition count 386
Iterating global reduction 5 with 25 rules applied. Total rules applied 1706 place count 120 transition count 386
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1716 place count 120 transition count 376
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1731 place count 105 transition count 356
Iterating global reduction 6 with 15 rules applied. Total rules applied 1746 place count 105 transition count 356
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1761 place count 90 transition count 336
Iterating global reduction 6 with 15 rules applied. Total rules applied 1776 place count 90 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1781 place count 90 transition count 331
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1799 place count 81 transition count 338
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1800 place count 80 transition count 328
Iterating global reduction 7 with 1 rules applied. Total rules applied 1801 place count 80 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1802 place count 80 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1807 place count 80 transition count 322
Applied a total of 1807 rules in 66 ms. Remains 80 /1036 variables (removed 956) and now considering 322/1631 (removed 1309) transitions.
[2025-06-08 13:15:15] [INFO ] Flow matrix only has 316 transitions (discarded 6 similar events)
// Phase 1: matrix 316 rows 80 cols
[2025-06-08 13:15:15] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:15:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-08 13:15:15] [INFO ] Flow matrix only has 316 transitions (discarded 6 similar events)
[2025-06-08 13:15:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:15:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:15:15] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:15:15] [INFO ] Redundant transitions in 8 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-08 13:15:15] [INFO ] Flow matrix only has 316 transitions (discarded 6 similar events)
[2025-06-08 13:15:15] [INFO ] Invariant cache hit.
[2025-06-08 13:15:15] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:17] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:17] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:17] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:17] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:17] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:17] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:18] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:18] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:18] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:18] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:18] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:18] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:19] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 315/395 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:23] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:31] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:31] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/396 variables, and 129 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 315/395 variables, 80/98 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 305/433 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 305 unsolved
SMT process timed out in 60267ms, After SMT, problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 80/1036 places, 322/1631 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60600 ms. Remains : 80/1036 places, 322/1631 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-04 finished in 60772 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 X((G((p0||(!p1&&X(p2))))||((p0||(!p1&&X(p2)))&&F(G(p3)))))))'
Support contains 8 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1028 transition count 1623
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1028 transition count 1623
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 1022 transition count 1617
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 1022 transition count 1617
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1017 transition count 1612
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1017 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 1012 transition count 1607
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 1012 transition count 1607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1012 transition count 1606
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 1008 transition count 1602
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 1008 transition count 1602
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1004 transition count 1598
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1004 transition count 1598
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 1000 transition count 1594
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 1000 transition count 1594
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 996 transition count 1590
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 996 transition count 1590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 996 transition count 1589
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 994 transition count 1587
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 994 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 992 transition count 1585
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 992 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 990 transition count 1583
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 989 transition count 1582
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 988 transition count 1581
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 987 transition count 1580
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 987 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 987 transition count 1579
Applied a total of 101 rules in 433 ms. Remains 987 /1036 variables (removed 49) and now considering 1579/1631 (removed 52) transitions.
// Phase 1: matrix 1579 rows 987 cols
[2025-06-08 13:16:16] [INFO ] Computed 6 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:16:16] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-06-08 13:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:16:17] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
Running 1578 sub problems to find dead transitions.
[2025-06-08 13:16:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 1578/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 0/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61453ms problems are : Problem set: 0 solved, 1578 unsolved
Search for dead transitions found 0 dead transitions in 61458ms
Starting structural reductions in LTL mode, iteration 1 : 987/1036 places, 1579/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63549 ms. Remains : 987/1036 places, 1579/1631 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, (NOT p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-05
Product exploration explored 100000 steps with 24983 reset in 266 ms.
Product exploration explored 100000 steps with 24905 reset in 305 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Detected a total of 205/987 stabilizing places and 215/1579 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 132 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (425 resets) in 234 ms. (170 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (77 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (75 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
[2025-06-08 13:17:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 966/973 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/973 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/987 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1579/2566 variables, 987/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2566 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2566 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2566/2566 variables, and 993 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 987/987 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 966/973 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/973 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/987 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1579/2566 variables, 987/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2566 variables, 3/996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2566 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2566 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2566/2566 variables, and 996 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2367 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 987/987 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3945ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 411 ms.
Support contains 7 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1579/1579 transitions.
Graph (trivial) has 977 edges and 987 vertex of which 80 / 987 are part of one of the 15 SCC in 0 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Graph (complete) has 1589 edges and 922 vertex of which 917 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 687 transitions
Trivial Post-agglo rules discarded 687 transitions
Performed 687 trivial Post agglomeration. Transition count delta: 687
Iterating post reduction 0 with 692 rules applied. Total rules applied 694 place count 917 transition count 797
Reduce places removed 687 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 701 rules applied. Total rules applied 1395 place count 230 transition count 783
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1401 place count 225 transition count 782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1402 place count 224 transition count 782
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1402 place count 224 transition count 726
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1514 place count 168 transition count 726
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1515 place count 168 transition count 725
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1587 place count 132 transition count 689
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1597 place count 132 transition count 679
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 1624 place count 105 transition count 357
Iterating global reduction 6 with 27 rules applied. Total rules applied 1651 place count 105 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1663 place count 105 transition count 345
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1678 place count 90 transition count 330
Iterating global reduction 7 with 15 rules applied. Total rules applied 1693 place count 90 transition count 330
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1703 place count 80 transition count 320
Iterating global reduction 7 with 10 rules applied. Total rules applied 1713 place count 80 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1717 place count 80 transition count 316
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1727 place count 75 transition count 311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1733 place count 72 transition count 326
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 1764 place count 72 transition count 295
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1812 place count 41 transition count 278
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1817 place count 36 transition count 273
Iterating global reduction 9 with 5 rules applied. Total rules applied 1822 place count 36 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 9 with 72 rules applied. Total rules applied 1894 place count 36 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1896 place count 35 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1900 place count 33 transition count 218
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1901 place count 33 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1902 place count 32 transition count 217
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1905 place count 32 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1907 place count 32 transition count 215
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1908 place count 31 transition count 213
Iterating global reduction 10 with 1 rules applied. Total rules applied 1909 place count 31 transition count 213
Applied a total of 1909 rules in 96 ms. Remains 31 /987 variables (removed 956) and now considering 213/1579 (removed 1366) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 31/987 places, 213/1579 transitions.
RANDOM walk for 408 steps (0 resets) in 6 ms. (58 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (OR (NOT p0) p2) (OR p1 p2)))), (F (NOT p3)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 15 factoid took 510 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 213 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Support contains 8 out of 987 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1579/1579 transitions.
Applied a total of 0 rules in 32 ms. Remains 987 /987 variables (removed 0) and now considering 1579/1579 (removed 0) transitions.
[2025-06-08 13:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:17:26] [INFO ] Implicit Places using invariants in 507 ms returned []
[2025-06-08 13:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:17:28] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
Running 1578 sub problems to find dead transitions.
[2025-06-08 13:17:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 1578/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 0/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61728ms problems are : Problem set: 0 solved, 1578 unsolved
Search for dead transitions found 0 dead transitions in 61730ms
Finished structural reductions in LTL mode , in 1 iterations and 63458 ms. Remains : 987/987 places, 1579/1579 transitions.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Detected a total of 205/987 stabilizing places and 215/1579 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 131 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 225 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (420 resets) in 152 ms. (261 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (77 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (78 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
[2025-06-08 13:18:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 966/973 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/973 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/987 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1579/2566 variables, 987/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2566 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2566 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2566/2566 variables, and 993 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 987/987 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 966/973 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/973 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/987 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1579/2566 variables, 987/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2566 variables, 3/996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2566 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2566 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2566/2566 variables, and 996 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2733 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 987/987 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4404ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 301 ms.
Support contains 7 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1579/1579 transitions.
Graph (trivial) has 977 edges and 987 vertex of which 80 / 987 are part of one of the 15 SCC in 1 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Graph (complete) has 1589 edges and 922 vertex of which 917 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 687 transitions
Trivial Post-agglo rules discarded 687 transitions
Performed 687 trivial Post agglomeration. Transition count delta: 687
Iterating post reduction 0 with 692 rules applied. Total rules applied 694 place count 917 transition count 797
Reduce places removed 687 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 701 rules applied. Total rules applied 1395 place count 230 transition count 783
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1401 place count 225 transition count 782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1402 place count 224 transition count 782
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1402 place count 224 transition count 726
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1514 place count 168 transition count 726
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1515 place count 168 transition count 725
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1587 place count 132 transition count 689
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1597 place count 132 transition count 679
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 1624 place count 105 transition count 357
Iterating global reduction 6 with 27 rules applied. Total rules applied 1651 place count 105 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1663 place count 105 transition count 345
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1678 place count 90 transition count 330
Iterating global reduction 7 with 15 rules applied. Total rules applied 1693 place count 90 transition count 330
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1703 place count 80 transition count 320
Iterating global reduction 7 with 10 rules applied. Total rules applied 1713 place count 80 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1717 place count 80 transition count 316
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1727 place count 75 transition count 311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1733 place count 72 transition count 326
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 1764 place count 72 transition count 295
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1812 place count 41 transition count 278
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1817 place count 36 transition count 273
Iterating global reduction 9 with 5 rules applied. Total rules applied 1822 place count 36 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 9 with 72 rules applied. Total rules applied 1894 place count 36 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1896 place count 35 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1900 place count 33 transition count 218
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1901 place count 33 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1902 place count 32 transition count 217
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1905 place count 32 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1907 place count 32 transition count 215
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1908 place count 31 transition count 213
Iterating global reduction 10 with 1 rules applied. Total rules applied 1909 place count 31 transition count 213
Applied a total of 1909 rules in 109 ms. Remains 31 /987 variables (removed 956) and now considering 213/1579 (removed 1366) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 31/987 places, 213/1579 transitions.
RANDOM walk for 227 steps (0 resets) in 4 ms. (45 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (AND (OR p1 p2) (OR p2 (NOT p0))))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p3)), (F p1)]
Knowledge based reduction with 7 factoid took 301 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 187 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 20034 reset in 257 ms.
Product exploration explored 100000 steps with 20010 reset in 224 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Support contains 8 out of 987 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 987/987 places, 1579/1579 transitions.
Graph (trivial) has 975 edges and 987 vertex of which 80 / 987 are part of one of the 15 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 676 rules applied. Total rules applied 677 place count 922 transition count 1504
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 686 place count 922 transition count 1495
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 686 place count 922 transition count 1500
Deduced a syphon composed of 716 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 726 place count 922 transition count 1500
Discarding 607 places :
Symmetric choice reduction at 2 with 607 rule applications. Total rules 1333 place count 315 transition count 893
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 2 with 607 rules applied. Total rules applied 1940 place count 315 transition count 893
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1996 place count 315 transition count 909
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 2083 place count 228 transition count 522
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 87 rules applied. Total rules applied 2170 place count 228 transition count 522
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 2187 place count 228 transition count 505
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 2224 place count 191 transition count 463
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 3 with 37 rules applied. Total rules applied 2261 place count 191 transition count 463
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2276 place count 176 transition count 448
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 2291 place count 176 transition count 448
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2295 place count 176 transition count 444
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2305 place count 166 transition count 434
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 2315 place count 166 transition count 434
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 2323 place count 166 transition count 472
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2336 place count 153 transition count 446
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 2349 place count 153 transition count 446
Deduced a syphon composed of 72 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 2359 place count 153 transition count 436
Deduced a syphon composed of 72 places in 1 ms
Applied a total of 2359 rules in 148 ms. Remains 153 /987 variables (removed 834) and now considering 436/1579 (removed 1143) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:18:36] [INFO ] Redundant transitions in 3 ms returned []
Running 428 sub problems to find dead transitions.
[2025-06-08 13:18:36] [INFO ] Flow matrix only has 430 transitions (discarded 6 similar events)
// Phase 1: matrix 430 rows 153 cols
[2025-06-08 13:18:36] [INFO ] Computed 2 invariants in 3 ms
[2025-06-08 13:18:36] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:40] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:41] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:41] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:41] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:41] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:41] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:41] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:41] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:42] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:42] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:42] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:42] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 7 ms to minimize.
Problem TDEAD364 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:43] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:43] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:43] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:43] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 16/18 constraints. Problems are: Problem set: 10 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:44] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:44] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/20 constraints. Problems are: Problem set: 10 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:47] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:18:48] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/22 constraints. Problems are: Problem set: 10 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 10 solved, 418 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 6 (OVERLAPS) 429/582 variables, 153/175 constraints. Problems are: Problem set: 104 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 55/230 constraints. Problems are: Problem set: 104 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/230 constraints. Problems are: Problem set: 104 solved, 324 unsolved
SMT process timed out in 30477ms, After SMT, problems are : Problem set: 104 solved, 324 unsolved
Search for dead transitions found 104 dead transitions in 30479ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 153/987 places, 332/1579 transitions.
Graph (complete) has 455 edges and 153 vertex of which 81 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.1 ms
Discarding 72 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 348
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 10 ms. Remains 81 /153 variables (removed 72) and now considering 348/332 (removed -16) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/987 places, 348/1579 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30668 ms. Remains : 81/987 places, 348/1579 transitions.
Built C files in :
/tmp/ltsmin15876065028881636531
[2025-06-08 13:19:07] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15876065028881636531
Running compilation step : cd /tmp/ltsmin15876065028881636531;'/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/ltsmin15876065028881636531;'/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/ltsmin15876065028881636531;'/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 8 out of 987 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 987/987 places, 1579/1579 transitions.
Applied a total of 0 rules in 71 ms. Remains 987 /987 variables (removed 0) and now considering 1579/1579 (removed 0) transitions.
// Phase 1: matrix 1579 rows 987 cols
[2025-06-08 13:19:10] [INFO ] Computed 6 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:19:11] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-06-08 13:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:19:12] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Running 1578 sub problems to find dead transitions.
[2025-06-08 13:19:12] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 1578/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1)
(s54 1)
(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 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(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 1)
(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 1)
(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 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(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 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 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(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 1)
(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 1)
(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 1)
(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 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(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 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(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 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 0/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61657ms problems are : Problem set: 0 solved, 1578 unsolved
Search for dead transitions found 0 dead transitions in 61661ms
Finished structural reductions in LTL mode , in 1 iterations and 63391 ms. Remains : 987/987 places, 1579/1579 transitions.
Built C files in :
/tmp/ltsmin16152623218414056488
[2025-06-08 13:20:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16152623218414056488
Running compilation step : cd /tmp/ltsmin16152623218414056488;'/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/ltsmin16152623218414056488;'/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/ltsmin16152623218414056488;'/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-06-08 13:20:17] [INFO ] Flatten gal took : 45 ms
[2025-06-08 13:20:17] [INFO ] Flatten gal took : 43 ms
[2025-06-08 13:20:17] [INFO ] Time to serialize gal into /tmp/LTL10168081924158963010.gal : 10 ms
[2025-06-08 13:20:17] [INFO ] Time to serialize properties into /tmp/LTL4459339806073117194.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/LTL10168081924158963010.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6548019866208428875.hoa' '-atoms' '/tmp/LTL4459339806073117194.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/LTL4459339806073117194.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6548019866208428875.hoa
Detected timeout of ITS tools.
[2025-06-08 13:20:32] [INFO ] Flatten gal took : 39 ms
[2025-06-08 13:20:32] [INFO ] Flatten gal took : 38 ms
[2025-06-08 13:20:32] [INFO ] Time to serialize gal into /tmp/LTL12835064008986136794.gal : 9 ms
[2025-06-08 13:20:32] [INFO ] Time to serialize properties into /tmp/LTL1837309420316241585.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12835064008986136794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1837309420316241585.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 : !((("(p573==1)")U(X((G(("(p573==1)")||((!("((((p95==1)&&(p418==1))&&((p719==1)&&(p1043==1)))&&(p1344==1))"))&&(X("(p640!=1)")))))||((F...285
Formula 0 simplified : !"(p573==1)" R X(F(!"(p573==1)" & ("((((p95==1)&&(p418==1))&&((p719==1)&&(p1043==1)))&&(p1344==1))" | X!"(p640!=1)")) & ((!"(p573==1...262
Detected timeout of ITS tools.
[2025-06-08 13:20:47] [INFO ] Flatten gal took : 48 ms
[2025-06-08 13:20:47] [INFO ] Applying decomposition
[2025-06-08 13:20:47] [INFO ] Flatten gal took : 38 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/graph7170555366657957254.txt' '-o' '/tmp/graph7170555366657957254.bin' '-w' '/tmp/graph7170555366657957254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7170555366657957254.bin' '-l' '-1' '-v' '-w' '/tmp/graph7170555366657957254.weights' '-q' '0' '-e' '0.001'
[2025-06-08 13:20:47] [INFO ] Decomposing Gal with order
[2025-06-08 13:20:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:20:47] [INFO ] Removed a total of 2811 redundant transitions.
[2025-06-08 13:20:47] [INFO ] Flatten gal took : 88 ms
[2025-06-08 13:20:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 16 ms.
[2025-06-08 13:20:47] [INFO ] Time to serialize gal into /tmp/LTL18300012327087265847.gal : 9 ms
[2025-06-08 13:20:47] [INFO ] Time to serialize properties into /tmp/LTL10099106094165063841.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/LTL18300012327087265847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10099106094165063841.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((("(i14.i0.i1.u149.p573==1)")U(X((G(("(i14.i0.i1.u149.p573==1)")||((!("((((i24.u30.p95==1)&&(i24.u82.p418==1))&&((i24.u160.p719==1)&...461
Formula 0 simplified : !"(i14.i0.i1.u149.p573==1)" R X(F(!"(i14.i0.i1.u149.p573==1)" & ("((((i24.u30.p95==1)&&(i24.u82.p418==1))&&((i24.u160.p719==1)&&(i24...438
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B03-LTLFireability-05 finished in 287282 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&&X(F((p0||X(p1)))))))'
Support contains 6 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1027 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1027 transition count 1622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 1020 transition count 1615
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 1020 transition count 1615
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 1014 transition count 1609
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1014 transition count 1609
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1008 transition count 1603
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1008 transition count 1603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1008 transition count 1602
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 1003 transition count 1597
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 1003 transition count 1597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 998 transition count 1592
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 998 transition count 1592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 993 transition count 1587
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 993 transition count 1587
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 988 transition count 1582
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 988 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 988 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 986 transition count 1579
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 986 transition count 1579
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 984 transition count 1577
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 984 transition count 1577
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 982 transition count 1575
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 982 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 981 transition count 1574
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 980 transition count 1573
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 980 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 979 transition count 1572
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 979 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 979 transition count 1571
Applied a total of 117 rules in 434 ms. Remains 979 /1036 variables (removed 57) and now considering 1571/1631 (removed 60) transitions.
// Phase 1: matrix 1571 rows 979 cols
[2025-06-08 13:21:03] [INFO ] Computed 6 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:21:03] [INFO ] Implicit Places using invariants in 522 ms returned []
[2025-06-08 13:21:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:21:05] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
Running 1570 sub problems to find dead transitions.
[2025-06-08 13:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1)
(s54 1)
(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 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(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 1)
(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 1)
(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 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(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 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 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(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 1)
(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 1)
(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 1)
(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 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(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 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(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 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61439ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 61442ms
Starting structural reductions in LTL mode, iteration 1 : 979/1036 places, 1571/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63469 ms. Remains : 979/1036 places, 1571/1631 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-07 finished in 63684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(((p1||X(X(!p2))) U (G((p1||X(X(!p2))))||(p3&&(p1||X(X(!p2)))))) U (G((p1||X(X(!p2))))||(((p1||X(X(!p2))) U (G((p1||X(X(!p2))))||(p3&&(p1||X(X(!p2))))))&&p4)))))'
Support contains 10 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1027 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1027 transition count 1622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 1020 transition count 1615
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 1020 transition count 1615
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 1014 transition count 1609
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1014 transition count 1609
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1008 transition count 1603
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1008 transition count 1603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1008 transition count 1602
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 1003 transition count 1597
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 1003 transition count 1597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 998 transition count 1592
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 998 transition count 1592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 993 transition count 1587
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 993 transition count 1587
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 988 transition count 1582
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 988 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 988 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 986 transition count 1579
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 986 transition count 1579
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 984 transition count 1577
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 984 transition count 1577
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 982 transition count 1575
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 982 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 981 transition count 1574
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 980 transition count 1573
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 980 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 979 transition count 1572
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 979 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 979 transition count 1571
Applied a total of 117 rules in 456 ms. Remains 979 /1036 variables (removed 57) and now considering 1571/1631 (removed 60) transitions.
[2025-06-08 13:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:22:07] [INFO ] Implicit Places using invariants in 506 ms returned []
[2025-06-08 13:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:22:08] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
Running 1570 sub problems to find dead transitions.
[2025-06-08 13:22:08] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61422ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 61432ms
Starting structural reductions in LTL mode, iteration 1 : 979/1036 places, 1571/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63492 ms. Remains : 979/1036 places, 1571/1631 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-08
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-08 finished in 63852 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 5 out of 1036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Graph (trivial) has 1028 edges and 1036 vertex of which 83 / 1036 are part of one of the 15 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 715 transitions
Trivial Post-agglo rules discarded 715 transitions
Performed 715 trivial Post agglomeration. Transition count delta: 715
Iterating post reduction 0 with 715 rules applied. Total rules applied 716 place count 967 transition count 837
Reduce places removed 715 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 730 rules applied. Total rules applied 1446 place count 252 transition count 822
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1452 place count 246 transition count 822
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 1452 place count 246 transition count 768
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 1560 place count 192 transition count 768
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1568 place count 184 transition count 760
Iterating global reduction 3 with 8 rules applied. Total rules applied 1576 place count 184 transition count 760
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1579 place count 181 transition count 757
Iterating global reduction 3 with 3 rules applied. Total rules applied 1582 place count 181 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1583 place count 181 transition count 756
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1584 place count 180 transition count 755
Iterating global reduction 4 with 1 rules applied. Total rules applied 1585 place count 180 transition count 755
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1586 place count 179 transition count 754
Iterating global reduction 4 with 1 rules applied. Total rules applied 1587 place count 179 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1588 place count 179 transition count 753
Performed 39 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1666 place count 140 transition count 712
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 1692 place count 114 transition count 395
Iterating global reduction 5 with 26 rules applied. Total rules applied 1718 place count 114 transition count 395
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1729 place count 114 transition count 384
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1744 place count 99 transition count 364
Iterating global reduction 6 with 15 rules applied. Total rules applied 1759 place count 99 transition count 364
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1774 place count 84 transition count 344
Iterating global reduction 6 with 15 rules applied. Total rules applied 1789 place count 84 transition count 344
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1794 place count 84 transition count 339
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1812 place count 75 transition count 346
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1813 place count 74 transition count 336
Iterating global reduction 7 with 1 rules applied. Total rules applied 1814 place count 74 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1815 place count 74 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1820 place count 74 transition count 330
Applied a total of 1820 rules in 69 ms. Remains 74 /1036 variables (removed 962) and now considering 330/1631 (removed 1301) transitions.
[2025-06-08 13:23:10] [INFO ] Flow matrix only has 324 transitions (discarded 6 similar events)
// Phase 1: matrix 324 rows 74 cols
[2025-06-08 13:23:10] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:23:10] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-08 13:23:10] [INFO ] Flow matrix only has 324 transitions (discarded 6 similar events)
[2025-06-08 13:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:23:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:23:10] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:23:10] [INFO ] Redundant transitions in 1 ms returned []
Running 313 sub problems to find dead transitions.
[2025-06-08 13:23:10] [INFO ] Flow matrix only has 324 transitions (discarded 6 similar events)
[2025-06-08 13:23:10] [INFO ] Invariant cache hit.
[2025-06-08 13:23:10] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:12] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:13] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:14] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:14] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:14] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:14] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:14] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:15] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 323/397 variables, 74/91 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:19] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:22] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 11 (OVERLAPS) 1/398 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:29] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:29] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:40] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:23:40] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/398 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/398 variables, and 128 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 323/397 variables, 74/97 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 313/440 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/398 variables, and 440 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/1036 places, 330/1631 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60722 ms. Remains : 74/1036 places, 330/1631 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-14
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-14 finished in 60832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 7 out of 1036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Graph (trivial) has 1017 edges and 1036 vertex of which 82 / 1036 are part of one of the 15 SCC in 1 ms
Free SCC test removed 67 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 711 transitions
Trivial Post-agglo rules discarded 711 transitions
Performed 711 trivial Post agglomeration. Transition count delta: 711
Iterating post reduction 0 with 711 rules applied. Total rules applied 712 place count 968 transition count 843
Reduce places removed 711 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 726 rules applied. Total rules applied 1438 place count 257 transition count 828
Reduce places removed 6 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 13 rules applied. Total rules applied 1451 place count 251 transition count 821
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1458 place count 244 transition count 821
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 1458 place count 244 transition count 768
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1564 place count 191 transition count 768
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1572 place count 183 transition count 760
Iterating global reduction 4 with 8 rules applied. Total rules applied 1580 place count 183 transition count 760
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1583 place count 180 transition count 757
Iterating global reduction 4 with 3 rules applied. Total rules applied 1586 place count 180 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1587 place count 180 transition count 756
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1588 place count 179 transition count 755
Iterating global reduction 5 with 1 rules applied. Total rules applied 1589 place count 179 transition count 755
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1590 place count 178 transition count 754
Iterating global reduction 5 with 1 rules applied. Total rules applied 1591 place count 178 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1592 place count 178 transition count 753
Performed 39 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 1670 place count 139 transition count 712
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 1699 place count 110 transition count 267
Iterating global reduction 6 with 29 rules applied. Total rules applied 1728 place count 110 transition count 267
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1742 place count 110 transition count 253
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1756 place count 96 transition count 235
Iterating global reduction 7 with 14 rules applied. Total rules applied 1770 place count 96 transition count 235
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1784 place count 82 transition count 217
Iterating global reduction 7 with 14 rules applied. Total rules applied 1798 place count 82 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1803 place count 82 transition count 212
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1823 place count 72 transition count 219
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1824 place count 71 transition count 207
Iterating global reduction 8 with 1 rules applied. Total rules applied 1825 place count 71 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1826 place count 71 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1832 place count 71 transition count 200
Applied a total of 1832 rules in 68 ms. Remains 71 /1036 variables (removed 965) and now considering 200/1631 (removed 1431) transitions.
[2025-06-08 13:24:11] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
// Phase 1: matrix 194 rows 71 cols
[2025-06-08 13:24:11] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:24:11] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-08 13:24:11] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
[2025-06-08 13:24:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:24:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:24:11] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:24:11] [INFO ] Redundant transitions in 1 ms returned []
Running 183 sub problems to find dead transitions.
[2025-06-08 13:24:11] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
[2025-06-08 13:24:11] [INFO ] Invariant cache hit.
[2025-06-08 13:24:11] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:12] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:12] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:12] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:12] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:13] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:13] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:13] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:13] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:13] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:13] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:14] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:14] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:14] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:14] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:14] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:14] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 193/264 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 1/265 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:20] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:20] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:21] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:22] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:22] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:26] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:26] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/265 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 128 constraints, problems are : Problem set: 0 solved, 183 unsolved in 21393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 193/264 variables, 71/97 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 183/310 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:24:39] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 183 unsolved
SMT process timed out in 51481ms, After SMT, problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 51481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/1036 places, 200/1631 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51746 ms. Remains : 71/1036 places, 200/1631 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-15 finished in 51853 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(X(((p1||X(p2))&&p0)))||F(p3))))'
Found a Lengthening insensitive property : MedleyB-PT-B03-LTLFireability-00
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) p0 (NOT p2))]
Support contains 4 out of 1036 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1036/1036 places, 1631/1631 transitions.
Graph (trivial) has 1015 edges and 1036 vertex of which 81 / 1036 are part of one of the 15 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 708 transitions
Trivial Post-agglo rules discarded 708 transitions
Performed 708 trivial Post agglomeration. Transition count delta: 708
Iterating post reduction 0 with 708 rules applied. Total rules applied 709 place count 969 transition count 847
Reduce places removed 708 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 721 rules applied. Total rules applied 1430 place count 261 transition count 834
Reduce places removed 6 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 16 rules applied. Total rules applied 1446 place count 255 transition count 824
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1458 place count 245 transition count 822
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1458 place count 245 transition count 767
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1568 place count 190 transition count 767
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1575 place count 183 transition count 760
Iterating global reduction 4 with 7 rules applied. Total rules applied 1582 place count 183 transition count 760
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1585 place count 180 transition count 757
Iterating global reduction 4 with 3 rules applied. Total rules applied 1588 place count 180 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1589 place count 180 transition count 756
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1590 place count 179 transition count 755
Iterating global reduction 5 with 1 rules applied. Total rules applied 1591 place count 179 transition count 755
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1592 place count 178 transition count 754
Iterating global reduction 5 with 1 rules applied. Total rules applied 1593 place count 178 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1594 place count 178 transition count 753
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 1668 place count 141 transition count 714
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 1696 place count 113 transition count 270
Iterating global reduction 6 with 28 rules applied. Total rules applied 1724 place count 113 transition count 270
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1739 place count 113 transition count 255
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1752 place count 100 transition count 238
Iterating global reduction 7 with 13 rules applied. Total rules applied 1765 place count 100 transition count 238
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1778 place count 87 transition count 221
Iterating global reduction 7 with 13 rules applied. Total rules applied 1791 place count 87 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1795 place count 87 transition count 217
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1815 place count 77 transition count 231
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1816 place count 76 transition count 219
Iterating global reduction 8 with 1 rules applied. Total rules applied 1817 place count 76 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1818 place count 76 transition count 218
Applied a total of 1818 rules in 88 ms. Remains 76 /1036 variables (removed 960) and now considering 218/1631 (removed 1413) transitions.
[2025-06-08 13:25:03] [INFO ] Flow matrix only has 211 transitions (discarded 7 similar events)
// Phase 1: matrix 211 rows 76 cols
[2025-06-08 13:25:03] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:25:03] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-08 13:25:03] [INFO ] Flow matrix only has 211 transitions (discarded 7 similar events)
[2025-06-08 13:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:25:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:25:03] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-08 13:25:03] [INFO ] Flow matrix only has 211 transitions (discarded 7 similar events)
[2025-06-08 13:25:03] [INFO ] Invariant cache hit.
[2025-06-08 13:25:03] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:05] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:06] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:07] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:07] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:07] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:07] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:07] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:08] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:08] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:08] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:08] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:09] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:09] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:10] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:25:10] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 210/286 variables, 76/109 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 30/139 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 13 (OVERLAPS) 1/287 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 15 (OVERLAPS) 0/287 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 140 constraints, problems are : Problem set: 0 solved, 193 unsolved in 17684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 210/286 variables, 76/109 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 30/139 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 193/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 1/287 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 333 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47823ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 47824ms
Starting structural reductions in LI_LTL mode, iteration 1 : 76/1036 places, 218/1631 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 48210 ms. Remains : 76/1036 places, 218/1631 transitions.
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-00
Stuttering criterion allowed to conclude after 94592 steps with 23936 reset in 180 ms.
Treatment of property MedleyB-PT-B03-LTLFireability-00 finished in 48735 ms.
FORMULA MedleyB-PT-B03-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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 X((G((p0||(!p1&&X(p2))))||((p0||(!p1&&X(p2)))&&F(G(p3)))))))'
[2025-06-08 13:25:52] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16649722005696006128
[2025-06-08 13:25:52] [INFO ] Too many transitions (1631) to apply POR reductions. Disabling POR matrices.
[2025-06-08 13:25:52] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16649722005696006128
Running compilation step : cd /tmp/ltsmin16649722005696006128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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-06-08 13:25:52] [INFO ] Applying decomposition
[2025-06-08 13:25:52] [INFO ] Flatten gal took : 41 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/graph2396464548003722186.txt' '-o' '/tmp/graph2396464548003722186.bin' '-w' '/tmp/graph2396464548003722186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2396464548003722186.bin' '-l' '-1' '-v' '-w' '/tmp/graph2396464548003722186.weights' '-q' '0' '-e' '0.001'
[2025-06-08 13:25:52] [INFO ] Decomposing Gal with order
[2025-06-08 13:25:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:25:52] [INFO ] Removed a total of 2821 redundant transitions.
[2025-06-08 13:25:52] [INFO ] Flatten gal took : 82 ms
[2025-06-08 13:25:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 12 ms.
[2025-06-08 13:25:52] [INFO ] Time to serialize gal into /tmp/LTLFireability6548026188469476359.gal : 13 ms
[2025-06-08 13:25:52] [INFO ] Time to serialize properties into /tmp/LTLFireability9347762594609151519.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/LTLFireability6548026188469476359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9347762594609151519.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 1 LTL properties
Checking formula 0 : !((("(i13.i1.i0.u153.p573==1)")U(X((G(("(i13.i1.i0.u153.p573==1)")||((!("((((i0.u32.p95==1)&&(i0.u82.p418==1))&&((i0.u164.p719==1)&&(i...451
Formula 0 simplified : !"(i13.i1.i0.u153.p573==1)" R X(F(!"(i13.i1.i0.u153.p573==1)" & ("((((i0.u32.p95==1)&&(i0.u82.p418==1))&&((i0.u164.p719==1)&&(i0.u24...428
Compilation finished in 3341 ms.
Running link step : cd /tmp/ltsmin16649722005696006128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16649722005696006128;'/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' '((LTLAPp4==true) U X(([](((LTLAPp4==true)||(!(LTLAPp5==true)&&X((LTLAPp6==true)))))||(((LTLAPp4==true)||(!(LTLAPp5==true)&&X((LTLAPp6==true))))&&<>([]((LTLAPp7==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t32, t41, t177, t273, t362, t416, t452, t598, t632, t720, t809, t951, t975, t976, t982, t985,...734
Computing Next relation with stutter on 1.19587e+06 deadlock states
Detected timeout of ITS tools.
[2025-06-08 13:53:06] [INFO ] Applying decomposition
[2025-06-08 13:53:07] [INFO ] Flatten gal took : 1171 ms
[2025-06-08 13:53:08] [INFO ] Decomposing Gal with order
[2025-06-08 13:53:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:53:08] [INFO ] Removed a total of 2632 redundant transitions.
[2025-06-08 13:53:08] [INFO ] Flatten gal took : 530 ms
[2025-06-08 13:53:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 355 labels/synchronizations in 111 ms.
[2025-06-08 13:53:09] [INFO ] Time to serialize gal into /tmp/LTLFireability11605258800954032003.gal : 19 ms
[2025-06-08 13:53:09] [INFO ] Time to serialize properties into /tmp/LTLFireability6279355861924889745.ltl : 7 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/LTLFireability11605258800954032003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6279355861924889745.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(i0.i0.i0.i0.u6.p573==1)")U(X((G(("(i0.i0.i0.i0.u6.p573==1)")||((!("((((i0.i0.i0.i0.u5.p95==1)&&(i0.i0.i0.i0.u6.p418==1))&&((i0.i...483
Formula 0 simplified : !"(i0.i0.i0.i0.u6.p573==1)" R X(F(!"(i0.i0.i0.i0.u6.p573==1)" & ("((((i0.i0.i0.i0.u5.p95==1)&&(i0.i0.i0.i0.u6.p418==1))&&((i0.i0.i0....460
Reverse transition relation is NOT exact ! Due to transitions t1015, i0.u9.t41, i0.u9.t97, i0.u9.t98, i0.u9.t113, i0.u9.t122, i0.u9.t175, i0.u9.t176, i0.u9...1000
Computing Next relation with stutter on 1.19587e+06 deadlock states
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin16649722005696006128;'/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' '((LTLAPp4==true) U X(([](((LTLAPp4==true)||(!(LTLAPp5==true)&&X((LTLAPp6==true)))))||(((LTLAPp4==true)||(!(LTLAPp5==true)&&X((LTLAPp6==true))))&&<>([]((LTLAPp7==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin16649722005696006128;'/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' '((LTLAPp4==true) U X(([](((LTLAPp4==true)||(!(LTLAPp5==true)&&X((LTLAPp6==true)))))||(((LTLAPp4==true)||(!(LTLAPp5==true)&&X((LTLAPp6==true))))&&<>([]((LTLAPp7==true)))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B03"
export BK_EXAMINATION="LTLFireability"
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 MedleyB-PT-B03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339900444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B03.tgz
mv MedleyB-PT-B03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;