Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.9K 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 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m010-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749072766699

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 21:32:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 21:32:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:32:48] [INFO ] Load time of PNML (sax parser for PT used): 607 ms
[2025-06-04 21:32:48] [INFO ] Transformed 6690 places.
[2025-06-04 21:32:48] [INFO ] Transformed 11934 transitions.
[2025-06-04 21:32:48] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 784 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 25 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1087 places :
Symmetric choice reduction at 1 with 1087 rule applications. Total rules 1206 place count 1281 transition count 7068
Iterating global reduction 1 with 1087 rules applied. Total rules applied 2293 place count 1281 transition count 7068
Ensure Unique test removed 279 transitions
Reduce isomorphic transitions removed 279 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 2572 place count 1281 transition count 6789
Discarding 922 places :
Symmetric choice reduction at 2 with 922 rule applications. Total rules 3494 place count 359 transition count 5867
Iterating global reduction 2 with 922 rules applied. Total rules applied 4416 place count 359 transition count 5867
Ensure Unique test removed 4695 transitions
Reduce isomorphic transitions removed 4695 transitions.
Iterating post reduction 2 with 4695 rules applied. Total rules applied 9111 place count 359 transition count 1172
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 9173 place count 297 transition count 1110
Iterating global reduction 3 with 62 rules applied. Total rules applied 9235 place count 297 transition count 1110
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Iterating post reduction 3 with 166 rules applied. Total rules applied 9401 place count 297 transition count 944
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9409 place count 289 transition count 936
Iterating global reduction 4 with 8 rules applied. Total rules applied 9417 place count 289 transition count 936
Applied a total of 9417 rules in 353 ms. Remains 289 /2385 variables (removed 2096) and now considering 936/11934 (removed 10998) transitions.
// Phase 1: matrix 936 rows 289 cols
[2025-06-04 21:32:49] [INFO ] Computed 3 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:49] [INFO ] Implicit Places using invariants in 493 ms returned []
[2025-06-04 21:32:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:50] [INFO ] State equation strengthened by 676 read => feed constraints.
[2025-06-04 21:32:52] [INFO ] Implicit Places using invariants and state equation in 2241 ms returned []
Implicit Place search using SMT with State Equation took 2778 ms to find 0 implicit places.
Running 935 sub problems to find dead transitions.
[2025-06-04 21:32:52] [INFO ] Invariant cache hit.
[2025-06-04 21:32:52] [INFO ] State equation strengthened by 676 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 935 unsolved
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
At refinement iteration 4 (OVERLAPS) 936/1225 variables, 289/292 constraints. Problems are: Problem set: 24 solved, 911 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1225 variables, 676/968 constraints. Problems are: Problem set: 24 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1225/1225 variables, and 968 constraints, problems are : Problem set: 24 solved, 911 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 289/289 constraints, ReadFeed: 676/676 constraints, PredecessorRefiner: 935/935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 911 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 911 unsolved
At refinement iteration 1 (OVERLAPS) 17/281 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 911 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 911 unsolved
At refinement iteration 3 (OVERLAPS) 8/289 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 911 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 911 unsolved
At refinement iteration 5 (OVERLAPS) 936/1225 variables, 289/292 constraints. Problems are: Problem set: 24 solved, 911 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1225 variables, 676/968 constraints. Problems are: Problem set: 24 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1225/1225 variables, and 1879 constraints, problems are : Problem set: 24 solved, 911 unsolved in 30725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 289/289 constraints, ReadFeed: 676/676 constraints, PredecessorRefiner: 911/935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62480ms problems are : Problem set: 24 solved, 911 unsolved
Search for dead transitions found 24 dead transitions in 62497ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 289/2385 places, 912/11934 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 265 transition count 900
Applied a total of 36 rules in 8 ms. Remains 265 /289 variables (removed 24) and now considering 900/912 (removed 12) transitions.
// Phase 1: matrix 900 rows 265 cols
[2025-06-04 21:33:54] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:54] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-04 21:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:54] [INFO ] State equation strengthened by 672 read => feed constraints.
[2025-06-04 21:33:56] [INFO ] Implicit Places using invariants and state equation in 1975 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/2385 places, 900/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67787 ms. Remains : 265/2385 places, 900/11934 transitions.
Support contains 24 out of 265 places after structural reductions.
[2025-06-04 21:33:56] [INFO ] Flatten gal took : 86 ms
[2025-06-04 21:33:57] [INFO ] Flatten gal took : 51 ms
[2025-06-04 21:33:57] [INFO ] Input system was already deterministic with 900 transitions.
Support contains 23 out of 265 places (down from 24) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (6933 resets) in 2245 ms. (17 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40004 steps (938 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2025-06-04 21:33:57] [INFO ] Invariant cache hit.
[2025-06-04 21:33:57] [INFO ] State equation strengthened by 672 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 253/327 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 835/1162 variables, 188/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1162 variables, 647/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:58] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1162 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1165 variables, 3/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1165 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1165 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 940 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 265/265 constraints, ReadFeed: 672/672 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 253/327 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 835/1162 variables, 188/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1162 variables, 647/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1162 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1162 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1165 variables, 3/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1165 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1165 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 265/265 constraints, ReadFeed: 672/672 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2085ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 900/900 transitions.
Graph (complete) has 1359 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 264 transition count 891
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 30 place count 244 transition count 389
Iterating global reduction 1 with 20 rules applied. Total rules applied 50 place count 244 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 244 transition count 388
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 70 place count 225 transition count 369
Iterating global reduction 2 with 19 rules applied. Total rules applied 89 place count 225 transition count 369
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 225 transition count 367
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 159 place count 157 transition count 299
Iterating global reduction 3 with 68 rules applied. Total rules applied 227 place count 157 transition count 299
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 295 place count 157 transition count 231
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 298 place count 154 transition count 192
Iterating global reduction 4 with 3 rules applied. Total rules applied 301 place count 154 transition count 192
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 303 place count 152 transition count 190
Iterating global reduction 4 with 2 rules applied. Total rules applied 305 place count 152 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 306 place count 152 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 310 place count 148 transition count 185
Iterating global reduction 5 with 4 rules applied. Total rules applied 314 place count 148 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 318 place count 148 transition count 181
Applied a total of 318 rules in 55 ms. Remains 148 /265 variables (removed 117) and now considering 181/900 (removed 719) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 148/265 places, 181/900 transitions.
RANDOM walk for 40000 steps (8532 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1525 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 265801 steps, run visited all 1 properties in 531 ms. (steps per millisecond=500 )
Probabilistic random walk after 265801 steps, saw 118778 distinct states, run finished after 534 ms. (steps per millisecond=497 ) properties seen :1
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 64 stabilizing places and 406 stable transitions
Graph (complete) has 1432 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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(X(p0)))&&F(p1)&&F(!p1))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 427
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 427
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 227 transition count 408
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 227 transition count 408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 227 transition count 406
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 142 place count 163 transition count 342
Iterating global reduction 1 with 64 rules applied. Total rules applied 206 place count 163 transition count 342
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 282 place count 163 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 283 place count 162 transition count 253
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 162 transition count 253
Applied a total of 284 rules in 13 ms. Remains 162 /265 variables (removed 103) and now considering 253/900 (removed 647) transitions.
// Phase 1: matrix 253 rows 162 cols
[2025-06-04 21:34:01] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:01] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-04 21:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:01] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-06-04 21:34:01] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-04 21:34:01] [INFO ] Invariant cache hit.
[2025-06-04 21:34:01] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/415 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 110/274 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/415 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 274 constraints, problems are : Problem set: 0 solved, 252 unsolved in 18041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/415 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 110/274 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 252/526 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:39] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:40] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:40] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 6 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/415 variables, and 529 constraints, problems are : Problem set: 17 solved, 235 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48206ms problems are : Problem set: 17 solved, 235 unsolved
Search for dead transitions found 17 dead transitions in 48207ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/265 places, 236/900 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 149 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 147 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 147 transition count 231
Applied a total of 20 rules in 3 ms. Remains 147 /162 variables (removed 15) and now considering 231/236 (removed 5) transitions.
// Phase 1: matrix 231 rows 147 cols
[2025-06-04 21:34:50] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:50] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 21:34:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:50] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-04 21:34:50] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/265 places, 231/900 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49641 ms. Remains : 147/265 places, 231/900 transitions.
Stuttering acceptance computed with spot in 465 ms :[true, true, (NOT p0), (NOT p1), p1, (NOT p0), (NOT p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-01 finished in 50182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U X((G(p1) U (p2||F(p3))))))))'
Support contains 5 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 248 transition count 515
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 248 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 248 transition count 514
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 51 place count 232 transition count 498
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 232 transition count 498
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 232 transition count 494
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 123 place count 180 transition count 442
Iterating global reduction 2 with 52 rules applied. Total rules applied 175 place count 180 transition count 442
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 283 place count 180 transition count 334
Applied a total of 283 rules in 15 ms. Remains 180 /265 variables (removed 85) and now considering 334/900 (removed 566) transitions.
// Phase 1: matrix 334 rows 180 cols
[2025-06-04 21:34:51] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 21:34:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:34:51] [INFO ] State equation strengthened by 177 read => feed constraints.
[2025-06-04 21:34:52] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2025-06-04 21:34:52] [INFO ] Invariant cache hit.
[2025-06-04 21:34:52] [INFO ] State equation strengthened by 177 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/514 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 177/359 constraints. Problems are: Problem set: 0 solved, 333 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 359 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/514 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 177/359 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 333/692 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 692 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 180/265 places, 334/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61382 ms. Remains : 180/265 places, 334/900 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-02 finished in 61749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 245 transition count 398
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 245 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 245 transition count 397
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 226 transition count 378
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 226 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 226 transition count 377
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 148 place count 158 transition count 309
Iterating global reduction 2 with 68 rules applied. Total rules applied 216 place count 158 transition count 309
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 284 place count 158 transition count 241
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 286 place count 156 transition count 215
Iterating global reduction 3 with 2 rules applied. Total rules applied 288 place count 156 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 289 place count 155 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 155 transition count 214
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 294 place count 151 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 298 place count 151 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 306 place count 151 transition count 202
Applied a total of 306 rules in 45 ms. Remains 151 /265 variables (removed 114) and now considering 202/900 (removed 698) transitions.
// Phase 1: matrix 202 rows 151 cols
[2025-06-04 21:35:53] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:35:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 21:35:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:35:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-04 21:35:53] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:35:53] [INFO ] Redundant transitions in 10 ms returned []
Running 201 sub problems to find dead transitions.
[2025-06-04 21:35:53] [INFO ] Invariant cache hit.
[2025-06-04 21:35:53] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/353 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 68/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:35:58] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:35:59] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:35:59] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 3 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:36:00] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 4 ms to minimize.
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:36:00] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 4 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 5/226 constraints. Problems are: Problem set: 22 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:36:08] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 1/227 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/227 constraints. Problems are: Problem set: 22 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/353 variables, and 227 constraints, problems are : Problem set: 22 solved, 179 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 3 (OVERLAPS) 8/141 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 202/343 variables, 141/143 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 68/211 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 39/250 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/250 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 10/353 variables, 10/260 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 140/400 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 6/406 constraints. Problems are: Problem set: 22 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:36:51] [INFO ] Deduced a trap along path composed of 9 places in 45 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 1/407 constraints. Problems are: Problem set: 22 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 407 constraints, problems are : Problem set: 22 solved, 179 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 179/201 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60137ms problems are : Problem set: 22 solved, 179 unsolved
Search for dead transitions found 22 dead transitions in 60138ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 151/265 places, 180/900 transitions.
Graph (complete) has 472 edges and 151 vertex of which 133 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 133 transition count 174
Applied a total of 7 rules in 9 ms. Remains 133 /151 variables (removed 18) and now considering 174/180 (removed 6) transitions.
// Phase 1: matrix 174 rows 133 cols
[2025-06-04 21:36:53] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:53] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 21:36:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:54] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-04 21:36:54] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 133/265 places, 174/900 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61459 ms. Remains : 133/265 places, 174/900 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-03 finished in 61575 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 U p1))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 245 transition count 426
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 245 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 245 transition count 425
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 226 transition count 406
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 226 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 226 transition count 404
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 145 place count 162 transition count 340
Iterating global reduction 2 with 64 rules applied. Total rules applied 209 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 289 place count 162 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 290 place count 161 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 161 transition count 247
Applied a total of 291 rules in 34 ms. Remains 161 /265 variables (removed 104) and now considering 247/900 (removed 653) transitions.
// Phase 1: matrix 247 rows 161 cols
[2025-06-04 21:36:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:54] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 21:36:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:54] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-04 21:36:56] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:36:56] [INFO ] Redundant transitions in 15 ms returned []
Running 246 sub problems to find dead transitions.
[2025-06-04 21:36:56] [INFO ] Invariant cache hit.
[2025-06-04 21:36:56] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/408 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 268 constraints, problems are : Problem set: 0 solved, 246 unsolved in 17617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/408 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 246/514 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:39] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:40] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:40] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:41] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 4 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 518 constraints, problems are : Problem set: 12 solved, 234 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47791ms problems are : Problem set: 12 solved, 234 unsolved
Search for dead transitions found 12 dead transitions in 47793ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/265 places, 235/900 transitions.
Graph (complete) has 565 edges and 161 vertex of which 153 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 149 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 149 transition count 231
Applied a total of 9 rules in 23 ms. Remains 149 /161 variables (removed 12) and now considering 231/235 (removed 4) transitions.
// Phase 1: matrix 231 rows 149 cols
[2025-06-04 21:37:43] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:44] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-04 21:37:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:44] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-04 21:37:44] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/265 places, 231/900 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50049 ms. Remains : 149/265 places, 231/900 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-04 finished in 50163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 245 transition count 426
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 245 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 245 transition count 425
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 226 transition count 406
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 226 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 226 transition count 404
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 145 place count 162 transition count 340
Iterating global reduction 2 with 64 rules applied. Total rules applied 209 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 289 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 291 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 293 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 294 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 299 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 303 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 315 place count 155 transition count 217
Applied a total of 315 rules in 34 ms. Remains 155 /265 variables (removed 110) and now considering 217/900 (removed 683) transitions.
// Phase 1: matrix 217 rows 155 cols
[2025-06-04 21:37:44] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:44] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 21:37:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:44] [INFO ] State equation strengthened by 80 read => feed constraints.
[2025-06-04 21:37:45] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:37:45] [INFO ] Redundant transitions in 3 ms returned []
Running 216 sub problems to find dead transitions.
[2025-06-04 21:37:45] [INFO ] Invariant cache hit.
[2025-06-04 21:37:45] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:52] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:52] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 239 constraints, problems are : Problem set: 0 solved, 216 unsolved in 17220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/372 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 80/239 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 216/455 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:15] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:16] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 3 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:21] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 4 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:21] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 4 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 4/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47358ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 47359ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/265 places, 195/900 transitions.
Graph (complete) has 494 edges and 155 vertex of which 137 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 137 transition count 189
Applied a total of 7 rules in 7 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2025-06-04 21:38:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:38:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 21:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:38:33] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:38:33] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 137/265 places, 189/900 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48890 ms. Remains : 137/265 places, 189/900 transitions.
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-06
Product exploration explored 100000 steps with 18618 reset in 259 ms.
Product exploration explored 100000 steps with 18627 reset in 251 ms.
Computed a total of 12 stabilizing places and 51 stable transitions
Graph (complete) has 474 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 78 ms :[p0, p0]
RANDOM walk for 1204 steps (211 resets) in 11 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 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 :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 189/189 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-06-04 21:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:38:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 21:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:38:34] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:38:35] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:38:35] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2025-06-04 21:38:35] [INFO ] Invariant cache hit.
[2025-06-04 21:38:35] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 215 constraints, problems are : Problem set: 0 solved, 188 unsolved in 10534 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 188/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:00] [INFO ] Deduced a trap along path composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:00] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 405 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40638ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 40639ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41345 ms. Remains : 137/137 places, 189/189 transitions.
Computed a total of 12 stabilizing places and 51 stable transitions
Graph (complete) has 474 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 12 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 85 ms :[p0, p0]
RANDOM walk for 1249 steps (236 resets) in 10 ms. (113 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 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 77 ms :[p0, p0]
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Product exploration explored 100000 steps with 18506 reset in 180 ms.
Product exploration explored 100000 steps with 18699 reset in 184 ms.
Built C files in :
/tmp/ltsmin6247826006221545385
[2025-06-04 21:39:16] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2025-06-04 21:39:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:39:16] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2025-06-04 21:39:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:39:17] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2025-06-04 21:39:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:39:17] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6247826006221545385
Running compilation step : cd /tmp/ltsmin6247826006221545385;'/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 502 ms.
Running link step : cd /tmp/ltsmin6247826006221545385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6247826006221545385;'/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/stateBased14729062516615932903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 189/189 transitions.
Applied a total of 0 rules in 12 ms. Remains 137 /137 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-06-04 21:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:39:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-04 21:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:39:32] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:39:32] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:39:32] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2025-06-04 21:39:32] [INFO ] Invariant cache hit.
[2025-06-04 21:39:32] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 215 constraints, problems are : Problem set: 0 solved, 188 unsolved in 10587 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 188/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:57] [INFO ] Deduced a trap along path composed of 10 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:57] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 405 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40690ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 40691ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41422 ms. Remains : 137/137 places, 189/189 transitions.
Built C files in :
/tmp/ltsmin1784195414514662598
[2025-06-04 21:40:13] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2025-06-04 21:40:13] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:40:13] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2025-06-04 21:40:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:40:13] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2025-06-04 21:40:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:40:13] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1784195414514662598
Running compilation step : cd /tmp/ltsmin1784195414514662598;'/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 389 ms.
Running link step : cd /tmp/ltsmin1784195414514662598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1784195414514662598;'/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/stateBased3153025575867752350.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 21:40:28] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:40:28] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:40:28] [INFO ] Time to serialize gal into /tmp/LTL5235262844755814645.gal : 3 ms
[2025-06-04 21:40:28] [INFO ] Time to serialize properties into /tmp/LTL8790958342779386394.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/LTL5235262844755814645.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8686134595791840555.hoa' '-atoms' '/tmp/LTL8790958342779386394.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8790958342779386394.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8686134595791840555.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t31, t32, t33, t34, t35, t36, t37, t38, t39, t68, t69, t70, t71, t72, t156, t159, t162, t...632
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
[2025-06-04 21:40:43] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:40:43] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:40:43] [INFO ] Time to serialize gal into /tmp/LTL4347591999174985317.gal : 7 ms
[2025-06-04 21:40:43] [INFO ] Time to serialize properties into /tmp/LTL676703803241245298.ltl : 9 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/LTL4347591999174985317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL676703803241245298.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 : !((G(F("((s1<1)||(l3908<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l3908<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t31, t32, t33, t34, t35, t36, t37, t38, t39, t68, t69, t70, t71, t72, t156, t159, t162, t...632
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
[2025-06-04 21:40:58] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:40:58] [INFO ] Applying decomposition
[2025-06-04 21:40:58] [INFO ] Flatten gal took : 8 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/graph91335474987106529.txt' '-o' '/tmp/graph91335474987106529.bin' '-w' '/tmp/graph91335474987106529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph91335474987106529.bin' '-l' '-1' '-v' '-w' '/tmp/graph91335474987106529.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:40:59] [INFO ] Decomposing Gal with order
[2025-06-04 21:40:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:40:59] [INFO ] Removed a total of 211 redundant transitions.
[2025-06-04 21:40:59] [INFO ] Flatten gal took : 58 ms
[2025-06-04 21:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 10 ms.
[2025-06-04 21:40:59] [INFO ] Time to serialize gal into /tmp/LTL12128815218945971346.gal : 4 ms
[2025-06-04 21:40:59] [INFO ] Time to serialize properties into /tmp/LTL16551661626818079710.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/LTL12128815218945971346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16551661626818079710.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u1.s1<1)||(i1.u5.l3908<1))"))))
Formula 0 simplified : FG!"((i2.u1.s1<1)||(i1.u5.l3908<1))"
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t36, t37, t165, t181, t186, t193, t233, t234, t235, t774, t776, t778, t815, t816, t...569
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-06 finished in 209507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (p1||F((G(F(p2))||G(p1)))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 247 transition count 484
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 247 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 247 transition count 483
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 230 transition count 466
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 230 transition count 466
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 230 transition count 464
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 129 place count 174 transition count 408
Iterating global reduction 2 with 56 rules applied. Total rules applied 185 place count 174 transition count 408
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 289 place count 174 transition count 304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 290 place count 173 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 173 transition count 291
Applied a total of 291 rules in 15 ms. Remains 173 /265 variables (removed 92) and now considering 291/900 (removed 609) transitions.
// Phase 1: matrix 291 rows 173 cols
[2025-06-04 21:41:14] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:41:14] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-04 21:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:41:14] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-06-04 21:41:15] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2025-06-04 21:41:15] [INFO ] Invariant cache hit.
[2025-06-04 21:41:15] [INFO ] State equation strengthened by 139 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/464 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 139/314 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:29] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 5 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:29] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 5 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:29] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 5 ms to minimize.
Problem TDEAD254 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:29] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:29] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:30] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 4 ms to minimize.
Problem TDEAD259 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:30] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 4 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:30] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:30] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 3 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 9/323 constraints. Problems are: Problem set: 16 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/323 constraints. Problems are: Problem set: 16 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:39] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 3 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/464 variables, 1/324 constraints. Problems are: Problem set: 22 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 324 constraints, problems are : Problem set: 22 solved, 268 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 8/163 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/4 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/4 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 291/454 variables, 163/167 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 139/306 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 39/345 constraints. Problems are: Problem set: 22 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/346 constraints. Problems are: Problem set: 22 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/346 constraints. Problems are: Problem set: 22 solved, 268 unsolved
SMT process timed out in 60212ms, After SMT, problems are : Problem set: 22 solved, 268 unsolved
Search for dead transitions found 22 dead transitions in 60215ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/265 places, 269/900 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 263
Applied a total of 24 rules in 5 ms. Remains 155 /173 variables (removed 18) and now considering 263/269 (removed 6) transitions.
// Phase 1: matrix 263 rows 155 cols
[2025-06-04 21:42:15] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:42:16] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-04 21:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:42:16] [INFO ] State equation strengthened by 135 read => feed constraints.
[2025-06-04 21:42:17] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/265 places, 263/900 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62984 ms. Remains : 155/265 places, 263/900 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-07
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-07 finished in 63300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||X(X(p1)))) U (p2 U (F(G(p1))&&p3))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 247 transition count 456
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 247 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 247 transition count 455
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 230 transition count 438
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 230 transition count 438
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 230 transition count 436
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 133 place count 170 transition count 376
Iterating global reduction 2 with 60 rules applied. Total rules applied 193 place count 170 transition count 376
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 277 place count 170 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 169 transition count 279
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 169 transition count 279
Applied a total of 279 rules in 14 ms. Remains 169 /265 variables (removed 96) and now considering 279/900 (removed 621) transitions.
// Phase 1: matrix 279 rows 169 cols
[2025-06-04 21:42:17] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:42:17] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-04 21:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:42:17] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 21:42:18] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2025-06-04 21:42:18] [INFO ] Invariant cache hit.
[2025-06-04 21:42:18] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/448 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 131/302 constraints. Problems are: Problem set: 0 solved, 278 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/448 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 302 constraints, problems are : Problem set: 0 solved, 278 unsolved in 23035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/448 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 131/302 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 278/580 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:43:08] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:43:09] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:43:10] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 4 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 583 constraints, problems are : Problem set: 12 solved, 266 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53248ms problems are : Problem set: 12 solved, 266 unsolved
Search for dead transitions found 12 dead transitions in 53249ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 169/265 places, 267/900 transitions.
Reduce places removed 9 places and 1 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 160 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 159 transition count 265
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 155 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 155 transition count 261
Applied a total of 18 rules in 4 ms. Remains 155 /169 variables (removed 14) and now considering 261/267 (removed 6) transitions.
// Phase 1: matrix 261 rows 155 cols
[2025-06-04 21:43:11] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:11] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 21:43:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:12] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-04 21:43:13] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/265 places, 261/900 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56359 ms. Remains : 155/265 places, 261/900 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-08
Stuttering criterion allowed to conclude after 11 steps with 2 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-08 finished in 56687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0)))||G(p1)))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 456
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 246 transition count 455
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 228 transition count 437
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 228 transition count 437
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 228 transition count 434
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 138 place count 168 transition count 374
Iterating global reduction 2 with 60 rules applied. Total rules applied 198 place count 168 transition count 374
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 282 place count 168 transition count 290
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 283 place count 167 transition count 277
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 167 transition count 277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 166 transition count 276
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 166 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 166 transition count 275
Applied a total of 287 rules in 16 ms. Remains 166 /265 variables (removed 99) and now considering 275/900 (removed 625) transitions.
// Phase 1: matrix 275 rows 166 cols
[2025-06-04 21:43:14] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 21:43:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:14] [INFO ] State equation strengthened by 129 read => feed constraints.
[2025-06-04 21:43:15] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-04 21:43:15] [INFO ] Invariant cache hit.
[2025-06-04 21:43:15] [INFO ] State equation strengthened by 129 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/441 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 129/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/441 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 297 constraints, problems are : Problem set: 0 solved, 274 unsolved in 25243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/441 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 129/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 274/571 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:02] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 4 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:03] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 3 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:04] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 5 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 574 constraints, problems are : Problem set: 12 solved, 262 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55417ms problems are : Problem set: 12 solved, 262 unsolved
Search for dead transitions found 12 dead transitions in 55418ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 166/265 places, 263/900 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 158 transition count 263
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 154 transition count 259
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 154 transition count 259
Applied a total of 16 rules in 3 ms. Remains 154 /166 variables (removed 12) and now considering 259/263 (removed 4) transitions.
// Phase 1: matrix 259 rows 154 cols
[2025-06-04 21:44:10] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:44:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 21:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:44:10] [INFO ] State equation strengthened by 125 read => feed constraints.
[2025-06-04 21:44:11] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/265 places, 259/900 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57032 ms. Remains : 154/265 places, 259/900 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-09
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-09 finished in 57352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 244 transition count 397
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 244 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 244 transition count 396
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 63 place count 224 transition count 376
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 224 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 224 transition count 374
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 153 place count 156 transition count 306
Iterating global reduction 2 with 68 rules applied. Total rules applied 221 place count 156 transition count 306
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 289 place count 156 transition count 238
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 291 place count 154 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 293 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 294 place count 153 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 153 transition count 211
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 299 place count 149 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 303 place count 149 transition count 207
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 311 place count 149 transition count 199
Applied a total of 311 rules in 13 ms. Remains 149 /265 variables (removed 116) and now considering 199/900 (removed 701) transitions.
// Phase 1: matrix 199 rows 149 cols
[2025-06-04 21:44:11] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:44:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 21:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:44:11] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-04 21:44:12] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-04 21:44:12] [INFO ] Invariant cache hit.
[2025-06-04 21:44:12] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/348 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:18] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:18] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:18] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:22] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 4 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/348 variables, 1/222 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/222 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 0/348 variables, 0/222 constraints. Problems are: Problem set: 10 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 222 constraints, problems are : Problem set: 10 solved, 188 unsolved in 19588 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/3 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/4 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 199/344 variables, 145/149 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 67/216 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 45/261 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/261 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 11 (OVERLAPS) 4/348 variables, 4/265 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 143/408 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 2/410 constraints. Problems are: Problem set: 10 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:56] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:44:57] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 4 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:01] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 4 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 413 constraints, problems are : Problem set: 22 solved, 176 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 188/198 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49714ms problems are : Problem set: 22 solved, 176 unsolved
Search for dead transitions found 22 dead transitions in 49715ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 149/265 places, 177/900 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 131 transition count 171
Applied a total of 24 rules in 1 ms. Remains 131 /149 variables (removed 18) and now considering 171/177 (removed 6) transitions.
// Phase 1: matrix 171 rows 131 cols
[2025-06-04 21:45:02] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 21:45:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:02] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-04 21:45:02] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/265 places, 171/900 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51132 ms. Remains : 131/265 places, 171/900 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-10
Entered a terminal (fully accepting) state of product in 36 steps with 5 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-10 finished in 51289 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 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 245 transition count 427
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 245 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 245 transition count 426
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 226 transition count 407
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 226 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 226 transition count 404
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 146 place count 162 transition count 340
Iterating global reduction 2 with 64 rules applied. Total rules applied 210 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 290 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 292 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 294 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 295 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 159 transition count 232
Applied a total of 297 rules in 28 ms. Remains 159 /265 variables (removed 106) and now considering 232/900 (removed 668) transitions.
// Phase 1: matrix 232 rows 159 cols
[2025-06-04 21:45:02] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-04 21:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:03] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-04 21:45:04] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:45:04] [INFO ] Redundant transitions in 1 ms returned []
Running 231 sub problems to find dead transitions.
[2025-06-04 21:45:04] [INFO ] Invariant cache hit.
[2025-06-04 21:45:04] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 252 constraints, problems are : Problem set: 0 solved, 231 unsolved in 16113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 231/483 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:33] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:33] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:34] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 5 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:39] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 5 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:40] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:40] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 6/489 constraints. Problems are: Problem set: 22 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 489 constraints, problems are : Problem set: 22 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46264ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 46267ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/265 places, 210/900 transitions.
Graph (complete) has 517 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 204
Applied a total of 7 rules in 13 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2025-06-04 21:45:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:50] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-04 21:45:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:51] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-04 21:45:51] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/265 places, 204/900 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48521 ms. Remains : 141/265 places, 204/900 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-11 finished in 48568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 245 transition count 427
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 245 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 245 transition count 426
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 226 transition count 407
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 226 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 226 transition count 404
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 146 place count 162 transition count 340
Iterating global reduction 2 with 64 rules applied. Total rules applied 210 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 290 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 292 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 294 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 295 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 300 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 304 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 316 place count 155 transition count 217
Applied a total of 316 rules in 25 ms. Remains 155 /265 variables (removed 110) and now considering 217/900 (removed 683) transitions.
// Phase 1: matrix 217 rows 155 cols
[2025-06-04 21:45:51] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 21:45:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:51] [INFO ] State equation strengthened by 80 read => feed constraints.
[2025-06-04 21:45:53] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:45:53] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2025-06-04 21:45:53] [INFO ] Invariant cache hit.
[2025-06-04 21:45:53] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 13899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:20] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:20] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 4 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 5 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 4 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44044ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 44045ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/265 places, 195/900 transitions.
Graph (complete) has 494 edges and 155 vertex of which 137 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 137 transition count 189
Applied a total of 7 rules in 5 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2025-06-04 21:46:37] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 21:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:46:38] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 137/265 places, 189/900 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46710 ms. Remains : 137/265 places, 189/900 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-13
Product exploration explored 100000 steps with 18537 reset in 216 ms.
Product exploration explored 100000 steps with 18504 reset in 225 ms.
Computed a total of 12 stabilizing places and 51 stable transitions
Graph (complete) has 474 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 12 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 991 steps (174 resets) in 13 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 189/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-06-04 21:46:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 21:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:46:39] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:46:39] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2025-06-04 21:46:39] [INFO ] Invariant cache hit.
[2025-06-04 21:46:39] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 215 constraints, problems are : Problem set: 0 solved, 188 unsolved in 11532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 188/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:04] [INFO ] Deduced a trap along path composed of 9 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 404 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41651ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 41653ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42447 ms. Remains : 137/137 places, 189/189 transitions.
Computed a total of 12 stabilizing places and 51 stable transitions
Graph (complete) has 474 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 231 steps (40 resets) in 5 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 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)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18521 reset in 197 ms.
Product exploration explored 100000 steps with 18482 reset in 212 ms.
Built C files in :
/tmp/ltsmin10913287363287392023
[2025-06-04 21:47:22] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2025-06-04 21:47:22] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:47:22] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2025-06-04 21:47:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:47:22] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2025-06-04 21:47:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:47:22] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10913287363287392023
Running compilation step : cd /tmp/ltsmin10913287363287392023;'/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 401 ms.
Running link step : cd /tmp/ltsmin10913287363287392023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10913287363287392023;'/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/stateBased5432332333405459131.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 189/189 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-06-04 21:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:47:37] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 21:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:47:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:47:38] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:47:38] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2025-06-04 21:47:38] [INFO ] Invariant cache hit.
[2025-06-04 21:47:38] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 215 constraints, problems are : Problem set: 0 solved, 188 unsolved in 11244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/326 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 76/215 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 188/403 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:02] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 404 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41356ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 41356ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42124 ms. Remains : 137/137 places, 189/189 transitions.
Built C files in :
/tmp/ltsmin5962724210459637410
[2025-06-04 21:48:19] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2025-06-04 21:48:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:48:19] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2025-06-04 21:48:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:48:19] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2025-06-04 21:48:19] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:48:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5962724210459637410
Running compilation step : cd /tmp/ltsmin5962724210459637410;'/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 400 ms.
Running link step : cd /tmp/ltsmin5962724210459637410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5962724210459637410;'/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/stateBased13393504541533134978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 21:48:34] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:48:34] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:48:34] [INFO ] Time to serialize gal into /tmp/LTL3699013600019933070.gal : 1 ms
[2025-06-04 21:48:34] [INFO ] Time to serialize properties into /tmp/LTL14860290425984561447.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/LTL3699013600019933070.gal' '-t' 'CGAL' '-hoa' '/tmp/aut324491382924305340.hoa' '-atoms' '/tmp/LTL14860290425984561447.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL14860290425984561447.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut324491382924305340.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t35, t36, t37, t38, t39, t64, t65, t66, t67, t68, t69, t70, t71, t72, t156, t159, t162, t...632
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
[2025-06-04 21:48:49] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:48:49] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:48:49] [INFO ] Time to serialize gal into /tmp/LTL7897797290307007362.gal : 1 ms
[2025-06-04 21:48:49] [INFO ] Time to serialize properties into /tmp/LTL18159352121775288044.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/LTL7897797290307007362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18159352121775288044.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("((s1<1)||(l3915<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l3915<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t35, t36, t37, t38, t39, t64, t65, t66, t67, t68, t69, t70, t71, t72, t156, t159, t162, t...632
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
[2025-06-04 21:49:04] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:49:04] [INFO ] Applying decomposition
[2025-06-04 21:49:04] [INFO ] Flatten gal took : 8 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/graph8930106349524312380.txt' '-o' '/tmp/graph8930106349524312380.bin' '-w' '/tmp/graph8930106349524312380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8930106349524312380.bin' '-l' '-1' '-v' '-w' '/tmp/graph8930106349524312380.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:49:04] [INFO ] Decomposing Gal with order
[2025-06-04 21:49:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:49:04] [INFO ] Removed a total of 178 redundant transitions.
[2025-06-04 21:49:04] [INFO ] Flatten gal took : 37 ms
[2025-06-04 21:49:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 5 ms.
[2025-06-04 21:49:04] [INFO ] Time to serialize gal into /tmp/LTL13618640833512131722.gal : 10 ms
[2025-06-04 21:49:04] [INFO ] Time to serialize properties into /tmp/LTL9057776049135278527.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/LTL13618640833512131722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9057776049135278527.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.u4.s1<1)||(u0.l3915<1))"))))
Formula 0 simplified : GF!"((i4.u4.s1<1)||(u0.l3915<1))"
Reverse transition relation is NOT exact ! Due to transitions t67, t197, t815, t816, t817, t818, t819, t820, t821, t823, t824, t825, t826, t827, t828, t829...536
Computing Next relation with stutter on 1.07119e+08 deadlock states
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-13 finished in 208486 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 U p1))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 428
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 246 transition count 427
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 228 transition count 409
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 228 transition count 409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 228 transition count 408
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 140 place count 164 transition count 344
Iterating global reduction 2 with 64 rules applied. Total rules applied 204 place count 164 transition count 344
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 284 place count 164 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 163 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 163 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 287 place count 162 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 162 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 289 place count 162 transition count 249
Applied a total of 289 rules in 33 ms. Remains 162 /265 variables (removed 103) and now considering 249/900 (removed 651) transitions.
// Phase 1: matrix 249 rows 162 cols
[2025-06-04 21:49:19] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 21:49:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:20] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-04 21:49:20] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:49:20] [INFO ] Redundant transitions in 3 ms returned []
Running 248 sub problems to find dead transitions.
[2025-06-04 21:49:20] [INFO ] Invariant cache hit.
[2025-06-04 21:49:20] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/411 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 106/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 270 constraints, problems are : Problem set: 0 solved, 248 unsolved in 19336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/411 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 106/270 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 248/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:49:56] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:49:56] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:06] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 5 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:06] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 4 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:07] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:07] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 6/524 constraints. Problems are: Problem set: 22 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 524 constraints, problems are : Problem set: 22 solved, 226 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49499ms problems are : Problem set: 22 solved, 226 unsolved
Search for dead transitions found 22 dead transitions in 49500ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/265 places, 227/900 transitions.
Graph (complete) has 538 edges and 162 vertex of which 144 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 144 transition count 221
Applied a total of 7 rules in 5 ms. Remains 144 /162 variables (removed 18) and now considering 221/227 (removed 6) transitions.
// Phase 1: matrix 221 rows 144 cols
[2025-06-04 21:50:10] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:10] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-04 21:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-04 21:50:11] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/265 places, 221/900 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51176 ms. Remains : 144/265 places, 221/900 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-14 finished in 51266 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((!p0&&G(p1))))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 900/900 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 455
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 246 transition count 454
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 228 transition count 436
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 228 transition count 436
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 228 transition count 434
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 137 place count 168 transition count 374
Iterating global reduction 2 with 60 rules applied. Total rules applied 197 place count 168 transition count 374
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 289 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 290 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 167 transition count 269
Applied a total of 291 rules in 18 ms. Remains 167 /265 variables (removed 98) and now considering 269/900 (removed 631) transitions.
// Phase 1: matrix 269 rows 167 cols
[2025-06-04 21:50:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 21:50:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:11] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-04 21:50:12] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-04 21:50:12] [INFO ] Invariant cache hit.
[2025-06-04 21:50:12] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 291 constraints, problems are : Problem set: 0 solved, 268 unsolved in 23778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 268/559 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:59] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 3 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:00] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:00] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 5 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 562 constraints, problems are : Problem set: 12 solved, 256 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53960ms problems are : Problem set: 12 solved, 256 unsolved
Search for dead transitions found 12 dead transitions in 53961ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/265 places, 257/900 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 159 transition count 257
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 155 transition count 253
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 155 transition count 253
Applied a total of 16 rules in 4 ms. Remains 155 /167 variables (removed 12) and now considering 253/257 (removed 4) transitions.
// Phase 1: matrix 253 rows 155 cols
[2025-06-04 21:51:06] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 21:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:06] [INFO ] State equation strengthened by 118 read => feed constraints.
[2025-06-04 21:51:07] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/265 places, 253/900 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56099 ms. Remains : 155/265 places, 253/900 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLFireability-15
Entered a terminal (fully accepting) state of product in 305 steps with 58 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLFireability-15 finished in 56277 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)))'
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)))'
[2025-06-04 21:51:07] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6168133809055179754
[2025-06-04 21:51:07] [INFO ] Computing symmetric may disable matrix : 900 transitions.
[2025-06-04 21:51:07] [INFO ] Applying decomposition
[2025-06-04 21:51:07] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:51:07] [INFO ] Computing symmetric may enable matrix : 900 transitions.
[2025-06-04 21:51:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:51:07] [INFO ] Flatten gal took : 42 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/graph16760465447614666665.txt' '-o' '/tmp/graph16760465447614666665.bin' '-w' '/tmp/graph16760465447614666665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16760465447614666665.bin' '-l' '-1' '-v' '-w' '/tmp/graph16760465447614666665.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:51:07] [INFO ] Decomposing Gal with order
[2025-06-04 21:51:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:51:08] [INFO ] Computing Do-Not-Accords matrix : 900 transitions.
[2025-06-04 21:51:08] [INFO ] Removed a total of 778 redundant transitions.
[2025-06-04 21:51:08] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:51:08] [INFO ] Flatten gal took : 188 ms
[2025-06-04 21:51:08] [INFO ] Built C files in 424ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6168133809055179754
Running compilation step : cd /tmp/ltsmin6168133809055179754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 21:51:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 554 labels/synchronizations in 42 ms.
[2025-06-04 21:51:08] [INFO ] Time to serialize gal into /tmp/LTLFireability5156233508963817594.gal : 5 ms
[2025-06-04 21:51:08] [INFO ] Time to serialize properties into /tmp/LTLFireability17274706927198919830.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/LTLFireability5156233508963817594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17274706927198919830.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(!("((u0.s1>=1)&&(u0.l3908>=1))")))))
Formula 0 simplified : FG"((u0.s1>=1)&&(u0.l3908>=1))"
Compilation finished in 3317 ms.
Running link step : cd /tmp/ltsmin6168133809055179754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin6168133809055179754;'/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' '[](<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t34, t35, t36, t37, t38, t39, t119, t156, t159, t162, t165, t194, t350, t351, t352, t353, t35...3576
Computing Next relation with stutter on 2.34415e+08 deadlock states
61 unique states visited
0 strongly connected components in search stack
68 transitions explored
54 items max in DFS search stack
25719 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,257.304,2220344,1,0,1.43657e+06,455498,1953,1.87086e+07,2253,4.24486e+06,666919
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("((u0.s1<1)||(u9.l3915<1))"))))
Formula 1 simplified : GF!"((u0.s1<1)||(u9.l3915<1))"
Computing Next relation with stutter on 2.34415e+08 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6168133809055179754;'/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' '[](<>(!(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6168133809055179754;'/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' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-04 22:17:14] [INFO ] Flatten gal took : 81 ms
[2025-06-04 22:17:14] [INFO ] Time to serialize gal into /tmp/LTLFireability787447693143148166.gal : 13 ms
[2025-06-04 22:17:14] [INFO ] Time to serialize properties into /tmp/LTLFireability8997887324862196132.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/LTLFireability787447693143148166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8997887324862196132.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...296
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l3915<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l3915<1))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6168133809055179754;'/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' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6168133809055179754;'/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' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d1m010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889264100420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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