Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 1.1M 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-d2m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749179296012

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-d2m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 03:08:17] [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-06 03:08:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 03:08:17] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2025-06-06 03:08:17] [INFO ] Transformed 2398 places.
[2025-06-06 03:08:17] [INFO ] Transformed 1954 transitions.
[2025-06-06 03:08:17] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1984 places in 28 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 957 place count 285 transition count 589
Iterating global reduction 1 with 104 rules applied. Total rules applied 1061 place count 285 transition count 589
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1074 place count 285 transition count 576
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1151 place count 208 transition count 499
Iterating global reduction 2 with 77 rules applied. Total rules applied 1228 place count 208 transition count 499
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1262 place count 208 transition count 465
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1290 place count 180 transition count 430
Iterating global reduction 3 with 28 rules applied. Total rules applied 1318 place count 180 transition count 430
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1381 place count 180 transition count 367
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1387 place count 174 transition count 356
Iterating global reduction 4 with 6 rules applied. Total rules applied 1393 place count 174 transition count 356
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1399 place count 168 transition count 350
Iterating global reduction 4 with 6 rules applied. Total rules applied 1405 place count 168 transition count 350
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1408 place count 165 transition count 347
Iterating global reduction 4 with 3 rules applied. Total rules applied 1411 place count 165 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1412 place count 164 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 1413 place count 164 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1414 place count 163 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 163 transition count 345
Applied a total of 1415 rules in 90 ms. Remains 163 /414 variables (removed 251) and now considering 345/1954 (removed 1609) transitions.
// Phase 1: matrix 345 rows 163 cols
[2025-06-06 03:08:17] [INFO ] Computed 5 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:08:18] [INFO ] Implicit Places using invariants in 442 ms returned []
[2025-06-06 03:08:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:08:18] [INFO ] State equation strengthened by 223 read => feed constraints.
[2025-06-06 03:08:19] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2025-06-06 03:08:19] [INFO ] Invariant cache hit.
[2025-06-06 03:08:19] [INFO ] State equation strengthened by 223 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:23] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:23] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:23] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:23] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (OVERLAPS) 1/163 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:28] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (OVERLAPS) 345/508 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 223/396 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:36] [INFO ] Deduced a trap composed of 43 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-06 03:08:40] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:40] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:40] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:40] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:40] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 6/402 constraints. Problems are: Problem set: 4 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 402 constraints, problems are : Problem set: 4 solved, 340 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 163/163 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 340 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 5/163 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 11/16 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 345/508 variables, 163/179 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 223/402 constraints. Problems are: Problem set: 4 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 340/742 constraints. Problems are: Problem set: 4 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 742 constraints, problems are : Problem set: 4 solved, 340 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 163/163 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 340/344 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60760ms problems are : Problem set: 4 solved, 340 unsolved
Search for dead transitions found 4 dead transitions in 60777ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 163/414 places, 341/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 341
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 3 rules in 5 ms. Remains 160 /163 variables (removed 3) and now considering 341/341 (removed 0) transitions.
// Phase 1: matrix 341 rows 160 cols
[2025-06-06 03:09:20] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:09:20] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-06 03:09:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:09:20] [INFO ] State equation strengthened by 222 read => feed constraints.
[2025-06-06 03:09:22] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/414 places, 341/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64447 ms. Remains : 160/414 places, 341/1954 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 20 out of 159 places after structural reductions.
[2025-06-06 03:09:22] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-06 03:09:22] [INFO ] Flatten gal took : 43 ms
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 03:09:22] [INFO ] Flatten gal took : 22 ms
[2025-06-06 03:09:22] [INFO ] Input system was already deterministic with 341 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8989 resets) in 2339 ms. (17 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (193 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (174 resets) in 68 ms. (58 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (181 resets) in 66 ms. (59 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (203 resets) in 84 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (187 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (181 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (193 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (184 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (176 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (187 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (203 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (182 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (179 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (193 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (183 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (217 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (186 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 450226 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :12 out of 17
Probabilistic random walk after 450226 steps, saw 205661 distinct states, run finished after 3005 ms. (steps per millisecond=149 ) properties seen :12
// Phase 1: matrix 341 rows 159 cols
[2025-06-06 03:09:26] [INFO ] Computed 4 invariants in 2 ms
[2025-06-06 03:09:26] [INFO ] State equation strengthened by 222 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/119 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 218/337 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 99/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 163/500 variables, 40/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 123/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/500 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 385 constraints, problems are : Problem set: 0 solved, 5 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 159/159 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/119 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 218/337 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 99/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 163/500 variables, 40/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 123/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:28] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:28] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/500 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 392 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 159/159 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4721ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4375 ms.
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 341/341 transitions.
Graph (complete) has 592 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 158 transition count 339
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 148 transition count 233
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 148 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 138 transition count 223
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 138 transition count 223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 138 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 133 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 133 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 62 place count 133 transition count 205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 131 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 131 transition count 203
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 129 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 129 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 127 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 127 transition count 198
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 79 place count 127 transition count 193
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 125 transition count 191
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 125 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 124 transition count 190
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 124 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 123 transition count 189
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 123 transition count 189
Applied a total of 87 rules in 51 ms. Remains 123 /159 variables (removed 36) and now considering 189/341 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 123/159 places, 189/341 transitions.
RANDOM walk for 40000 steps (8964 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1870 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1837 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1870 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1912 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 519520 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 5
Probabilistic random walk after 519520 steps, saw 226285 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
// Phase 1: matrix 189 rows 123 cols
[2025-06-06 03:09:38] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 03:09:38] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 171/246 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 82/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 66/312 variables, 48/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 18/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/312 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 226 constraints, problems are : Problem set: 0 solved, 5 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 123/123 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:39] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 171/246 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 82/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 66/312 variables, 48/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 18/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:39] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:40] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/312 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 234 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2823 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 123/123 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3218ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3169 ms.
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 189/189 transitions.
Applied a total of 0 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 123/123 places, 189/189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 189/189 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-06-06 03:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:09:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 03:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:09:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-06 03:09:45] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:09:45] [INFO ] Redundant transitions in 9 ms returned []
Running 188 sub problems to find dead transitions.
[2025-06-06 03:09:45] [INFO ] Invariant cache hit.
[2025-06-06 03:09:45] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 4 (OVERLAPS) 189/312 variables, 123/126 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 100/226 constraints. Problems are: Problem set: 3 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:51] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:09:57] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/312 variables, 1/228 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 228 constraints, problems are : Problem set: 3 solved, 185 unsolved in 26949 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 123/123 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 188/308 variables, 120/123 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 99/222 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 19/241 constraints. Problems are: Problem set: 3 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:10:27] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:10:27] [INFO ] Deduced a trap along path composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/243 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/243 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 4/312 variables, 3/246 constraints. Problems are: Problem set: 3 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/247 constraints. Problems are: Problem set: 3 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 413 constraints, problems are : Problem set: 3 solved, 185 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 123/123 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 185/188 constraints, Known Traps: 0/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57098ms problems are : Problem set: 3 solved, 185 unsolved
Search for dead transitions found 3 dead transitions in 57099ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 186/189 transitions.
Graph (complete) has 387 edges and 123 vertex of which 120 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 120 /123 variables (removed 3) and now considering 186/186 (removed 0) transitions.
// Phase 1: matrix 186 rows 120 cols
[2025-06-06 03:10:42] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:10:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 03:10:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:10:42] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-06 03:10:43] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 120/123 places, 186/189 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58157 ms. Remains : 120/123 places, 186/189 transitions.
RANDOM walk for 40000 steps (8963 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1826 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1920 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 514818 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 5
Probabilistic random walk after 514818 steps, saw 224191 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2025-06-06 03:10:46] [INFO ] Invariant cache hit.
[2025-06-06 03:10:46] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 169/244 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 82/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 62/306 variables, 45/205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 17/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 222 constraints, problems are : Problem set: 0 solved, 5 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:10:46] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 169/244 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 82/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 62/306 variables, 45/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 17/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/306 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 228 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2468 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2797ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3152 ms.
Support contains 7 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 120/120 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2025-06-06 03:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:10:52] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 03:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:10:52] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-06 03:10:52] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:10:52] [INFO ] Redundant transitions in 10 ms returned []
Running 185 sub problems to find dead transitions.
[2025-06-06 03:10:52] [INFO ] Invariant cache hit.
[2025-06-06 03:10:52] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/306 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 99/222 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 222 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9558 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/306 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 99/222 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 185/407 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:12] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 1/408 constraints. Problems are: Problem set: 9 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 408 constraints, problems are : Problem set: 9 solved, 176 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39648ms problems are : Problem set: 9 solved, 176 unsolved
Search for dead transitions found 9 dead transitions in 39649ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/120 places, 177/186 transitions.
Graph (complete) has 367 edges and 120 vertex of which 114 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 114 /120 variables (removed 6) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 114 cols
[2025-06-06 03:11:32] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:11:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 03:11:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:11:32] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-06 03:11:33] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 114/120 places, 176/186 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40684 ms. Remains : 114/120 places, 176/186 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Computed a total of 38 stabilizing places and 59 stable transitions
Graph (complete) has 650 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 144 transition count 193
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 144 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 144 transition count 192
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 129 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 129 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 129 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 119 transition count 154
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 119 transition count 154
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 119 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 115 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 115 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 111 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 108 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 108 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 108 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 105 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 105 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 126 place count 103 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 103 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 102 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 102 transition count 125
Applied a total of 130 rules in 31 ms. Remains 102 /159 variables (removed 57) and now considering 125/341 (removed 216) transitions.
// Phase 1: matrix 125 rows 102 cols
[2025-06-06 03:11:33] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:11:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-06 03:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:11:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 03:11:33] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:11:33] [INFO ] Redundant transitions in 3 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-06 03:11:33] [INFO ] Invariant cache hit.
[2025-06-06 03:11:33] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 5 (OVERLAPS) 125/227 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 162 constraints, problems are : Problem set: 3 solved, 121 unsolved in 5476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 125/226 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:42] [INFO ] Deduced a trap along path composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 1/227 variables, 1/180 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 104/284 constraints. Problems are: Problem set: 3 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:11:52] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 1/285 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 16 (OVERLAPS) 0/227 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 285 constraints, problems are : Problem set: 3 solved, 121 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 121/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35525ms problems are : Problem set: 3 solved, 121 unsolved
Search for dead transitions found 3 dead transitions in 35526ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/159 places, 122/341 transitions.
Graph (complete) has 324 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 99 /102 variables (removed 3) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 99 cols
[2025-06-06 03:12:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:09] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 03:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:09] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 03:12:09] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/159 places, 122/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36303 ms. Remains : 99/159 places, 122/341 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 finished in 36532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p0)))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 144 transition count 193
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 144 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 144 transition count 192
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 129 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 129 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 66 place count 129 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 119 transition count 155
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 119 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 93 place count 119 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 115 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 115 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 111 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 111 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 108 transition count 134
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 108 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 105 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 105 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 103 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 102 transition count 126
Applied a total of 129 rules in 11 ms. Remains 102 /159 variables (removed 57) and now considering 126/341 (removed 215) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 03:12:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 03:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 03:12:10] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-06 03:12:10] [INFO ] Invariant cache hit.
[2025-06-06 03:12:10] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 4512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:12:18] [INFO ] Deduced a trap along path composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/180 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 105/285 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 15 (OVERLAPS) 0/228 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 285 constraints, problems are : Problem set: 3 solved, 122 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34561ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 34561ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/159 places, 123/341 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 123
Applied a total of 3 rules in 1 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2025-06-06 03:12:44] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-06 03:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 03:12:45] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/159 places, 123/341 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35307 ms. Remains : 99/159 places, 123/341 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 finished in 35443 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 p1)||X(X(p2))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 145 transition count 194
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 145 transition count 194
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 131 transition count 180
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 131 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 131 transition count 175
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 122 transition count 159
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 122 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 114 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 114 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 112 transition count 141
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 112 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 112 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 110 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 110 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 109 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 109 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 108 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 108 transition count 135
Applied a total of 116 rules in 26 ms. Remains 108 /159 variables (removed 51) and now considering 135/341 (removed 206) transitions.
// Phase 1: matrix 135 rows 108 cols
[2025-06-06 03:12:45] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 03:12:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:45] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 03:12:45] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-06 03:12:45] [INFO ] Invariant cache hit.
[2025-06-06 03:12:45] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 5 (OVERLAPS) 135/243 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 59/171 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:12:50] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/243 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 172 constraints, problems are : Problem set: 3 solved, 131 unsolved in 9169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 135/242 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 59/170 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 18/188 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:12:56] [INFO ] Deduced a trap along path composed of 21 places in 21 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 1/243 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 113/303 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:10] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 5 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 0/305 constraints. Problems are: Problem set: 5 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 305 constraints, problems are : Problem set: 5 solved, 129 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/134 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39228ms problems are : Problem set: 5 solved, 129 unsolved
Search for dead transitions found 5 dead transitions in 39229ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/159 places, 130/341 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 103 transition count 130
Applied a total of 5 rules in 3 ms. Remains 103 /108 variables (removed 5) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 103 cols
[2025-06-06 03:13:25] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:13:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 03:13:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:13:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 03:13:25] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/159 places, 130/341 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40085 ms. Remains : 103/159 places, 130/341 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 277 ms.
Product exploration explored 100000 steps with 33333 reset in 195 ms.
Computed a total of 20 stabilizing places and 27 stable transitions
Graph (complete) has 337 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-03 finished in 40811 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 144 transition count 193
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 144 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 144 transition count 192
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 129 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 129 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 66 place count 129 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 119 transition count 155
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 119 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 93 place count 119 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 115 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 115 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 111 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 111 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 108 transition count 134
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 108 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 105 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 105 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 103 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 102 transition count 126
Applied a total of 129 rules in 24 ms. Remains 102 /159 variables (removed 57) and now considering 126/341 (removed 215) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 03:13:26] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:13:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 03:13:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:13:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 03:13:26] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:13:26] [INFO ] Redundant transitions in 0 ms returned []
Running 125 sub problems to find dead transitions.
[2025-06-06 03:13:26] [INFO ] Invariant cache hit.
[2025-06-06 03:13:26] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 5151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:35] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:37] [INFO ] Deduced a trap composed of 29 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-06 03:13:37] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 2/181 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 1/228 variables, 1/182 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 105/287 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:46] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 1/288 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:13:53] [INFO ] Deduced a trap along path composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 1/289 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 289 constraints, problems are : Problem set: 3 solved, 122 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 35198ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 35199ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/159 places, 123/341 transitions.
Graph (complete) has 325 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2025-06-06 03:14:01] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:01] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-06 03:14:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 03:14:02] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/159 places, 123/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35993 ms. Remains : 99/159 places, 123/341 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 finished in 36051 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 (X(X(X(!p1)))&&F(p0))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 145 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 145 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 145 transition count 205
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 131 transition count 191
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 131 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 61 place count 131 transition count 187
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 122 transition count 172
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 122 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 119 transition count 163
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 119 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 116 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 116 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 113 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 113 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 113 transition count 151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 110 transition count 148
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 110 transition count 148
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 108 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 107 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 107 transition count 145
Applied a total of 118 rules in 19 ms. Remains 107 /159 variables (removed 52) and now considering 145/341 (removed 196) transitions.
// Phase 1: matrix 145 rows 107 cols
[2025-06-06 03:14:02] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:02] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 03:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:02] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 03:14:02] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-06 03:14:02] [INFO ] Invariant cache hit.
[2025-06-06 03:14:02] [INFO ] State equation strengthened by 70 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 5 (OVERLAPS) 145/252 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 70/181 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 181 constraints, problems are : Problem set: 3 solved, 141 unsolved in 6273 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 145/251 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 70/180 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/198 constraints. Problems are: Problem set: 3 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:13] [INFO ] Deduced a trap along path composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/199 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/199 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 1/252 variables, 1/200 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 123/323 constraints. Problems are: Problem set: 3 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:29] [INFO ] Deduced a trap along path composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/324 constraints. Problems are: Problem set: 3 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/252 variables, and 324 constraints, problems are : Problem set: 3 solved, 141 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 141/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36343ms problems are : Problem set: 3 solved, 141 unsolved
Search for dead transitions found 3 dead transitions in 36344ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 107/159 places, 142/341 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 104 transition count 142
Applied a total of 3 rules in 2 ms. Remains 104 /107 variables (removed 3) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 104 cols
[2025-06-06 03:14:39] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 03:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:39] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 03:14:39] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/159 places, 142/341 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37325 ms. Remains : 104/159 places, 142/341 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) p1), p1, (NOT p0), p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 finished in 37677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 145 transition count 194
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 145 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 145 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 131 transition count 179
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 131 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 131 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 122 transition count 158
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 122 transition count 158
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 87 place count 122 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 119 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 116 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 116 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 114 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 114 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 114 transition count 139
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 112 transition count 137
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 112 transition count 137
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 111 transition count 136
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 111 transition count 136
Applied a total of 111 rules in 21 ms. Remains 111 /159 variables (removed 48) and now considering 136/341 (removed 205) transitions.
// Phase 1: matrix 136 rows 111 cols
[2025-06-06 03:14:39] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 03:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-06 03:14:40] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:14:40] [INFO ] Redundant transitions in 2 ms returned []
Running 135 sub problems to find dead transitions.
[2025-06-06 03:14:40] [INFO ] Invariant cache hit.
[2025-06-06 03:14:40] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 5 (OVERLAPS) 136/247 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 60/175 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 3 solved, 132 unsolved in 5700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 136/246 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 60/174 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 18/192 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:50] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 12 (OVERLAPS) 1/247 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 114/308 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:08] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/309 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 309 constraints, problems are : Problem set: 3 solved, 132 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 132/135 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35766ms problems are : Problem set: 3 solved, 132 unsolved
Search for dead transitions found 3 dead transitions in 35767ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/159 places, 133/341 transitions.
Graph (complete) has 353 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 108 /111 variables (removed 3) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 108 cols
[2025-06-06 03:15:16] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:16] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-06 03:15:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 03:15:16] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/159 places, 133/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36664 ms. Remains : 108/159 places, 133/341 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 finished in 36773 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)||p1)) U p2) U (!(p3 U p0)&&F(p3))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 146 transition count 207
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 146 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 146 transition count 206
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 40 place count 133 transition count 193
Iterating global reduction 1 with 13 rules applied. Total rules applied 53 place count 133 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 133 transition count 188
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 125 transition count 175
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 125 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 125 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 123 transition count 168
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 123 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 121 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 121 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 119 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 119 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 117 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 114 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 114 transition count 156
Applied a total of 101 rules in 23 ms. Remains 114 /159 variables (removed 45) and now considering 156/341 (removed 185) transitions.
// Phase 1: matrix 156 rows 114 cols
[2025-06-06 03:15:16] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 03:15:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2025-06-06 03:15:17] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:15:17] [INFO ] Redundant transitions in 1 ms returned []
Running 155 sub problems to find dead transitions.
[2025-06-06 03:15:17] [INFO ] Invariant cache hit.
[2025-06-06 03:15:17] [INFO ] State equation strengthened by 77 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:18] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 6 (OVERLAPS) 156/270 variables, 114/119 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 77/196 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 196 constraints, problems are : Problem set: 3 solved, 152 unsolved in 10503 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 2/113 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 156/269 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 77/195 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 18/213 constraints. Problems are: Problem set: 3 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:32] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/214 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 1/270 variables, 1/215 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 134/349 constraints. Problems are: Problem set: 3 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:15:46] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 1/350 constraints. Problems are: Problem set: 3 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 350 constraints, problems are : Problem set: 3 solved, 152 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 152/155 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40574ms problems are : Problem set: 3 solved, 152 unsolved
Search for dead transitions found 3 dead transitions in 40576ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/159 places, 153/341 transitions.
Graph (complete) has 377 edges and 114 vertex of which 111 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 111 /114 variables (removed 3) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 111 cols
[2025-06-06 03:15:57] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 03:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:57] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-06 03:15:58] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/159 places, 153/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41479 ms. Remains : 111/159 places, 153/341 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p3) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p3), false, p0, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 finished in 41771 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 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 145 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 145 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 145 transition count 205
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 131 transition count 191
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 131 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 61 place count 131 transition count 187
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 122 transition count 172
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 122 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 119 transition count 163
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 119 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 116 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 116 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 114 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 114 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 112 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 112 transition count 153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 110 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 110 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 109 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 109 transition count 150
Applied a total of 111 rules in 15 ms. Remains 109 /159 variables (removed 50) and now considering 150/341 (removed 191) transitions.
// Phase 1: matrix 150 rows 109 cols
[2025-06-06 03:15:58] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 03:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:15:58] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 03:15:58] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:15:58] [INFO ] Redundant transitions in 1 ms returned []
Running 149 sub problems to find dead transitions.
[2025-06-06 03:15:58] [INFO ] Invariant cache hit.
[2025-06-06 03:15:58] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 5 (OVERLAPS) 150/259 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 187 constraints, problems are : Problem set: 3 solved, 146 unsolved in 6814 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:16:06] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 2/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 150/258 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 18/205 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:16:10] [INFO ] Deduced a trap along path composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 1/206 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/206 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 1/259 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 128/335 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:16:23] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 1/336 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 336 constraints, problems are : Problem set: 3 solved, 146 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36881ms problems are : Problem set: 3 solved, 146 unsolved
Search for dead transitions found 3 dead transitions in 36882ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 109/159 places, 147/341 transitions.
Graph (complete) has 361 edges and 109 vertex of which 106 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 106 /109 variables (removed 3) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 106 cols
[2025-06-06 03:16:35] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:16:35] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 03:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:16:35] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 03:16:36] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/159 places, 147/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37828 ms. Remains : 106/159 places, 147/341 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 finished in 37906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 145 transition count 195
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 145 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 145 transition count 194
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 131 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 131 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 131 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 122 transition count 158
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 122 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 122 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 119 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 119 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 116 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 116 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 114 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 114 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 114 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 112 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 112 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 111 transition count 138
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 111 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 110 transition count 137
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 110 transition count 137
Applied a total of 113 rules in 15 ms. Remains 110 /159 variables (removed 49) and now considering 137/341 (removed 204) transitions.
// Phase 1: matrix 137 rows 110 cols
[2025-06-06 03:16:36] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:16:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 03:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:16:36] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-06 03:16:36] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:16:36] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-06 03:16:36] [INFO ] Invariant cache hit.
[2025-06-06 03:16:36] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 5 (OVERLAPS) 137/247 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 61/175 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:16:41] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/247 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/247 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 176 constraints, problems are : Problem set: 3 solved, 133 unsolved in 9761 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 2/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 137/246 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 61/174 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 18/192 constraints. Problems are: Problem set: 3 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:16:49] [INFO ] Deduced a trap along path composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 1/247 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 115/309 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/310 constraints. Problems are: Problem set: 3 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:17:03] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/311 constraints. Problems are: Problem set: 10 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/311 constraints. Problems are: Problem set: 10 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 311 constraints, problems are : Problem set: 10 solved, 126 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 133/136 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39828ms problems are : Problem set: 10 solved, 126 unsolved
Search for dead transitions found 10 dead transitions in 39828ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/159 places, 127/341 transitions.
Graph (complete) has 336 edges and 110 vertex of which 103 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 103 /110 variables (removed 7) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 103 cols
[2025-06-06 03:17:16] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:16] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 03:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 03:17:17] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/159 places, 127/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40759 ms. Remains : 103/159 places, 127/341 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 finished in 40818 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(((p1 U G(p2))&&p0)))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 145 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 145 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 145 transition count 205
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 131 transition count 191
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 131 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 131 transition count 185
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 122 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 122 transition count 170
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 113 transition count 152
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 113 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 113 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 110 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 110 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 108 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 108 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 107 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 107 transition count 143
Applied a total of 120 rules in 13 ms. Remains 107 /159 variables (removed 52) and now considering 143/341 (removed 198) transitions.
// Phase 1: matrix 143 rows 107 cols
[2025-06-06 03:17:17] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 03:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 03:17:18] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2025-06-06 03:17:18] [INFO ] Invariant cache hit.
[2025-06-06 03:17:18] [INFO ] State equation strengthened by 70 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 5 (OVERLAPS) 143/250 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 70/181 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 181 constraints, problems are : Problem set: 3 solved, 139 unsolved in 7601 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 143/249 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 70/180 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 18/198 constraints. Problems are: Problem set: 3 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:17:30] [INFO ] Deduced a trap along path composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/199 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/199 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 12 (OVERLAPS) 1/250 variables, 1/200 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 121/321 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/250 variables, and 321 constraints, problems are : Problem set: 3 solved, 139 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 139/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37666ms problems are : Problem set: 3 solved, 139 unsolved
Search for dead transitions found 3 dead transitions in 37667ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 107/159 places, 140/341 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 104 transition count 140
Applied a total of 3 rules in 3 ms. Remains 104 /107 variables (removed 3) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 104 cols
[2025-06-06 03:17:55] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-06 03:17:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:56] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 03:17:56] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/159 places, 140/341 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39371 ms. Remains : 104/159 places, 140/341 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 finished in 39555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 341/341 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 144 transition count 193
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 144 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 144 transition count 192
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 129 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 129 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 66 place count 129 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 119 transition count 155
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 119 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 93 place count 119 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 115 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 115 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 111 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 111 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 108 transition count 134
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 108 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 105 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 105 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 103 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 102 transition count 126
Applied a total of 129 rules in 19 ms. Remains 102 /159 variables (removed 57) and now considering 126/341 (removed 215) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 03:17:56] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:56] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 03:17:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:17:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 03:17:57] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-06 03:17:57] [INFO ] Invariant cache hit.
[2025-06-06 03:17:57] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 4856 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:18:02] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 17/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:18:05] [INFO ] Deduced a trap along path composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 1/180 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 1/228 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 105/286 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/286 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:18:26] [INFO ] Deduced a trap along path composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/228 variables, 1/287 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 287 constraints, problems are : Problem set: 3 solved, 122 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 34917ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 34918ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/159 places, 123/341 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 123
Applied a total of 3 rules in 2 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2025-06-06 03:18:31] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:18:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 03:18:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:18:32] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 03:18:32] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/159 places, 123/341 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35593 ms. Remains : 99/159 places, 123/341 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Product exploration explored 100000 steps with 33333 reset in 193 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 finished in 36159 ms.
All properties solved by simple procedures.
Total runtime 615589 ms.

BK_STOP 1749179912955

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

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