Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K 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 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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-d1m005-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749071966816

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-d1m005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 21:19:27] [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:19:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:19:28] [INFO ] Load time of PNML (sax parser for PT used): 455 ms
[2025-06-04 21:19:28] [INFO ] Transformed 6690 places.
[2025-06-04 21:19:28] [INFO ] Transformed 11934 transitions.
[2025-06-04 21:19:28] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 600 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 28 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 6521
Iterating global reduction 1 with 1087 rules applied. Total rules applied 2293 place count 1281 transition count 6521
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 251 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 2544 place count 1281 transition count 6270
Discarding 921 places :
Symmetric choice reduction at 2 with 921 rule applications. Total rules 3465 place count 360 transition count 5349
Iterating global reduction 2 with 921 rules applied. Total rules applied 4386 place count 360 transition count 5349
Ensure Unique test removed 4203 transitions
Reduce isomorphic transitions removed 4203 transitions.
Iterating post reduction 2 with 4203 rules applied. Total rules applied 8589 place count 360 transition count 1146
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 8659 place count 290 transition count 1076
Iterating global reduction 3 with 70 rules applied. Total rules applied 8729 place count 290 transition count 1076
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Iterating post reduction 3 with 158 rules applied. Total rules applied 8887 place count 290 transition count 918
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 8895 place count 282 transition count 910
Iterating global reduction 4 with 8 rules applied. Total rules applied 8903 place count 282 transition count 910
Applied a total of 8903 rules in 472 ms. Remains 282 /2385 variables (removed 2103) and now considering 910/11934 (removed 11024) transitions.
// Phase 1: matrix 910 rows 282 cols
[2025-06-04 21:19:29] [INFO ] Computed 3 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:29] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-06-04 21:19:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:30] [INFO ] State equation strengthened by 655 read => feed constraints.
[2025-06-04 21:19:32] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 2662 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2025-06-04 21:19:32] [INFO ] Invariant cache hit.
[2025-06-04 21:19:32] [INFO ] State equation strengthened by 655 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
At refinement iteration 4 (OVERLAPS) 910/1192 variables, 282/285 constraints. Problems are: Problem set: 24 solved, 885 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1192 variables, 655/940 constraints. Problems are: Problem set: 24 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1192/1192 variables, and 940 constraints, problems are : Problem set: 24 solved, 885 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 282/282 constraints, ReadFeed: 655/655 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 885 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 885 unsolved
At refinement iteration 1 (OVERLAPS) 17/274 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 885 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 885 unsolved
At refinement iteration 3 (OVERLAPS) 8/282 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 910/1192 variables, 282/285 constraints. Problems are: Problem set: 24 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1192 variables, 655/940 constraints. Problems are: Problem set: 24 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1192/1192 variables, and 1825 constraints, problems are : Problem set: 24 solved, 885 unsolved in 30666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 282/282 constraints, ReadFeed: 655/655 constraints, PredecessorRefiner: 885/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62332ms problems are : Problem set: 24 solved, 885 unsolved
Search for dead transitions found 24 dead transitions in 62349ms
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 : 282/2385 places, 886/11934 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 259 transition count 875
Applied a total of 34 rules in 5 ms. Remains 259 /282 variables (removed 23) and now considering 875/886 (removed 11) transitions.
// Phase 1: matrix 875 rows 259 cols
[2025-06-04 21:20:34] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:34] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-04 21:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:34] [INFO ] State equation strengthened by 651 read => feed constraints.
[2025-06-04 21:20:36] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 259/2385 places, 875/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67524 ms. Remains : 259/2385 places, 875/11934 transitions.
Support contains 30 out of 259 places after structural reductions.
[2025-06-04 21:20:36] [INFO ] Flatten gal took : 99 ms
[2025-06-04 21:20:36] [INFO ] Flatten gal took : 47 ms
[2025-06-04 21:20:36] [INFO ] Input system was already deterministic with 875 transitions.
Support contains 29 out of 259 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (7054 resets) in 2581 ms. (15 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40004 steps (1275 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2025-06-04 21:20:37] [INFO ] Invariant cache hit.
[2025-06-04 21:20:37] [INFO ] State equation strengthened by 651 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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 237/246 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/309 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/313 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 818/1131 variables, 210/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1131 variables, 644/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1131 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 1134/1134 variables, and 912 constraints, problems are : Problem set: 1 solved, 0 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, ReadFeed: 651/651 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 51 stabilizing places and 346 stable transitions
Graph (complete) has 1396 edges and 259 vertex of which 257 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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||((p0 U p2)&&p1))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Graph (complete) has 1396 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 237 transition count 419
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 237 transition count 419
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 237 transition count 414
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 67 place count 219 transition count 396
Iterating global reduction 2 with 18 rules applied. Total rules applied 85 place count 219 transition count 396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 91 place count 219 transition count 390
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 147 place count 163 transition count 334
Iterating global reduction 3 with 56 rules applied. Total rules applied 203 place count 163 transition count 334
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 271 place count 163 transition count 266
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 273 place count 161 transition count 240
Iterating global reduction 4 with 2 rules applied. Total rules applied 275 place count 161 transition count 240
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 276 place count 160 transition count 239
Iterating global reduction 4 with 1 rules applied. Total rules applied 277 place count 160 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 160 transition count 238
Applied a total of 278 rules in 57 ms. Remains 160 /259 variables (removed 99) and now considering 238/875 (removed 637) transitions.
// Phase 1: matrix 238 rows 160 cols
[2025-06-04 21:20:38] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:38] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 21:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:38] [INFO ] State equation strengthened by 97 read => feed constraints.
[2025-06-04 21:20:39] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:20:39] [INFO ] Redundant transitions in 14 ms returned []
Running 237 sub problems to find dead transitions.
[2025-06-04 21:20:39] [INFO ] Invariant cache hit.
[2025-06-04 21:20:39] [INFO ] State equation strengthened by 97 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/398 variables, 160/162 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 97/259 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 259 constraints, problems are : Problem set: 0 solved, 237 unsolved in 15028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/398 variables, 160/162 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 97/259 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 237/496 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:16] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 18 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:21:16] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:17] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 499 constraints, problems are : Problem set: 12 solved, 225 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45270ms problems are : Problem set: 12 solved, 225 unsolved
Search for dead transitions found 12 dead transitions in 45271ms
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 : 160/259 places, 226/875 transitions.
Graph (complete) has 555 edges and 160 vertex of which 153 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 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 222
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 149 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 19 ms. Remains 149 /160 variables (removed 11) and now considering 222/226 (removed 4) transitions.
// Phase 1: matrix 222 rows 149 cols
[2025-06-04 21:21:24] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:24] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 21:21:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:24] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-06-04 21:21:25] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/259 places, 222/875 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46761 ms. Remains : 149/259 places, 222/875 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-00 finished in 46993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (!p1&&((p2 U p1) U p3)&&F(p2))))))'
Support contains 6 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 239 transition count 451
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 239 transition count 451
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 47 place count 239 transition count 444
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 62 place count 224 transition count 429
Iterating global reduction 2 with 15 rules applied. Total rules applied 77 place count 224 transition count 429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 224 transition count 425
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 133 place count 172 transition count 373
Iterating global reduction 3 with 52 rules applied. Total rules applied 185 place count 172 transition count 373
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 261 place count 172 transition count 297
Applied a total of 261 rules in 17 ms. Remains 172 /259 variables (removed 87) and now considering 297/875 (removed 578) transitions.
// Phase 1: matrix 297 rows 172 cols
[2025-06-04 21:21:25] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 21:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:25] [INFO ] State equation strengthened by 146 read => feed constraints.
[2025-06-04 21:21:26] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2025-06-04 21:21:26] [INFO ] Invariant cache hit.
[2025-06-04 21:21:26] [INFO ] State equation strengthened by 146 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 297/469 variables, 172/174 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 146/320 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:35] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 3 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:37] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 3 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:38] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:38] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 3 ms to minimize.
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:39] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 5 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:39] [INFO ] Deduced a trap composed of 60 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:21:39] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:39] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:39] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 4 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 9/329 constraints. Problems are: Problem set: 21 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:49] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 6 ms to minimize.
Problem TDEAD260 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:49] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:50] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 3/332 constraints. Problems are: Problem set: 22 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 332 constraints, problems are : Problem set: 22 solved, 274 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 8/162 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 5/8 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 297/459 variables, 162/170 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 146/316 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 39/355 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/355 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 11 (OVERLAPS) 10/469 variables, 10/365 constraints. Problems are: Problem set: 22 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 600 constraints, problems are : Problem set: 22 solved, 274 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 274/296 constraints, Known Traps: 6/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 22 solved, 274 unsolved
Search for dead transitions found 22 dead transitions in 60363ms
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 : 172/259 places, 275/875 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 154 transition count 269
Applied a total of 24 rules in 2 ms. Remains 154 /172 variables (removed 18) and now considering 269/275 (removed 6) transitions.
// Phase 1: matrix 269 rows 154 cols
[2025-06-04 21:22:26] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 21:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:27] [INFO ] State equation strengthened by 142 read => feed constraints.
[2025-06-04 21:22:27] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/259 places, 269/875 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62332 ms. Remains : 154/259 places, 269/875 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p2) (NOT p3) p1), (OR (NOT p3) (NOT p2) p1), true, (NOT p1), (NOT p3), (NOT p2), (AND (NOT p2) (NOT p1) p3), (NOT p3)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-01 finished in 62747 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(F(p0))))'
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 236 transition count 386
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 236 transition count 386
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 236 transition count 383
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 68 place count 217 transition count 364
Iterating global reduction 2 with 19 rules applied. Total rules applied 87 place count 217 transition count 364
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 217 transition count 360
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 151 place count 157 transition count 300
Iterating global reduction 3 with 60 rules applied. Total rules applied 211 place count 157 transition count 300
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 271 place count 157 transition count 240
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 273 place count 155 transition count 214
Iterating global reduction 4 with 2 rules applied. Total rules applied 275 place count 155 transition count 214
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 276 place count 154 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 277 place count 154 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 154 transition count 212
Applied a total of 278 rules in 17 ms. Remains 154 /259 variables (removed 105) and now considering 212/875 (removed 663) transitions.
// Phase 1: matrix 212 rows 154 cols
[2025-06-04 21:22:28] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:28] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 21:22:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-04 21:22:28] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-04 21:22:28] [INFO ] Invariant cache hit.
[2025-06-04 21:22:28] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/366 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 75/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:34] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:34] [INFO ] Deduced a trap composed of 58 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:22:34] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 3 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:35] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:35] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 5 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:35] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 5 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:35] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 4 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:35] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:35] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:35] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 10/241 constraints. Problems are: Problem set: 22 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:41] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 1/242 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/242 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/242 constraints. Problems are: Problem set: 22 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 242 constraints, problems are : Problem set: 22 solved, 189 unsolved in 24444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 8/144 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 4/7 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 212/356 variables, 144/151 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 75/226 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 39/265 constraints. Problems are: Problem set: 22 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:02] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/266 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/266 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 10/366 variables, 10/276 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 150/426 constraints. Problems are: Problem set: 22 solved, 189 unsolved
SMT process timed out in 54584ms, After SMT, problems are : Problem set: 22 solved, 189 unsolved
Search for dead transitions found 22 dead transitions in 54585ms
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 : 154/259 places, 190/875 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 136 transition count 184
Applied a total of 24 rules in 4 ms. Remains 136 /154 variables (removed 18) and now considering 184/190 (removed 6) transitions.
// Phase 1: matrix 184 rows 136 cols
[2025-06-04 21:23:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 21:23:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:23] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-04 21:23:24] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/259 places, 184/875 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55917 ms. Remains : 136/259 places, 184/875 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Computed a total of 4 stabilizing places and 23 stable transitions
Graph (complete) has 468 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-03 finished in 56549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(((G(p1) U p2)&&F(G(p1)))))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 238 transition count 480
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 238 transition count 480
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 50 place count 238 transition count 472
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 66 place count 222 transition count 456
Iterating global reduction 2 with 16 rules applied. Total rules applied 82 place count 222 transition count 456
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 90 place count 222 transition count 448
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 138 place count 174 transition count 400
Iterating global reduction 3 with 48 rules applied. Total rules applied 186 place count 174 transition count 400
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 282 place count 174 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 283 place count 173 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 173 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 172 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 172 transition count 290
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 290 place count 168 transition count 286
Iterating global reduction 4 with 4 rules applied. Total rules applied 294 place count 168 transition count 286
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 318 place count 168 transition count 262
Applied a total of 318 rules in 20 ms. Remains 168 /259 variables (removed 91) and now considering 262/875 (removed 613) transitions.
// Phase 1: matrix 262 rows 168 cols
[2025-06-04 21:23:24] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:25] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-04 21:23:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:25] [INFO ] State equation strengthened by 115 read => feed constraints.
[2025-06-04 21:23:25] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-06-04 21:23:25] [INFO ] Invariant cache hit.
[2025-06-04 21:23:25] [INFO ] State equation strengthened by 115 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:37] [INFO ] Deduced a trap composed of 60 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:23:37] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:37] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 6/291 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:46] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 6 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:46] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 6 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:46] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 6 ms to minimize.
Problem TDEAD225 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:46] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:46] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:46] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 5 ms to minimize.
Problem TDEAD230 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:47] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:47] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 5 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 8/299 constraints. Problems are: Problem set: 16 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/430 variables, and 299 constraints, problems are : Problem set: 16 solved, 245 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 2/2 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 1/3 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/4 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 4/158 variables, 1/5 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 4/9 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 262/420 variables, 158/167 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 115/282 constraints. Problems are: Problem set: 16 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 39/321 constraints. Problems are: Problem set: 16 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:08] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 1/322 constraints. Problems are: Problem set: 16 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:14] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 1/323 constraints. Problems are: Problem set: 16 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/430 variables, and 323 constraints, problems are : Problem set: 16 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 39/261 constraints, Known Traps: 7/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60188ms problems are : Problem set: 16 solved, 245 unsolved
Search for dead transitions found 16 dead transitions in 60189ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 168/259 places, 246/875 transitions.
Reduce places removed 16 places and 2 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 152 transition count 238
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 150 transition count 234
Applied a total of 24 rules in 4 ms. Remains 150 /168 variables (removed 18) and now considering 234/246 (removed 12) transitions.
// Phase 1: matrix 234 rows 150 cols
[2025-06-04 21:24:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:26] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-04 21:24:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:26] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-04 21:24:27] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/259 places, 234/875 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62225 ms. Remains : 150/259 places, 234/875 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-04 finished in 62535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||((X(p2)&&p1) U p2))))||G(p3)))'
Support contains 5 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 238 transition count 450
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 238 transition count 450
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 49 place count 238 transition count 443
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 65 place count 222 transition count 427
Iterating global reduction 2 with 16 rules applied. Total rules applied 81 place count 222 transition count 427
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 222 transition count 422
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 138 place count 170 transition count 370
Iterating global reduction 3 with 52 rules applied. Total rules applied 190 place count 170 transition count 370
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 270 place count 170 transition count 290
Applied a total of 270 rules in 16 ms. Remains 170 /259 variables (removed 89) and now considering 290/875 (removed 585) transitions.
// Phase 1: matrix 290 rows 170 cols
[2025-06-04 21:24:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 21:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:27] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-04 21:24:29] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-06-04 21:24:29] [INFO ] Invariant cache hit.
[2025-06-04 21:24:30] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/460 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 141/313 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 3 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 3 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 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:24:38] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:39] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 4 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:40] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:40] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 9 ms to minimize.
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 9/322 constraints. Problems are: Problem set: 21 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:49] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 5 ms to minimize.
Problem TDEAD249 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:49] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:49] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 3/325 constraints. Problems are: Problem set: 22 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:56] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/326 constraints. Problems are: Problem set: 22 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 326 constraints, problems are : Problem set: 22 solved, 267 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 8/160 variables, 1/4 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 5/9 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 290/450 variables, 160/169 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 141/310 constraints. Problems are: Problem set: 22 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 39/349 constraints. Problems are: Problem set: 22 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:19] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 1/350 constraints. Problems are: Problem set: 22 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/460 variables, and 350 constraints, problems are : Problem set: 22 solved, 267 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/170 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 39/289 constraints, Known Traps: 7/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60252ms problems are : Problem set: 22 solved, 267 unsolved
Search for dead transitions found 22 dead transitions in 60254ms
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 : 170/259 places, 268/875 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 152 transition count 262
Applied a total of 24 rules in 6 ms. Remains 152 /170 variables (removed 18) and now considering 262/268 (removed 6) transitions.
// Phase 1: matrix 262 rows 152 cols
[2025-06-04 21:25:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:30] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 21:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:30] [INFO ] State equation strengthened by 137 read => feed constraints.
[2025-06-04 21:25:31] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/259 places, 262/875 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63582 ms. Remains : 152/259 places, 262/875 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-07 finished in 63708 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 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Graph (complete) has 1396 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 236 transition count 416
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 236 transition count 416
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 236 transition count 411
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 69 place count 218 transition count 393
Iterating global reduction 2 with 18 rules applied. Total rules applied 87 place count 218 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 218 transition count 388
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 148 place count 162 transition count 332
Iterating global reduction 3 with 56 rules applied. Total rules applied 204 place count 162 transition count 332
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 276 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 278 place count 160 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 280 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 159 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 283 place count 159 transition count 232
Applied a total of 283 rules in 48 ms. Remains 159 /259 variables (removed 100) and now considering 232/875 (removed 643) transitions.
// Phase 1: matrix 232 rows 159 cols
[2025-06-04 21:25:31] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:31] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-04 21:25:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:31] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-04 21:25:32] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:25:32] [INFO ] Redundant transitions in 11 ms returned []
Running 231 sub problems to find dead transitions.
[2025-06-04 21:25:32] [INFO ] Invariant cache hit.
[2025-06-04 21:25:32] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:37] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 5 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:25:37] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:37] [INFO ] Deduced a trap composed of 60 places in 48 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:25:38] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 3 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:39] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 7 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 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:25:39] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 6/258 constraints. Problems are: Problem set: 20 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:44] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:45] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 5 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:46] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:46] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:46] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 5/263 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/263 constraints. Problems are: Problem set: 22 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:55] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/391 variables, 1/264 constraints. Problems are: Problem set: 22 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/391 variables, and 264 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: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 8/149 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 5/8 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 232/381 variables, 149/157 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 91/248 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 39/287 constraints. Problems are: Problem set: 22 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:13] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 1/288 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/288 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 12 (OVERLAPS) 10/391 variables, 10/298 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 468 constraints, problems are : Problem set: 22 solved, 209 unsolved in 30075 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: 209/231 constraints, Known Traps: 6/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60235ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 60236ms
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/259 places, 210/875 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 22 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:26:32] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:32] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 21:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:32] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-04 21:26:32] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/259 places, 204/875 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61712 ms. Remains : 141/259 places, 204/875 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-08
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-08 finished in 61802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)&&G(X(p1))))'
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 236 transition count 416
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 236 transition count 416
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 236 transition count 411
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 69 place count 218 transition count 393
Iterating global reduction 2 with 18 rules applied. Total rules applied 87 place count 218 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 218 transition count 388
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 148 place count 162 transition count 332
Iterating global reduction 3 with 56 rules applied. Total rules applied 204 place count 162 transition count 332
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 272 place count 162 transition count 264
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 161 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 161 transition count 251
Applied a total of 274 rules in 18 ms. Remains 161 /259 variables (removed 98) and now considering 251/875 (removed 624) transitions.
// Phase 1: matrix 251 rows 161 cols
[2025-06-04 21:26: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:26:33] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 21:26:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:33] [INFO ] State equation strengthened by 109 read => feed constraints.
[2025-06-04 21:26:34] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2025-06-04 21:26:34] [INFO ] Invariant cache hit.
[2025-06-04 21:26:34] [INFO ] State equation strengthened by 109 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, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/412 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 109/272 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:41] [INFO ] Deduced a trap composed of 49 places in 49 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:26:41] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 4 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:26:41] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:42] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 5 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:43] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:43] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:43] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 6 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:43] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 7 ms to minimize.
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:44] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 4 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:44] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:44] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 11/283 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/283 constraints. Problems are: Problem set: 22 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:55] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/412 variables, 1/284 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/284 constraints. Problems are: Problem set: 22 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/412 variables, and 284 constraints, problems are : Problem set: 22 solved, 228 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 8/151 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 5/8 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 251/402 variables, 151/159 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 109/268 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 39/307 constraints. Problems are: Problem set: 22 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:20] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/308 constraints. Problems are: Problem set: 22 solved, 228 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/412 variables, and 308 constraints, problems are : Problem set: 22 solved, 228 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/161 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 39/250 constraints, Known Traps: 6/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60194ms problems are : Problem set: 22 solved, 228 unsolved
Search for dead transitions found 22 dead transitions in 60196ms
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 : 161/259 places, 229/875 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 143 transition count 223
Applied a total of 24 rules in 2 ms. Remains 143 /161 variables (removed 18) and now considering 223/229 (removed 6) transitions.
// Phase 1: matrix 223 rows 143 cols
[2025-06-04 21:27:34] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:34] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 21:27:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:35] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-04 21:27:35] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/259 places, 223/875 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62392 ms. Remains : 143/259 places, 223/875 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-09 finished in 62512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(!p1) U (p2&&F(p3)))))'
Support contains 5 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 239 transition count 513
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 239 transition count 513
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 50 place count 239 transition count 503
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 65 place count 224 transition count 488
Iterating global reduction 2 with 15 rules applied. Total rules applied 80 place count 224 transition count 488
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 90 place count 224 transition count 478
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 134 place count 180 transition count 434
Iterating global reduction 3 with 44 rules applied. Total rules applied 178 place count 180 transition count 434
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 270 place count 180 transition count 342
Applied a total of 270 rules in 17 ms. Remains 180 /259 variables (removed 79) and now considering 342/875 (removed 533) transitions.
// Phase 1: matrix 342 rows 180 cols
[2025-06-04 21:27:35] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 21:27:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:35] [INFO ] State equation strengthened by 185 read => feed constraints.
[2025-06-04 21:27:39] [INFO ] Implicit Places using invariants and state equation in 4317 ms returned []
Implicit Place search using SMT with State Equation took 4400 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2025-06-04 21:27:39] [INFO ] Invariant cache hit.
[2025-06-04 21:27:39] [INFO ] State equation strengthened by 185 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, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/522 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 185/367 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:51] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 3 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:55] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:55] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:55] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:55] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:56] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 12 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 6/373 constraints. Problems are: Problem set: 10 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:07] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:07] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 3 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 4 ms to minimize.
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 4/377 constraints. Problems are: Problem set: 21 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/522 variables, and 377 constraints, problems are : Problem set: 21 solved, 320 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 8/171 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 4/7 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 342/513 variables, 171/178 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 185/363 constraints. Problems are: Problem set: 21 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 40/403 constraints. Problems are: Problem set: 21 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:32] [INFO ] Deduced a trap along path composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 1/404 constraints. Problems are: Problem set: 21 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/522 variables, and 404 constraints, problems are : Problem set: 21 solved, 320 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/180 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 40/341 constraints, Known Traps: 5/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60320ms problems are : Problem set: 21 solved, 320 unsolved
Search for dead transitions found 21 dead transitions in 60323ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 180/259 places, 321/875 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 163 transition count 316
Applied a total of 22 rules in 4 ms. Remains 163 /180 variables (removed 17) and now considering 316/321 (removed 5) transitions.
// Phase 1: matrix 316 rows 163 cols
[2025-06-04 21:28:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:28:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 21:28:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:28:40] [INFO ] State equation strengthened by 181 read => feed constraints.
[2025-06-04 21:28:41] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/259 places, 316/875 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66470 ms. Remains : 163/259 places, 316/875 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), p1, (OR (NOT p2) (NOT p3)), (NOT p3), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-10 finished in 66686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 5 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Graph (complete) has 1396 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 238 transition count 450
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 238 transition count 450
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 49 place count 238 transition count 443
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 65 place count 222 transition count 427
Iterating global reduction 2 with 16 rules applied. Total rules applied 81 place count 222 transition count 427
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 222 transition count 422
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 138 place count 170 transition count 370
Iterating global reduction 3 with 52 rules applied. Total rules applied 190 place count 170 transition count 370
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 266 place count 170 transition count 294
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 268 place count 168 transition count 268
Iterating global reduction 4 with 2 rules applied. Total rules applied 270 place count 168 transition count 268
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 271 place count 167 transition count 267
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 167 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 167 transition count 266
Applied a total of 273 rules in 37 ms. Remains 167 /259 variables (removed 92) and now considering 266/875 (removed 609) transitions.
// Phase 1: matrix 266 rows 167 cols
[2025-06-04 21:28:42] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:28:42] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-04 21:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:28:42] [INFO ] State equation strengthened by 118 read => feed constraints.
[2025-06-04 21:28:43] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:28:43] [INFO ] Redundant transitions in 3 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-04 21:28:43] [INFO ] Invariant cache hit.
[2025-06-04 21:28:43] [INFO ] State equation strengthened by 118 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, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/433 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 118/287 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:49] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 3 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:50] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:52] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:52] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:52] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 4 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:53] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:53] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:53] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 4 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 8/295 constraints. Problems are: Problem set: 20 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:01] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:01] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 6 ms to minimize.
Problem TDEAD225 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 2/297 constraints. Problems are: Problem set: 21 solved, 244 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:10] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:10] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 2/299 constraints. Problems are: Problem set: 21 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/433 variables, and 299 constraints, problems are : Problem set: 21 solved, 244 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 8/158 variables, 1/5 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 4/9 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 266/424 variables, 158/167 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 118/285 constraints. Problems are: Problem set: 21 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 40/325 constraints. Problems are: Problem set: 21 solved, 244 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:30] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/326 constraints. Problems are: Problem set: 21 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/433 variables, and 326 constraints, problems are : Problem set: 21 solved, 244 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/167 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 40/265 constraints, Known Traps: 7/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60190ms problems are : Problem set: 21 solved, 244 unsolved
Search for dead transitions found 21 dead transitions in 60191ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 167/259 places, 245/875 transitions.
Graph (complete) has 569 edges and 167 vertex of which 150 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 150 transition count 240
Applied a total of 6 rules in 9 ms. Remains 150 /167 variables (removed 17) and now considering 240/245 (removed 5) transitions.
// Phase 1: matrix 240 rows 150 cols
[2025-06-04 21:29:43] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 21:29:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:43] [INFO ] State equation strengthened by 114 read => feed constraints.
[2025-06-04 21:29:43] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/259 places, 240/875 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61674 ms. Remains : 150/259 places, 240/875 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-11
Product exploration explored 100000 steps with 20514 reset in 264 ms.
Product exploration explored 100000 steps with 20644 reset in 262 ms.
Computed a total of 4 stabilizing places and 25 stable transitions
Graph (complete) has 551 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 10236 steps (2064 resets) in 95 ms. (106 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-04 21:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 21:29:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:29:45] [INFO ] State equation strengthened by 114 read => feed constraints.
[2025-06-04 21:29:45] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:29:45] [INFO ] Redundant transitions in 2 ms returned []
Running 239 sub problems to find dead transitions.
[2025-06-04 21:29:45] [INFO ] Invariant cache hit.
[2025-06-04 21:29:45] [INFO ] State equation strengthened by 114 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Problem TDEAD207 is UNSAT
At refinement iteration 4 (OVERLAPS) 240/390 variables, 150/152 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 114/266 constraints. Problems are: Problem set: 1 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:53] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:53] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:54] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:54] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:54] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:54] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 6/272 constraints. Problems are: Problem set: 1 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:29:59] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:30:02] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/390 variables, and 274 constraints, problems are : Problem set: 1 solved, 238 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 240/389 variables, 149/159 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 114/273 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 39/312 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/313 constraints. Problems are: Problem set: 1 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 512 constraints, problems are : Problem set: 1 solved, 238 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 238/239 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 1 solved, 238 unsolved
Search for dead transitions found 1 dead transitions in 60230ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 150/150 places, 239/240 transitions.
Graph (complete) has 548 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 149 transition count 238
Applied a total of 2 rules in 6 ms. Remains 149 /150 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 149 cols
[2025-06-04 21:30:45] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 21:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:45] [INFO ] State equation strengthened by 114 read => feed constraints.
[2025-06-04 21:30:46] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/150 places, 238/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61409 ms. Remains : 149/150 places, 238/240 transitions.
Computed a total of 4 stabilizing places and 25 stable transitions
Graph (complete) has 546 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 4 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 7980 steps (1617 resets) in 55 ms. (142 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20571 reset in 220 ms.
Product exploration explored 100000 steps with 20682 reset in 323 ms.
Built C files in :
/tmp/ltsmin12654484517476524160
[2025-06-04 21:30:47] [INFO ] Computing symmetric may disable matrix : 238 transitions.
[2025-06-04 21:30:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:30:47] [INFO ] Computing symmetric may enable matrix : 238 transitions.
[2025-06-04 21:30:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:30:47] [INFO ] Computing Do-Not-Accords matrix : 238 transitions.
[2025-06-04 21:30:47] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:30:47] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12654484517476524160
Running compilation step : cd /tmp/ltsmin12654484517476524160;'/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 636 ms.
Running link step : cd /tmp/ltsmin12654484517476524160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12654484517476524160;'/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/stateBased3590940825440353658.hoa' '--buchi-type=spotba'
LTSmin run took 6697 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-11 finished in 132909 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(((F((!p1||X(p2))) U p3)&&p0)))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Graph (complete) has 1396 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 237 transition count 449
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 237 transition count 449
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 237 transition count 442
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 68 place count 220 transition count 425
Iterating global reduction 2 with 17 rules applied. Total rules applied 85 place count 220 transition count 425
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 92 place count 220 transition count 418
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 144 place count 168 transition count 366
Iterating global reduction 3 with 52 rules applied. Total rules applied 196 place count 168 transition count 366
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 276 place count 168 transition count 286
Applied a total of 276 rules in 30 ms. Remains 168 /259 variables (removed 91) and now considering 286/875 (removed 589) transitions.
// Phase 1: matrix 286 rows 168 cols
[2025-06-04 21:30:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-04 21:30:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:30:55] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-06-04 21:30:55] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:30:55] [INFO ] Redundant transitions in 8 ms returned []
Running 285 sub problems to find dead transitions.
[2025-06-04 21:30:55] [INFO ] Invariant cache hit.
[2025-06-04 21:30:55] [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/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/454 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 139/309 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:07] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:07] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:07] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:07] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 9 ms to minimize.
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:08] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 5 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:08] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:08] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:08] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:08] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:08] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 4 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 10/319 constraints. Problems are: Problem set: 12 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:13] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:14] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 3 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:15] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 5 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 3/322 constraints. Problems are: Problem set: 22 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 322 constraints, problems are : Problem set: 22 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 263 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 8/158 variables, 1/4 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 5/9 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 286/444 variables, 158/167 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 139/306 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 39/345 constraints. Problems are: Problem set: 22 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:31:41] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/346 constraints. Problems are: Problem set: 22 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/454 variables, and 346 constraints, problems are : Problem set: 22 solved, 263 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/168 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 39/285 constraints, Known Traps: 7/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60256ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 60257ms
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 : 168/259 places, 264/875 transitions.
Graph (complete) has 585 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 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 150 transition count 258
Applied a total of 7 rules in 10 ms. Remains 150 /168 variables (removed 18) and now considering 258/264 (removed 6) transitions.
// Phase 1: matrix 258 rows 150 cols
[2025-06-04 21:31:56] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:31:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 21:31:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:31:56] [INFO ] State equation strengthened by 135 read => feed constraints.
[2025-06-04 21:31:56] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/259 places, 258/875 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61923 ms. Remains : 150/259 places, 258/875 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-12 finished in 62061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 235 transition count 385
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 235 transition count 385
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 235 transition count 381
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 71 place count 216 transition count 362
Iterating global reduction 2 with 19 rules applied. Total rules applied 90 place count 216 transition count 362
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 94 place count 216 transition count 358
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 154 place count 156 transition count 298
Iterating global reduction 3 with 60 rules applied. Total rules applied 214 place count 156 transition count 298
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 274 place count 156 transition count 238
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 154 transition count 212
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 279 place count 153 transition count 211
Iterating global reduction 4 with 1 rules applied. Total rules applied 280 place count 153 transition count 211
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 284 place count 149 transition count 207
Iterating global reduction 4 with 4 rules applied. Total rules applied 288 place count 149 transition count 207
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 296 place count 149 transition count 199
Applied a total of 296 rules in 19 ms. Remains 149 /259 variables (removed 110) and now considering 199/875 (removed 676) transitions.
// Phase 1: matrix 199 rows 149 cols
[2025-06-04 21:31:57] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:31:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 21:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:31:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-04 21:31:57] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-04 21:31:57] [INFO ] Invariant cache hit.
[2025-06-04 21:31:57] [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:32:03] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:03] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 7 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:04] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:04] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:04] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:04] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 3 ms to minimize.
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 6 (INCLUDED_ONLY) 0/348 variables, 6/224 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:32:07] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:08] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:08] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 4 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 3/227 constraints. Problems are: Problem set: 20 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:11] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 5 ms to minimize.
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:11] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 5 ms to minimize.
Problem TDEAD162 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:11] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 3/230 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/230 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 10 (OVERLAPS) 0/348 variables, 0/230 constraints. Problems are: Problem set: 22 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 230 constraints, problems are : Problem set: 22 solved, 176 unsolved in 26472 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: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 8/139 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 5/8 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 199/338 variables, 139/147 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 67/214 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 39/253 constraints. Problems are: Problem set: 22 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:32:31] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 1/254 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/254 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 10/348 variables, 10/264 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 137/401 constraints. Problems are: Problem set: 22 solved, 176 unsolved
SMT process timed out in 56587ms, After SMT, problems are : Problem set: 22 solved, 176 unsolved
Search for dead transitions found 22 dead transitions in 56589ms
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/259 places, 177/875 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:32:54] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 21:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:54] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-04 21:32:55] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/259 places, 171/875 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58039 ms. Remains : 131/259 places, 171/875 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-14
Stuttering criterion allowed to conclude after 18 steps with 2 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-14 finished in 58125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(!p1)))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 875/875 transitions.
Graph (complete) has 1396 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 874
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 238 transition count 482
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 238 transition count 482
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 51 place count 238 transition count 473
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 67 place count 222 transition count 457
Iterating global reduction 2 with 16 rules applied. Total rules applied 83 place count 222 transition count 457
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 92 place count 222 transition count 448
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 140 place count 174 transition count 400
Iterating global reduction 3 with 48 rules applied. Total rules applied 188 place count 174 transition count 400
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 276 place count 174 transition count 312
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 277 place count 173 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 173 transition count 299
Applied a total of 278 rules in 31 ms. Remains 173 /259 variables (removed 86) and now considering 299/875 (removed 576) transitions.
// Phase 1: matrix 299 rows 173 cols
[2025-06-04 21:32:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 21:32:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:32:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-04 21:32:56] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:32:56] [INFO ] Redundant transitions in 5 ms returned []
Running 298 sub problems to find dead transitions.
[2025-06-04 21:32:56] [INFO ] Invariant cache hit.
[2025-06-04 21:32:56] [INFO ] State equation strengthened by 147 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, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 299/472 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 147/322 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:07] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:07] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:07] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 3 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:07] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 5 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:07] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 4 ms to minimize.
Problem TDEAD262 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:07] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:08] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:08] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:08] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:08] [INFO ] Deduced a trap composed of 59 places in 51 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
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 10/332 constraints. Problems are: Problem set: 12 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:15] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:15] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 3 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 2/334 constraints. Problems are: Problem set: 22 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:33:23] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/335 constraints. Problems are: Problem set: 22 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 335 constraints, problems are : Problem set: 22 solved, 276 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 1/3 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 8/163 variables, 1/4 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 5/9 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 299/462 variables, 163/172 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 147/319 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 39/358 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/358 constraints. Problems are: Problem set: 22 solved, 276 unsolved
At refinement iteration 11 (OVERLAPS) 10/472 variables, 10/368 constraints. Problems are: Problem set: 22 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 605 constraints, problems are : Problem set: 22 solved, 276 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 276/298 constraints, Known Traps: 7/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60393ms problems are : Problem set: 22 solved, 276 unsolved
Search for dead transitions found 22 dead transitions in 60393ms
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 : 173/259 places, 277/875 transitions.
Graph (complete) has 609 edges and 173 vertex of which 155 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 155 transition count 271
Applied a total of 7 rules in 7 ms. Remains 155 /173 variables (removed 18) and now considering 271/277 (removed 6) transitions.
// Phase 1: matrix 271 rows 155 cols
[2025-06-04 21:33:56] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 21:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:56] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-04 21:33:57] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/259 places, 271/875 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61968 ms. Remains : 155/259 places, 271/875 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-15
Product exploration explored 100000 steps with 18052 reset in 254 ms.
Product exploration explored 100000 steps with 18036 reset in 255 ms.
Computed a total of 12 stabilizing places and 70 stable transitions
Graph (complete) has 589 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) p1), p1]
RANDOM walk for 40000 steps (7134 resets) in 156 ms. (254 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (1138 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
[2025-06-04 21:33:58] [INFO ] Invariant cache hit.
[2025-06-04 21:33:58] [INFO ] State equation strengthened by 143 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/263 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 426/426 variables, and 224 constraints, problems are : Problem set: 1 solved, 0 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 67/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 196 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p1]
Stuttering acceptance computed with spot in 36 ms :[p1]
Support contains 2 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 271/271 transitions.
Applied a total of 0 rules in 18 ms. Remains 155 /155 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2025-06-04 21:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 21:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:33:58] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-04 21:33:59] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:33:59] [INFO ] Redundant transitions in 3 ms returned []
Running 270 sub problems to find dead transitions.
[2025-06-04 21:33:59] [INFO ] Invariant cache hit.
[2025-06-04 21:33:59] [INFO ] State equation strengthened by 143 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, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/426 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 143/300 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:08] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:08] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:19] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:19] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/426 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:24] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:34:24] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 306 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 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: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 271/426 variables, 155/163 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 143/306 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 270/576 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 576 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60763 ms. Remains : 155/155 places, 271/271 transitions.
Computed a total of 12 stabilizing places and 70 stable transitions
Graph (complete) has 589 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 70 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 35 ms :[p1]
RANDOM walk for 10074 steps (1825 resets) in 41 ms. (239 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 76 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 27 ms :[p1]
Stuttering acceptance computed with spot in 32 ms :[p1]
Stuttering acceptance computed with spot in 27 ms :[p1]
Product exploration explored 100000 steps with 17990 reset in 235 ms.
Product exploration explored 100000 steps with 18047 reset in 247 ms.
Built C files in :
/tmp/ltsmin1871981867586984651
[2025-06-04 21:35:00] [INFO ] Computing symmetric may disable matrix : 271 transitions.
[2025-06-04 21:35:00] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:35:00] [INFO ] Computing symmetric may enable matrix : 271 transitions.
[2025-06-04 21:35:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:35:00] [INFO ] Computing Do-Not-Accords matrix : 271 transitions.
[2025-06-04 21:35:00] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:35:00] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1871981867586984651
Running compilation step : cd /tmp/ltsmin1871981867586984651;'/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 567 ms.
Running link step : cd /tmp/ltsmin1871981867586984651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1871981867586984651;'/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/stateBased16121303795252447170.hoa' '--buchi-type=spotba'
LTSmin run took 6706 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-15 finished in 132218 ms.
All properties solved by simple procedures.
Total runtime 939450 ms.

BK_STOP 1749072907489

--------------------
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-d1m005"
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-d1m005, 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-174889264100412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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