Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254600747.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 QuasiCertifProtocol-COL-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254600747
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 93K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749126757098

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-05 12:32:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 12:32:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 12:32:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 12:32:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 12:32:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 581 ms
[2025-06-05 12:32:39] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 12:32:39] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 9 ms.
[2025-06-05 12:32:39] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40018 steps (1458 resets) in 709 ms. (56 steps per ms) remains 8/24 properties
BEST_FIRST walk for 40003 steps (416 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40006 steps (851 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (525 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (525 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (664 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (528 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (531 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (532 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 12:32:39] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/24 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/56 variables, 6/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 3 solved, 5 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 2/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 6 (OVERLAPS) 16/47 variables, 9/30 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 2/32 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/53 variables, 1/33 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 2/35 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:32:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:32:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 2/37 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/56 variables, 4/41 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/56 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 41 constraints, problems are : Problem set: 4 solved, 4 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 570ms problems are : Problem set: 4 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 111 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=111 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 66 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2025-06-05 12:32:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-05 12:32:40] [INFO ] Flatten gal took : 16 ms
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 12:32:40] [INFO ] Flatten gal took : 5 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2025-06-05 12:32:40] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 35 ms.
[2025-06-05 12:32:40] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 940 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Applied a total of 0 rules in 72 ms. Remains 1398 /1398 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1398 cols
[2025-06-05 12:32:40] [INFO ] Computed 1103 invariants in 92 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:32:42] [INFO ] Implicit Places using invariants in 1920 ms returned []
[2025-06-05 12:32:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:32:44] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 3776 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 12:32:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 43/1398 variables, 4/742 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1398 variables, 361/1103 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.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)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1398/1694 variables, and 1103 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1099/1099 constraints, State Equation: 0/1398 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 43/1398 variables, 4/742 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1398 variables, 361/1103 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1398 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 296/1694 variables, 1398/2501 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 276/2777 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2777 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1099/1099 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Finished structural reductions in LTL mode , in 1 iterations and 64275 ms. Remains : 1398/1398 places, 296/296 transitions.
Support contains 940 out of 1398 places after structural reductions.
[2025-06-05 12:33:45] [INFO ] Flatten gal took : 89 ms
[2025-06-05 12:33:45] [INFO ] Flatten gal took : 67 ms
[2025-06-05 12:33:45] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (1763 resets) in 1660 ms. (24 steps per ms) remains 14/22 properties
BEST_FIRST walk for 40003 steps (122 resets) in 365 ms. (109 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (48 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (124 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (172 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (124 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (172 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (72 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (73 resets) in 311 ms. (128 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (123 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (126 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (124 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (172 resets) in 136 ms. (292 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (123 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (124 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
[2025-06-05 12:33:46] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
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/538 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 2 (OVERLAPS) 81/619 variables, 4/364 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/619 variables, 0/364 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 741/1360 variables, 721/1085 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1360 variables, 0/1085 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 296/1656 variables, 1360/2445 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1656 variables, 0/2445 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 38/1694 variables, 38/2483 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 18/2501 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1694 variables, 0/2501 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/1694 variables, 0/2501 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 2501 constraints, problems are : Problem set: 3 solved, 11 unsolved in 2998 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1099/1099 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 14/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 360/360 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:33:49] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 1/361 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 0/361 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 83/619 variables, 4/365 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 0/365 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 741/1360 variables, 721/1086 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 0/1086 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 296/1656 variables, 1360/2446 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1656 variables, 9/2455 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1656/1694 variables, and 2455 constraints, problems are : Problem set: 3 solved, 11 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1081/1099 constraints, State Equation: 1360/1398 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8062ms problems are : Problem set: 3 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 536 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1396 transition count 292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 1396 transition count 291
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 1395 transition count 291
Applied a total of 7 rules in 101 ms. Remains 1395 /1398 variables (removed 3) and now considering 291/296 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1395/1398 places, 291/296 transitions.
RANDOM walk for 40000 steps (1848 resets) in 1226 ms. (32 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (129 resets) in 316 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 82 ms. (481 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (135 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (133 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (180 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (77 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (132 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (133 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (137 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (136 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 3261 steps, run visited all 10 properties in 81 ms. (steps per millisecond=40 )
Probabilistic random walk after 3261 steps, saw 3162 distinct states, run finished after 85 ms. (steps per millisecond=38 ) properties seen :10
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 1398 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1398 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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) U p1) U X(X(p2))))'
Support contains 402 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1357 transition count 296
Applied a total of 41 rules in 70 ms. Remains 1357 /1398 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2025-06-05 12:33:55] [INFO ] Computed 1063 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:33:56] [INFO ] Implicit Places using invariants in 930 ms returned []
[2025-06-05 12:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:34:00] [INFO ] Implicit Places using invariants and state equation in 3315 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 4251 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1398 places, 296/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4347 ms. Remains : 1338/1398 places, 296/296 transitions.
Stuttering acceptance computed with spot in 654 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 734 ms.
Product exploration explored 100000 steps with 33333 reset in 691 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 24 ms. Reduced automaton from 13 states, 27 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-01 finished in 6758 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(G(p0)) U p1) U X(X(p0)))))'
Support contains 39 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1357 transition count 296
Applied a total of 41 rules in 37 ms. Remains 1357 /1398 variables (removed 41) and now considering 296/296 (removed 0) transitions.
[2025-06-05 12:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:34:03] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2025-06-05 12:34:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:34:08] [INFO ] Implicit Places using invariants and state equation in 4311 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 5731 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1398 places, 296/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5798 ms. Remains : 1338/1398 places, 296/296 transitions.
Stuttering acceptance computed with spot in 1602 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-02
Product exploration explored 100000 steps with 25018 reset in 366 ms.
Product exploration explored 100000 steps with 25036 reset in 370 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
RANDOM walk for 40000 steps (1764 resets) in 550 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (127 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (125 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 1426 steps, run visited all 6 properties in 22 ms. (steps per millisecond=64 )
Probabilistic random walk after 1426 steps, saw 1382 distinct states, run finished after 23 ms. (steps per millisecond=62 ) properties seen :6
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 368 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p1), false]
Support contains 39 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8784 edges and 1338 vertex of which 1318 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.13 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1315 transition count 291
Applied a total of 5 rules in 106 ms. Remains 1315 /1338 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1315 cols
[2025-06-05 12:34:12] [INFO ] Computed 1026 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:34:13] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2025-06-05 12:34:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:34:17] [INFO ] Implicit Places using invariants and state equation in 3858 ms returned [1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 5000 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1338 places, 291/296 transitions.
Applied a total of 0 rules in 67 ms. Remains 1296 /1296 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5173 ms. Remains : 1296/1338 places, 291/296 transitions.
Computed a total of 1296 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 238 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p0), (NOT p1), false]
RANDOM walk for 40000 steps (1685 resets) in 421 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (75 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (52 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 1359 steps, run visited all 6 properties in 23 ms. (steps per millisecond=59 )
Probabilistic random walk after 1359 steps, saw 1318 distinct states, run finished after 23 ms. (steps per millisecond=59 ) properties seen :6
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 496 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p0), (NOT p1), false]
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p0), (NOT p1), false]
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p0), (NOT p1), false]
Product exploration explored 100000 steps with 4214 reset in 443 ms.
Product exploration explored 100000 steps with 4210 reset in 440 ms.
Built C files in :
/tmp/ltsmin10231479540620900254
[2025-06-05 12:34:21] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2025-06-05 12:34:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:34:21] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2025-06-05 12:34:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:34:21] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2025-06-05 12:34:21] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:34:21] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10231479540620900254
Running compilation step : cd /tmp/ltsmin10231479540620900254;'/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'
Compilation finished in 1252 ms.
Running link step : cd /tmp/ltsmin10231479540620900254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin10231479540620900254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12853571626448092077.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1296/1296 places, 291/291 transitions.
Applied a total of 0 rules in 61 ms. Remains 1296 /1296 variables (removed 0) and now considering 291/291 (removed 0) transitions.
// Phase 1: matrix 291 rows 1296 cols
[2025-06-05 12:34:36] [INFO ] Computed 1008 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:34:37] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2025-06-05 12:34:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:34:44] [INFO ] Implicit Places using invariants and state equation in 6551 ms returned []
Implicit Place search using SMT with State Equation took 7784 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:34:44] [INFO ] Redundant transitions in 30 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-05 12:34:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1276 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1567 variables, 1276/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1567 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 30178ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38068 ms. Remains : 1296/1296 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin13260401116952219127
[2025-06-05 12:35:14] [INFO ] Computing symmetric may disable matrix : 291 transitions.
[2025-06-05 12:35:14] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:35:14] [INFO ] Computing symmetric may enable matrix : 291 transitions.
[2025-06-05 12:35:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:35:14] [INFO ] Computing Do-Not-Accords matrix : 291 transitions.
[2025-06-05 12:35:14] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:35:14] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13260401116952219127
Running compilation step : cd /tmp/ltsmin13260401116952219127;'/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'
Compilation finished in 1088 ms.
Running link step : cd /tmp/ltsmin13260401116952219127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13260401116952219127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6870482540402039652.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 12:35:29] [INFO ] Flatten gal took : 40 ms
[2025-06-05 12:35:29] [INFO ] Flatten gal took : 37 ms
[2025-06-05 12:35:29] [INFO ] Time to serialize gal into /tmp/LTL7645425921693427608.gal : 9 ms
[2025-06-05 12:35:29] [INFO ] Time to serialize properties into /tmp/LTL14022860548646405904.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7645425921693427608.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5655297162397122867.hoa' '-atoms' '/tmp/LTL14022860548646405904.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/LTL14022860548646405904.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5655297162397122867.hoa
Detected timeout of ITS tools.
[2025-06-05 12:35:44] [INFO ] Flatten gal took : 35 ms
[2025-06-05 12:35:44] [INFO ] Flatten gal took : 34 ms
[2025-06-05 12:35:44] [INFO ] Time to serialize gal into /tmp/LTL12525258317966927097.gal : 6 ms
[2025-06-05 12:35:44] [INFO ] Time to serialize properties into /tmp/LTL11234535963044219542.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/LTL12525258317966927097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11234535963044219542.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...277
Read 1 LTL properties
Checking formula 0 : !((G(((F(G("((((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+(((s5_8+s5_9)+(s5_10+s5_11))+((s5_12+s5_13)+(s5_14+s5_15))))+((s5...645
Formula 0 simplified : F((GF!"((((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+(((s5_8+s5_9)+(s5_10+s5_11))+((s5_12+s5_13)+(s5_14+s5_15))))+((s5_16...635
Detected timeout of ITS tools.
[2025-06-05 12:35:59] [INFO ] Flatten gal took : 31 ms
[2025-06-05 12:35:59] [INFO ] Applying decomposition
[2025-06-05 12:35:59] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8622471478866727987.txt' '-o' '/tmp/graph8622471478866727987.bin' '-w' '/tmp/graph8622471478866727987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8622471478866727987.bin' '-l' '-1' '-v' '-w' '/tmp/graph8622471478866727987.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:35:59] [INFO ] Decomposing Gal with order
[2025-06-05 12:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:36:00] [INFO ] Removed a total of 204 redundant transitions.
[2025-06-05 12:36:00] [INFO ] Flatten gal took : 151 ms
[2025-06-05 12:36:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 29 ms.
[2025-06-05 12:36:00] [INFO ] Time to serialize gal into /tmp/LTL11630835135718874029.gal : 10 ms
[2025-06-05 12:36:00] [INFO ] Time to serialize properties into /tmp/LTL8236100862301819637.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/LTL11630835135718874029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8236100862301819637.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((F(G("((((((gu45.s5_0+gu45.s5_1)+(gu45.s5_2+gu45.s5_3))+((gu45.s5_4+gu45.s5_5)+(gu45.s5_6+gu45.s5_7)))+(((gu45.s5_8+gu45.s5_9)+(...1111
Formula 0 simplified : F((GF!"((((((gu45.s5_0+gu45.s5_1)+(gu45.s5_2+gu45.s5_3))+((gu45.s5_4+gu45.s5_5)+(gu45.s5_6+gu45.s5_7)))+(((gu45.s5_8+gu45.s5_9)+(gu4...1101
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-02 finished in 132853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((((p0 U X(G(p0))) U p1) U X(X(p2)))))))'
Support contains 77 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1375 transition count 296
Applied a total of 23 rules in 36 ms. Remains 1375 /1398 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1375 cols
[2025-06-05 12:36:15] [INFO ] Computed 1081 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:36:16] [INFO ] Implicit Places using invariants in 1399 ms returned []
[2025-06-05 12:36:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:36:19] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 4548 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1356/1398 places, 296/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4613 ms. Remains : 1356/1398 places, 296/296 transitions.
Stuttering acceptance computed with spot in 656 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 10692 steps with 770 reset in 47 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-03 finished in 5356 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 20 out of 1398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 158 are kept as prefixes of interest. Removing 1240 places using SCC suffix rule.5 ms
Discarding 1240 places :
Also discarding 97 output transitions
Drop transitions (Output transitions of discarded places.) removed 97 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 158 transition count 124
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 1 with 2 rules applied. Total rules applied 78 place count 157 transition count 123
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 157 transition count 123
Applied a total of 79 rules in 16 ms. Remains 157 /1398 variables (removed 1241) and now considering 123/296 (removed 173) transitions.
// Phase 1: matrix 123 rows 157 cols
[2025-06-05 12:36:20] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:36:20] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-05 12:36:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:36:20] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:36:20] [INFO ] Redundant transitions in 24 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-05 12:36:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 123/279 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/280 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 193 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4088 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 123/279 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 102/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/280 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 295 constraints, problems are : Problem set: 0 solved, 102 unsolved in 10736 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14841ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 14842ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/1398 places, 123/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15087 ms. Remains : 157/1398 places, 123/296 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04
Product exploration explored 100000 steps with 4317 reset in 251 ms.
Product exploration explored 100000 steps with 4313 reset in 250 ms.
Computed a total of 157 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 157 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1569 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (70 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2656903 steps, run timeout after 3001 ms. (steps per millisecond=885 ) properties seen :0 out of 1
Probabilistic random walk after 2656903 steps, saw 349793 distinct states, run finished after 3003 ms. (steps per millisecond=884 ) properties seen :0
[2025-06-05 12:36:39] [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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/142 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/161 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/280 variables, 78/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/142 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/161 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 119/280 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 20 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-05 12:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:36:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-05 12:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:36:40] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:36:40] [INFO ] Redundant transitions in 20 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-05 12:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 123/279 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/280 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 193 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4182 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 123/279 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 102/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/280 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 295 constraints, problems are : Problem set: 0 solved, 102 unsolved in 11617 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15819ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 15819ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16059 ms. Remains : 157/157 places, 123/123 transitions.
Computed a total of 157 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 157 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1568 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (68 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2670376 steps, run timeout after 3001 ms. (steps per millisecond=889 ) properties seen :0 out of 1
Probabilistic random walk after 2670376 steps, saw 350906 distinct states, run finished after 3001 ms. (steps per millisecond=889 ) properties seen :0
[2025-06-05 12:36:59] [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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/142 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/161 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/280 variables, 78/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/41 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/142 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/161 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 119/280 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4321 reset in 215 ms.
Product exploration explored 100000 steps with 4320 reset in 231 ms.
Built C files in :
/tmp/ltsmin3406658344286663431
[2025-06-05 12:37:00] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2025-06-05 12:37:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:37:00] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2025-06-05 12:37:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:37:00] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2025-06-05 12:37:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:37:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3406658344286663431
Running compilation step : cd /tmp/ltsmin3406658344286663431;'/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'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin3406658344286663431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3406658344286663431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased131211484014197565.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 123/123 transitions.
Applied a total of 0 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-05 12:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:37:15] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-05 12:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:37:15] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:37:15] [INFO ] Redundant transitions in 24 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-05 12:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 123/279 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/280 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 193 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4168 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 123/279 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 102/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/280 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 295 constraints, problems are : Problem set: 0 solved, 102 unsolved in 11756 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15938ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 15939ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16211 ms. Remains : 157/157 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin9795567639210912240
[2025-06-05 12:37:31] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2025-06-05 12:37:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:37:31] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2025-06-05 12:37:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:37:31] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2025-06-05 12:37:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:37:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9795567639210912240
Running compilation step : cd /tmp/ltsmin9795567639210912240;'/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'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin9795567639210912240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9795567639210912240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9834342114989386786.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 12:37:46] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:37:46] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:37:47] [INFO ] Time to serialize gal into /tmp/LTL4632346450533975356.gal : 1 ms
[2025-06-05 12:37:47] [INFO ] Time to serialize properties into /tmp/LTL931447145227212196.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4632346450533975356.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2547789575041719505.hoa' '-atoms' '/tmp/LTL931447145227212196.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...316
Loading property file /tmp/LTL931447145227212196.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2547789575041719505.hoa
Detected timeout of ITS tools.
[2025-06-05 12:38:02] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:38:02] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:38:02] [INFO ] Time to serialize gal into /tmp/LTL9748649529808563705.gal : 0 ms
[2025-06-05 12:38:02] [INFO ] Time to serialize properties into /tmp/LTL15419726906687861566.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/LTL9748649529808563705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15419726906687861566.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((n5_16+...183
Formula 0 simplified : FG!"((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((n5_16+n5...177
Detected timeout of ITS tools.
[2025-06-05 12:38:17] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:38:17] [INFO ] Applying decomposition
[2025-06-05 12:38:17] [INFO ] Flatten gal took : 4 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/graph8642692282394361149.txt' '-o' '/tmp/graph8642692282394361149.bin' '-w' '/tmp/graph8642692282394361149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8642692282394361149.bin' '-l' '-1' '-v' '-w' '/tmp/graph8642692282394361149.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:38:17] [INFO ] Decomposing Gal with order
[2025-06-05 12:38:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:38:17] [INFO ] Removed a total of 125 redundant transitions.
[2025-06-05 12:38:17] [INFO ] Flatten gal took : 14 ms
[2025-06-05 12:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 10 ms.
[2025-06-05 12:38:17] [INFO ] Time to serialize gal into /tmp/LTL5507001168593389024.gal : 1 ms
[2025-06-05 12:38:17] [INFO ] Time to serialize properties into /tmp/LTL2044316627862108612.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/LTL5507001168593389024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2044316627862108612.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((gu1.n5_0+gu1.n5_1)+(gu1.n5_2+gu1.n5_3))+((gu1.n5_4+gu1.n5_5)+(gu1.n5_6+gu1.n5_7)))+(((gu1.n5_8+gu1.n5_9)+(gu1.n5_10+gu1....263
Formula 0 simplified : FG!"((((((gu1.n5_0+gu1.n5_1)+(gu1.n5_2+gu1.n5_3))+((gu1.n5_4+gu1.n5_5)+(gu1.n5_6+gu1.n5_7)))+(((gu1.n5_8+gu1.n5_9)+(gu1.n5_10+gu1.n5...257
Reverse transition relation is NOT exact ! Due to transitions gu0.t75, gi2.gi1.gi15.gu38.t137, gi2.gi1.gi15.gu48.t134, gi2.t294_t136, gi2.t292, t76, t77, t...457
Computing Next relation with stutter on 3.40804e+08 deadlock states
74 unique states visited
74 strongly connected components in search stack
75 transitions explored
74 items max in DFS search stack
829 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.34022,265956,1,0,395,1.11505e+06,200,340,7191,1.24969e+06,849
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 126089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 362 out of 1398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 937 are kept as prefixes of interest. Removing 461 places using SCC suffix rule.3 ms
Discarding 461 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 937 transition count 219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 935 transition count 217
Applied a total of 42 rules in 36 ms. Remains 935 /1398 variables (removed 463) and now considering 217/296 (removed 79) transitions.
// Phase 1: matrix 217 rows 935 cols
[2025-06-05 12:38:26] [INFO ] Computed 720 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:38:27] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-06-05 12:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:38:28] [INFO ] Implicit Places using invariants and state equation in 795 ms returned [818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 1322 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 916/1398 places, 217/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 916 /916 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1373 ms. Remains : 916/1398 places, 217/296 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-05
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-05 finished in 1430 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&&X((X(X(F(p1)))||G(p0))))))'
Support contains 39 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 34 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2025-06-05 12:38:28] [INFO ] Computed 1062 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:38:29] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2025-06-05 12:38:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:38:31] [INFO ] Implicit Places using invariants and state equation in 2356 ms returned []
Implicit Place search using SMT with State Equation took 3619 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 12:38:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
(s725 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 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 0.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)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1652 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 1356/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63797 ms. Remains : 1356/1398 places, 296/296 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-06
Product exploration explored 100000 steps with 4420 reset in 314 ms.
Product exploration explored 100000 steps with 4421 reset in 326 ms.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1764 resets) in 153 ms. (259 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (121 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2025-06-05 12:39:33] [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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 135/1561 variables, 95/2282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 18/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/1645 variables, 78/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1645 variables, 36/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1645 variables, 0/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/1652 variables, 4/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 987 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/1652 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2039 ms.
Refiners :[Generalized P Invariants (flows): 1008/1062 constraints, State Equation: 1179/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3039ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 956 are kept as prefixes of interest. Removing 400 places using SCC suffix rule.7 ms
Discarding 400 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 177 rules applied. Total rules applied 178 place count 918 transition count 136
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 199 place count 897 transition count 136
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 199 place count 897 transition count 98
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 331 place count 803 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 803 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 802 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 333 place count 802 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 800 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 716 place count 439 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 717 place count 438 transition count 76
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 736 place count 419 transition count 76
Applied a total of 736 rules in 70 ms. Remains 419 /1356 variables (removed 937) and now considering 76/296 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 419/1356 places, 76/296 transitions.
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 12:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:39:39] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 1674 ms returned sat
[2025-06-05 12:39:44] [INFO ] [Real]Absence check using state equation in 5328 ms returned sat
[2025-06-05 12:39:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:39:46] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 1657 ms returned sat
[2025-06-05 12:39:54] [INFO ] [Nat]Absence check using state equation in 7804 ms returned sat
[2025-06-05 12:39:54] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2025-06-05 12:39:55] [INFO ] Added : 40 causal constraints over 8 iterations in 859 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 12:39:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:39:56] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2025-06-05 12:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:39:58] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 3634 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 12:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1652 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in LTL mode , in 1 iterations and 63813 ms. Remains : 1356/1356 places, 296/296 transitions.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1765 resets) in 189 ms. (210 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (136 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
[2025-06-05 12:40:59] [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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 135/1561 variables, 95/2282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 18/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/2300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/1645 variables, 78/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1645 variables, 36/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1645 variables, 0/2414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/1652 variables, 4/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1022 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/1652 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1827 ms.
Refiners :[Generalized P Invariants (flows): 1008/1062 constraints, State Equation: 1179/1356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2857ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 956 are kept as prefixes of interest. Removing 400 places using SCC suffix rule.3 ms
Discarding 400 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 177 rules applied. Total rules applied 178 place count 918 transition count 136
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 199 place count 897 transition count 136
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 199 place count 897 transition count 98
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 331 place count 803 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 803 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 802 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 333 place count 802 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 800 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 716 place count 439 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 717 place count 438 transition count 76
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 736 place count 419 transition count 76
Applied a total of 736 rules in 55 ms. Remains 419 /1356 variables (removed 937) and now considering 76/296 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 419/1356 places, 76/296 transitions.
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 12:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:41:05] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 1691 ms returned sat
[2025-06-05 12:41:10] [INFO ] [Real]Absence check using state equation in 5508 ms returned sat
[2025-06-05 12:41:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:41:12] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 1694 ms returned sat
[2025-06-05 12:41:20] [INFO ] [Nat]Absence check using state equation in 7962 ms returned sat
[2025-06-05 12:41:20] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 12 ms.
[2025-06-05 12:41:21] [INFO ] Added : 40 causal constraints over 8 iterations in 820 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4420 reset in 295 ms.
Product exploration explored 100000 steps with 4418 reset in 286 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1336 transition count 296
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 227 ms. Remains 1336 /1356 variables (removed 20) and now considering 296/296 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:41:23] [INFO ] Redundant transitions in 29 ms returned []
Running 276 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 1336 cols
[2025-06-05 12:41:23] [INFO ] Computed 1044 invariants in 17 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1335 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1335 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
At refinement iteration 2 (OVERLAPS) 296/1631 variables, 1335/2379 constraints. Problems are: Problem set: 4 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1631/1632 variables, and 2379 constraints, problems are : Problem set: 4 solved, 272 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1336 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1333 variables, 1044/1044 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1333 variables, 0/1044 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 294/1627 variables, 1333/2377 constraints. Problems are: Problem set: 4 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1627 variables, 272/2649 constraints. Problems are: Problem set: 4 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1632 variables, and 2649 constraints, problems are : Problem set: 4 solved, 272 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1333/1336 constraints, PredecessorRefiner: 272/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 4 solved, 272 unsolved
Search for dead transitions found 4 dead transitions in 60166ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1356 places, 292/296 transitions.
Graph (complete) has 9711 edges and 1336 vertex of which 1334 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 47 ms. Remains 1334 /1336 variables (removed 2) and now considering 292/292 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1334/1356 places, 292/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60481 ms. Remains : 1334/1356 places, 292/296 transitions.
Built C files in :
/tmp/ltsmin458882664520237554
[2025-06-05 12:42:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin458882664520237554
Running compilation step : cd /tmp/ltsmin458882664520237554;'/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'
Compilation finished in 950 ms.
Running link step : cd /tmp/ltsmin458882664520237554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin458882664520237554;'/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' '--hoa' '/tmp/stateBased15103722735832755946.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2025-06-05 12:42:38] [INFO ] Computed 1062 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:39] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2025-06-05 12:42:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:42:42] [INFO ] Implicit Places using invariants and state equation in 2276 ms returned []
Implicit Place search using SMT with State Equation took 3590 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 12:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/1652 variables, and 2417 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 63791 ms. Remains : 1356/1356 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin17345473906711805593
[2025-06-05 12:43:42] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17345473906711805593
Running compilation step : cd /tmp/ltsmin17345473906711805593;'/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'
Compilation finished in 994 ms.
Running link step : cd /tmp/ltsmin17345473906711805593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17345473906711805593;'/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' '--hoa' '/tmp/stateBased12185085089381622790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 12:43:57] [INFO ] Flatten gal took : 30 ms
[2025-06-05 12:43:57] [INFO ] Flatten gal took : 27 ms
[2025-06-05 12:43:57] [INFO ] Time to serialize gal into /tmp/LTL8734624828278443121.gal : 4 ms
[2025-06-05 12:43:57] [INFO ] Time to serialize properties into /tmp/LTL14924611475467664582.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/LTL8734624828278443121.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9492971655828682112.hoa' '-atoms' '/tmp/LTL14924611475467664582.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/LTL14924611475467664582.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9492971655828682112.hoa
Detected timeout of ITS tools.
[2025-06-05 12:44:12] [INFO ] Flatten gal took : 38 ms
[2025-06-05 12:44:12] [INFO ] Flatten gal took : 25 ms
[2025-06-05 12:44:12] [INFO ] Time to serialize gal into /tmp/LTL687913385589436289.gal : 5 ms
[2025-06-05 12:44:12] [INFO ] Time to serialize properties into /tmp/LTL2439580542645661298.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/LTL687913385589436289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2439580542645661298.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...274
Read 1 LTL properties
Checking formula 0 : !((F(("(malicious_reservoir<1)")&&(X((X(X(F("((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s...465
Formula 0 simplified : G(!"(malicious_reservoir<1)" | X(XXG!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+...451
Detected timeout of ITS tools.
[2025-06-05 12:44:27] [INFO ] Flatten gal took : 27 ms
[2025-06-05 12:44:27] [INFO ] Applying decomposition
[2025-06-05 12:44:27] [INFO ] Flatten gal took : 25 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/graph14455291365309363874.txt' '-o' '/tmp/graph14455291365309363874.bin' '-w' '/tmp/graph14455291365309363874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14455291365309363874.bin' '-l' '-1' '-v' '-w' '/tmp/graph14455291365309363874.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:44:27] [INFO ] Decomposing Gal with order
[2025-06-05 12:44:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:44:27] [INFO ] Removed a total of 183 redundant transitions.
[2025-06-05 12:44:27] [INFO ] Flatten gal took : 57 ms
[2025-06-05 12:44:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 71 ms.
[2025-06-05 12:44:28] [INFO ] Time to serialize gal into /tmp/LTL2522566356538969772.gal : 13 ms
[2025-06-05 12:44:28] [INFO ] Time to serialize properties into /tmp/LTL477112531370183503.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/LTL2522566356538969772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL477112531370183503.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...274
Read 1 LTL properties
Checking formula 0 : !((F(("(gu0.malicious_reservoir<1)")&&(X((X(X(F("((((((gu127.s6_0+gu127.s6_1)+(gu127.s6_2+gu127.s6_3))+((gu127.s6_4+gu127.s6_5)+(gu127...701
Formula 0 simplified : G(!"(gu0.malicious_reservoir<1)" | X(XXG!"((((((gu127.s6_0+gu127.s6_1)+(gu127.s6_2+gu127.s6_3))+((gu127.s6_4+gu127.s6_5)+(gu127.s6_6...687
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-06 finished in 374989 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))'
Support contains 20 out of 1398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1336 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.4 ms
Discarding 62 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1334 transition count 292
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1334 transition count 292
Applied a total of 4 rules in 107 ms. Remains 1334 /1398 variables (removed 64) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2025-06-05 12:44:43] [INFO ] Computed 1044 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:44:44] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2025-06-05 12:44:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:44:47] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3844 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1398 places, 292/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3987 ms. Remains : 1296/1398 places, 292/296 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-08
Product exploration explored 100000 steps with 5337 reset in 326 ms.
Product exploration explored 100000 steps with 5331 reset in 323 ms.
Computed a total of 1296 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 292
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 68 steps (0 resets) in 15 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 292 rows 1296 cols
[2025-06-05 12:44:48] [INFO ] Computed 1008 invariants in 113 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:44:50] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 1492 ms returned sat
[2025-06-05 12:44:58] [INFO ] [Real]Absence check using state equation in 8521 ms returned sat
[2025-06-05 12:44:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:45:00] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 1481 ms returned sat
[2025-06-05 12:45:14] [INFO ] [Nat]Absence check using state equation in 13161 ms returned unknown
Could not prove EG (NOT p0)
Support contains 20 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Applied a total of 0 rules in 37 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2025-06-05 12:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:45:15] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2025-06-05 12:45:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:45:18] [INFO ] Implicit Places using invariants and state equation in 3163 ms returned []
Implicit Place search using SMT with State Equation took 4365 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:45:18] [INFO ] Redundant transitions in 21 ms returned []
Running 253 sub problems to find dead transitions.
[2025-06-05 12:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1277 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1277 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 292/1569 variables, 1277/2285 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1569 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 253 unsolved
SMT process timed out in 30111ms, After SMT, problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 30114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34543 ms. Remains : 1296/1296 places, 292/292 transitions.
Computed a total of 1296 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 292
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 74 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2025-06-05 12:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:45:51] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 1687 ms returned sat
[2025-06-05 12:46:01] [INFO ] [Real]Absence check using state equation in 9920 ms returned sat
[2025-06-05 12:46:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:46:03] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 1701 ms returned sat
[2025-06-05 12:46:14] [INFO ] [Nat]Absence check using state equation in 11528 ms returned sat
[2025-06-05 12:46:14] [INFO ] Computed and/alt/rep : 192/230/192 causal constraints (skipped 61 transitions) in 12 ms.
[2025-06-05 12:46:15] [INFO ] Added : 28 causal constraints over 6 iterations in 561 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5318 reset in 313 ms.
Product exploration explored 100000 steps with 5337 reset in 333 ms.
Built C files in :
/tmp/ltsmin7308392876870710471
[2025-06-05 12:46:16] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2025-06-05 12:46:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:46:16] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2025-06-05 12:46:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:46:16] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2025-06-05 12:46:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:46:16] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7308392876870710471
Running compilation step : cd /tmp/ltsmin7308392876870710471;'/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'
Compilation finished in 1108 ms.
Running link step : cd /tmp/ltsmin7308392876870710471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7308392876870710471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7329022169123341173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Applied a total of 0 rules in 45 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2025-06-05 12:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:46:32] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2025-06-05 12:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:46:35] [INFO ] Implicit Places using invariants and state equation in 3317 ms returned []
Implicit Place search using SMT with State Equation took 4606 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:46:35] [INFO ] Redundant transitions in 22 ms returned []
Running 253 sub problems to find dead transitions.
[2025-06-05 12:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1277 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1277 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 292/1569 variables, 1277/2285 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1569/1588 variables, and 2285 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1277/1296 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1277 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1277 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 292/1569 variables, 1277/2285 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1569 variables, 253/2538 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1569/1588 variables, and 2538 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1277/1296 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64825 ms. Remains : 1296/1296 places, 292/292 transitions.
Built C files in :
/tmp/ltsmin8924123598805411527
[2025-06-05 12:47:35] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2025-06-05 12:47:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:47:35] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2025-06-05 12:47:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:47:35] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2025-06-05 12:47:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:47:35] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8924123598805411527
Running compilation step : cd /tmp/ltsmin8924123598805411527;'/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'
Compilation finished in 1060 ms.
Running link step : cd /tmp/ltsmin8924123598805411527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8924123598805411527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12940027524694617275.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 12:47:51] [INFO ] Flatten gal took : 23 ms
[2025-06-05 12:47:51] [INFO ] Flatten gal took : 24 ms
[2025-06-05 12:47:51] [INFO ] Time to serialize gal into /tmp/LTL13410983830782947255.gal : 5 ms
[2025-06-05 12:47:51] [INFO ] Time to serialize properties into /tmp/LTL13102979452487275115.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13410983830782947255.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10139336948755835258.hoa' '-atoms' '/tmp/LTL13102979452487275115.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/LTL13102979452487275115.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10139336948755835258.hoa
Detected timeout of ITS tools.
[2025-06-05 12:48:06] [INFO ] Flatten gal took : 23 ms
[2025-06-05 12:48:06] [INFO ] Flatten gal took : 23 ms
[2025-06-05 12:48:06] [INFO ] Time to serialize gal into /tmp/LTL2279077502585259151.gal : 3 ms
[2025-06-05 12:48:06] [INFO ] Time to serialize properties into /tmp/LTL3885782344431421913.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/LTL2279077502585259151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3885782344431421913.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(malicious_reservoir<=(((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14...193
Formula 0 simplified : G!"(malicious_reservoir<=(((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+...189
Detected timeout of ITS tools.
[2025-06-05 12:48:21] [INFO ] Flatten gal took : 24 ms
[2025-06-05 12:48:21] [INFO ] Applying decomposition
[2025-06-05 12:48:21] [INFO ] Flatten gal took : 23 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/graph8356231585153138722.txt' '-o' '/tmp/graph8356231585153138722.bin' '-w' '/tmp/graph8356231585153138722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8356231585153138722.bin' '-l' '-1' '-v' '-w' '/tmp/graph8356231585153138722.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:48:21] [INFO ] Decomposing Gal with order
[2025-06-05 12:48:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:48:21] [INFO ] Removed a total of 210 redundant transitions.
[2025-06-05 12:48:21] [INFO ] Flatten gal took : 74 ms
[2025-06-05 12:48:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 297 labels/synchronizations in 26 ms.
[2025-06-05 12:48:21] [INFO ] Time to serialize gal into /tmp/LTL16755065258514091572.gal : 8 ms
[2025-06-05 12:48:21] [INFO ] Time to serialize properties into /tmp/LTL2548547741633548517.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/LTL16755065258514091572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2548547741633548517.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 : !((F("(gu0.malicious_reservoir<=(((((gu0.n5_0+gu0.n5_1)+(gu0.n5_2+gu0.n5_3))+((gu0.n5_4+gu0.n5_5)+(gu0.n5_6+gu0.n5_7)))+(((gu0.n5_8+gu...273
Formula 0 simplified : G!"(gu0.malicious_reservoir<=(((((gu0.n5_0+gu0.n5_1)+(gu0.n5_2+gu0.n5_3))+((gu0.n5_4+gu0.n5_5)+(gu0.n5_6+gu0.n5_7)))+(((gu0.n5_8+gu0...269
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-08 finished in 233523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(X(p1)))))))'
Support contains 20 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1357 transition count 296
Applied a total of 41 rules in 35 ms. Remains 1357 /1398 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2025-06-05 12:48:36] [INFO ] Computed 1063 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:48:38] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2025-06-05 12:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:48:44] [INFO ] Implicit Places using invariants and state equation in 6267 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7629 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1398 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7694 ms. Remains : 1338/1398 places, 296/296 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-10
Product exploration explored 100000 steps with 19987 reset in 284 ms.
Product exploration explored 100000 steps with 20021 reset in 279 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1764 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (128 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (123 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (131 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (123 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (124 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (132 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 801641 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :5 out of 6
Probabilistic random walk after 801641 steps, saw 112197 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :5
// Phase 1: matrix 296 rows 1338 cols
[2025-06-05 12:48:49] [INFO ] Computed 1044 invariants in 29 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/39 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 253/332 variables, 60/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1257/1589 variables, 1198/1315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1589 variables, 1008/2323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1589 variables, 0/2323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/1631 variables, 39/2362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1631 variables, 18/2380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1631 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1634 variables, 2/2382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 733 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/39 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 253/332 variables, 60/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1589/1634 variables, and 1316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1283 ms.
Refiners :[Generalized P Invariants (flows): 18/1044 constraints, State Equation: 1297/1338 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2059ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 558 are kept as prefixes of interest. Removing 780 places using SCC suffix rule.3 ms
Discarding 780 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Drop transitions (Empty/Sink Transition effects.) removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 520 transition count 118
Reduce places removed 1 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 20 rules applied. Total rules applied 197 place count 519 transition count 99
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 216 place count 500 transition count 99
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 216 place count 500 transition count 41
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 388 place count 386 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 388 place count 386 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 393 place count 383 transition count 39
Applied a total of 393 rules in 24 ms. Remains 383 /1338 variables (removed 955) and now considering 39/296 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 383/1338 places, 39/296 transitions.
RANDOM walk for 40000 steps (1288 resets) in 696 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (108 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 659155 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 659155 steps, saw 85931 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
// Phase 1: matrix 39 rows 383 cols
[2025-06-05 12:48:54] [INFO ] Computed 344 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/59 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 324/383 variables, 324/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/422 variables, 383/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/59 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/422 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9082 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 0/383 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9264ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 39/39 transitions.
Applied a total of 0 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 383/383 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 39/39 transitions.
Applied a total of 0 rules in 5 ms. Remains 383 /383 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-05 12:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:49:04] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-05 12:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:49:04] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:49:04] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-05 12:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 2/383 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/422 variables, 383/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 727 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2897 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 2/383 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/422 variables, 383/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 38/765 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 765 constraints, problems are : Problem set: 0 solved, 38 unsolved in 6232 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9154ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 9154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10126 ms. Remains : 383/383 places, 39/39 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 322 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Support contains 20 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 1318 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1316 transition count 292
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1316 transition count 292
Applied a total of 4 rules in 95 ms. Remains 1316 /1338 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1316 cols
[2025-06-05 12:49:15] [INFO ] Computed 1026 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:49:16] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2025-06-05 12:49:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:49:22] [INFO ] Implicit Places using invariants and state equation in 6201 ms returned [1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7434 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1297/1338 places, 292/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1297 /1297 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7563 ms. Remains : 1297/1338 places, 292/296 transitions.
Computed a total of 1297 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1297 transition count 292
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 309 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1687 resets) in 354 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (74 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (75 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 837722 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 6
Probabilistic random walk after 837722 steps, saw 112004 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :0
// Phase 1: matrix 292 rows 1297 cols
[2025-06-05 12:49:26] [INFO ] Computed 1008 invariants in 51 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/59 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 250/309 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1258/1567 variables, 1198/1277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1567 variables, 1008/2285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1567 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/1589 variables, 20/2305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1589 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1589 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1589/1589 variables, and 2305 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1093 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1297/1297 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/59 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 250/309 variables, 59/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1258/1567 variables, 1198/1283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1567 variables, 1008/2291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1567 variables, 0/2291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 22/1589 variables, 20/2311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1589 variables, 0/2311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1589 variables, 0/2311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1589/1589 variables, and 2311 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4407 ms.
Refiners :[Generalized P Invariants (flows): 1008/1008 constraints, State Equation: 1297/1297 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5572ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 5 properties in 136 ms.
Support contains 20 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 292/292 transitions.
Graph (complete) has 8952 edges and 1297 vertex of which 537 are kept as prefixes of interest. Removing 760 places using SCC suffix rule.1 ms
Discarding 760 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Drop transitions (Empty/Sink Transition effects.) removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 499 transition count 98
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 214 place count 480 transition count 98
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 214 place count 480 transition count 40
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 38 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 368 place count 384 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 368 place count 384 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 370 place count 383 transition count 39
Applied a total of 370 rules in 14 ms. Remains 383 /1297 variables (removed 914) and now considering 39/292 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 383/1297 places, 39/292 transitions.
RANDOM walk for 40000 steps (1288 resets) in 462 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (108 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 612861 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 612861 steps, saw 78864 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 39 rows 383 cols
[2025-06-05 12:49:35] [INFO ] Computed 344 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/59 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 324/383 variables, 324/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/422 variables, 383/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/59 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/422 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9084 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 0/383 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9281ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 39/39 transitions.
Applied a total of 0 rules in 13 ms. Remains 383 /383 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 383/383 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 39/39 transitions.
Applied a total of 0 rules in 5 ms. Remains 383 /383 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-05 12:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:49:45] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-06-05 12:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:49:45] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:49:45] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-05 12:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 2/383 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/422 variables, 383/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/422 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 727 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2933 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 2/383 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/422 variables, 383/727 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 38/765 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 765 constraints, problems are : Problem set: 0 solved, 38 unsolved in 6166 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 324/324 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9121ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 9121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10076 ms. Remains : 383/383 places, 39/39 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 17 factoid took 655 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Product exploration explored 100000 steps with 14220 reset in 457 ms.
Product exploration explored 100000 steps with 14238 reset in 487 ms.
Built C files in :
/tmp/ltsmin11457833932087498264
[2025-06-05 12:49:57] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2025-06-05 12:49:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:49:57] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2025-06-05 12:49:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:49:57] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2025-06-05 12:49:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:49:57] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11457833932087498264
Running compilation step : cd /tmp/ltsmin11457833932087498264;'/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'
Compilation finished in 1091 ms.
Running link step : cd /tmp/ltsmin11457833932087498264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11457833932087498264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2741649381463959725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 1297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1297/1297 places, 292/292 transitions.
Applied a total of 0 rules in 37 ms. Remains 1297 /1297 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 1297 cols
[2025-06-05 12:50:12] [INFO ] Computed 1008 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:50:13] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2025-06-05 12:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:50:19] [INFO ] Implicit Places using invariants and state equation in 5847 ms returned []
Implicit Place search using SMT with State Equation took 7098 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:50:19] [INFO ] Redundant transitions in 20 ms returned []
Running 253 sub problems to find dead transitions.
[2025-06-05 12:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1277 variables, 1008/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1277 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 292/1569 variables, 1277/2285 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1569 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 253 unsolved
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37278 ms. Remains : 1297/1297 places, 292/292 transitions.
Built C files in :
/tmp/ltsmin13969565440322440240
[2025-06-05 12:50:49] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2025-06-05 12:50:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:50:49] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2025-06-05 12:50:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:50:49] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2025-06-05 12:50:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:50:49] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13969565440322440240
Running compilation step : cd /tmp/ltsmin13969565440322440240;'/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'
Compilation finished in 1122 ms.
Running link step : cd /tmp/ltsmin13969565440322440240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13969565440322440240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3589517098540312315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 12:51:05] [INFO ] Flatten gal took : 24 ms
[2025-06-05 12:51:05] [INFO ] Flatten gal took : 24 ms
[2025-06-05 12:51:05] [INFO ] Time to serialize gal into /tmp/LTL3639868180979109862.gal : 4 ms
[2025-06-05 12:51:05] [INFO ] Time to serialize properties into /tmp/LTL15923680567653386857.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/LTL3639868180979109862.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3464018376009113266.hoa' '-atoms' '/tmp/LTL15923680567653386857.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/LTL15923680567653386857.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3464018376009113266.hoa
Detected timeout of ITS tools.
[2025-06-05 12:51:20] [INFO ] Flatten gal took : 23 ms
[2025-06-05 12:51:20] [INFO ] Flatten gal took : 22 ms
[2025-06-05 12:51:20] [INFO ] Time to serialize gal into /tmp/LTL16420874570136034028.gal : 3 ms
[2025-06-05 12:51:20] [INFO ] Time to serialize properties into /tmp/LTL17619265151810863794.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/LTL16420874570136034028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17619265151810863794.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((n5_16...209
Formula 0 simplified : GF(!"((((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5_7)))+(((n5_8+n5_9)+(n5_10+n5_11))+((n5_12+n5_13)+(n5_14+n5_15))))+((n5_16+n...197
Detected timeout of ITS tools.
[2025-06-05 12:51:35] [INFO ] Flatten gal took : 32 ms
[2025-06-05 12:51:35] [INFO ] Applying decomposition
[2025-06-05 12:51:35] [INFO ] Flatten gal took : 24 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/graph3155386690733798749.txt' '-o' '/tmp/graph3155386690733798749.bin' '-w' '/tmp/graph3155386690733798749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3155386690733798749.bin' '-l' '-1' '-v' '-w' '/tmp/graph3155386690733798749.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:51:35] [INFO ] Decomposing Gal with order
[2025-06-05 12:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:51:35] [INFO ] Removed a total of 171 redundant transitions.
[2025-06-05 12:51:35] [INFO ] Flatten gal took : 70 ms
[2025-06-05 12:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 23 ms.
[2025-06-05 12:51:35] [INFO ] Time to serialize gal into /tmp/LTL16621648062939947150.gal : 9 ms
[2025-06-05 12:51:35] [INFO ] Time to serialize properties into /tmp/LTL5028082411031054029.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/LTL16621648062939947150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5028082411031054029.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 : !((F(G(("((((((gu1.n5_0+gu1.n5_1)+(gu1.n5_2+gu1.n5_3))+((gu1.n5_4+gu1.n5_5)+(gu1.n5_6+gu1.n5_7)))+(((gu1.n5_8+gu1.n5_9)+(gu1.n5_10+gu1...302
Formula 0 simplified : GF(!"((((((gu1.n5_0+gu1.n5_1)+(gu1.n5_2+gu1.n5_3))+((gu1.n5_4+gu1.n5_5)+(gu1.n5_6+gu1.n5_7)))+(((gu1.n5_8+gu1.n5_9)+(gu1.n5_10+gu1.n...290
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-10 finished in 194065 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(X(X(G(p0)))))))'
Support contains 19 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 31 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2025-06-05 12:51:50] [INFO ] Computed 1062 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:51:52] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2025-06-05 12:51:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:52:00] [INFO ] Implicit Places using invariants and state equation in 8157 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 9459 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1398 places, 296/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9519 ms. Remains : 1337/1398 places, 296/296 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-11 finished in 9751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 20 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1376 transition count 296
Applied a total of 22 rules in 33 ms. Remains 1376 /1398 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1376 cols
[2025-06-05 12:52:00] [INFO ] Computed 1082 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:52:02] [INFO ] Implicit Places using invariants in 1992 ms returned []
[2025-06-05 12:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:52:18] [INFO ] Implicit Places using invariants and state equation in 16238 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 18235 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1398 places, 296/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18313 ms. Remains : 1357/1398 places, 296/296 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-14
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-14 finished in 18478 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 U (p1||G(p0))))))'
Support contains 363 out of 1398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1358 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1357 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1356 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1356 transition count 294
Applied a total of 5 rules in 66 ms. Remains 1356 /1398 variables (removed 42) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1356 cols
[2025-06-05 12:52:19] [INFO ] Computed 1063 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:52:20] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2025-06-05 12:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:52:25] [INFO ] Implicit Places using invariants and state equation in 5706 ms returned [1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 6752 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1318/1398 places, 294/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 1318 /1318 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6847 ms. Remains : 1318/1398 places, 294/296 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-15
Product exploration explored 100000 steps with 6037 reset in 3115 ms.
Product exploration explored 100000 steps with 6072 reset in 3102 ms.
Computed a total of 1318 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1318 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 549 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1679 resets) in 655 ms. (60 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 535 ms. (74 steps per ms) remains 1/1 properties
// Phase 1: matrix 294 rows 1318 cols
[2025-06-05 12:52:33] [INFO ] Computed 1027 invariants in 19 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 367/1612 variables, and 325 constraints, problems are : Problem set: 1 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 324/1026 constraints, State Equation: 0/1318 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 706 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
[2025-06-05 12:52:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:52:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-05 12:52:36] [INFO ] [Real]Absence check using 1 positive and 1026 generalized place invariants in 1130 ms returned sat
[2025-06-05 12:52:45] [INFO ] [Real]Absence check using state equation in 9209 ms returned sat
[2025-06-05 12:52:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:52:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 32 ms returned sat
[2025-06-05 12:52:47] [INFO ] [Nat]Absence check using 1 positive and 1026 generalized place invariants in 1524 ms returned sat
[2025-06-05 12:52:54] [INFO ] [Nat]Absence check using state equation in 6946 ms returned sat
[2025-06-05 12:52:54] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:52:55] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 5 ms to minimize.
[2025-06-05 12:52:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-06-05 12:52:55] [INFO ] Added : 59 causal constraints over 12 iterations in 1361 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 363 out of 1318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1318/1318 places, 294/294 transitions.
Applied a total of 0 rules in 28 ms. Remains 1318 /1318 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-05 12:52:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:52:56] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2025-06-05 12:52:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:53:03] [INFO ] Implicit Places using invariants and state equation in 6859 ms returned []
Implicit Place search using SMT with State Equation took 7869 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:53:03] [INFO ] Redundant transitions in 2 ms returned []
Running 255 sub problems to find dead transitions.
[2025-06-05 12:53:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1297 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1297 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 2/1299 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.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 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1299 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 255 unsolved
SMT process timed out in 30114ms, After SMT, problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38021 ms. Remains : 1318/1318 places, 294/294 transitions.
Computed a total of 1318 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1318 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 65 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
[2025-06-05 12:53:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:53:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-05 12:53:36] [INFO ] [Real]Absence check using 1 positive and 1026 generalized place invariants in 1077 ms returned sat
[2025-06-05 12:53:44] [INFO ] [Real]Absence check using state equation in 8816 ms returned sat
[2025-06-05 12:53:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:53:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2025-06-05 12:53:46] [INFO ] [Nat]Absence check using 1 positive and 1026 generalized place invariants in 1558 ms returned sat
[2025-06-05 12:53:53] [INFO ] [Nat]Absence check using state equation in 7033 ms returned sat
[2025-06-05 12:53:53] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:53:55] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
[2025-06-05 12:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-05 12:53:55] [INFO ] Added : 59 causal constraints over 12 iterations in 1536 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6076 reset in 1045 ms.
Product exploration explored 100000 steps with 6006 reset in 1052 ms.
Built C files in :
/tmp/ltsmin10961861049981628096
[2025-06-05 12:53:57] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2025-06-05 12:53:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:53:57] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2025-06-05 12:53:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:53:57] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2025-06-05 12:53:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:53:57] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10961861049981628096
Running compilation step : cd /tmp/ltsmin10961861049981628096;'/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'
Compilation finished in 1102 ms.
Running link step : cd /tmp/ltsmin10961861049981628096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10961861049981628096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15676431714389544937.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 363 out of 1318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1318/1318 places, 294/294 transitions.
Applied a total of 0 rules in 33 ms. Remains 1318 /1318 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-05 12:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:54:13] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2025-06-05 12:54:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:54:20] [INFO ] Implicit Places using invariants and state equation in 7015 ms returned []
Implicit Place search using SMT with State Equation took 8051 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:54:20] [INFO ] Redundant transitions in 2 ms returned []
Running 255 sub problems to find dead transitions.
[2025-06-05 12:54:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1297 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1297 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 2/1299 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1299 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 255 unsolved
SMT process timed out in 30113ms, After SMT, problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 30114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38209 ms. Remains : 1318/1318 places, 294/294 transitions.
Built C files in :
/tmp/ltsmin4371818799726631972
[2025-06-05 12:54:50] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2025-06-05 12:54:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:54:50] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2025-06-05 12:54:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:54:50] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2025-06-05 12:54:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:54:50] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4371818799726631972
Running compilation step : cd /tmp/ltsmin4371818799726631972;'/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'
Compilation finished in 1173 ms.
Running link step : cd /tmp/ltsmin4371818799726631972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4371818799726631972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8929843856484574252.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 12:55:06] [INFO ] Flatten gal took : 26 ms
[2025-06-05 12:55:06] [INFO ] Flatten gal took : 23 ms
[2025-06-05 12:55:06] [INFO ] Time to serialize gal into /tmp/LTL7332219779270660277.gal : 4 ms
[2025-06-05 12:55:06] [INFO ] Time to serialize properties into /tmp/LTL14790016391584593038.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7332219779270660277.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11463524581851871017.hoa' '-atoms' '/tmp/LTL14790016391584593038.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14790016391584593038.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11463524581851871017.hoa
Detected timeout of ITS tools.
[2025-06-05 12:55:21] [INFO ] Flatten gal took : 25 ms
[2025-06-05 12:55:21] [INFO ] Flatten gal took : 24 ms
[2025-06-05 12:55:21] [INFO ] Time to serialize gal into /tmp/LTL11538786886696354289.gal : 3 ms
[2025-06-05 12:55:21] [INFO ] Time to serialize properties into /tmp/LTL112310537525808101.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/LTL11538786886696354289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL112310537525808101.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(AstopAbort>(((((((((n9_0+n9_1)+(n9_2+n9_3))+((n9_4+n9_5)+(n9_6+n9_7)))+(((n9_8+n9_9)+(n9_10+n9_11))+((n9_12+n9_13)+(n9_14+n9...9514
Formula 0 simplified : FG(!"(AstopAbort>(((((((((n9_0+n9_1)+(n9_2+n9_3))+((n9_4+n9_5)+(n9_6+n9_7)))+(((n9_8+n9_9)+(n9_10+n9_11))+((n9_12+n9_13)+(n9_14+n9_1...6349
Detected timeout of ITS tools.
[2025-06-05 12:55:36] [INFO ] Flatten gal took : 32 ms
[2025-06-05 12:55:36] [INFO ] Applying decomposition
[2025-06-05 12:55:36] [INFO ] Flatten gal took : 24 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/graph14373767717371730635.txt' '-o' '/tmp/graph14373767717371730635.bin' '-w' '/tmp/graph14373767717371730635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14373767717371730635.bin' '-l' '-1' '-v' '-w' '/tmp/graph14373767717371730635.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:55:36] [INFO ] Decomposing Gal with order
[2025-06-05 12:55:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:55:36] [INFO ] Removed a total of 249 redundant transitions.
[2025-06-05 12:55:36] [INFO ] Flatten gal took : 49 ms
[2025-06-05 12:55:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 259 labels/synchronizations in 55 ms.
[2025-06-05 12:55:37] [INFO ] Time to serialize gal into /tmp/LTL6830378026408285530.gal : 9 ms
[2025-06-05 12:55:37] [INFO ] Time to serialize properties into /tmp/LTL2693544794719344422.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/LTL6830378026408285530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2693544794719344422.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu2.AstopAbort>(((((((((gu2.n9_0+gu2.n9_1)+(gu2.n9_2+gu2.n9_3))+((gu2.n9_4+gu2.n9_5)+(gu2.n9_6+gu2.n9_7)))+(((gu2.n9_8+gu2.n...13875
Formula 0 simplified : FG(!"(gu2.AstopAbort>(((((((((gu2.n9_0+gu2.n9_1)+(gu2.n9_2+gu2.n9_3))+((gu2.n9_4+gu2.n9_5)+(gu2.n9_6+gu2.n9_7)))+(((gu2.n9_8+gu2.n9_...9262
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-15 finished in 213130 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(G(p0)) U p1) U X(X(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(X(F(p1)))||G(p0))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-18-LTLCardinality-06
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1336 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.5 ms
Discarding 62 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1333 transition count 291
Applied a total of 5 rules in 85 ms. Remains 1333 /1398 variables (removed 65) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2025-06-05 12:55:52] [INFO ] Computed 1044 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:55:54] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2025-06-05 12:55:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:55:56] [INFO ] Implicit Places using invariants and state equation in 2247 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3595 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1314/1398 places, 291/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3724 ms. Remains : 1314/1398 places, 291/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-06
Product exploration explored 100000 steps with 4210 reset in 296 ms.
Product exploration explored 100000 steps with 4205 reset in 321 ms.
Computed a total of 1314 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1314 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1679 resets) in 156 ms. (254 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
// Phase 1: matrix 291 rows 1314 cols
[2025-06-05 12:55:57] [INFO ] Computed 1026 invariants in 13 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 115/1541 variables, 76/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1541 variables, 0/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1603 variables, 58/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1603 variables, 18/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1603 variables, 0/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1605 variables, 1/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1605/1605 variables, and 2340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 804 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/1605 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1529 ms.
Refiners :[Generalized P Invariants (flows): 1008/1026 constraints, State Equation: 1179/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 1314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Graph (complete) has 9653 edges and 1314 vertex of which 934 are kept as prefixes of interest. Removing 380 places using SCC suffix rule.2 ms
Discarding 380 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 896 transition count 135
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 195 place count 877 transition count 135
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 195 place count 877 transition count 97
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 38 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 309 place count 801 transition count 97
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 310 place count 801 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 800 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 691 place count 439 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 692 place count 438 transition count 76
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 711 place count 419 transition count 76
Applied a total of 711 rules in 50 ms. Remains 419 /1314 variables (removed 895) and now considering 76/291 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 419/1314 places, 76/291 transitions.
RANDOM walk for 80 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 12:56:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:56:02] [INFO ] [Real]Absence check using 0 positive and 1026 generalized place invariants in 1474 ms returned sat
[2025-06-05 12:56:07] [INFO ] [Real]Absence check using state equation in 5506 ms returned sat
[2025-06-05 12:56:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:56:09] [INFO ] [Nat]Absence check using 0 positive and 1026 generalized place invariants in 1447 ms returned sat
[2025-06-05 12:56:16] [INFO ] [Nat]Absence check using state equation in 6497 ms returned sat
[2025-06-05 12:56:16] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 16 ms.
[2025-06-05 12:56:16] [INFO ] Added : 9 causal constraints over 2 iterations in 238 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 39 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Applied a total of 0 rules in 38 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2025-06-05 12:56:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:56:17] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2025-06-05 12:56:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:56:19] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 3393 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-05 12:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1295 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1295 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1586 variables, 1295/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1586 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 30119ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Finished structural reductions in LTL mode , in 1 iterations and 33552 ms. Remains : 1314/1314 places, 291/291 transitions.
Computed a total of 1314 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1314 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1680 resets) in 197 ms. (202 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (75 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2025-06-05 12:56:50] [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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1426 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 115/1541 variables, 76/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1541 variables, 0/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1603 variables, 58/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1603 variables, 18/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1603 variables, 0/2339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1605 variables, 1/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1605 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1605/1605 variables, and 2340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 914 ms.
Refiners :[Generalized P Invariants (flows): 1026/1026 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 722/760 variables, 684/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/855 variables, 760/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 571/1426 variables, 419/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1426 variables, 324/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/1605 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1632 ms.
Refiners :[Generalized P Invariants (flows): 1008/1026 constraints, State Equation: 1179/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2556ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 1314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Graph (complete) has 9653 edges and 1314 vertex of which 934 are kept as prefixes of interest. Removing 380 places using SCC suffix rule.2 ms
Discarding 380 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 896 transition count 135
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 195 place count 877 transition count 135
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 195 place count 877 transition count 97
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 38 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 309 place count 801 transition count 97
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 310 place count 801 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 800 transition count 96
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 691 place count 439 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 692 place count 438 transition count 76
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 711 place count 419 transition count 76
Applied a total of 711 rules in 57 ms. Remains 419 /1314 variables (removed 895) and now considering 76/291 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 419/1314 places, 76/291 transitions.
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 12:56:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:56:55] [INFO ] [Real]Absence check using 0 positive and 1026 generalized place invariants in 1474 ms returned sat
[2025-06-05 12:57:01] [INFO ] [Real]Absence check using state equation in 5552 ms returned sat
[2025-06-05 12:57:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 12:57:03] [INFO ] [Nat]Absence check using 0 positive and 1026 generalized place invariants in 1508 ms returned sat
[2025-06-05 12:57:10] [INFO ] [Nat]Absence check using state equation in 6833 ms returned sat
[2025-06-05 12:57:10] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 16 ms.
[2025-06-05 12:57:10] [INFO ] Added : 9 causal constraints over 2 iterations in 231 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4219 reset in 266 ms.
Product exploration explored 100000 steps with 4207 reset in 296 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 1314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Applied a total of 0 rules in 44 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 12:57:11] [INFO ] Redundant transitions in 22 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-05 12:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1295 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1295 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1586 variables, 1295/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 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 0.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)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)timeout

(s942 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1586 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 30124ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30197 ms. Remains : 1314/1314 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin1396332503547700575
[2025-06-05 12:57:41] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1396332503547700575
Running compilation step : cd /tmp/ltsmin1396332503547700575;'/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'
Compilation finished in 946 ms.
Running link step : cd /tmp/ltsmin1396332503547700575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1396332503547700575;'/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' '--hoa' '/tmp/stateBased15236832920554372118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 291/291 transitions.
Applied a total of 0 rules in 35 ms. Remains 1314 /1314 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2025-06-05 12:57:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:57:57] [INFO ] Implicit Places using invariants in 1240 ms returned []
[2025-06-05 12:57:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:57:59] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 3329 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-05 12:57:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1295 variables, 1026/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1295 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 291/1586 variables, 1295/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1586 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 30135ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 30137ms
Finished structural reductions in LTL mode , in 1 iterations and 33502 ms. Remains : 1314/1314 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin10543996673452929863
[2025-06-05 12:58:30] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10543996673452929863
Running compilation step : cd /tmp/ltsmin10543996673452929863;'/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'
Compilation finished in 916 ms.
Running link step : cd /tmp/ltsmin10543996673452929863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10543996673452929863;'/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' '--hoa' '/tmp/stateBased11549966115470928457.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 12:58:45] [INFO ] Flatten gal took : 21 ms
[2025-06-05 12:58:45] [INFO ] Flatten gal took : 21 ms
[2025-06-05 12:58:45] [INFO ] Time to serialize gal into /tmp/LTL13270138525288087852.gal : 4 ms
[2025-06-05 12:58:45] [INFO ] Time to serialize properties into /tmp/LTL10227586655344954831.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13270138525288087852.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7325362210578993568.hoa' '-atoms' '/tmp/LTL10227586655344954831.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10227586655344954831.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7325362210578993568.hoa
Detected timeout of ITS tools.
[2025-06-05 12:59:00] [INFO ] Flatten gal took : 21 ms
[2025-06-05 12:59:00] [INFO ] Flatten gal took : 21 ms
[2025-06-05 12:59:00] [INFO ] Time to serialize gal into /tmp/LTL13131629846023613753.gal : 4 ms
[2025-06-05 12:59:00] [INFO ] Time to serialize properties into /tmp/LTL9714627022839852530.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/LTL13131629846023613753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9714627022839852530.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 : !((F(("(malicious_reservoir<1)")&&(X((X(X(F("((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s...465
Formula 0 simplified : G(!"(malicious_reservoir<1)" | X(XXG!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+...451
Detected timeout of ITS tools.
[2025-06-05 12:59:15] [INFO ] Flatten gal took : 20 ms
[2025-06-05 12:59:15] [INFO ] Applying decomposition
[2025-06-05 12:59:15] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17314311922218186553.txt' '-o' '/tmp/graph17314311922218186553.bin' '-w' '/tmp/graph17314311922218186553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17314311922218186553.bin' '-l' '-1' '-v' '-w' '/tmp/graph17314311922218186553.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:59:15] [INFO ] Decomposing Gal with order
[2025-06-05 12:59:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:59:15] [INFO ] Removed a total of 218 redundant transitions.
[2025-06-05 12:59:15] [INFO ] Flatten gal took : 43 ms
[2025-06-05 12:59:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 26 ms.
[2025-06-05 12:59:15] [INFO ] Time to serialize gal into /tmp/LTL14373608045591547393.gal : 8 ms
[2025-06-05 12:59:15] [INFO ] Time to serialize properties into /tmp/LTL4175496049658356385.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/LTL14373608045591547393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4175496049658356385.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 : !((F(("(gu0.malicious_reservoir<1)")&&(X((X(X(F("((((((gu37.s6_0+gu37.s6_1)+(gu37.s6_2+gu37.s6_3))+((gu37.s6_4+gu37.s6_5)+(gu37.s6_6+g...663
Formula 0 simplified : G(!"(gu0.malicious_reservoir<1)" | X(XXG!"((((((gu37.s6_0+gu37.s6_1)+(gu37.s6_2+gu37.s6_3))+((gu37.s6_4+gu37.s6_5)+(gu37.s6_6+gu37.s...649
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-06 finished in 218557 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(X(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
[2025-06-05 12:59:31] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14403122629118555236
[2025-06-05 12:59:31] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2025-06-05 12:59:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:59:31] [INFO ] Applying decomposition
[2025-06-05 12:59:31] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2025-06-05 12:59:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:59:31] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2025-06-05 12:59:31] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:59:31] [INFO ] Flatten gal took : 25 ms
[2025-06-05 12:59:31] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14403122629118555236
Running compilation step : cd /tmp/ltsmin14403122629118555236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' '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'
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/graph18017052668913456195.txt' '-o' '/tmp/graph18017052668913456195.bin' '-w' '/tmp/graph18017052668913456195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18017052668913456195.bin' '-l' '-1' '-v' '-w' '/tmp/graph18017052668913456195.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:59:31] [INFO ] Decomposing Gal with order
[2025-06-05 12:59:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:59:31] [INFO ] Removed a total of 156 redundant transitions.
[2025-06-05 12:59:31] [INFO ] Flatten gal took : 49 ms
[2025-06-05 12:59:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 3 ms.
[2025-06-05 12:59:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality8523033011708186826.gal : 5 ms
[2025-06-05 12:59:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality3699279759330961684.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/LTLCardinality8523033011708186826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3699279759330961684.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...297
Read 5 LTL properties
Checking formula 0 : !((G(((F(G("((((((gi2.gu43.s5_0+gi2.gu43.s5_1)+(gi2.gu43.s5_2+gi2.gu43.s5_3))+((gi2.gu43.s5_4+gi2.gu43.s5_5)+(gi2.gu43.s5_6+gi2.gu43.s...1347
Formula 0 simplified : F((GF!"((((((gi2.gu43.s5_0+gi2.gu43.s5_1)+(gi2.gu43.s5_2+gi2.gu43.s5_3))+((gi2.gu43.s5_4+gi2.gu43.s5_5)+(gi2.gu43.s5_6+gi2.gu43.s5_7...1337
Compilation finished in 1225 ms.
Running link step : cd /tmp/ltsmin14403122629118555236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14403122629118555236;'/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' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin14403122629118555236;'/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' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14403122629118555236;'/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' '<>(((LTLAPp2==true)&&X((X(X(<>((LTLAPp3==true))))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin14403122629118555236;'/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' '<>(((LTLAPp2==true)&&X((X(X(<>((LTLAPp3==true))))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14403122629118555236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp4==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin14403122629118555236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp4==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14403122629118555236;'/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' '<>([](((LTLAPp5==true)||X(X(X((LTLAPp6==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin14403122629118555236;'/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' '<>([](((LTLAPp5==true)||X(X(X((LTLAPp6==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14403122629118555236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp7==true) U ((LTLAPp8==true)||[]((LTLAPp7==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin14403122629118555236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp7==true) U ((LTLAPp8==true)||[]((LTLAPp7==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin14403122629118555236;'/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' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: LTL layer: formula: [](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))
pins2lts-mc-linux64( 3/ 8), 0.013: "[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.014: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.147: There are 306 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.147: State length is 1399, there are 315 groups
pins2lts-mc-linux64( 0/ 8), 0.147: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.147: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.147: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.147: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.205: [Blue] ~8 levels ~960 states ~2624 transitions
pins2lts-mc-linux64( 1/ 8), 0.255: [Blue] ~15 levels ~1920 states ~5224 transitions
pins2lts-mc-linux64( 4/ 8), 0.315: [Blue] ~22 levels ~3840 states ~11720 transitions
pins2lts-mc-linux64( 3/ 8), 0.437: [Blue] ~22 levels ~7680 states ~29048 transitions
pins2lts-mc-linux64( 3/ 8), 0.650: [Blue] ~22 levels ~15360 states ~66048 transitions
pins2lts-mc-linux64( 3/ 8), 1.055: [Blue] ~23 levels ~30720 states ~147576 transitions
pins2lts-mc-linux64( 3/ 8), 1.717: [Blue] ~23 levels ~61440 states ~281768 transitions
pins2lts-mc-linux64( 3/ 8), 3.062: [Blue] ~23 levels ~122880 states ~597776 transitions
pins2lts-mc-linux64( 4/ 8), 5.621: [Blue] ~23 levels ~245760 states ~1228480 transitions
pins2lts-mc-linux64( 3/ 8), 10.610: [Blue] ~23 levels ~491520 states ~2963024 transitions
pins2lts-mc-linux64( 4/ 8), 19.924: [Blue] ~23 levels ~983040 states ~5848664 transitions
pins2lts-mc-linux64( 5/ 8), 37.905: [Blue] ~23 levels ~1966080 states ~11867304 transitions
pins2lts-mc-linux64( 4/ 8), 74.248: [Blue] ~24 levels ~3932160 states ~24504016 transitions
pins2lts-mc-linux64( 5/ 8), 149.286: [Blue] ~24 levels ~7864320 states ~53082384 transitions
pins2lts-mc-linux64( 6/ 8), 207.473: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 208.037:
pins2lts-mc-linux64( 0/ 8), 208.037: Explored 10416659 states 72083868 transitions, fanout: 6.920
pins2lts-mc-linux64( 0/ 8), 208.037: Total exploration time 207.880 sec (207.380 sec minimum, 207.559 sec on average)
pins2lts-mc-linux64( 0/ 8), 208.037: States per second: 50109, Transitions per second: 346757
pins2lts-mc-linux64( 0/ 8), 208.037:
pins2lts-mc-linux64( 0/ 8), 208.037: State space has 10417167 states, 3472384 are accepting
pins2lts-mc-linux64( 0/ 8), 208.037: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 208.037: blue states: 10416659 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 208.037: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 208.037: all-red states: 6943308 (66.65%), bogus 876 (0.01%)
pins2lts-mc-linux64( 0/ 8), 208.037:
pins2lts-mc-linux64( 0/ 8), 208.037: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 208.037:
pins2lts-mc-linux64( 0/ 8), 208.037: Queue width: 8B, total height: 194, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 208.037: Tree memory: 335.5MB, 33.8 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 208.037: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 208.037: Stored 322 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 208.037: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 208.037: Est. total memory use: 335.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14403122629118555236;'/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' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14403122629118555236;'/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' '[](((<>([]((LTLAPp0==true))) U (LTLAPp1==true)) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 13:28:31] [INFO ] Applying decomposition
[2025-06-05 13:28:31] [INFO ] Flatten gal took : 198 ms
[2025-06-05 13:28:31] [INFO ] Decomposing Gal with order
[2025-06-05 13:28:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 13:28:31] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Cstart_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0, SstopOK_0, CstopOK_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Cstart_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1, SstopOK_1, CstopOK_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Cstart_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2, SstopOK_2, CstopOK_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Cstart_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3, SstopOK_3, CstopOK_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Cstart_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4, SstopOK_4, CstopOK_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Cstart_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5, SstopOK_5, CstopOK_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Cstart_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6, SstopOK_6, CstopOK_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Cstart_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7, SstopOK_7, CstopOK_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Cstart_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8, SstopOK_8, CstopOK_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Cstart_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9, SstopOK_9, CstopOK_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Cstart_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10, SstopOK_10, CstopOK_10],[n6_11, n5_11, n4_11, n3_11, n2_11, n1_11, c1_11, Cstart_11, Sstart_11, s2_11, s3_11, s4_11, s5_11, s6_11, SstopOK_11, CstopOK_11],[n6_12, n5_12, n4_12, n3_12, n2_12, n1_12, c1_12, Cstart_12, Sstart_12, s2_12, s3_12, s4_12, s5_12, s6_12, SstopOK_12, CstopOK_12],[n6_13, n5_13, n4_13, n3_13, n2_13, n1_13, c1_13, Cstart_13, Sstart_13, s2_13, s3_13, s4_13, s5_13, s6_13, SstopOK_13, CstopOK_13],[n6_14, n5_14, n4_14, n3_14, n2_14, n1_14, c1_14, Cstart_14, Sstart_14, s2_14, s3_14, s4_14, s5_14, s6_14, SstopOK_14, CstopOK_14],[n6_15, n5_15, n4_15, n3_15, n2_15, n1_15, c1_15, Cstart_15, Sstart_15, s2_15, s3_15, s4_15, s5_15, s6_15, SstopOK_15, CstopOK_15],[n6_16, n5_16, n4_16, n3_16, n2_16, n1_16, c1_16, Cstart_16, Sstart_16, s2_16, s3_16, s4_16, s5_16, s6_16, SstopOK_16, CstopOK_16],[n6_17, n5_17, n4_17, n3_17, n2_17, n1_17, c1_17, Cstart_17, Sstart_17, s2_17, s3_17, s4_17, s5_17, s6_17, SstopOK_17, CstopOK_17],[n6_18, n5_18, n4_18, n3_18, n2_18, n1_18, c1_18, Cstart_18, Sstart_18, s2_18, s3_18, s4_18, s5_18, s6_18, SstopOK_18, CstopOK_18],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],[n9_121, n8_121, n7_121],[n9_122, n8_122, n7_122],[n9_123, n8_123, n7_123],[n9_124, n8_124, n7_124],[n9_125, n8_125, n7_125],[n9_126, n8_126, n7_126],[n9_127, n8_127, n7_127],[n9_128, n8_128, n7_128],[n9_129, n8_129, n7_129],[n9_130, n8_130, n7_130],[n9_131, n8_131, n7_131],[n9_132, n8_132, n7_132],[n9_133, n8_133, n7_133],[n9_134, n8_134, n7_134],[n9_135, n8_135, n7_135],[n9_136, n8_136, n7_136],[n9_137, n8_137, n7_137],[n9_138, n8_138, n7_138],[n9_139, n8_139, n7_139],[n9_140, n8_140, n7_140],[n9_141, n8_141, n7_141],[n9_142, n8_142, n7_142],[n9_143, n8_143, n7_143],[n9_144, n8_144, n7_144],[n9_145, n8_145, n7_145],[n9_146, n8_146, n7_146],[n9_147, n8_147, n7_147],[n9_148, n8_148, n7_148],[n9_149, n8_149, n7_149],[n9_150, n8_150, n7_150],[n9_151, n8_151, n7_151],[n9_152, n8_152, n7_152],[n9_153, n8_153, n7_153],[n9_154, n8_154, n7_154],[n9_155, n8_155, n7_155],[n9_156, n8_156, n7_156],[n9_157, n8_157, n7_157],[n9_158, n8_158, n7_158],[n9_159, n8_159, n7_159],[n9_160, n8_160, n7_160],[n9_161, n8_161, n7_161],[n9_162, n8_162, n7_162],[n9_163, n8_163, n7_163],[n9_164, n8_164, n7_164],[n9_165, n8_165, n7_165],[n9_166, n8_166, n7_166],[n9_167, n8_167, n7_167],[n9_168, n8_168, n7_168],[n9_169, n8_169, n7_169],[n9_170, n8_170, n7_170],[n9_171, n8_171, n7_171],[n9_172, n8_172, n7_172],[n9_173, n8_173, n7_173],[n9_174, n8_174, n7_174],[n9_175, n8_175, n7_175],[n9_176, n8_176, n7_176],[n9_177, n8_177, n7_177],[n9_178, n8_178, n7_178],[n9_179, n8_179, n7_179],[n9_180, n8_180, n7_180],[n9_181, n8_181, n7_181],[n9_182, n8_182, n7_182],[n9_183, n8_183, n7_183],[n9_184, n8_184, n7_184],[n9_185, n8_185, n7_185],[n9_186, n8_186, n7_186],[n9_187, n8_187, n7_187],[n9_188, n8_188, n7_188],[n9_189, n8_189, n7_189],[n9_190, n8_190, n7_190],[n9_191, n8_191, n7_191],[n9_192, n8_192, n7_192],[n9_193, n8_193, n7_193],[n9_194, n8_194, n7_194],[n9_195, n8_195, n7_195],[n9_196, n8_196, n7_196],[n9_197, n8_197, n7_197],[n9_198, n8_198, n7_198],[n9_199, n8_199, n7_199],[n9_200, n8_200, n7_200],[n9_201, n8_201, n7_201],[n9_202, n8_202, n7_202],[n9_203, n8_203, n7_203],[n9_204, n8_204, n7_204],[n9_205, n8_205, n7_205],[n9_206, n8_206, n7_206],[n9_207, n8_207, n7_207],[n9_208, n8_208, n7_208],[n9_209, n8_209, n7_209],[n9_210, n8_210, n7_210],[n9_211, n8_211, n7_211],[n9_212, n8_212, n7_212],[n9_213, n8_213, n7_213],[n9_214, n8_214, n7_214],[n9_215, n8_215, n7_215],[n9_216, n8_216, n7_216],[n9_217, n8_217, n7_217],[n9_218, n8_218, n7_218],[n9_219, n8_219, n7_219],[n9_220, n8_220, n7_220],[n9_221, n8_221, n7_221],[n9_222, n8_222, n7_222],[n9_223, n8_223, n7_223],[n9_224, n8_224, n7_224],[n9_225, n8_225, n7_225],[n9_226, n8_226, n7_226],[n9_227, n8_227, n7_227],[n9_228, n8_228, n7_228],[n9_229, n8_229, n7_229],[n9_230, n8_230, n7_230],[n9_231, n8_231, n7_231],[n9_232, n8_232, n7_232],[n9_233, n8_233, n7_233],[n9_234, n8_234, n7_234],[n9_235, n8_235, n7_235],[n9_236, n8_236, n7_236],[n9_237, n8_237, n7_237],[n9_238, n8_238, n7_238],[n9_239, n8_239, n7_239],[n9_240, n8_240, n7_240],[n9_241, n8_241, n7_241],[n9_242, n8_242, n7_242],[n9_243, n8_243, n7_243],[n9_244, n8_244, n7_244],[n9_245, n8_245, n7_245],[n9_246, n8_246, n7_246],[n9_247, n8_247, n7_247],[n9_248, n8_248, n7_248],[n9_249, n8_249, n7_249],[n9_250, n8_250, n7_250],[n9_251, n8_251, n7_251],[n9_252, n8_252, n7_252],[n9_253, n8_253, n7_253],[n9_254, n8_254, n7_254],[n9_255, n8_255, n7_255],[n9_256, n8_256, n7_256],[n9_257, n8_257, n7_257],[n9_258, n8_258, n7_258],[n9_259, n8_259, n7_259],[n9_260, n8_260, n7_260],[n9_261, n8_261, n7_261],[n9_262, n8_262, n7_262],[n9_263, n8_263, n7_263],[n9_264, n8_264, n7_264],[n9_265, n8_265, n7_265],[n9_266, n8_266, n7_266],[n9_267, n8_267, n7_267],[n9_268, n8_268, n7_268],[n9_269, n8_269, n7_269],[n9_270, n8_270, n7_270],[n9_271, n8_271, n7_271],[n9_272, n8_272, n7_272],[n9_273, n8_273, n7_273],[n9_274, n8_274, n7_274],[n9_275, n8_275, n7_275],[n9_276, n8_276, n7_276],[n9_277, n8_277, n7_277],[n9_278, n8_278, n7_278],[n9_279, n8_279, n7_279],[n9_280, n8_280, n7_280],[n9_281, n8_281, n7_281],[n9_282, n8_282, n7_282],[n9_283, n8_283, n7_283],[n9_284, n8_284, n7_284],[n9_285, n8_285, n7_285],[n9_286, n8_286, n7_286],[n9_287, n8_287, n7_287],[n9_288, n8_288, n7_288],[n9_289, n8_289, n7_289],[n9_290, n8_290, n7_290],[n9_291, n8_291, n7_291],[n9_292, n8_292, n7_292],[n9_293, n8_293, n7_293],[n9_294, n8_294, n7_294],[n9_295, n8_295, n7_295],[n9_296, n8_296, n7_296],[n9_297, n8_297, n7_297],[n9_298, n8_298, n7_298],[n9_299, n8_299, n7_299],[n9_300, n8_300, n7_300],[n9_301, n8_301, n7_301],[n9_302, n8_302, n7_302],[n9_303, n8_303, n7_303],[n9_304, n8_304, n7_304],[n9_305, n8_305, n7_305],[n9_306, n8_306, n7_306],[n9_307, n8_307, n7_307],[n9_308, n8_308, n7_308],[n9_309, n8_309, n7_309],[n9_310, n8_310, n7_310],[n9_311, n8_311, n7_311],[n9_312, n8_312, n7_312],[n9_313, n8_313, n7_313],[n9_314, n8_314, n7_314],[n9_315, n8_315, n7_315],[n9_316, n8_316, n7_316],[n9_317, n8_317, n7_317],[n9_318, n8_318, n7_318],[n9_319, n8_319, n7_319],[n9_320, n8_320, n7_320],[n9_321, n8_321, n7_321],[n9_322, n8_322, n7_322],[n9_323, n8_323, n7_323],[n9_324, n8_324, n7_324],[n9_325, n8_325, n7_325],[n9_326, n8_326, n7_326],[n9_327, n8_327, n7_327],[n9_328, n8_328, n7_328],[n9_329, n8_329, n7_329],[n9_330, n8_330, n7_330],[n9_331, n8_331, n7_331],[n9_332, n8_332, n7_332],[n9_333, n8_333, n7_333],[n9_334, n8_334, n7_334],[n9_335, n8_335, n7_335],[n9_336, n8_336, n7_336],[n9_337, n8_337, n7_337],[n9_338, n8_338, n7_338],[n9_339, n8_339, n7_339],[n9_340, n8_340, n7_340],[n9_341, n8_341, n7_341],[n9_342, n8_342, n7_342],[n9_343, n8_343, n7_343],[n9_344, n8_344, n7_344],[n9_345, n8_345, n7_345],[n9_346, n8_346, n7_346],[n9_347, n8_347, n7_347],[n9_348, n8_348, n7_348],[n9_349, n8_349, n7_349],[n9_350, n8_350, n7_350],[n9_351, n8_351, n7_351],[n9_352, n8_352, n7_352],[n9_353, n8_353, n7_353],[n9_354, n8_354, n7_354],[n9_355, n8_355, n7_355],[n9_356, n8_356, n7_356],[n9_357, n8_357, n7_357],[n9_358, n8_358, n7_358],[n9_359, n8_359, n7_359],[n9_360, n8_360, n7_360],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-05 13:28:32] [INFO ] Flatten gal took : 214 ms
[2025-06-05 13:28:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality4345749945398216687.gal : 19 ms
[2025-06-05 13:28:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality2635393335418408028.ltl : 11 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/LTLCardinality4345749945398216687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2635393335418408028.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...297
Read 5 LTL properties
Checking formula 0 : !((G(((F(G("((((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+(((s5_8+s5_9)+(s5_10+s5_11))+((s5_12+s5_13)+(s5_14+s5_15))))+((s5...645
Formula 0 simplified : F((GF!"((((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+(((s5_8+s5_9)+(s5_10+s5_11))+((s5_12+s5_13)+(s5_14+s5_15))))+((s5_16...635

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254600747"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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