About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d2m36
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ?FTFFFTFFFFFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400476.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-d2m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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-d2m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749184476195
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-d2m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 04:34:37] [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 04:34:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 04:34:37] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2025-06-06 04:34:37] [INFO ] Transformed 2398 places.
[2025-06-06 04:34:37] [INFO ] Transformed 1954 transitions.
[2025-06-06 04:34:37] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 267 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 2 formulas.
Deduced a syphon composed of 1984 places in 24 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 949 place count 293 transition count 722
Iterating global reduction 1 with 96 rules applied. Total rules applied 1045 place count 293 transition count 722
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1054 place count 293 transition count 713
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1124 place count 223 transition count 643
Iterating global reduction 2 with 70 rules applied. Total rules applied 1194 place count 223 transition count 643
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1222 place count 223 transition count 615
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1247 place count 198 transition count 587
Iterating global reduction 3 with 25 rules applied. Total rules applied 1272 place count 198 transition count 587
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 3 with 93 rules applied. Total rules applied 1365 place count 198 transition count 494
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1370 place count 193 transition count 486
Iterating global reduction 4 with 5 rules applied. Total rules applied 1375 place count 193 transition count 486
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1380 place count 188 transition count 481
Iterating global reduction 4 with 5 rules applied. Total rules applied 1385 place count 188 transition count 481
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1388 place count 185 transition count 477
Iterating global reduction 4 with 3 rules applied. Total rules applied 1391 place count 185 transition count 477
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1392 place count 184 transition count 476
Iterating global reduction 4 with 1 rules applied. Total rules applied 1393 place count 184 transition count 476
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1394 place count 183 transition count 475
Iterating global reduction 4 with 1 rules applied. Total rules applied 1395 place count 183 transition count 475
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1396 place count 182 transition count 474
Iterating global reduction 4 with 1 rules applied. Total rules applied 1397 place count 182 transition count 474
Applied a total of 1397 rules in 111 ms. Remains 182 /414 variables (removed 232) and now considering 474/1954 (removed 1480) transitions.
// Phase 1: matrix 474 rows 182 cols
[2025-06-06 04:34:37] [INFO ] Computed 5 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:38] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-06 04:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:38] [INFO ] State equation strengthened by 334 read => feed constraints.
[2025-06-06 04:34:41] [INFO ] Implicit Places using invariants and state equation in 2903 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2025-06-06 04:34:41] [INFO ] Invariant cache hit.
[2025-06-06 04:34:41] [INFO ] State equation strengthened by 334 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (OVERLAPS) 1/182 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:49] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:49] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (OVERLAPS) 474/656 variables, 182/189 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 334/523 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:04] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:04] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 656/656 variables, and 525 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 334/334 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (OVERLAPS) 1/182 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD441 is UNSAT
At refinement iteration 6 (OVERLAPS) 474/656 variables, 182/191 constraints. Problems are: Problem set: 3 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 334/525 constraints. Problems are: Problem set: 3 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 470/995 constraints. Problems are: Problem set: 3 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 656/656 variables, and 995 constraints, problems are : Problem set: 3 solved, 470 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 334/334 constraints, PredecessorRefiner: 470/473 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60644ms problems are : Problem set: 3 solved, 470 unsolved
Search for dead transitions found 3 dead transitions in 60753ms
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 : 182/414 places, 471/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 179 transition count 471
Applied a total of 3 rules in 5 ms. Remains 179 /182 variables (removed 3) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 179 cols
[2025-06-06 04:35:41] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:42] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-06 04:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:42] [INFO ] State equation strengthened by 333 read => feed constraints.
[2025-06-06 04:35:44] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 179/414 places, 471/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66231 ms. Remains : 179/414 places, 471/1954 transitions.
Support contains 29 out of 179 places after structural reductions.
[2025-06-06 04:35:44] [INFO ] Flatten gal took : 55 ms
[2025-06-06 04:35:44] [INFO ] Flatten gal took : 27 ms
[2025-06-06 04:35:44] [INFO ] Input system was already deterministic with 471 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8858 resets) in 2668 ms. (14 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (198 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (191 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (176 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (164 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (191 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (174 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (192 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (167 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (169 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (177 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (179 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (171 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (178 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (189 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (170 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (181 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (187 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (178 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (184 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (175 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (184 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (180 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (182 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (183 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (174 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (194 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 311802 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :12 out of 26
Probabilistic random walk after 311802 steps, saw 142950 distinct states, run finished after 3005 ms. (steps per millisecond=103 ) properties seen :12
[2025-06-06 04:35:48] [INFO ] Invariant cache hit.
[2025-06-06 04:35:48] [INFO ] State equation strengthened by 333 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 84/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:48] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 43/142 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:48] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 348/490 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 210/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 160/650 variables, 37/395 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 123/518 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/650 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 518 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 84/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 43/142 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 348/490 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 210/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 160/650 variables, 37/395 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 123/518 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 14/532 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:53] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/650 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 534 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7217ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 471/471 transitions.
Graph (complete) has 745 edges and 179 vertex of which 178 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 178 transition count 469
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 165 transition count 359
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 165 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 33 place count 165 transition count 355
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 155 transition count 343
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 155 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 155 transition count 339
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 152 transition count 335
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 152 transition count 335
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 151 transition count 334
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 151 transition count 334
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 150 transition count 333
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 150 transition count 333
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 149 transition count 332
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 149 transition count 332
Applied a total of 69 rules in 75 ms. Remains 149 /179 variables (removed 30) and now considering 332/471 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 149/179 places, 332/471 transitions.
RANDOM walk for 40000 steps (8941 resets) in 462 ms. (86 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1858 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (1907 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1912 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1909 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1936 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1901 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1835 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1923 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 368347 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :3 out of 14
Probabilistic random walk after 368347 steps, saw 165395 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :3
// Phase 1: matrix 332 rows 149 cols
[2025-06-06 04:35:59] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 04:35:59] [INFO ] State equation strengthened by 216 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 71/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 273/360 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 157/247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 121/481 variables, 62/309 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 59/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/481 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 368 constraints, problems are : Problem set: 0 solved, 11 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 149/149 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 71/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 273/360 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 157/247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 121/481 variables, 62/309 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 59/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:03] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/481 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 381 constraints, problems are : Problem set: 0 solved, 11 unsolved in 8402 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 149/149 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9424ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 19409 ms.
Support contains 12 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 332/332 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 146 transition count 293
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 146 transition count 293
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 143 transition count 290
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 143 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 143 transition count 289
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 140 transition count 283
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 140 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 140 transition count 280
Applied a total of 22 rules in 25 ms. Remains 140 /149 variables (removed 9) and now considering 280/332 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 140/149 places, 280/332 transitions.
RANDOM walk for 40000 steps (8918 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1963 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1921 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1861 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1898 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1994 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1931 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1918 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1846 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1886 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1847 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 394210 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :1 out of 11
Probabilistic random walk after 394210 steps, saw 173440 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :1
// Phase 1: matrix 280 rows 140 cols
[2025-06-06 04:36:31] [INFO ] Computed 3 invariants in 3 ms
[2025-06-06 04:36:31] [INFO ] State equation strengthened by 174 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 68/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 247/330 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 141/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 90/420 variables, 57/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 33/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/420 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 317 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1721 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 140/140 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 68/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 247/330 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 141/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 90/420 variables, 57/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 33/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 10/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:35] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/420 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 328 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7099 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 140/140 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8843ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 8973 ms.
Support contains 11 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 280/280 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 139 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 138 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 138 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 137 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 137 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 137 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 136 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 136 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 135 transition count 261
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 135 transition count 261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 134 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 134 transition count 260
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 134 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 133 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 133 transition count 250
Applied a total of 24 rules in 32 ms. Remains 133 /140 variables (removed 7) and now considering 250/280 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 133/140 places, 250/280 transitions.
RANDOM walk for 40000 steps (8970 resets) in 241 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1883 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1889 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1847 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1860 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1935 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1969 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 423431 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 10
Probabilistic random walk after 423431 steps, saw 180580 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
// Phase 1: matrix 250 rows 133 cols
[2025-06-06 04:36:53] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 04:36:53] [INFO ] State equation strengthened by 149 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 66/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/81 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 232/313 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 131/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 70/383 variables, 52/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 18/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 285 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 66/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/81 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 232/313 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 131/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 70/383 variables, 52/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 18/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 10/295 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:56] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/383 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 296 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7510 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9045ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 7472 ms.
Support contains 11 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 133/133 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-06 04:37:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-06 04:37:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:09] [INFO ] State equation strengthened by 149 read => feed constraints.
[2025-06-06 04:37:10] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:37:10] [INFO ] Redundant transitions in 14 ms returned []
Running 249 sub problems to find dead transitions.
[2025-06-06 04:37:10] [INFO ] Invariant cache hit.
[2025-06-06 04:37:10] [INFO ] State equation strengthened by 149 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 4 (OVERLAPS) 250/383 variables, 133/136 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 149/285 constraints. Problems are: Problem set: 3 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:25] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/286 constraints. Problems are: Problem set: 3 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:37] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/287 constraints. Problems are: Problem set: 3 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 287 constraints, problems are : Problem set: 3 solved, 246 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 249/379 variables, 130/133 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 148/281 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 23/304 constraints. Problems are: Problem set: 3 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:44] [INFO ] Deduced a trap along path composed of 20 places in 36 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 1/305 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/305 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 4/383 variables, 3/308 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/309 constraints. Problems are: Problem set: 3 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 223/532 constraints. Problems are: Problem set: 3 solved, 246 unsolved
SMT process timed out in 60154ms, After SMT, problems are : Problem set: 3 solved, 246 unsolved
Search for dead transitions found 3 dead transitions in 60155ms
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 : 133/133 places, 247/250 transitions.
Graph (complete) has 460 edges and 133 vertex of which 130 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 10 ms. Remains 130 /133 variables (removed 3) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 130 cols
[2025-06-06 04:38:11] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:11] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-06 04:38:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:11] [INFO ] State equation strengthened by 148 read => feed constraints.
[2025-06-06 04:38:11] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 130/133 places, 247/250 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62325 ms. Remains : 130/133 places, 247/250 transitions.
Computed a total of 37 stabilizing places and 69 stable transitions
Graph (complete) has 811 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 153 transition count 203
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 153 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 153 transition count 199
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 79 place count 130 transition count 174
Iterating global reduction 1 with 23 rules applied. Total rules applied 102 place count 130 transition count 174
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 112 place count 130 transition count 164
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 116 transition count 139
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 116 transition count 139
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 149 place count 116 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 154 place count 111 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 159 place count 111 transition count 125
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 164 place count 106 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 169 place count 106 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 103 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 103 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 177 place count 103 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 179 place count 101 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 101 transition count 113
Applied a total of 181 rules in 26 ms. Remains 101 /179 variables (removed 78) and now considering 113/471 (removed 358) transitions.
// Phase 1: matrix 113 rows 101 cols
[2025-06-06 04:38:12] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 04:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 04:38:12] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:38:12] [INFO ] Redundant transitions in 1 ms returned []
Running 112 sub problems to find dead transitions.
[2025-06-06 04:38:12] [INFO ] Invariant cache hit.
[2025-06-06 04:38:12] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/214 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 43/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 148 constraints, problems are : Problem set: 3 solved, 109 unsolved in 4814 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 2/100 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 113/213 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 43/147 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 17/164 constraints. Problems are: Problem set: 3 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:19] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:22] [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/213 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 1/214 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 92/259 constraints. Problems are: Problem set: 3 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 4 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 2/261 constraints. Problems are: Problem set: 7 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 0/261 constraints. Problems are: Problem set: 7 solved, 105 unsolved
At refinement iteration 17 (OVERLAPS) 0/214 variables, 0/261 constraints. Problems are: Problem set: 7 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 261 constraints, problems are : Problem set: 7 solved, 105 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 109/112 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34868ms problems are : Problem set: 7 solved, 105 unsolved
Search for dead transitions found 7 dead transitions in 34869ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/179 places, 106/471 transitions.
Graph (complete) has 303 edges and 101 vertex of which 96 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 10 ms. Remains 96 /101 variables (removed 5) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 96 cols
[2025-06-06 04:38:47] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 04:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 04:38:47] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/179 places, 106/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35586 ms. Remains : 96/179 places, 106/471 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 151 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00
Product exploration explored 100000 steps with 22449 reset in 445 ms.
Product exploration explored 100000 steps with 22497 reset in 180 ms.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 299 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9014 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1921 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 115 steps, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Probabilistic random walk after 115 steps, saw 77 distinct states, run finished after 8 ms. (steps per millisecond=14 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 95 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 106/106 transitions.
Applied a total of 0 rules in 9 ms. Remains 95 /95 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 95 cols
[2025-06-06 04:38:49] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 04:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 04:38:49] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:38:49] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-06 04:38:49] [INFO ] Invariant cache hit.
[2025-06-06 04:38:49] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/201 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 40/138 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 139 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 40/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 105/244 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:01] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 245 constraints, problems are : Problem set: 0 solved, 105 unsolved in 26106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30913ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 30913ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31244 ms. Remains : 95/95 places, 106/106 transitions.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 299 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 20 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8873 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1874 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 115 steps, run visited all 1 properties in 3 ms. (steps per millisecond=38 )
Probabilistic random walk after 115 steps, saw 77 distinct states, run finished after 3 ms. (steps per millisecond=38 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22449 reset in 114 ms.
Product exploration explored 100000 steps with 22439 reset in 130 ms.
Built C files in :
/tmp/ltsmin7141793462919948302
[2025-06-06 04:39:21] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2025-06-06 04:39:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:39:21] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2025-06-06 04:39:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:39:21] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2025-06-06 04:39:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:39:21] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7141793462919948302
Running compilation step : cd /tmp/ltsmin7141793462919948302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 335 ms.
Running link step : cd /tmp/ltsmin7141793462919948302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7141793462919948302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2674086019320864393.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 106/106 transitions.
Applied a total of 0 rules in 10 ms. Remains 95 /95 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-06 04:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 04:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 04:39:36] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:39:36] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-06 04:39:36] [INFO ] Invariant cache hit.
[2025-06-06 04:39:36] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/201 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 40/138 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:38] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 139 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 40/139 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 105/244 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:48] [INFO ] Deduced a trap along path composed of 20 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 245 constraints, problems are : Problem set: 0 solved, 105 unsolved in 26334 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31150ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 31151ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31467 ms. Remains : 95/95 places, 106/106 transitions.
Built C files in :
/tmp/ltsmin4394933364709261775
[2025-06-06 04:40:07] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2025-06-06 04:40:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:40:07] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2025-06-06 04:40:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:40:07] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2025-06-06 04:40:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 04:40:07] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4394933364709261775
Running compilation step : cd /tmp/ltsmin4394933364709261775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin4394933364709261775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4394933364709261775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12538543719727254811.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 04:40:22] [INFO ] Flatten gal took : 6 ms
[2025-06-06 04:40:22] [INFO ] Flatten gal took : 6 ms
[2025-06-06 04:40:22] [INFO ] Time to serialize gal into /tmp/LTL10257822683003630803.gal : 2 ms
[2025-06-06 04:40:22] [INFO ] Time to serialize properties into /tmp/LTL9760636072313205188.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10257822683003630803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16390086765900316508.hoa' '-atoms' '/tmp/LTL9760636072313205188.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9760636072313205188.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16390086765900316508.hoa
Detected timeout of ITS tools.
[2025-06-06 04:40:37] [INFO ] Flatten gal took : 10 ms
[2025-06-06 04:40:37] [INFO ] Flatten gal took : 6 ms
[2025-06-06 04:40:37] [INFO ] Time to serialize gal into /tmp/LTL1450730158219343281.gal : 1 ms
[2025-06-06 04:40:37] [INFO ] Time to serialize properties into /tmp/LTL8441702302016192407.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1450730158219343281.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8441702302016192407.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((true))
Formula 0 simplified : 0
Detected timeout of ITS tools.
[2025-06-06 04:40:52] [INFO ] Flatten gal took : 5 ms
[2025-06-06 04:40:52] [INFO ] Applying decomposition
[2025-06-06 04:40:52] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6367294128766992888.txt' '-o' '/tmp/graph6367294128766992888.bin' '-w' '/tmp/graph6367294128766992888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6367294128766992888.bin' '-l' '-1' '-v' '-w' '/tmp/graph6367294128766992888.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:40:52] [INFO ] Decomposing Gal with order
[2025-06-06 04:40:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:40:53] [INFO ] Removed a total of 91 redundant transitions.
[2025-06-06 04:40:53] [INFO ] Flatten gal took : 74 ms
[2025-06-06 04:40:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 9 ms.
[2025-06-06 04:40:53] [INFO ] Time to serialize gal into /tmp/LTL14811988114495854972.gal : 3 ms
[2025-06-06 04:40:53] [INFO ] Time to serialize properties into /tmp/LTL11912171592000987420.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14811988114495854972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11912171592000987420.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((true))
Formula 0 simplified : 0
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 175787 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((X((p0&&X((G(p2)||p1))))&&G(p3))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 155 transition count 229
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 155 transition count 225
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 74 place count 133 transition count 201
Iterating global reduction 1 with 22 rules applied. Total rules applied 96 place count 133 transition count 201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 105 place count 133 transition count 192
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 118 place count 120 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 131 place count 120 transition count 170
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 138 place count 120 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 117 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 117 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 114 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 112 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 112 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 157 place count 112 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 110 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 110 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 162 place count 109 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 109 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 108 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 108 transition count 146
Applied a total of 165 rules in 13 ms. Remains 108 /179 variables (removed 71) and now considering 146/471 (removed 325) transitions.
// Phase 1: matrix 146 rows 108 cols
[2025-06-06 04:41:08] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-06 04:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-06 04:41:08] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2025-06-06 04:41:08] [INFO ] Invariant cache hit.
[2025-06-06 04:41:08] [INFO ] State equation strengthened by 72 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, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 5 (OVERLAPS) 146/254 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 72/184 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 184 constraints, problems are : Problem set: 3 solved, 142 unsolved in 6497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 142 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, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 146/253 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 72/183 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 18/201 constraints. Problems are: Problem set: 3 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:19] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 1/202 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 1/254 variables, 1/203 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 124/327 constraints. Problems are: Problem set: 3 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:41:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 1/328 constraints. Problems are: Problem set: 3 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/254 variables, and 328 constraints, problems are : Problem set: 3 solved, 142 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 142/145 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36578ms problems are : Problem set: 3 solved, 142 unsolved
Search for dead transitions found 3 dead transitions in 36579ms
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 : 108/179 places, 143/471 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 143
Applied a total of 3 rules in 1 ms. Remains 105 /108 variables (removed 3) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 105 cols
[2025-06-06 04:41:45] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 04:41:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-06 04:41:45] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/179 places, 143/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37493 ms. Remains : 105/179 places, 143/471 transitions.
Stuttering acceptance computed with spot in 452 ms :[(OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 finished in 37975 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(F((!p0||(!p1 U (p2||G(!p1))))))||(X(p3)&&F((!p0||(!p1 U (p2||G(!p1)))))))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 155 transition count 241
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 155 transition count 236
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 74 place count 134 transition count 213
Iterating global reduction 1 with 21 rules applied. Total rules applied 95 place count 134 transition count 213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 103 place count 134 transition count 205
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 122 transition count 185
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 122 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 122 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 120 transition count 177
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 120 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 118 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 118 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 117 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 117 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 116 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 116 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 115 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 114 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 114 transition count 169
Applied a total of 149 rules in 17 ms. Remains 114 /179 variables (removed 65) and now considering 169/471 (removed 302) transitions.
// Phase 1: matrix 169 rows 114 cols
[2025-06-06 04:41:46] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 04:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:46] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-06-06 04:41:46] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2025-06-06 04:41:46] [INFO ] Invariant cache hit.
[2025-06-06 04:41:46] [INFO ] State equation strengthened by 89 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, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (OVERLAPS) 169/283 variables, 114/118 constraints. Problems are: Problem set: 3 solved, 165 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 89/207 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 207 constraints, problems are : Problem set: 3 solved, 165 unsolved in 8168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 165 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, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 169/282 variables, 113/117 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 89/206 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 19/225 constraints. Problems are: Problem set: 3 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:00] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/226 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 12 (OVERLAPS) 1/283 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 146/373 constraints. Problems are: Problem set: 3 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:17] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/374 constraints. Problems are: Problem set: 3 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 374 constraints, problems are : Problem set: 3 solved, 165 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 165/168 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38259ms problems are : Problem set: 3 solved, 165 unsolved
Search for dead transitions found 3 dead transitions in 38260ms
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 : 114/179 places, 166/471 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 166
Applied a total of 3 rules in 1 ms. Remains 111 /114 variables (removed 3) and now considering 166/166 (removed 0) transitions.
// Phase 1: matrix 166 rows 111 cols
[2025-06-06 04:42:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 04:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:25] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-06 04:42:25] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/179 places, 166/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39455 ms. Remains : 111/179 places, 166/471 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND p0 p1 (NOT p2)), (AND (NOT p3) p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Computed a total of 17 stabilizing places and 24 stable transitions
Graph (complete) has 387 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p3), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 20 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 40203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0&&X((F(!p1)||G(!p0))))))'
Support contains 2 out of 179 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 154 transition count 217
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 154 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 154 transition count 212
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 132 transition count 188
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 132 transition count 188
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 108 place count 132 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 121 place count 119 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 134 place count 119 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 141 place count 119 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 116 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 116 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 113 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 113 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 111 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 111 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 159 place count 111 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 110 transition count 138
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 110 transition count 138
Applied a total of 161 rules in 27 ms. Remains 110 /179 variables (removed 69) and now considering 138/471 (removed 333) transitions.
// Phase 1: matrix 138 rows 110 cols
[2025-06-06 04:42:26] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 04:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:42:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-06 04:42:26] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:42:26] [INFO ] Redundant transitions in 2 ms returned []
Running 137 sub problems to find dead transitions.
[2025-06-06 04:42:26] [INFO ] Invariant cache hit.
[2025-06-06 04:42:26] [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, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 5 (OVERLAPS) 138/248 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 61/175 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/248 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 175 constraints, problems are : Problem set: 3 solved, 134 unsolved in 7901 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: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 134 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, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 2/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 138/247 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 61/174 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 18/192 constraints. Problems are: Problem set: 3 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:37] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 1/248 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 116/310 constraints. Problems are: Problem set: 3 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:46] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:52] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:52] [INFO ] Deduced a trap along path composed of 10 places in 22 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 2/313 constraints. Problems are: Problem set: 10 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 248/248 variables, and 313 constraints, problems are : Problem set: 10 solved, 127 unsolved in 30019 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: 134/137 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37967ms problems are : Problem set: 10 solved, 127 unsolved
Search for dead transitions found 10 dead transitions in 37967ms
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/179 places, 128/471 transitions.
Graph (complete) has 337 edges and 110 vertex of which 103 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 10 ms. Remains 103 /110 variables (removed 7) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 103 cols
[2025-06-06 04:43:04] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:04] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 04:43:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 04:43:05] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/179 places, 128/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39104 ms. Remains : 103/179 places, 128/471 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 53 ms :[true, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
Product exploration explored 100000 steps with 22424 reset in 212 ms.
Product exploration explored 100000 steps with 22454 reset in 175 ms.
Computed a total of 20 stabilizing places and 27 stable transitions
Graph (complete) has 333 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 27 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, p0]
RANDOM walk for 40000 steps (8943 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1908 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1664 steps, run visited all 1 properties in 7 ms. (steps per millisecond=237 )
Probabilistic random walk after 1664 steps, saw 800 distinct states, run finished after 7 ms. (steps per millisecond=237 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 finished in 39849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U p1))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 155 transition count 229
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 155 transition count 225
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 73 place count 134 transition count 203
Iterating global reduction 1 with 21 rules applied. Total rules applied 94 place count 134 transition count 203
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 134 transition count 195
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 114 place count 122 transition count 174
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 122 transition count 174
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 133 place count 122 transition count 167
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 136 place count 119 transition count 164
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 119 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 116 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 116 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 115 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 115 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 150 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 114 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 114 transition count 156
Applied a total of 152 rules in 24 ms. Remains 114 /179 variables (removed 65) and now considering 156/471 (removed 315) transitions.
// Phase 1: matrix 156 rows 114 cols
[2025-06-06 04:43:06] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 04:43:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:06] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 04:43:06] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:43:06] [INFO ] Redundant transitions in 3 ms returned []
Running 155 sub problems to find dead transitions.
[2025-06-06 04:43:06] [INFO ] Invariant cache hit.
[2025-06-06 04:43:06] [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/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
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 5 (OVERLAPS) 156/270 variables, 114/118 constraints. Problems are: Problem set: 3 solved, 152 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 74/192 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 192 constraints, problems are : Problem set: 3 solved, 152 unsolved in 8742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 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, 0/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 156/269 variables, 113/117 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 74/191 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 19/210 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 04:43:18] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/211 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 04:43:23] [INFO ] Deduced a trap along path composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 1/270 variables, 1/213 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 133/346 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 346 constraints, problems are : Problem set: 3 solved, 152 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 152/155 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38825ms problems are : Problem set: 3 solved, 152 unsolved
Search for dead transitions found 3 dead transitions in 38825ms
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/179 places, 153/471 transitions.
Graph (complete) has 378 edges and 114 vertex of which 111 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 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 04:43:45] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 04:43:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 04:43:45] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/179 places, 153/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39826 ms. Remains : 111/179 places, 153/471 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 39937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p1))||p0))))'
Support contains 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 154 transition count 228
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 154 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 154 transition count 223
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 132 transition count 199
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 132 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 107 place count 132 transition count 191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 119 transition count 169
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 119 transition count 169
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 140 place count 119 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 116 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 116 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 113 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 113 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 112 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 111 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 111 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 110 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 110 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 109 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 109 transition count 150
Applied a total of 160 rules in 19 ms. Remains 109 /179 variables (removed 70) and now considering 150/471 (removed 321) transitions.
// Phase 1: matrix 150 rows 109 cols
[2025-06-06 04:43:46] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 04:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:43:46] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 04:43:46] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:43:46] [INFO ] Redundant transitions in 1 ms returned []
Running 149 sub problems to find dead transitions.
[2025-06-06 04:43:46] [INFO ] Invariant cache hit.
[2025-06-06 04:43:46] [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 7299 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
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 150/258 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 74/186 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 18/204 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 04:43:58] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 1/259 variables, 1/206 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 128/334 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 04:44:16] [INFO ] Deduced a trap along path composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 1/335 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 335 constraints, problems are : Problem set: 3 solved, 146 unsolved in 30019 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: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37372ms problems are : Problem set: 3 solved, 146 unsolved
Search for dead transitions found 3 dead transitions in 37373ms
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/179 places, 147/471 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 9 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 04:44:23] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:44:24] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-06 04:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:44:24] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 04:44:24] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/179 places, 147/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38348 ms. Remains : 106/179 places, 147/471 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 finished in 38446 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||X(!p0)) U (G((!p0||X(!p0)))||(!p1&&(!p0||X(!p0))))))'
Support contains 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 153 transition count 215
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 153 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 153 transition count 210
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 80 place count 130 transition count 185
Iterating global reduction 1 with 23 rules applied. Total rules applied 103 place count 130 transition count 185
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 130 transition count 176
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 116 transition count 152
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 116 transition count 152
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 148 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 112 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 112 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 160 place count 108 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 108 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 106 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 106 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 170 place count 106 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 104 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 102 transition count 126
Applied a total of 178 rules in 13 ms. Remains 102 /179 variables (removed 77) and now considering 126/471 (removed 345) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 04:44:24] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:44:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 04:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:44:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 04:44:24] [INFO ] Implicit Places using invariants and state equation in 332 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 04:44:24] [INFO ] Invariant cache hit.
[2025-06-06 04:44:24] [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 5430 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 04:44:33] [INFO ] Deduced a trap along path composed of 20 places in 37 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:45] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 1/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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 286 constraints, problems are : Problem set: 3 solved, 122 unsolved in 30010 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: 2/2 constraints]
After SMT, in 35485ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 35485ms
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/179 places, 123/471 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 04:45:00] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 04:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:00] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 04:45:00] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/179 places, 123/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36209 ms. Remains : 99/179 places, 123/471 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 77 ms :[p0, p0, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 TRUE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 finished in 36303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1)))&&G(p2)))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 155 transition count 241
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 155 transition count 236
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 74 place count 134 transition count 213
Iterating global reduction 1 with 21 rules applied. Total rules applied 95 place count 134 transition count 213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 103 place count 134 transition count 205
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 122 transition count 185
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 122 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 122 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 120 transition count 177
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 120 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 118 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 118 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 117 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 117 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 116 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 116 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 115 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 114 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 114 transition count 169
Applied a total of 149 rules in 13 ms. Remains 114 /179 variables (removed 65) and now considering 169/471 (removed 302) transitions.
// Phase 1: matrix 169 rows 114 cols
[2025-06-06 04:45:00] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:00] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 04:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:01] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-06-06 04:45:01] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2025-06-06 04:45:01] [INFO ] Invariant cache hit.
[2025-06-06 04:45:01] [INFO ] State equation strengthened by 89 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, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (OVERLAPS) 169/283 variables, 114/118 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 89/207 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 207 constraints, problems are : Problem set: 3 solved, 165 unsolved in 9383 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 165 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, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 169/282 variables, 113/117 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 89/206 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 19/225 constraints. Problems are: Problem set: 3 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:45:16] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/226 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 12 (OVERLAPS) 1/283 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 165 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 146/373 constraints. Problems are: Problem set: 3 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 373 constraints, problems are : Problem set: 3 solved, 165 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 165/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39468ms problems are : Problem set: 3 solved, 165 unsolved
Search for dead transitions found 3 dead transitions in 39470ms
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 : 114/179 places, 166/471 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 166
Applied a total of 3 rules in 3 ms. Remains 111 /114 variables (removed 3) and now considering 166/166 (removed 0) transitions.
// Phase 1: matrix 166 rows 111 cols
[2025-06-06 04:45:41] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:41] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 04:45:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:41] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-06 04:45:41] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/179 places, 166/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40902 ms. Remains : 111/179 places, 166/471 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 finished in 41065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)&&X(X(X(F(p1))))))'
Support contains 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 154 transition count 228
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 154 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 154 transition count 223
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 132 transition count 199
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 132 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 107 place count 132 transition count 191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 119 transition count 169
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 119 transition count 169
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 140 place count 119 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 116 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 116 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 113 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 113 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 111 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 111 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 159 place count 111 transition count 151
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 161 place count 109 transition count 147
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 109 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 108 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 107 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 107 transition count 145
Applied a total of 167 rules in 23 ms. Remains 107 /179 variables (removed 72) and now considering 145/471 (removed 326) transitions.
// Phase 1: matrix 145 rows 107 cols
[2025-06-06 04:45:41] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 04:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:45:42] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 04:45:42] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-06 04:45:42] [INFO ] Invariant cache hit.
[2025-06-06 04:45:42] [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
All remaining problems are real, not stopping.
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 6469 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 04:45:54] [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/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
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/323 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 323 constraints, problems are : Problem set: 3 solved, 141 unsolved in 30011 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: 1/1 constraints]
After SMT, in 36533ms problems are : Problem set: 3 solved, 141 unsolved
Search for dead transitions found 3 dead transitions in 36534ms
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/179 places, 142/471 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 0 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 04:46:19] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:46:19] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 04:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:46:19] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 04:46:19] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/179 places, 142/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37916 ms. Remains : 104/179 places, 142/471 transitions.
Stuttering acceptance computed with spot in 191 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
Product exploration explored 100000 steps with 22460 reset in 156 ms.
Product exploration explored 100000 steps with 22344 reset in 201 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 351 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
RANDOM walk for 40000 steps (8975 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1950 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1828 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1832 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1844 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1771269 steps, run timeout after 3001 ms. (steps per millisecond=590 ) properties seen :3 out of 4
Probabilistic random walk after 1771269 steps, saw 734126 distinct states, run finished after 3001 ms. (steps per millisecond=590 ) properties seen :3
[2025-06-06 04:46:23] [INFO ] Invariant cache hit.
[2025-06-06 04:46:23] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/190 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/246 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 29/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/190 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/246 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 29/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 142/142 transitions.
Graph (complete) has 315 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 102 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 102 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 101 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 101 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 100 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 100 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 100 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 99 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 98 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 98 transition count 121
Applied a total of 15 rules in 8 ms. Remains 98 /104 variables (removed 6) and now considering 121/142 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/104 places, 121/142 transitions.
RANDOM walk for 40000 steps (8923 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2010915 steps, run timeout after 3001 ms. (steps per millisecond=670 ) properties seen :0 out of 1
Probabilistic random walk after 2010915 steps, saw 889821 distinct states, run finished after 3001 ms. (steps per millisecond=670 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 04:46:27] [INFO ] Computed 3 invariants in 6 ms
[2025-06-06 04:46:27] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 04:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:46:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 04:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:46:28] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 04:46:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:46:28] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 04:46:28] [INFO ] Invariant cache hit.
[2025-06-06 04:46:28] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4676 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 26409 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31127ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 31127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31447 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 15 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 04:46:59] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:46:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:46:59] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:46:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-06 04:46:59] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 04:46:59] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 04:46:59] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 192 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 220 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 142/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 104 cols
[2025-06-06 04:47:00] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:47:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 04:47:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:47:00] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 04:47:00] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-06 04:47:00] [INFO ] Invariant cache hit.
[2025-06-06 04:47:01] [INFO ] State equation strengthened by 69 read => feed constraints.
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: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/246 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 177 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 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: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/246 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 141/318 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:47:14] [INFO ] Deduced a trap along path composed of 5 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:47:14] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 320 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36696ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 36698ms
Finished structural reductions in LTL mode , in 1 iterations and 37434 ms. Remains : 104/104 places, 142/142 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 351 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
RANDOM walk for 40000 steps (8967 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1819 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2004633 steps, run timeout after 3001 ms. (steps per millisecond=667 ) properties seen :3 out of 4
Probabilistic random walk after 2004633 steps, saw 830687 distinct states, run finished after 3001 ms. (steps per millisecond=667 ) properties seen :3
[2025-06-06 04:47:41] [INFO ] Invariant cache hit.
[2025-06-06 04:47:41] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/190 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/246 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 29/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 113/190 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/246 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 29/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 142/142 transitions.
Graph (complete) has 315 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 102 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 102 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 101 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 101 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 100 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 100 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 100 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 99 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 98 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 98 transition count 121
Applied a total of 15 rules in 8 ms. Remains 98 /104 variables (removed 6) and now considering 121/142 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/104 places, 121/142 transitions.
RANDOM walk for 40000 steps (8979 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2196738 steps, run timeout after 3001 ms. (steps per millisecond=732 ) properties seen :0 out of 1
Probabilistic random walk after 2196738 steps, saw 974440 distinct states, run finished after 3001 ms. (steps per millisecond=732 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 04:47:44] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 04:47:44] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 04:47:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:47:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 04:47:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:47:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 04:47:45] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:47:45] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 04:47:45] [INFO ] Invariant cache hit.
[2025-06-06 04:47:45] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4685 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 26177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30905ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 30905ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31226 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 14 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 04:48:16] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:48:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:48:16] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:48:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:48:16] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 04:48:16] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 04:48:16] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 171 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 209 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 214 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 22527 reset in 152 ms.
Product exploration explored 100000 steps with 22479 reset in 157 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 219 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 142/142 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:48:18] [INFO ] Redundant transitions in 0 ms returned []
Running 141 sub problems to find dead transitions.
// Phase 1: matrix 142 rows 104 cols
[2025-06-06 04:48:18] [INFO ] Computed 4 invariants in 1 ms
[2025-06-06 04:48:18] [INFO ] State equation strengthened by 69 read => feed constraints.
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: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/246 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 177 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6590 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 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: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/246 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 141/318 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:48:32] [INFO ] Deduced a trap along path composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 319 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36669ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 36670ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36688 ms. Remains : 104/104 places, 142/142 transitions.
Built C files in :
/tmp/ltsmin2195633689338853599
[2025-06-06 04:48:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2195633689338853599
Running compilation step : cd /tmp/ltsmin2195633689338853599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 245 ms.
Running link step : cd /tmp/ltsmin2195633689338853599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2195633689338853599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7404423412264262616.hoa' '--buchi-type=spotba'
LTSmin run took 530 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 finished in 193813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))) U (G((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))||(!p2&&(X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0)))))))))) U (G((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))||(!p0&&((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))) U (G((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))||(!p2&&(X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))))))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 155 transition count 229
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 155 transition count 225
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 73 place count 134 transition count 203
Iterating global reduction 1 with 21 rules applied. Total rules applied 94 place count 134 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 103 place count 134 transition count 194
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 122 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 122 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 134 place count 122 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 120 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 120 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 118 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 118 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 117 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 117 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 147 place count 117 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 116 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 116 transition count 157
Applied a total of 149 rules in 17 ms. Remains 116 /179 variables (removed 63) and now considering 157/471 (removed 314) transitions.
// Phase 1: matrix 157 rows 116 cols
[2025-06-06 04:48:55] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:48:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 04:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:48:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-06 04:48:56] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-06 04:48:56] [INFO ] Invariant cache hit.
[2025-06-06 04:48:56] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 5 (OVERLAPS) 157/273 variables, 116/120 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 75/195 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 195 constraints, problems are : Problem set: 3 solved, 153 unsolved in 8153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 2/115 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 157/272 variables, 115/119 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 75/194 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 19/213 constraints. Problems are: Problem set: 3 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:49:08] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:49:12] [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/272 variables, 1/215 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/215 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 13 (OVERLAPS) 1/273 variables, 1/216 constraints. Problems are: Problem set: 3 solved, 153 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 134/350 constraints. Problems are: Problem set: 3 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:49:31] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 1/351 constraints. Problems are: Problem set: 3 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 351 constraints, problems are : Problem set: 3 solved, 153 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 153/156 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38231ms problems are : Problem set: 3 solved, 153 unsolved
Search for dead transitions found 3 dead transitions in 38232ms
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 : 116/179 places, 154/471 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 154
Applied a total of 3 rules in 1 ms. Remains 113 /116 variables (removed 3) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 113 cols
[2025-06-06 04:49:34] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:49:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 04:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:49:34] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 04:49:34] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/179 places, 154/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39069 ms. Remains : 113/179 places, 154/471 transitions.
Stuttering acceptance computed with spot in 312 ms :[p0, p0, p0, p0, p0, p0, p0, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
Product exploration explored 100000 steps with 25377 reset in 159 ms.
Product exploration explored 100000 steps with 25397 reset in 161 ms.
Computed a total of 26 stabilizing places and 36 stable transitions
Graph (complete) has 381 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 121 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[p0, p0, p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (8931 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1896 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1837 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1853 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 918418 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :2 out of 4
Probabilistic random walk after 918418 steps, saw 385545 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :2
[2025-06-06 04:49:39] [INFO ] Invariant cache hit.
[2025-06-06 04:49:39] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 137/224 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 57/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/267 variables, 26/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 17/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:49:39] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 137/224 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 57/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 43/267 variables, 26/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/267 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 194 constraints, problems are : Problem set: 0 solved, 2 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 910ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2470 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 154/154 transitions.
Graph (complete) has 342 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 111 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 111 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 110 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 110 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 109 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 109 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 108 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 107 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 107 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 106 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 106 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 105 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 105 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 104 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 104 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 103 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 103 transition count 139
Applied a total of 22 rules in 16 ms. Remains 103 /113 variables (removed 10) and now considering 139/154 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 103/113 places, 139/154 transitions.
RANDOM walk for 40000 steps (9009 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1887 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1912 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 954995 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :0 out of 2
Probabilistic random walk after 954995 steps, saw 399953 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2025-06-06 04:49:45] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 04:49:45] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 746ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2922 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2025-06-06 04:49:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:49:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 04:49:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:49:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-06 04:49:49] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:49:49] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2025-06-06 04:49:49] [INFO ] Invariant cache hit.
[2025-06-06 04:49:49] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5775 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:50:03] [INFO ] Deduced a trap along path composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 312 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35840ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 35840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36213 ms. Remains : 103/103 places, 139/139 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 97 transition count 117
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 119
Applied a total of 59 rules in 4 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 119 rows 74 cols
[2025-06-06 04:50:25] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:50:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:50:25] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:50:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:50:25] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-06 04:50:25] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-06 04:50:25] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 300 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 213 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[p0, p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, p0, p0, p0, true]
Support contains 3 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 113 cols
[2025-06-06 04:50:26] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:50:26] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 04:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:50:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 04:50:26] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-06 04:50:26] [INFO ] Invariant cache hit.
[2025-06-06 04:50:26] [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/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 154/267 variables, 113/117 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 74/191 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 191 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 154/267 variables, 113/117 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 74/191 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 153/344 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:50:38] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:50:47] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 346 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36998ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 36998ms
Finished structural reductions in LTL mode , in 1 iterations and 37435 ms. Remains : 113/113 places, 154/154 transitions.
Computed a total of 26 stabilizing places and 36 stable transitions
Graph (complete) has 381 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p0, p0, p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (8958 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1941 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1965 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1863 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 894445 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :2 out of 4
Probabilistic random walk after 894445 steps, saw 375650 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :2
[2025-06-06 04:51:07] [INFO ] Invariant cache hit.
[2025-06-06 04:51:07] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 137/224 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 57/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/267 variables, 26/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 17/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:51:07] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 137/224 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 57/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 43/267 variables, 26/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/267 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 194 constraints, problems are : Problem set: 0 solved, 2 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3157 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 154/154 transitions.
Graph (complete) has 342 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 111 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 111 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 110 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 110 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 109 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 109 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 108 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 107 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 107 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 106 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 106 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 105 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 105 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 104 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 104 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 103 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 103 transition count 139
Applied a total of 22 rules in 10 ms. Remains 103 /113 variables (removed 10) and now considering 139/154 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 103/113 places, 139/154 transitions.
RANDOM walk for 40000 steps (9041 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1807 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 894059 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :0 out of 2
Probabilistic random walk after 894059 steps, saw 375495 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2025-06-06 04:51:14] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 04:51:14] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2671 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2025-06-06 04:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:51:18] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 04:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:51:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-06 04:51:18] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:51:18] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2025-06-06 04:51:18] [INFO ] Invariant cache hit.
[2025-06-06 04:51:18] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5850 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:51:32] [INFO ] Deduced a trap along path composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 1)
(t7 2)
(t8 1)
(t9 1)
(t10 0)
(t11 0)
(t12 1)
(t13 0)
(t14 1)
(t15 1)
(t16 1)
(t17 3)
(t18 1)
(t19 1)
(t20 0)
(t21 1)
(t22 2)
(t23 1)
(t24 1)
(t25 2)
(t26 10)
(t27 7)
(t28 1)
(t29 0)
(t30 1)
(t31 1)
(t32 2)
(t33 11)
(t34 1)
(t35 10)
(t36 1)
(t37 10)
(t38 0)
(t39 10)
(t40 1)
(t41 0)
(t42 10)
(t43 1)
(t44 10)
(t45 0)
(t46 7)
(t47 1)
(t48 0)
(t49 1)
(t50 2)
(t51 0)
(t52 0)
(t53 7)
(t54 4)
(t55 10)
(t56 0)
(t57 10)
(t58 10)
(t59 6)
(t60 0)
(t61 5)
(t62 1)
(t63 6)
(t64 0)
(t65 9)
(t66 0)
(t67 8)
(t68 0)
(t69 9)
(t70 1)
(t71 0)
(t72 1)
(t73 1)
(t74 0)
(t75 0)
(t76 7)
(t77 5)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 1)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 6)
(t91 0)
(t92 1)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 1)
(t105 0)
(t106 2)
(t107 8)
(t108 0)
(t109 7)
(t110 10)
(t111 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 312 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35928ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 35929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36312 ms. Remains : 103/103 places, 139/139 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 97 transition count 117
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 119
Applied a total of 59 rules in 5 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 119 rows 74 cols
[2025-06-06 04:51:54] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:51:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:51:54] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:51:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:51:54] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-06 04:51:54] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-06 04:51:54] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 289 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[p0, p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 252 ms :[p0, p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 246 ms :[p0, p0, p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25353 reset in 151 ms.
Product exploration explored 100000 steps with 25331 reset in 154 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 262 ms :[p0, p0, p0, p0, p0, p0, true]
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 112 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 111 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 110 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 109 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 109 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 108 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 108 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 107 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 107 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 106 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 106 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 105 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 105 transition count 142
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 104 transition count 141
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 104 transition count 141
Applied a total of 19 rules in 19 ms. Remains 104 /113 variables (removed 9) and now considering 141/154 (removed 13) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:51:56] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
// Phase 1: matrix 141 rows 104 cols
[2025-06-06 04:51:56] [INFO ] Computed 4 invariants in 2 ms
[2025-06-06 04:51:56] [INFO ] State equation strengthened by 69 read => feed constraints.
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: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 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: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:52:08] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:52:17] [INFO ] Deduced a trap along path composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 245/245 variables, and 319 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36496ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 36497ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/113 places, 141/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36524 ms. Remains : 104/113 places, 141/154 transitions.
Built C files in :
/tmp/ltsmin12610598409372146914
[2025-06-06 04:52:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12610598409372146914
Running compilation step : cd /tmp/ltsmin12610598409372146914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin12610598409372146914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12610598409372146914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8188496845590025456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 112 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 111 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 110 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 109 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 109 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 108 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 108 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 107 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 107 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 106 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 106 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 105 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 105 transition count 142
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 104 transition count 141
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 104 transition count 141
Applied a total of 19 rules in 6 ms. Remains 104 /113 variables (removed 9) and now considering 141/154 (removed 13) transitions.
[2025-06-06 04:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:52:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 04:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:52:48] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 04:52:48] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2025-06-06 04:52:48] [INFO ] Invariant cache hit.
[2025-06-06 04:52:48] [INFO ] State equation strengthened by 69 read => feed constraints.
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: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7765 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 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: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 18852 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26675ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 26676ms
Starting structural reductions in LTL mode, iteration 1 : 104/113 places, 141/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27170 ms. Remains : 104/113 places, 141/154 transitions.
Built C files in :
/tmp/ltsmin16323075702589706427
[2025-06-06 04:53:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16323075702589706427
Running compilation step : cd /tmp/ltsmin16323075702589706427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 236 ms.
Running link step : cd /tmp/ltsmin16323075702589706427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16323075702589706427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased67549439122005535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 04:53:30] [INFO ] Flatten gal took : 11 ms
[2025-06-06 04:53:30] [INFO ] Flatten gal took : 7 ms
[2025-06-06 04:53:30] [INFO ] Time to serialize gal into /tmp/LTL16216812053055401605.gal : 1 ms
[2025-06-06 04:53:30] [INFO ] Time to serialize properties into /tmp/LTL6134756369228764166.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16216812053055401605.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17869544582514135811.hoa' '-atoms' '/tmp/LTL6134756369228764166.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6134756369228764166.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17869544582514135811.hoa
Detected timeout of ITS tools.
[2025-06-06 04:53:45] [INFO ] Flatten gal took : 8 ms
[2025-06-06 04:53:45] [INFO ] Flatten gal took : 7 ms
[2025-06-06 04:53:45] [INFO ] Time to serialize gal into /tmp/LTL11058082790475480710.gal : 1 ms
[2025-06-06 04:53:45] [INFO ] Time to serialize properties into /tmp/LTL7424227796937630234.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11058082790475480710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7424227796937630234.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((((X(X(X(X(!("((s1>=1)&&(l2235>=1))"))))))U((X(X(X(X(G(!("((s1>=1)&&(l2235>=1))")))))))||((!("((s1<1)||(l2231<1))"))&&(X(X(X(X(!("(...1268
Formula 0 simplified : ("((s1>=1)&&(l188>=1))" U (XXXX"((s1>=1)&&(l2235>=1))" R (XXXXF"((s1>=1)&&(l2235>=1))" & ("((s1<1)||(l2231<1))" | XXXX"((s1>=1)&&(l2...468
Detected timeout of ITS tools.
[2025-06-06 04:54:00] [INFO ] Flatten gal took : 9 ms
[2025-06-06 04:54:00] [INFO ] Applying decomposition
[2025-06-06 04:54:00] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12065390031038740308.txt' '-o' '/tmp/graph12065390031038740308.bin' '-w' '/tmp/graph12065390031038740308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12065390031038740308.bin' '-l' '-1' '-v' '-w' '/tmp/graph12065390031038740308.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:54:00] [INFO ] Decomposing Gal with order
[2025-06-06 04:54:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:54:00] [INFO ] Removed a total of 143 redundant transitions.
[2025-06-06 04:54:00] [INFO ] Flatten gal took : 17 ms
[2025-06-06 04:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 5 ms.
[2025-06-06 04:54:00] [INFO ] Time to serialize gal into /tmp/LTL8187983480432037717.gal : 2 ms
[2025-06-06 04:54:00] [INFO ] Time to serialize properties into /tmp/LTL15414610281783091539.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8187983480432037717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15414610281783091539.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((((X(X(X(X(!("((i5.u0.s1>=1)&&(i6.u21.l2235>=1))"))))))U((X(X(X(X(G(!("((i5.u0.s1>=1)&&(i6.u21.l2235>=1))")))))))||((!("((i5.u0.s1<...1669
Formula 0 simplified : ("((i5.u0.s1>=1)&&(i2.u8.l188>=1))" U (XXXX"((i5.u0.s1>=1)&&(i6.u21.l2235>=1))" R (XXXXF"((i5.u0.s1>=1)&&(i6.u21.l2235>=1))" & ("((i...661
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 finished in 319859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(((p1||F(p2)) U (p0 U p3)))))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 156 transition count 254
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 156 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 156 transition count 249
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 71 place count 136 transition count 227
Iterating global reduction 1 with 20 rules applied. Total rules applied 91 place count 136 transition count 227
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 100 place count 136 transition count 218
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 125 transition count 200
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 125 transition count 200
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 127 place count 125 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 123 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 123 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 121 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 121 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 120 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 120 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 119 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 119 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 118 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 118 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 117 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 117 transition count 185
Applied a total of 143 rules in 20 ms. Remains 117 /179 variables (removed 62) and now considering 185/471 (removed 286) transitions.
// Phase 1: matrix 185 rows 117 cols
[2025-06-06 04:54:15] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:54:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 04:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:54:15] [INFO ] State equation strengthened by 103 read => feed constraints.
[2025-06-06 04:54:16] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-06 04:54:16] [INFO ] Invariant cache hit.
[2025-06-06 04:54:16] [INFO ] State equation strengthened by 103 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 5 (OVERLAPS) 185/302 variables, 117/121 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 103/224 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 224 constraints, problems are : Problem set: 3 solved, 181 unsolved in 11271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 181 unsolved
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: 3 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 2/116 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 185/301 variables, 116/120 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 103/223 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 20/243 constraints. Problems are: Problem set: 3 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:54:34] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 1/244 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 1/302 variables, 1/245 constraints. Problems are: Problem set: 3 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 161/406 constraints. Problems are: Problem set: 3 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 406 constraints, problems are : Problem set: 3 solved, 181 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 181/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41381ms problems are : Problem set: 3 solved, 181 unsolved
Search for dead transitions found 3 dead transitions in 41382ms
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 : 117/179 places, 182/471 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 182
Applied a total of 3 rules in 3 ms. Remains 114 /117 variables (removed 3) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 114 cols
[2025-06-06 04:54:57] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:54:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-06 04:54:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:54:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-06 04:54:58] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 114/179 places, 182/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42701 ms. Remains : 114/179 places, 182/471 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p2) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 finished in 42999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!p0 U X(X(p1))))) U (F(!p2)&&G(!p3))))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 156 transition count 242
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 156 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 156 transition count 237
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 72 place count 135 transition count 214
Iterating global reduction 1 with 21 rules applied. Total rules applied 93 place count 135 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 101 place count 135 transition count 206
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 122 transition count 184
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 122 transition count 184
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 134 place count 122 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 119 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 119 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 116 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 116 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 115 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 114 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 114 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 113 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 113 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 112 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 112 transition count 165
Applied a total of 154 rules in 17 ms. Remains 112 /179 variables (removed 67) and now considering 165/471 (removed 306) transitions.
// Phase 1: matrix 165 rows 112 cols
[2025-06-06 04:54:58] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:54:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 04:54:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:54:58] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-06 04:55:01] [INFO ] Implicit Places using invariants and state equation in 2316 ms returned []
Implicit Place search using SMT with State Equation took 2389 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-06 04:55:01] [INFO ] Invariant cache hit.
[2025-06-06 04:55:01] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 5 (OVERLAPS) 165/277 variables, 112/116 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 88/204 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 204 constraints, problems are : Problem set: 3 solved, 161 unsolved in 7756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 161 unsolved
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: 3 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 165/276 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 88/203 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 19/222 constraints. Problems are: Problem set: 3 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:55:14] [INFO ] Deduced a trap along path composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 1/223 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 1/277 variables, 1/224 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 142/366 constraints. Problems are: Problem set: 3 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:55:30] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 1/367 constraints. Problems are: Problem set: 3 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 367 constraints, problems are : Problem set: 3 solved, 161 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 161/164 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37834ms problems are : Problem set: 3 solved, 161 unsolved
Search for dead transitions found 3 dead transitions in 37835ms
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 : 112/179 places, 162/471 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 162
Applied a total of 3 rules in 2 ms. Remains 109 /112 variables (removed 3) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 109 cols
[2025-06-06 04:55:38] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:55:38] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-06 04:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:55:38] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-06 04:55:40] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/179 places, 162/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41396 ms. Remains : 109/179 places, 162/471 transitions.
Stuttering acceptance computed with spot in 641 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
Product exploration explored 100000 steps with 26805 reset in 176 ms.
Product exploration explored 100000 steps with 26924 reset in 179 ms.
Computed a total of 17 stabilizing places and 24 stable transitions
Graph (complete) has 378 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 191 ms. Reduced automaton from 16 states, 33 edges and 4 AP (stutter sensitive) to 16 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 653 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
RANDOM walk for 40000 steps (8879 resets) in 256 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1856 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1842 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1855 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1947 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1845 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1906 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1880 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1944 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1897 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 477107 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :7 out of 13
Probabilistic random walk after 477107 steps, saw 215054 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :7
[2025-06-06 04:55:45] [INFO ] Invariant cache hit.
[2025-06-06 04:55:45] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 23/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 143/224 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 68/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 47/271 variables, 28/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 200 constraints, problems are : Problem set: 0 solved, 6 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:55:45] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:55:45] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/81 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 143/224 variables, 81/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 68/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 47/271 variables, 28/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 19/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/271 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 208 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1927ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7340 ms.
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 162/162 transitions.
Graph (complete) has 339 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 108 transition count 160
Applied a total of 3 rules in 5 ms. Remains 108 /109 variables (removed 1) and now considering 160/162 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 108/109 places, 160/162 transitions.
RANDOM walk for 40000 steps (8995 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1981 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1868 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1825 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1900 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1843 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 454258 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 6
Probabilistic random walk after 454258 steps, saw 204483 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
// Phase 1: matrix 160 rows 108 cols
[2025-06-06 04:55:57] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 04:55:57] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 141/203 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 66/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 65/268 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 19/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 196 constraints, problems are : Problem set: 0 solved, 6 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:55:58] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 141/203 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 65/268 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 19/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 203 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2416ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4594 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 160/160 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 108/108 places, 160/160 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2025-06-06 04:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:56:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 04:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:56:04] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-06 04:56:05] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:56:05] [INFO ] Redundant transitions in 1 ms returned []
Running 159 sub problems to find dead transitions.
[2025-06-06 04:56:05] [INFO ] Invariant cache hit.
[2025-06-06 04:56:05] [INFO ] State equation strengthened by 85 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, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/268 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 85/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 196 constraints, problems are : Problem set: 0 solved, 159 unsolved in 8295 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 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: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/268 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 85/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 159/355 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:56:23] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 356 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38366ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 38367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39073 ms. Remains : 108/108 places, 160/160 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 108 transition count 153
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 102 transition count 153
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 102 transition count 139
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 88 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 59 place count 79 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 78 transition count 140
Applied a total of 61 rules in 5 ms. Remains 78 /108 variables (removed 30) and now considering 140/160 (removed 20) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 140 rows 78 cols
[2025-06-06 04:56:43] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:56:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:56:43] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:56:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:56:43] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-06 04:56:44] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-06 04:56:44] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 539 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p3 (NOT p0)))), (F p0), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 412 ms. Reduced automaton from 16 states, 33 edges and 4 AP (stutter sensitive) to 16 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 583 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
Stuttering acceptance computed with spot in 584 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 109 cols
[2025-06-06 04:56:45] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:56:45] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 04:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:56:45] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-06 04:56:46] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 04:56:46] [INFO ] Invariant cache hit.
[2025-06-06 04:56:46] [INFO ] State equation strengthened by 87 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, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 162/271 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 87/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 200 constraints, problems are : Problem set: 0 solved, 161 unsolved in 8540 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
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, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 162/271 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 87/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 161/361 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:57:06] [INFO ] Deduced a trap along path composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 362 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38626ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 38627ms
Finished structural reductions in LTL mode , in 1 iterations and 39777 ms. Remains : 109/109 places, 162/162 transitions.
Computed a total of 17 stabilizing places and 24 stable transitions
Graph (complete) has 378 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 189 ms. Reduced automaton from 16 states, 33 edges and 4 AP (stutter sensitive) to 16 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 587 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
RANDOM walk for 40000 steps (8945 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1828 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1985 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1890 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1881 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1951 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1852 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 72 ms. (547 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1839 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1845 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 380268 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :7 out of 13
Probabilistic random walk after 380268 steps, saw 172569 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :7
[2025-06-06 04:57:29] [INFO ] Invariant cache hit.
[2025-06-06 04:57:29] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 23/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 143/224 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 68/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 47/271 variables, 28/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 200 constraints, problems are : Problem set: 0 solved, 6 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:57:30] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:57:30] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/81 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 143/224 variables, 81/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 68/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 47/271 variables, 28/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 19/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/271 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 208 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1964ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7454 ms.
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 162/162 transitions.
Graph (complete) has 339 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 108 transition count 160
Applied a total of 3 rules in 3 ms. Remains 108 /109 variables (removed 1) and now considering 160/162 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 108/109 places, 160/162 transitions.
RANDOM walk for 40000 steps (9022 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1820 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1953 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 461362 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 6
Probabilistic random walk after 461362 steps, saw 207350 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
// Phase 1: matrix 160 rows 108 cols
[2025-06-06 04:57:42] [INFO ] Computed 3 invariants in 0 ms
[2025-06-06 04:57:42] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 141/203 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 66/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 65/268 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 19/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 196 constraints, problems are : Problem set: 0 solved, 6 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:57:42] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 141/203 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 65/268 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 19/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 203 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2405ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4536 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 160/160 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 108/108 places, 160/160 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2025-06-06 04:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:57:49] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-06 04:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:57:49] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-06 04:57:50] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:57:50] [INFO ] Redundant transitions in 1 ms returned []
Running 159 sub problems to find dead transitions.
[2025-06-06 04:57:50] [INFO ] Invariant cache hit.
[2025-06-06 04:57:50] [INFO ] State equation strengthened by 85 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, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/268 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 85/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 196 constraints, problems are : Problem set: 0 solved, 159 unsolved in 8308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 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: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/268 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 85/196 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 159/355 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:58:08] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 356 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38384ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 38385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39188 ms. Remains : 108/108 places, 160/160 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 108 transition count 153
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 102 transition count 153
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 102 transition count 139
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 88 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 59 place count 79 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 78 transition count 140
Applied a total of 61 rules in 5 ms. Remains 78 /108 variables (removed 30) and now considering 140/160 (removed 20) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 140 rows 78 cols
[2025-06-06 04:58:28] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:58:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:58:28] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 04:58:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 04:58:28] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-06 04:58:28] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-06 04:58:28] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 529 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p3 (NOT p0)))), (F p0), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 416 ms. Reduced automaton from 16 states, 33 edges and 4 AP (stutter sensitive) to 16 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 653 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
Stuttering acceptance computed with spot in 658 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
Stuttering acceptance computed with spot in 681 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
Product exploration explored 100000 steps with 26899 reset in 176 ms.
Product exploration explored 100000 steps with 26824 reset in 191 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true, true, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 631 ms :[(OR p2 p3), (NOT p1), p3, p2, (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p3), (NOT p1), (NOT p1), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND p3 (NOT p1)), p3]
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 162/162 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:58:32] [INFO ] Redundant transitions in 1 ms returned []
Running 161 sub problems to find dead transitions.
// Phase 1: matrix 162 rows 109 cols
[2025-06-06 04:58:32] [INFO ] Computed 4 invariants in 2 ms
[2025-06-06 04:58:32] [INFO ] State equation strengthened by 87 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, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 162/271 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 87/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 200 constraints, problems are : Problem set: 0 solved, 161 unsolved in 8506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
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, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 162/271 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 87/200 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 161/361 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:58:51] [INFO ] Deduced a trap along path composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 362 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38589ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 38589ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38604 ms. Remains : 109/109 places, 162/162 transitions.
Built C files in :
/tmp/ltsmin1456205068125826703
[2025-06-06 04:59:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1456205068125826703
Running compilation step : cd /tmp/ltsmin1456205068125826703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin1456205068125826703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1456205068125826703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14060918030437766464.hoa' '--buchi-type=spotba'
LTSmin run took 442 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 finished in 253345 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 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 153 transition count 215
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 153 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 153 transition count 210
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 80 place count 130 transition count 185
Iterating global reduction 1 with 23 rules applied. Total rules applied 103 place count 130 transition count 185
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 130 transition count 176
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 116 transition count 152
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 116 transition count 152
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 148 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 112 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 112 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 160 place count 108 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 108 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 106 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 106 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 170 place count 106 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 104 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 102 transition count 126
Applied a total of 178 rules in 28 ms. Remains 102 /179 variables (removed 77) and now considering 126/471 (removed 345) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 04:59:11] [INFO ] Computed 4 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:59:12] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-06 04:59:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:59:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 04:59:12] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:59:12] [INFO ] Redundant transitions in 0 ms returned []
Running 125 sub problems to find dead transitions.
[2025-06-06 04:59:12] [INFO ] Invariant cache hit.
[2025-06-06 04:59:12] [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 5655 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 04:59:21] [INFO ] Deduced a trap along path composed of 20 places in 36 ms of which 2 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:59:38] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/228 variables, 1/286 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 286 constraints, problems are : Problem set: 3 solved, 122 unsolved in 30024 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: 1/1 constraints]
After SMT, in 35737ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 35737ms
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/179 places, 123/471 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 3 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 04:59:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:59:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 04:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:59:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 04:59:48] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/179 places, 123/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36628 ms. Remains : 99/179 places, 123/471 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
Product exploration explored 100000 steps with 22419 reset in 129 ms.
Product exploration explored 100000 steps with 22527 reset in 138 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.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8977 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2268306 steps, run timeout after 3001 ms. (steps per millisecond=755 ) properties seen :0 out of 1
Probabilistic random walk after 2268306 steps, saw 952715 distinct states, run finished after 3001 ms. (steps per millisecond=755 ) properties seen :0
[2025-06-06 04:59:52] [INFO ] Invariant cache hit.
[2025-06-06 04:59:52] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 123/123 transitions.
Graph (complete) has 289 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 121
Applied a total of 3 rules in 2 ms. Remains 98 /99 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/99 places, 121/123 transitions.
RANDOM walk for 40000 steps (8967 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2286357 steps, run timeout after 3001 ms. (steps per millisecond=761 ) properties seen :0 out of 1
Probabilistic random walk after 2286357 steps, saw 960355 distinct states, run finished after 3003 ms. (steps per millisecond=761 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 04:59:55] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 04:59:55] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 04:59:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:59:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 04:59:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:59:56] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 04:59:56] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:59:56] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 04:59:56] [INFO ] Invariant cache hit.
[2025-06-06 04:59:56] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4771 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:00:13] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/219 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 275 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34822ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 34823ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35150 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 9 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 05:00:31] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 05:00:31] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-06 05:00:31] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 05:00:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-06 05:00:31] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 05:00:31] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 05:00:31] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 179 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2025-06-06 05:00:31] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:00:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 05:00:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:00:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 05:00:32] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:00:32] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-06 05:00:32] [INFO ] Invariant cache hit.
[2025-06-06 05:00:32] [INFO ] State equation strengthened by 55 read => feed constraints.
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: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4195 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 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: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 17715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21948ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 21949ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22391 ms. Remains : 99/99 places, 123/123 transitions.
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.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8945 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1893 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2239494 steps, run timeout after 3001 ms. (steps per millisecond=746 ) properties seen :0 out of 1
Probabilistic random walk after 2239494 steps, saw 940802 distinct states, run finished after 3001 ms. (steps per millisecond=746 ) properties seen :0
[2025-06-06 05:00:57] [INFO ] Invariant cache hit.
[2025-06-06 05:00:57] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 123/123 transitions.
Graph (complete) has 289 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 121
Applied a total of 3 rules in 2 ms. Remains 98 /99 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/99 places, 121/123 transitions.
RANDOM walk for 40000 steps (8950 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2285606 steps, run timeout after 3001 ms. (steps per millisecond=761 ) properties seen :0 out of 1
Probabilistic random walk after 2285606 steps, saw 960041 distinct states, run finished after 3001 ms. (steps per millisecond=761 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 05:01:00] [INFO ] Computed 3 invariants in 3 ms
[2025-06-06 05:01:00] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 462ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 05:01:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:01:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 05:01:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:01:01] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 05:01:01] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:01:01] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 05:01:01] [INFO ] Invariant cache hit.
[2025-06-06 05:01:01] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4837 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:01:19] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/219 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 275 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34898ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 34899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35219 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 10 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 05:01:36] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 05:01:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 05:01:36] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 05:01:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 05:01:36] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 05:01:36] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 05:01:36] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 183 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22448 reset in 131 ms.
Product exploration explored 100000 steps with 22442 reset in 135 ms.
Built C files in :
/tmp/ltsmin2597475608380646492
[2025-06-06 05:01:37] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2025-06-06 05:01:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:01:37] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2025-06-06 05:01:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:01:37] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2025-06-06 05:01:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:01:37] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2597475608380646492
Running compilation step : cd /tmp/ltsmin2597475608380646492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin2597475608380646492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2597475608380646492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1246114224657452549.hoa' '--buchi-type=spotba'
LTSmin run took 439 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 finished in 146080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 471/471 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 153 transition count 204
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 153 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 153 transition count 200
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 80 place count 129 transition count 174
Iterating global reduction 1 with 24 rules applied. Total rules applied 104 place count 129 transition count 174
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 114 place count 129 transition count 164
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 129 place count 114 transition count 138
Iterating global reduction 2 with 15 rules applied. Total rules applied 144 place count 114 transition count 138
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 153 place count 114 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 158 place count 109 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 163 place count 109 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 168 place count 104 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 173 place count 104 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 101 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 101 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 101 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 184 place count 98 transition count 109
Iterating global reduction 4 with 3 rules applied. Total rules applied 187 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 188 place count 97 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 96 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 96 transition count 107
Applied a total of 191 rules in 11 ms. Remains 96 /179 variables (removed 83) and now considering 107/471 (removed 364) transitions.
// Phase 1: matrix 107 rows 96 cols
[2025-06-06 05:01:38] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:01:38] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 05:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:01:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 05:01:38] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 05:01:38] [INFO ] Invariant cache hit.
[2025-06-06 05:01:38] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 5 (OVERLAPS) 107/203 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 41/141 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 141 constraints, problems are : Problem set: 3 solved, 103 unsolved in 4055 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 107/202 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 41/140 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 16/156 constraints. Problems are: Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:01:45] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 1/157 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 1/203 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 87/245 constraints. Problems are: Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:01:54] [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/203 variables, 1/246 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 16 (OVERLAPS) 0/203 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 246 constraints, problems are : Problem set: 3 solved, 103 unsolved in 27123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 103/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31217ms problems are : Problem set: 3 solved, 103 unsolved
Search for dead transitions found 3 dead transitions in 31217ms
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 : 96/179 places, 104/471 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 93 transition count 104
Applied a total of 3 rules in 1 ms. Remains 93 /96 variables (removed 3) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 93 cols
[2025-06-06 05:02:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:02:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 05:02:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:02:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 05:02:09] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/179 places, 104/471 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31855 ms. Remains : 93/179 places, 104/471 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 finished in 31979 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))) U (G((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))||(!p2&&(X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0)))))))))) U (G((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))||(!p0&&((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))) U (G((X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))||(!p2&&(X(X(X(X(!p0)))) U ((!p1&&X(X(X(X(!p0)))))||X(X(X(X(G(!p0))))))))))))))'
[2025-06-06 05:02:10] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8045933852009588650
[2025-06-06 05:02:10] [INFO ] Applying decomposition
[2025-06-06 05:02:10] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2025-06-06 05:02:10] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:02:10] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2025-06-06 05:02:10] [INFO ] Flatten gal took : 18 ms
[2025-06-06 05:02:10] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16455422955479342837.txt' '-o' '/tmp/graph16455422955479342837.bin' '-w' '/tmp/graph16455422955479342837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16455422955479342837.bin' '-l' '-1' '-v' '-w' '/tmp/graph16455422955479342837.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:02:10] [INFO ] Decomposing Gal with order
[2025-06-06 05:02:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:02:10] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2025-06-06 05:02:10] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:02:10] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8045933852009588650
Running compilation step : cd /tmp/ltsmin8045933852009588650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-06 05:02:10] [INFO ] Removed a total of 204 redundant transitions.
[2025-06-06 05:02:10] [INFO ] Flatten gal took : 50 ms
[2025-06-06 05:02:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 229 labels/synchronizations in 11 ms.
[2025-06-06 05:02:10] [INFO ] Time to serialize gal into /tmp/LTLFireability10999247124203057861.gal : 4 ms
[2025-06-06 05:02:10] [INFO ] Time to serialize properties into /tmp/LTLFireability1971440798400341297.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10999247124203057861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1971440798400341297.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G("((u0.s1<1)||(i1.u7.l104<1))"))))
Formula 0 simplified : GF!"((u0.s1<1)||(i1.u7.l104<1))"
Compilation finished in 1132 ms.
Running link step : cd /tmp/ltsmin8045933852009588650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8045933852009588650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8045933852009588650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8045933852009588650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((X(X(X(X(!(LTLAPp1==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp1==true))))))||X(X(X(X([](!(LTLAPp1==true)))))))) U ([]((X(X(X(X(!(LTLAPp1==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp1==true))))))||X(X(X(X([](!(LTLAPp1==true)))))))))||(!(LTLAPp3==true)&&(X(X(X(X(!(LTLAPp1==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp1==true))))))||X(X(X(X([](!(LTLAPp1==true))))))))))) U ([]((X(X(X(X(!(LTLAPp1==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp1==true))))))||X(X(X(X([](!(LTLAPp1==true)))))))))||(!(LTLAPp1==true)&&((X(X(X(X(!(LTLAPp1==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp1==true))))))||X(X(X(X([](!(LTLAPp1==true)))))))) U ([]((X(X(X(X(!(LTLAPp1==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp1==true))))))||X(X(X(X([](!(LTLAPp1==true)))))))))||(!(LTLAPp3==true)&&(X(X(X(X(!(LTLAPp1==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp1==true))))))||X(X(X(X([](!(LTLAPp1==true))))))))))))))' '--buchi-type=spotba'
LTSmin run took 5079 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8045933852009588650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-06 05:31:21] [INFO ] Flatten gal took : 57 ms
[2025-06-06 05:31:21] [INFO ] Time to serialize gal into /tmp/LTLFireability7611287196725467322.gal : 2 ms
[2025-06-06 05:31:21] [INFO ] Time to serialize properties into /tmp/LTLFireability10499187040489233164.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7611287196725467322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10499187040489233164.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l104<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l104<1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m36"
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-d2m36, 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-174901994400476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 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 '
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 ;