Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:33 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 SieveSingleMsgMbox-PT-d0m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749148800842

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 18:40:02] [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-05 18:40:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:40:02] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-05 18:40:02] [INFO ] Transformed 262 places.
[2025-06-05 18:40:02] [INFO ] Transformed 73 transitions.
[2025-06-05 18:40:02] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 67 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 67 transition count 70
Applied a total of 8 rules in 28 ms. Remains 67 /72 variables (removed 5) and now considering 70/73 (removed 3) transitions.
// Phase 1: matrix 70 rows 67 cols
[2025-06-05 18:40:02] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:02] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-05 18:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:02] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-06-05 18:40:02] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2025-06-05 18:40:02] [INFO ] Invariant cache hit.
[2025-06-05 18:40:02] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:03] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/137 variables, 67/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 29/102 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:04] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:04] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:04] [INFO ] Deduced a trap composed of 21 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-05 18:40:04] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:04] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:04] [INFO ] Deduced a trap composed of 22 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-05 18:40:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:05] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:05] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:05] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 114 constraints, problems are : Problem set: 0 solved, 69 unsolved in 4340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:07] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 70/137 variables, 67/86 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 29/115 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 69/184 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:08] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:08] [INFO ] Deduced a trap along path composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 186 constraints, problems are : Problem set: 0 solved, 69 unsolved in 6725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 11149ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 11164ms
Starting structural reductions in LTL mode, iteration 1 : 67/72 places, 70/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11547 ms. Remains : 67/72 places, 70/73 transitions.
Support contains 34 out of 67 places after structural reductions.
[2025-06-05 18:40:14] [INFO ] Flatten gal took : 22 ms
[2025-06-05 18:40:14] [INFO ] Flatten gal took : 9 ms
[2025-06-05 18:40:14] [INFO ] Input system was already deterministic with 70 transitions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40000 steps (8951 resets) in 1622 ms. (24 steps per ms) remains 23/28 properties
BEST_FIRST walk for 4001 steps (406 resets) in 72 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (435 resets) in 66 ms. (59 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (442 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (199 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (407 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (333 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (168 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (197 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (421 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (188 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (800 resets) in 22 ms. (173 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (429 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (439 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (212 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (421 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (200 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (384 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (201 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (408 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (169 resets) in 18 ms. (210 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (401 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (189 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
[2025-06-05 18:40:14] [INFO ] Invariant cache hit.
[2025-06-05 18:40:14] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 29/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/62 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:15] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:15] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 69/131 variables, 62/70 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 28/98 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 6/137 variables, 5/103 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:15] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:15] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:15] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 4/108 constraints. Problems are: Problem set: 1 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 108 constraints, problems are : Problem set: 1 solved, 21 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 30/55 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 6/61 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 69/130 variables, 61/69 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 28/97 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 10/107 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 7/137 variables, 6/113 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/114 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 11/125 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/137 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 129 constraints, problems are : Problem set: 1 solved, 21 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 21/22 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3140ms problems are : Problem set: 1 solved, 21 unsolved
Parikh walk visited 8 properties in 7576 ms.
Support contains 17 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 67
Applied a total of 6 rules in 13 ms. Remains 64 /67 variables (removed 3) and now considering 67/70 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 64/67 places, 67/70 transitions.
RANDOM walk for 40000 steps (8993 resets) in 259 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (4185 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (4272 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1899 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (4086 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (4090 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (4075 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (4137 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1943 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1944 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (4106 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1886 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 829260 steps, run visited all 13 properties in 2721 ms. (steps per millisecond=304 )
Probabilistic random walk after 829260 steps, saw 425649 distinct states, run finished after 2729 ms. (steps per millisecond=303 ) properties seen :13
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 206 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0||X(G(!p1)))) U ((X((!p0||X(G(!p1))))&&(!p2||G(p3)))||X(G((!p0||X(G(!p1)))))))))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 62 transition count 64
Applied a total of 11 rules in 9 ms. Remains 62 /67 variables (removed 5) and now considering 64/70 (removed 6) transitions.
// Phase 1: matrix 64 rows 62 cols
[2025-06-05 18:40:29] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-05 18:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:29] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:40:29] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-06-05 18:40:29] [INFO ] Invariant cache hit.
[2025-06-05 18:40:29] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:30] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/126 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 95 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/126 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 63/158 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:32] [INFO ] Deduced a trap along path composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:34] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/126 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (OVERLAPS) 0/126 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 160 constraints, problems are : Problem set: 0 solved, 63 unsolved in 7594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 9311ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 9312ms
Starting structural reductions in LTL mode, iteration 1 : 62/67 places, 64/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9487 ms. Remains : 62/67 places, 64/70 transitions.
Stuttering acceptance computed with spot in 600 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1 (NOT p3)), (AND p0 p1), (AND (NOT p3) p0 p1), (AND p0 p1), (AND p0 p1), p1, (AND p1 (NOT p3)), (NOT p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 229 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 191 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 18 ms. Reduced automaton from 11 states, 31 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 finished in 10574 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 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 59 transition count 61
Applied a total of 17 rules in 12 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 18:40:39] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 18:40:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:40:40] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:40:40] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 18:40:40] [INFO ] Invariant cache hit.
[2025-06-05 18:40:40] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:40] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:41] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:41] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:41] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2820 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:44] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:44] [INFO ] Deduced a trap along path composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7518ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7523ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7726 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 finished in 7822 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 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 60 transition count 62
Applied a total of 15 rules in 17 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:40:47] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 18:40:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:40:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:40:47] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:40:47] [INFO ] Invariant cache hit.
[2025-06-05 18:40:47] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:50] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 154 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4566 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5707ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5707ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5876 ms. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-03
Product exploration explored 100000 steps with 22442 reset in 189 ms.
Product exploration explored 100000 steps with 22518 reset in 154 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 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 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8915 resets) in 290 ms. (137 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (6123 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
[2025-06-05 18:40:54] [INFO ] Invariant cache hit.
[2025-06-05 18:40:54] [INFO ] State equation strengthened by 26 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) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/103 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/122 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/103 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/122 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 62/62 transitions.
RANDOM walk for 40000 steps (8912 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (6158 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 410 steps, run visited all 1 properties in 3 ms. (steps per millisecond=136 )
Probabilistic random walk after 410 steps, saw 241 distinct states, run finished after 3 ms. (steps per millisecond=136 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 231 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 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-05 18:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-05 18:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:40:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:40:55] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:40:55] [INFO ] Redundant transitions in 0 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:40:55] [INFO ] Invariant cache hit.
[2025-06-05 18:40:55] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:40:58] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 154 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5817ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5817ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5986 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 89 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 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8906 resets) in 112 ms. (353 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (6149 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
[2025-06-05 18:41:01] [INFO ] Invariant cache hit.
[2025-06-05 18:41:01] [INFO ] State equation strengthened by 26 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) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/103 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/122 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/103 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/122 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 62/62 transitions.
RANDOM walk for 40000 steps (8998 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (6173 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 410 steps, run visited all 1 properties in 12 ms. (steps per millisecond=34 )
Probabilistic random walk after 410 steps, saw 241 distinct states, run finished after 12 ms. (steps per millisecond=34 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 187 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 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22399 reset in 95 ms.
Product exploration explored 100000 steps with 22366 reset in 121 ms.
Built C files in :
/tmp/ltsmin3024528943203802580
[2025-06-05 18:41:02] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2025-06-05 18:41:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:02] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2025-06-05 18:41:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:02] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2025-06-05 18:41:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:02] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3024528943203802580
Running compilation step : cd /tmp/ltsmin3024528943203802580;'/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 270 ms.
Running link step : cd /tmp/ltsmin3024528943203802580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3024528943203802580;'/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/stateBased6237863012710701976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 12 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-05 18:41:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:41:17] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 18:41:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:41:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:41:17] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:41:17] [INFO ] Redundant transitions in 0 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:41:17] [INFO ] Invariant cache hit.
[2025-06-05 18:41:17] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:41:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:41:20] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 154 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5831ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5831ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5984 ms. Remains : 60/60 places, 62/62 transitions.
Built C files in :
/tmp/ltsmin6296332579573283978
[2025-06-05 18:41:23] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2025-06-05 18:41:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:23] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2025-06-05 18:41:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:23] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2025-06-05 18:41:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:41:23] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6296332579573283978
Running compilation step : cd /tmp/ltsmin6296332579573283978;'/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 159 ms.
Running link step : cd /tmp/ltsmin6296332579573283978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6296332579573283978;'/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/stateBased13854160254158392645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:41:38] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:41:38] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:41:38] [INFO ] Time to serialize gal into /tmp/LTL5002008277941324495.gal : 2 ms
[2025-06-05 18:41:38] [INFO ] Time to serialize properties into /tmp/LTL11154256240043418190.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5002008277941324495.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7787075943478910490.hoa' '-atoms' '/tmp/LTL11154256240043418190.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11154256240043418190.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7787075943478910490.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t61, t62, t63, t66, t69, Inte...248
Computing Next relation with stutter on 2.35274e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 18:41:53] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:41:53] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:41:53] [INFO ] Time to serialize gal into /tmp/LTL17484464367419527579.gal : 1 ms
[2025-06-05 18:41:53] [INFO ] Time to serialize properties into /tmp/LTL946783906533122778.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17484464367419527579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL946783906533122778.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((s2>=1)&&(l65>=1))"))U((G(!("((s2>=1)&&(l65>=1))")))||("((!((s1>=1)&&(l30>=1)))&&(!((s2>=1)&&(l65>=1))))"))))))
Formula 0 simplified : FG("((s2>=1)&&(l65>=1))" M !"((!((s1>=1)&&(l30>=1)))&&(!((s2>=1)&&(l65>=1))))")
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t61, t62, t63, t66, t69, Inte...248
Computing Next relation with stutter on 2.35274e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 18:42:08] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:42:08] [INFO ] Applying decomposition
[2025-06-05 18:42:08] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18322410520133618859.txt' '-o' '/tmp/graph18322410520133618859.bin' '-w' '/tmp/graph18322410520133618859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18322410520133618859.bin' '-l' '-1' '-v' '-w' '/tmp/graph18322410520133618859.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:42:08] [INFO ] Decomposing Gal with order
[2025-06-05 18:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:42:08] [INFO ] Removed a total of 54 redundant transitions.
[2025-06-05 18:42:09] [INFO ] Flatten gal took : 36 ms
[2025-06-05 18:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2025-06-05 18:42:09] [INFO ] Time to serialize gal into /tmp/LTL8518727276529040529.gal : 2 ms
[2025-06-05 18:42:09] [INFO ] Time to serialize properties into /tmp/LTL2685465877958783278.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8518727276529040529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2685465877958783278.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i4.u0.s2>=1)&&(i4.u8.l65>=1))"))U((G(!("((i4.u0.s2>=1)&&(i4.u8.l65>=1))")))||("((!((i4.u0.s1>=1)&&(u3.l30>=1)))&&(!((i4.u...189
Formula 0 simplified : FG("((i4.u0.s2>=1)&&(i4.u8.l65>=1))" M !"((!((i4.u0.s1>=1)&&(u3.l30>=1)))&&(!((i4.u0.s2>=1)&&(i4.u8.l65>=1))))")
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 finished in 96335 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(((X(X((X(G(!p1))&&F(!p2))))&&p0)||G((X(G(!p1))&&F(!p2)))))))'
Support contains 3 out of 67 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 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 60 transition count 62
Applied a total of 15 rules in 10 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:42:24] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:24] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-05 18:42:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:42:24] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:42:24] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:42:24] [INFO ] Invariant cache hit.
[2025-06-05 18:42:24] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:25] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:26] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:26] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 100 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:28] [INFO ] Deduced a trap along path composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 162 constraints, problems are : Problem set: 0 solved, 61 unsolved in 5680 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8837ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 8837ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9149 ms. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR p1 p2), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-04
Product exploration explored 100000 steps with 22387 reset in 108 ms.
Product exploration explored 100000 steps with 22423 reset in 219 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 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 59 ms :[(OR p1 p2), p2]
RANDOM walk for 40000 steps (8884 resets) in 235 ms. (169 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (1931 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1949 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2025-06-05 18:42:34] [INFO ] Invariant cache hit.
[2025-06-05 18:42:34] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/48 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/101 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/122 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/48 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/101 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/122 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 25 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p2) p1))), (F p1)]
Knowledge based reduction with 7 factoid took 139 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 :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 69 ms :[(OR p1 p2), p2]
Support contains 3 out of 60 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 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-05 18:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-05 18:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:42:34] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:42:34] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:42:34] [INFO ] Invariant cache hit.
[2025-06-05 18:42:34] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:35] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:35] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:35] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:35] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:35] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:36] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:36] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 100 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2803 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:38] [INFO ] Deduced a trap along path composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 162 constraints, problems are : Problem set: 0 solved, 61 unsolved in 5759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8605ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 8607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8791 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 68 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 64 ms :[(OR p1 p2), p2]
RANDOM walk for 40000 steps (8964 resets) in 114 ms. (347 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (1933 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2018 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
[2025-06-05 18:42:43] [INFO ] Invariant cache hit.
[2025-06-05 18:42:43] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/48 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/101 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/122 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/48 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/101 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/122 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1132 steps, including 99 resets, run visited all 2 properties in 5 ms. (steps per millisecond=226 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p2) p1))), (F p1)]
Knowledge based reduction with 7 factoid took 151 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 61 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 66 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 67 ms :[(OR p1 p2), p2]
Product exploration explored 100000 steps with 22313 reset in 105 ms.
Product exploration explored 100000 steps with 22299 reset in 167 ms.
Built C files in :
/tmp/ltsmin12215064885660250472
[2025-06-05 18:42:44] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2025-06-05 18:42:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:42:44] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2025-06-05 18:42:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:42:44] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2025-06-05 18:42:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:42:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12215064885660250472
Running compilation step : cd /tmp/ltsmin12215064885660250472;'/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 155 ms.
Running link step : cd /tmp/ltsmin12215064885660250472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12215064885660250472;'/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/stateBased18393273030169468286.hoa' '--buchi-type=spotba'
LTSmin run took 238 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 finished in 20964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 60 transition count 62
Applied a total of 15 rules in 7 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:42:45] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 18:42:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:42:45] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:42:45] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:42:45] [INFO ] Invariant cache hit.
[2025-06-05 18:42:45] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:46] [INFO ] Deduced a trap composed of 18 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-05 18:42:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:46] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:46] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:46] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 99 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2631 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:49] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:49] [INFO ] Deduced a trap along path composed of 14 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 162 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4899 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7545ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7735 ms. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 finished in 7793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(!p0)))) U G(!p1)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 59 transition count 61
Applied a total of 17 rules in 9 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 18:42:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:53] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-06-05 18:42:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:42:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:42:53] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:42:53] [INFO ] Invariant cache hit.
[2025-06-05 18:42:53] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:54] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:54] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:56] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:42:56] [INFO ] Deduced a trap along path composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4526 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6956ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6956ms
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7375 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
Product exploration explored 100000 steps with 29773 reset in 109 ms.
Product exploration explored 100000 steps with 29777 reset in 109 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
RANDOM walk for 40000 steps (8920 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1947 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1119 steps, run visited all 2 properties in 5 ms. (steps per millisecond=223 )
Probabilistic random walk after 1119 steps, saw 532 distinct states, run finished after 6 ms. (steps per millisecond=186 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 180 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2025-06-05 18:43:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:43:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 18:43:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:43:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:43:01] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:43:01] [INFO ] Invariant cache hit.
[2025-06-05 18:43:01] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:02] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:02] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:02] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:02] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:03] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:05] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:05] [INFO ] Deduced a trap along path composed of 14 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7128ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7128ms
Finished structural reductions in LTL mode , in 1 iterations and 7266 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
RANDOM walk for 40000 steps (8988 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1938 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1119 steps, run visited all 2 properties in 11 ms. (steps per millisecond=101 )
Probabilistic random walk after 1119 steps, saw 532 distinct states, run finished after 14 ms. (steps per millisecond=79 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 199 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 181 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 29739 reset in 105 ms.
Product exploration explored 100000 steps with 29824 reset in 104 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 207 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:43:10] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 18:43:10] [INFO ] Invariant cache hit.
[2025-06-05 18:43:10] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:11] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:12] [INFO ] Deduced a trap composed of 18 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-05 18:43:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:14] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:14] [INFO ] Deduced a trap along path composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7516ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7537 ms. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin5525232290310624705
[2025-06-05 18:43:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5525232290310624705
Running compilation step : cd /tmp/ltsmin5525232290310624705;'/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 125 ms.
Running link step : cd /tmp/ltsmin5525232290310624705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5525232290310624705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1396505223911477279.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2025-06-05 18:43:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:43:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-05 18:43:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:43:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:43:33] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:43:33] [INFO ] Invariant cache hit.
[2025-06-05 18:43:33] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:34] [INFO ] Deduced a trap composed of 19 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-05 18:43:34] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:37] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:43:37] [INFO ] Deduced a trap along path composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7046ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7046ms
Finished structural reductions in LTL mode , in 1 iterations and 7174 ms. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin15796682930561054300
[2025-06-05 18:43:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15796682930561054300
Running compilation step : cd /tmp/ltsmin15796682930561054300;'/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 139 ms.
Running link step : cd /tmp/ltsmin15796682930561054300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15796682930561054300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3347366214589974500.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:43:55] [INFO ] Flatten gal took : 8 ms
[2025-06-05 18:43:55] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:43:55] [INFO ] Time to serialize gal into /tmp/LTL1278713238938795497.gal : 0 ms
[2025-06-05 18:43:55] [INFO ] Time to serialize properties into /tmp/LTL576201756656691055.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1278713238938795497.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4518650290579728942.hoa' '-atoms' '/tmp/LTL576201756656691055.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL576201756656691055.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4518650290579728942.hoa
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t61, t62, t63, t66, t69, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 18:44:10] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:44:10] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:44:10] [INFO ] Time to serialize gal into /tmp/LTL14848033340690762754.gal : 1 ms
[2025-06-05 18:44:10] [INFO ] Time to serialize properties into /tmp/LTL3480174597744512244.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14848033340690762754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3480174597744512244.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F(!("((s1>=1)&&(l207>=1))"))))))U(G(!("((s2>=1)&&(l128>=1))")))))
Formula 0 simplified : XXXG"((s1>=1)&&(l207>=1))" R F"((s2>=1)&&(l128>=1))"
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t61, t62, t63, t66, t69, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 18:44:25] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:44:25] [INFO ] Applying decomposition
[2025-06-05 18:44:25] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15298728837798940501.txt' '-o' '/tmp/graph15298728837798940501.bin' '-w' '/tmp/graph15298728837798940501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15298728837798940501.bin' '-l' '-1' '-v' '-w' '/tmp/graph15298728837798940501.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:44:25] [INFO ] Decomposing Gal with order
[2025-06-05 18:44:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:44:25] [INFO ] Removed a total of 57 redundant transitions.
[2025-06-05 18:44:25] [INFO ] Flatten gal took : 8 ms
[2025-06-05 18:44:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 3 ms.
[2025-06-05 18:44:25] [INFO ] Time to serialize gal into /tmp/LTL17054377517355994522.gal : 1 ms
[2025-06-05 18:44:25] [INFO ] Time to serialize properties into /tmp/LTL12692107440055259218.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17054377517355994522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12692107440055259218.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F(!("((i4.i1.u0.s1>=1)&&(u10.l207>=1))"))))))U(G(!("((i4.i1.u0.s2>=1)&&(i3.u8.l128>=1))")))))
Formula 0 simplified : XXXG"((i4.i1.u0.s1>=1)&&(u10.l207>=1))" R F"((i4.i1.u0.s2>=1)&&(i3.u8.l128>=1))"
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 finished in 107985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 60 transition count 62
Applied a total of 15 rules in 3 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:44:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:40] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 18:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:44:40] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-05 18:44:40] [INFO ] Invariant cache hit.
[2025-06-05 18:44:40] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:41] [INFO ] Deduced a trap composed of 19 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-05 18:44:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:41] [INFO ] Deduced a trap composed of 20 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-05 18:44:42] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:42] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:42] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:42] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 99 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:44] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:44] [INFO ] Deduced a trap along path composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 162 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7291ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7291ms
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7420 ms. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 finished in 7814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((G(p1)&&p0)))||G(p2))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 60 transition count 62
Applied a total of 15 rules in 2 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:44:48] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 18:44:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:44:48] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-05 18:44:48] [INFO ] Invariant cache hit.
[2025-06-05 18:44:48] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:49] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:49] [INFO ] Deduced a trap composed of 19 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-05 18:44:49] [INFO ] Deduced a trap composed of 19 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-05 18:44:50] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:50] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:50] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:50] [INFO ] Deduced a trap composed of 20 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-05 18:44:50] [INFO ] Deduced a trap composed of 20 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-05 18:44:50] [INFO ] Deduced a trap composed of 20 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-05 18:44:50] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:53] [INFO ] Deduced a trap along path composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 165 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7474ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7474ms
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7653 ms. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p0 p1), false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 finished in 8032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 59 transition count 61
Applied a total of 17 rules in 6 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 18:44:56] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 18:44:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:44:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:44:56] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:44:56] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 18:44:56] [INFO ] Invariant cache hit.
[2025-06-05 18:44:56] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:57] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:44:58] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:00] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:00] [INFO ] Deduced a trap along path composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4578 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7016ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7016ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7185 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 86 ms :[p0, true, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-09
Product exploration explored 100000 steps with 22334 reset in 104 ms.
Product exploration explored 100000 steps with 22357 reset in 100 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, p0]
RANDOM walk for 40000 steps (8891 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1975 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1213 steps, run visited all 1 properties in 5 ms. (steps per millisecond=242 )
Probabilistic random walk after 1213 steps, saw 597 distinct states, run finished after 5 ms. (steps per millisecond=242 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 finished in 7755 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)&&(p1 U X(X(p0)))&&(p2 U !p1)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Applied a total of 10 rules in 3 ms. Remains 62 /67 variables (removed 5) and now considering 65/70 (removed 5) transitions.
// Phase 1: matrix 65 rows 62 cols
[2025-06-05 18:45:04] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 18:45:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:04] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-05 18:45:04] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-05 18:45:04] [INFO ] Invariant cache hit.
[2025-06-05 18:45:04] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:05] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:05] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:05] [INFO ] Deduced a trap composed of 19 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-05 18:45:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:06] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:06] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:07] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/127 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/127 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 104 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 27/104 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 64/168 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:09] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:10] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 170 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 9327ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 9327ms
Starting structural reductions in LTL mode, iteration 1 : 62/67 places, 65/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9496 ms. Remains : 62/67 places, 65/70 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1), (NOT p0), (NOT p0), true, (OR (NOT p0) p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 finished in 9849 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&&F(p1)))&&X(G(p2))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 60 transition count 62
Applied a total of 15 rules in 1 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:45:14] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 18:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:45:14] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-05 18:45:14] [INFO ] Invariant cache hit.
[2025-06-05 18:45:14] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:15] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:15] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:15] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2317 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:19] [INFO ] Deduced a trap along path composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 5505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7837ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7838ms
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7989 ms. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-12
Entered a terminal (fully accepting) state of product in 33620 steps with 7447 reset in 38 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 finished in 8259 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)&&G((G(p2)||p1))))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Applied a total of 12 rules in 1 ms. Remains 61 /67 variables (removed 6) and now considering 64/70 (removed 6) transitions.
// Phase 1: matrix 64 rows 61 cols
[2025-06-05 18:45:22] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 18:45:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:45:22] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-06-05 18:45:22] [INFO ] Invariant cache hit.
[2025-06-05 18:45:22] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:23] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:23] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:23] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:23] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:24] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:24] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:24] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:24] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:24] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:24] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 104 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:27] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 168 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7337ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7338ms
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 64/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7493 ms. Remains : 61/67 places, 64/70 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-13
Product exploration explored 100000 steps with 30963 reset in 143 ms.
Product exploration explored 100000 steps with 30844 reset in 159 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (8914 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1976 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4083 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4087 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2780931 steps, run timeout after 3001 ms. (steps per millisecond=926 ) properties seen :3 out of 4
Probabilistic random walk after 2780931 steps, saw 1258801 distinct states, run finished after 3006 ms. (steps per millisecond=925 ) properties seen :3
[2025-06-05 18:45:33] [INFO ] Invariant cache hit.
[2025-06-05 18:45:33] [INFO ] State equation strengthened by 26 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) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 51/125 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/61 constraints, ReadFeed: 0/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 61 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 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-05 18:45:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:34] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 18:45:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-05 18:45:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:45:34] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-05 18:45:34] [INFO ] Invariant cache hit.
[2025-06-05 18:45:34] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:36] [INFO ] Deduced a trap composed of 19 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-05 18:45:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 104 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:38] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 168 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4419 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7325ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7325ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7499 ms. Remains : 61/61 places, 64/64 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8975 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1986 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1977 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4220 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4088 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 3006663 steps, run timeout after 3001 ms. (steps per millisecond=1001 ) properties seen :3 out of 4
Probabilistic random walk after 3006663 steps, saw 1354893 distinct states, run finished after 3001 ms. (steps per millisecond=1001 ) properties seen :3
[2025-06-05 18:45:45] [INFO ] Invariant cache hit.
[2025-06-05 18:45:45] [INFO ] State equation strengthened by 26 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) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 51/125 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/61 constraints, ReadFeed: 0/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 22326 reset in 125 ms.
Product exploration explored 100000 steps with 22295 reset in 122 ms.
Built C files in :
/tmp/ltsmin15035691467599794428
[2025-06-05 18:45:46] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2025-06-05 18:45:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:45:46] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2025-06-05 18:45:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:45:46] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2025-06-05 18:45:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:45:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15035691467599794428
Running compilation step : cd /tmp/ltsmin15035691467599794428;'/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 157 ms.
Running link step : cd /tmp/ltsmin15035691467599794428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15035691467599794428;'/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/stateBased5831905201429624599.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 finished in 23817 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(G(p2))||p1)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 60 transition count 62
Applied a total of 15 rules in 8 ms. Remains 60 /67 variables (removed 7) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 18:45:46] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 18:45:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:45:46] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:45:46] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:45:46] [INFO ] Invariant cache hit.
[2025-06-05 18:45:46] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:46] [INFO ] Deduced a trap composed of 19 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-05 18:45:46] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:47] [INFO ] Deduced a trap composed of 20 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-05 18:45:47] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:47] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:47] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:48] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 99 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2587 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:50] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:50] [INFO ] Deduced a trap along path composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 162 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4881 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7481ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/67 places, 62/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7634 ms. Remains : 60/67 places, 62/70 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
Product exploration explored 100000 steps with 22361 reset in 115 ms.
Product exploration explored 100000 steps with 22467 reset in 131 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 128 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (9008 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4203 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4052 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4063 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4229 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4136 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (4054 resets) in 78 ms. (506 steps per ms) remains 5/7 properties
[2025-06-05 18:45:54] [INFO ] Invariant cache hit.
[2025-06-05 18:45:54] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/49 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/102 variables, 49/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/71 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/122 variables, 11/82 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 9/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/122 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 91 constraints, problems are : Problem set: 2 solved, 3 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/49 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/102 variables, 49/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/71 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/74 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 20/122 variables, 11/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 9/94 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/122 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 94 constraints, problems are : Problem set: 2 solved, 3 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Graph (complete) has 165 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 60
Applied a total of 3 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/60 places, 60/62 transitions.
RANDOM walk for 40000 steps (8990 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4104 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4131 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4131 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1405 steps, run visited all 3 properties in 10 ms. (steps per millisecond=140 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 10 ms. (steps per millisecond=140 ) properties seen :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (G (OR p1 p2 (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 19 factoid took 352 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 60 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 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-05 18:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 18:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:45:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:45:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:45:55] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 18:45:55] [INFO ] Invariant cache hit.
[2025-06-05 18:45:55] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:56] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:57] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:57] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:57] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 99 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2656 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:59] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:45:59] [INFO ] Deduced a trap along path composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 162 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4838 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7509ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7510ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7667 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 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 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8937 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4128 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 286 steps, run visited all 1 properties in 3 ms. (steps per millisecond=95 )
Probabilistic random walk after 286 steps, saw 152 distinct states, run finished after 3 ms. (steps per millisecond=95 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22248 reset in 90 ms.
Product exploration explored 100000 steps with 22611 reset in 105 ms.
Built C files in :
/tmp/ltsmin11973663747776239263
[2025-06-05 18:46:04] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2025-06-05 18:46:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:46:04] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2025-06-05 18:46:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:46:04] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2025-06-05 18:46:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:46:04] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11973663747776239263
Running compilation step : cd /tmp/ltsmin11973663747776239263;'/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 163 ms.
Running link step : cd /tmp/ltsmin11973663747776239263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11973663747776239263;'/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/stateBased974515021344776204.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 8 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 18:46:19] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:46:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 18:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:46:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:46:19] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:46:19] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 18:46:19] [INFO ] Invariant cache hit.
[2025-06-05 18:46:19] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:20] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:22] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:46:22] [INFO ] Deduced a trap along path composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6986ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6986ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7139 ms. Remains : 59/60 places, 61/62 transitions.
Built C files in :
/tmp/ltsmin6525382041426926744
[2025-06-05 18:46:26] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2025-06-05 18:46:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:46:26] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2025-06-05 18:46:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:46:26] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2025-06-05 18:46:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:46:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6525382041426926744
Running compilation step : cd /tmp/ltsmin6525382041426926744;'/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 154 ms.
Running link step : cd /tmp/ltsmin6525382041426926744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6525382041426926744;'/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/stateBased8159415275013859720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:46:41] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:46:41] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:46:41] [INFO ] Time to serialize gal into /tmp/LTL15424562182907963665.gal : 1 ms
[2025-06-05 18:46:41] [INFO ] Time to serialize properties into /tmp/LTL11771118432490616551.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15424562182907963665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5605796205387246428.hoa' '-atoms' '/tmp/LTL11771118432490616551.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11771118432490616551.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5605796205387246428.hoa
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t61, t62, t63, t66, t69, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 18:46:56] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:46:56] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:46:56] [INFO ] Time to serialize gal into /tmp/LTL15461527617546063170.gal : 0 ms
[2025-06-05 18:46:56] [INFO ] Time to serialize properties into /tmp/LTL1543011358222739581.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15461527617546063170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1543011358222739581.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s9<1)||(l89<1))")&&(("((s9<1)||(l89<1))")||(X(G("((p16>=1)&&(l0>=1))"))))))))
Formula 0 simplified : GF!"((s9<1)||(l89<1))"
Detected timeout of ITS tools.
[2025-06-05 18:47:11] [INFO ] Flatten gal took : 6 ms
[2025-06-05 18:47:11] [INFO ] Applying decomposition
[2025-06-05 18:47:11] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5790157964665518300.txt' '-o' '/tmp/graph5790157964665518300.bin' '-w' '/tmp/graph5790157964665518300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5790157964665518300.bin' '-l' '-1' '-v' '-w' '/tmp/graph5790157964665518300.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:47:11] [INFO ] Decomposing Gal with order
[2025-06-05 18:47:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:47:11] [INFO ] Removed a total of 56 redundant transitions.
[2025-06-05 18:47:11] [INFO ] Flatten gal took : 9 ms
[2025-06-05 18:47:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 2 ms.
[2025-06-05 18:47:11] [INFO ] Time to serialize gal into /tmp/LTL16751522932195262102.gal : 1 ms
[2025-06-05 18:47:11] [INFO ] Time to serialize properties into /tmp/LTL15163849409828766479.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16751522932195262102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15163849409828766479.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i4.u5.s9<1)||(i4.u7.l89<1))")&&(("((i4.u5.s9<1)||(i4.u7.l89<1))")||(X(G("((i7.u10.p16>=1)&&(i2.u0.l0>=1))"))))))))
Formula 0 simplified : GF!"((i4.u5.s9<1)||(i4.u7.l89<1))"
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 finished in 100261 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))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(!p0)))) U G(!p1)))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
Stuttering acceptance computed with spot in 249 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 59 transition count 61
Applied a total of 17 rules in 7 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
[2025-06-05 18:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:47:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 18:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:47:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:47:27] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:47:27] [INFO ] Invariant cache hit.
[2025-06-05 18:47:27] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:30] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:30] [INFO ] Deduced a trap along path composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7092ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7092ms
Starting structural reductions in LI_LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7237 ms. Remains : 59/67 places, 61/70 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
Product exploration explored 100000 steps with 29711 reset in 105 ms.
Product exploration explored 100000 steps with 29798 reset in 105 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
RANDOM walk for 40000 steps (8909 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1930 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1119 steps, run visited all 2 properties in 5 ms. (steps per millisecond=223 )
Probabilistic random walk after 1119 steps, saw 532 distinct states, run finished after 5 ms. (steps per millisecond=223 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 249 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2025-06-05 18:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:47:35] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 18:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:47:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:47:35] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:47:35] [INFO ] Invariant cache hit.
[2025-06-05 18:47:35] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:36] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:36] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:36] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:39] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:39] [INFO ] Deduced a trap along path composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6995ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6995ms
Finished structural reductions in LTL mode , in 1 iterations and 7125 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
RANDOM walk for 40000 steps (8837 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1119 steps, run visited all 2 properties in 5 ms. (steps per millisecond=223 )
Probabilistic random walk after 1119 steps, saw 532 distinct states, run finished after 5 ms. (steps per millisecond=223 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 179 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 155 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 29777 reset in 104 ms.
Product exploration explored 100000 steps with 29732 reset in 104 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 170 ms :[p1, p0, (AND p1 p0), p0, p0, (AND p0 p1)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:47:44] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 18:47:44] [INFO ] Invariant cache hit.
[2025-06-05 18:47:44] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:44] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:44] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:45] [INFO ] Deduced a trap composed of 19 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-05 18:47:45] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:45] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2520 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:47] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:47:48] [INFO ] Deduced a trap along path composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7100ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7110 ms. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin17260423319055970540
[2025-06-05 18:47:51] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17260423319055970540
Running compilation step : cd /tmp/ltsmin17260423319055970540;'/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 127 ms.
Running link step : cd /tmp/ltsmin17260423319055970540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17260423319055970540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13966512757914246825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2025-06-05 18:48:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:48:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 18:48:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:48:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:48:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:48:06] [INFO ] Invariant cache hit.
[2025-06-05 18:48:06] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:48:07] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:48:07] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:48:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:48:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:48:07] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:48:07] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:48:10] [INFO ] Deduced a trap along path composed of 3 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-05 18:48:10] [INFO ] Deduced a trap along path composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7078ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7078ms
Finished structural reductions in LTL mode , in 1 iterations and 7246 ms. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin3764600941894147705
[2025-06-05 18:48:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3764600941894147705
Running compilation step : cd /tmp/ltsmin3764600941894147705;'/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 127 ms.
Running link step : cd /tmp/ltsmin3764600941894147705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3764600941894147705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3572366813169289112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 18:48:28] [INFO ] Flatten gal took : 5 ms
[2025-06-05 18:48:28] [INFO ] Flatten gal took : 2 ms
[2025-06-05 18:48:28] [INFO ] Time to serialize gal into /tmp/LTL13094615383825633817.gal : 0 ms
[2025-06-05 18:48:28] [INFO ] Time to serialize properties into /tmp/LTL8043548001234503925.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13094615383825633817.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13614126037183786019.hoa' '-atoms' '/tmp/LTL8043548001234503925.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8043548001234503925.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13614126037183786019.hoa
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t61, t62, t63, t66, t69, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 18:48:43] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:48:43] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:48:43] [INFO ] Time to serialize gal into /tmp/LTL5220125132750407007.gal : 1 ms
[2025-06-05 18:48:43] [INFO ] Time to serialize properties into /tmp/LTL18380413738906374381.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5220125132750407007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18380413738906374381.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F(!("((s1>=1)&&(l207>=1))"))))))U(G(!("((s2>=1)&&(l128>=1))")))))
Formula 0 simplified : XXXG"((s1>=1)&&(l207>=1))" R F"((s2>=1)&&(l128>=1))"
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t61, t62, t63, t66, t69, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 18:48:58] [INFO ] Flatten gal took : 4 ms
[2025-06-05 18:48:58] [INFO ] Applying decomposition
[2025-06-05 18:48:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2875478230061897529.txt' '-o' '/tmp/graph2875478230061897529.bin' '-w' '/tmp/graph2875478230061897529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2875478230061897529.bin' '-l' '-1' '-v' '-w' '/tmp/graph2875478230061897529.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:48:58] [INFO ] Decomposing Gal with order
[2025-06-05 18:48:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:48:59] [INFO ] Removed a total of 57 redundant transitions.
[2025-06-05 18:48:59] [INFO ] Flatten gal took : 7 ms
[2025-06-05 18:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 2 ms.
[2025-06-05 18:48:59] [INFO ] Time to serialize gal into /tmp/LTL4082163777317835978.gal : 1 ms
[2025-06-05 18:48:59] [INFO ] Time to serialize properties into /tmp/LTL96057144183980556.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4082163777317835978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL96057144183980556.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F(!("((i5.u0.s1>=1)&&(u13.l207>=1))"))))))U(G(!("((i5.u0.s2>=1)&&(i5.u9.l128>=1))")))))
Formula 0 simplified : XXXG"((i5.u0.s1>=1)&&(u13.l207>=1))" R F"((i5.u0.s2>=1)&&(i5.u9.l128>=1))"
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 finished in 107353 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(G(p2))||p1)))))'
[2025-06-05 18:49:14] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2854705501739732648
[2025-06-05 18:49:14] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2025-06-05 18:49:14] [INFO ] Applying decomposition
[2025-06-05 18:49:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:49:14] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2025-06-05 18:49:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:49:14] [INFO ] Flatten gal took : 3 ms
[2025-06-05 18:49:14] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2025-06-05 18:49:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:49:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2854705501739732648
Running compilation step : cd /tmp/ltsmin2854705501739732648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17157773386578317709.txt' '-o' '/tmp/graph17157773386578317709.bin' '-w' '/tmp/graph17157773386578317709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17157773386578317709.bin' '-l' '-1' '-v' '-w' '/tmp/graph17157773386578317709.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:49:14] [INFO ] Decomposing Gal with order
[2025-06-05 18:49:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:49:14] [INFO ] Removed a total of 64 redundant transitions.
[2025-06-05 18:49:14] [INFO ] Flatten gal took : 7 ms
[2025-06-05 18:49:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 2 ms.
[2025-06-05 18:49:14] [INFO ] Time to serialize gal into /tmp/LTLFireability15799274433252961705.gal : 1 ms
[2025-06-05 18:49:14] [INFO ] Time to serialize properties into /tmp/LTLFireability13329841151140416259.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15799274433252961705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13329841151140416259.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((G(F((!("((i0.u0.s2>=1)&&(i5.u8.l65>=1))"))U(("((!((i0.u0.s1>=1)&&(u3.l30>=1)))&&(!((i0.u0.s2>=1)&&(i5.u8.l65>=1))))")||(G(!("((i0.u...189
Formula 0 simplified : FG("((i0.u0.s2>=1)&&(i5.u8.l65>=1))" M !"((!((i0.u0.s1>=1)&&(u3.l30>=1)))&&(!((i0.u0.s2>=1)&&(i5.u8.l65>=1))))")
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin2854705501739732648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2854705501739732648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2854705501739732648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2854705501739732648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X(<>(!(LTLAPp2==true))))) U [](!(LTLAPp3==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: (X(X(X(<>(!(LTLAPp2==true))))) U [](!(LTLAPp3==true)))
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: "(X(X(X(<>(!(LTLAPp2==true))))) U [](!(LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: There are 78 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.030: State length is 68, there are 82 groups
pins2lts-mc-linux64( 0/ 8), 0.030: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.030: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.030: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.030: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.041: [Blue] ~37 levels ~960 states ~3016 transitions
pins2lts-mc-linux64( 6/ 8), 0.048: [Blue] ~67 levels ~1920 states ~5528 transitions
pins2lts-mc-linux64( 6/ 8), 0.058: [Blue] ~113 levels ~3840 states ~10344 transitions
pins2lts-mc-linux64( 6/ 8), 0.079: [Blue] ~210 levels ~7680 states ~20296 transitions
pins2lts-mc-linux64( 3/ 8), 0.133: [Blue] ~363 levels ~15360 states ~46104 transitions
pins2lts-mc-linux64( 3/ 8), 0.239: [Blue] ~673 levels ~30720 states ~88328 transitions
pins2lts-mc-linux64( 3/ 8), 0.514: [Blue] ~1267 levels ~61440 states ~166824 transitions
pins2lts-mc-linux64( 7/ 8), 0.822: [Blue] ~968 levels ~122880 states ~297448 transitions
pins2lts-mc-linux64( 7/ 8), 1.367: [Blue] ~1048 levels ~245760 states ~563880 transitions
pins2lts-mc-linux64( 7/ 8), 2.037: [Blue] ~1237 levels ~491520 states ~1115560 transitions
pins2lts-mc-linux64( 5/ 8), 2.943: [Blue] ~2249 levels ~983040 states ~2265584 transitions
pins2lts-mc-linux64( 5/ 8), 4.348: [Blue] ~4108 levels ~1966080 states ~4602272 transitions
pins2lts-mc-linux64( 1/ 8), 7.180: [Blue] ~12808 levels ~3932160 states ~9773656 transitions
pins2lts-mc-linux64( 5/ 8), 13.195: [Blue] ~22102 levels ~7864320 states ~19403360 transitions
pins2lts-mc-linux64( 1/ 8), 25.368: [Blue] ~54668 levels ~15728640 states ~40419992 transitions
pins2lts-mc-linux64( 1/ 8), 50.662: [Blue] ~115107 levels ~31457280 states ~82197368 transitions
pins2lts-mc-linux64( 1/ 8), 102.478: [Blue] ~240844 levels ~62914560 states ~169014360 transitions
pins2lts-mc-linux64( 3/ 8), 232.491: [Blue] ~420359 levels ~125829120 states ~388127240 transitions
pins2lts-mc-linux64( 4/ 8), 310.674: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 310.697:
pins2lts-mc-linux64( 0/ 8), 310.697: Explored 145991497 states 510048109 transitions, fanout: 3.494
pins2lts-mc-linux64( 0/ 8), 310.697: Total exploration time 310.660 sec (310.640 sec minimum, 310.650 sec on average)
pins2lts-mc-linux64( 0/ 8), 310.697: States per second: 469940, Transitions per second: 1641821
pins2lts-mc-linux64( 0/ 8), 310.697:
pins2lts-mc-linux64( 0/ 8), 310.697: State space has 134214371 states, 3151 are accepting
pins2lts-mc-linux64( 0/ 8), 310.697: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 310.697: blue states: 145991497 (108.77%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 310.697: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 310.697: all-red states: 66999706 (49.92%), bogus 4157 (0.00%)
pins2lts-mc-linux64( 0/ 8), 310.697:
pins2lts-mc-linux64( 0/ 8), 310.697: Total memory used for local state coloring: 67.4MB
pins2lts-mc-linux64( 0/ 8), 310.697:
pins2lts-mc-linux64( 0/ 8), 310.697: Queue width: 8B, total height: 4415151, memory: 33.68MB
pins2lts-mc-linux64( 0/ 8), 310.697: Tree memory: 1115.8MB, 8.7 B/state, compr.: 3.2%
pins2lts-mc-linux64( 0/ 8), 310.697: Tree fill ratio (roots/leafs): 99.0%/35.0%
pins2lts-mc-linux64( 0/ 8), 310.697: Stored 71 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 310.697: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 310.697: Est. total memory use: 1149.5MB (~1057.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2854705501739732648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X(<>(!(LTLAPp2==true))))) U [](!(LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2854705501739732648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X(<>(!(LTLAPp2==true))))) U [](!(LTLAPp3==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Reverse transition relation is NOT exact ! Due to transitions t7, t20, t45, t49, t51, t52, t53, t54, t55, t56, t58, t59, t60, t61, t62, t69, i0.t67, i0.t63...265
Computing Next relation with stutter on 2.49792e+09 deadlock states
62 unique states visited
0 strongly connected components in search stack
92 transitions explored
47 items max in DFS search stack
69838 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,698.406,2615376,1,0,2.80432e+06,474031,652,5.74774e+06,328,1.32957e+06,1642023
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(X(X(F(!("((i0.u0.s1>=1)&&(i0.u11.l207>=1))"))))))U(G(!("((i0.u0.s2>=1)&&(i5.u8.l128>=1))")))))
Formula 1 simplified : XXXG"((i0.u0.s1>=1)&&(i0.u11.l207>=1))" R F"((i0.u0.s2>=1)&&(i5.u8.l128>=1))"
Computing Next relation with stutter on 2.49792e+09 deadlock states
Detected timeout of ITS tools.
[2025-06-05 19:12:18] [INFO ] Flatten gal took : 8 ms
[2025-06-05 19:12:18] [INFO ] Time to serialize gal into /tmp/LTLFireability3992464980531708329.gal : 1 ms
[2025-06-05 19:12:18] [INFO ] Time to serialize properties into /tmp/LTLFireability2363558476264055945.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3992464980531708329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2363558476264055945.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !(((X(X(X(F(!("((s1>=1)&&(l207>=1))"))))))U(G(!("((s2>=1)&&(l128>=1))")))))
Formula 0 simplified : XXXG"((s1>=1)&&(l207>=1))" R F"((s2>=1)&&(l128>=1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t10, t20, t45, t49, t50, t51, t52, t53, t54, t55, t56, t58, t59, t60, t61, t62, t...277
Computing Next relation with stutter on 2.49792e+09 deadlock states
141 unique states visited
0 strongly connected components in search stack
323 transitions explored
49 items max in DFS search stack
40303 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,403.05,2682140,1,0,1837,1.35918e+07,29,1368,1284,1.77609e+07,1626
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(("((s9<1)||(l89<1))")&&(("((s9<1)||(l89<1))")||(X(G("((p16>=1)&&(l0>=1))"))))))))
Formula 1 simplified : GF!"((s9<1)||(l89<1))"
Computing Next relation with stutter on 2.49792e+09 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
81031 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1213.36,4374392,1,0,6571,2.10601e+07,20,5336,1162,2.78239e+07,9218
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 3171182 ms.

BK_STOP 1749151973259

--------------------
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="SieveSingleMsgMbox-PT-d0m36"
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 SieveSingleMsgMbox-PT-d0m36, 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 r212-tall-174901994200380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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