Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 450K 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-d1m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749158099981

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-d1m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 21:15:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 21:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 21:15:01] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-05 21:15:01] [INFO ] Transformed 1295 places.
[2025-06-05 21:15:01] [INFO ] Transformed 749 transitions.
[2025-06-05 21:15:01] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 302 place count 197 transition count 382
Iterating global reduction 1 with 45 rules applied. Total rules applied 347 place count 197 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 354 place count 197 transition count 375
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 383 place count 168 transition count 346
Iterating global reduction 2 with 29 rules applied. Total rules applied 412 place count 168 transition count 346
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 419 place count 168 transition count 339
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 434 place count 153 transition count 324
Iterating global reduction 3 with 15 rules applied. Total rules applied 449 place count 153 transition count 324
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 479 place count 153 transition count 294
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 482 place count 150 transition count 289
Iterating global reduction 4 with 3 rules applied. Total rules applied 485 place count 150 transition count 289
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 488 place count 147 transition count 286
Iterating global reduction 4 with 3 rules applied. Total rules applied 491 place count 147 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 492 place count 146 transition count 285
Iterating global reduction 4 with 1 rules applied. Total rules applied 493 place count 146 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 494 place count 145 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 495 place count 145 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 496 place count 144 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 497 place count 144 transition count 283
Applied a total of 497 rules in 91 ms. Remains 144 /259 variables (removed 115) and now considering 283/749 (removed 466) transitions.
// Phase 1: matrix 283 rows 144 cols
[2025-06-05 21:15:01] [INFO ] Computed 5 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:15:02] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-06-05 21:15:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:15:02] [INFO ] State equation strengthened by 181 read => feed constraints.
[2025-06-05 21:15:02] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2025-06-05 21:15:03] [INFO ] Invariant cache hit.
[2025-06-05 21:15:03] [INFO ] State equation strengthened by 181 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:07] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:07] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:07] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:07] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:08] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:08] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 283/427 variables, 144/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 181/336 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:18] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
Problem TDEAD257 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:18] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:18] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:18] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 11 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 4/340 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/340 constraints. Problems are: Problem set: 3 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/427 variables, and 340 constraints, problems are : Problem set: 3 solved, 279 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 4/144 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 9/15 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 283/427 variables, 144/159 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 181/340 constraints. Problems are: Problem set: 3 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 279/619 constraints. Problems are: Problem set: 3 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:53] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:15:55] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 621 constraints, problems are : Problem set: 3 solved, 279 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 279/282 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60491ms problems are : Problem set: 3 solved, 279 unsolved
Search for dead transitions found 3 dead transitions in 60514ms
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 : 144/259 places, 280/749 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 141 transition count 280
Applied a total of 3 rules in 4 ms. Remains 141 /144 variables (removed 3) and now considering 280/280 (removed 0) transitions.
// Phase 1: matrix 280 rows 141 cols
[2025-06-05 21:16:03] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:16:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-05 21:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:16:03] [INFO ] State equation strengthened by 180 read => feed constraints.
[2025-06-05 21:16:04] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/259 places, 280/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62892 ms. Remains : 141/259 places, 280/749 transitions.
Support contains 24 out of 141 places after structural reductions.
[2025-06-05 21:16:04] [INFO ] Flatten gal took : 39 ms
[2025-06-05 21:16:04] [INFO ] Flatten gal took : 20 ms
[2025-06-05 21:16:04] [INFO ] Input system was already deterministic with 280 transitions.
RANDOM walk for 40000 steps (8916 resets) in 2493 ms. (16 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4003 steps (173 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (180 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (183 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (389 resets) in 56 ms. (70 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (184 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (182 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (182 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (201 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (177 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (192 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (188 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (174 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (175 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (168 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (200 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (195 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (385 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
[2025-06-05 21:16:05] [INFO ] Invariant cache hit.
[2025-06-05 21:16:05] [INFO ] State equation strengthened by 180 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 65/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 32/118 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:16:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:16:05] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 263/381 variables, 118/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 163/287 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 9 (OVERLAPS) 40/421 variables, 23/310 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 17/327 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/327 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/421 variables, 0/327 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 327 constraints, problems are : Problem set: 2 solved, 15 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 141/141 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 65/85 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 32/117 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 252/369 variables, 117/123 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 152/275 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/275 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 52/421 variables, 24/299 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 28/327 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 15/342 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 342 constraints, problems are : Problem set: 2 solved, 15 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 141/141 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7014ms problems are : Problem set: 2 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 280/280 transitions.
Graph (complete) has 499 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 140 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 138 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 138 transition count 266
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 138 transition count 265
Applied a total of 8 rules in 38 ms. Remains 138 /141 variables (removed 3) and now considering 265/280 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 138/141 places, 265/280 transitions.
RANDOM walk for 40000 steps (8967 resets) in 522 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (191 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (201 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (420 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (179 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (189 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (201 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (193 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (189 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (195 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (196 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (201 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (183 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (193 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (187 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (416 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 650136 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :12 out of 15
Probabilistic random walk after 650136 steps, saw 288749 distinct states, run finished after 3005 ms. (steps per millisecond=216 ) properties seen :12
// Phase 1: matrix 265 rows 138 cols
[2025-06-05 21:16:16] [INFO ] Computed 3 invariants in 2 ms
[2025-06-05 21:16:16] [INFO ] State equation strengthened by 165 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 260/397 variables, 128/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 132/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/403 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 306 constraints, problems are : Problem set: 0 solved, 3 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 138/138 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 260/397 variables, 128/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 132/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/403 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:16:17] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/403 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 138/138 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4390ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2626 ms.
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 265/265 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 124 transition count 180
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 124 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 124 transition count 179
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 113 transition count 168
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 113 transition count 168
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 113 transition count 161
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 67 place count 104 transition count 150
Iterating global reduction 2 with 9 rules applied. Total rules applied 76 place count 104 transition count 150
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 87 place count 104 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 102 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 102 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 100 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 100 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 98 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 98 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 98 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 96 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 96 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 95 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 94 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 94 transition count 124
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 93 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 93 transition count 123
Applied a total of 113 rules in 27 ms. Remains 93 /138 variables (removed 45) and now considering 123/265 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 93/138 places, 123/265 transitions.
RANDOM walk for 40000 steps (8934 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1891 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1908 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 798881 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 3
Probabilistic random walk after 798881 steps, saw 336895 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
// Phase 1: matrix 123 rows 93 cols
[2025-06-05 21:16:26] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 21:16:26] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 121/210 variables, 83/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/216 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/216 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 158 constraints, problems are : Problem set: 0 solved, 3 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 121/210 variables, 83/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/216 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/216 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 161 constraints, problems are : Problem set: 0 solved, 3 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 834ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1767 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 93/93 places, 123/123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-05 21:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:16:28] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 21:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:16:28] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-05 21:16:29] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:16:29] [INFO ] Redundant transitions in 5 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-05 21:16:29] [INFO ] Invariant cache hit.
[2025-06-05 21:16:29] [INFO ] State equation strengthened by 62 read => feed constraints.
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: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:16:29] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/216 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 62/159 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:16:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 160 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 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/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/216 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 62/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 122/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:16:43] [INFO ] Deduced a trap along path composed of 17 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/216 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 283 constraints, problems are : Problem set: 0 solved, 122 unsolved in 27750 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35920ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 35920ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36241 ms. Remains : 93/93 places, 123/123 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 93 transition count 116
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 87 transition count 116
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 87 transition count 102
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 73 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 65 transition count 94
Applied a total of 57 rules in 18 ms. Remains 65 /93 variables (removed 28) and now considering 94/123 (removed 29) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 65 cols
[2025-06-05 21:17:05] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:17:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 21:17:05] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:17:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 21:17:05] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-06-05 21:17:05] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-05 21:17:05] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 332 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 28 stabilizing places and 47 stable transitions
Graph (complete) has 552 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((X(p1)&&F(p2)))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 125 transition count 173
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 125 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 125 transition count 171
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 112 transition count 158
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 112 transition count 158
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 112 transition count 151
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 103 transition count 140
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 103 transition count 140
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 94 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 101 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 97 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 94 transition count 121
Applied a total of 112 rules in 23 ms. Remains 94 /141 variables (removed 47) and now considering 121/280 (removed 159) transitions.
// Phase 1: matrix 121 rows 94 cols
[2025-06-05 21:17:05] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:17:05] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 21:17:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:17:05] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-05 21:17:06] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-05 21:17:06] [INFO ] Invariant cache hit.
[2025-06-05 21:17:06] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/215 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 158 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 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/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:17:13] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/215 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 120/279 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:17:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:17:28] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:17:28] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:17:31] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 215/215 variables, and 283 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36184ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 36185ms
Starting structural reductions in LTL mode, iteration 1 : 94/141 places, 121/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36666 ms. Remains : 94/141 places, 121/280 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 finished in 37092 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 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 162
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 124 transition count 160
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 110 transition count 146
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 110 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 72 place count 110 transition count 138
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 100 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 100 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 100 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 97 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 97 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 94 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 92 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 87 transition count 102
Applied a total of 128 rules in 30 ms. Remains 87 /141 variables (removed 54) and now considering 102/280 (removed 178) transitions.
// Phase 1: matrix 102 rows 87 cols
[2025-06-05 21:17:42] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:17:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 21:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:17:42] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 21:17:43] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:17:43] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-05 21:17:43] [INFO ] Invariant cache hit.
[2025-06-05 21:17:43] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:17:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 239 constraints, problems are : Problem set: 0 solved, 101 unsolved in 12598 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18812ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 18813ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/141 places, 102/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19142 ms. Remains : 87/141 places, 102/280 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-01
Product exploration explored 100000 steps with 22321 reset in 273 ms.
Product exploration explored 100000 steps with 22389 reset in 183 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 277 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 29 ms :[p0]
RANDOM walk for 40000 steps (8943 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1878 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2322103 steps, run timeout after 3001 ms. (steps per millisecond=773 ) properties seen :0 out of 1
Probabilistic random walk after 2322103 steps, saw 958973 distinct states, run finished after 3001 ms. (steps per millisecond=773 ) properties seen :0
[2025-06-05 21:18:05] [INFO ] Invariant cache hit.
[2025-06-05 21:18:05] [INFO ] State equation strengthened by 46 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) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 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) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:18:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 244 edges and 87 vertex of which 86 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 86 transition count 100
Applied a total of 3 rules in 4 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/87 places, 100/102 transitions.
RANDOM walk for 40000 steps (8958 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1940 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2512890 steps, run timeout after 3001 ms. (steps per millisecond=837 ) properties seen :0 out of 1
Probabilistic random walk after 2512890 steps, saw 1035210 distinct states, run finished after 3002 ms. (steps per millisecond=837 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2025-06-05 21:18:09] [INFO ] Computed 3 invariants in 3 ms
[2025-06-05 21:18:09] [INFO ] State equation strengthened by 44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-06-05 21:18:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:18:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 21:18:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:18:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 21:18:09] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:18:09] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2025-06-05 21:18:09] [INFO ] Invariant cache hit.
[2025-06-05 21:18:09] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:18:11] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4597 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/186 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 99/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:18:18] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:18:18] [INFO ] Deduced a trap along path composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/186 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 235 constraints, problems are : Problem set: 0 solved, 99 unsolved in 19047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 23685ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 23686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23970 ms. Remains : 86/86 places, 100/100 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 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
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 80 transition count 79
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 66 transition count 79
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 55 place count 59 transition count 72
Applied a total of 55 rules in 10 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2025-06-05 21:18:33] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 21:18:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:18:33] [INFO ] After 53ms 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-05 21:18:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-05 21:18:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:18:33] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 21:18:33] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 21:18:33] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 87 cols
[2025-06-05 21:18:33] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:18:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 21:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:18:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 21:18:34] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:18:34] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-05 21:18:34] [INFO ] Invariant cache hit.
[2025-06-05 21:18:34] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:18:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 239 constraints, problems are : Problem set: 0 solved, 101 unsolved in 12398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18621ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 18621ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18911 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 277 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT 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 41 ms :[p0]
RANDOM walk for 40000 steps (8925 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2479660 steps, run timeout after 3001 ms. (steps per millisecond=826 ) properties seen :0 out of 1
Probabilistic random walk after 2479660 steps, saw 1021789 distinct states, run finished after 3001 ms. (steps per millisecond=826 ) properties seen :0
[2025-06-05 21:18:55] [INFO ] Invariant cache hit.
[2025-06-05 21:18:55] [INFO ] State equation strengthened by 46 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) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 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) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:18:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 244 edges and 87 vertex of which 86 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 86 transition count 100
Applied a total of 3 rules in 3 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/87 places, 100/102 transitions.
RANDOM walk for 40000 steps (8959 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1921 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2526064 steps, run timeout after 3001 ms. (steps per millisecond=841 ) properties seen :0 out of 1
Probabilistic random walk after 2526064 steps, saw 1040332 distinct states, run finished after 3002 ms. (steps per millisecond=841 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2025-06-05 21:18:59] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 21:18:59] [INFO ] State equation strengthened by 44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 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) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-06-05 21:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:18:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 21:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:18:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 21:19:00] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:19:00] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2025-06-05 21:19:00] [INFO ] Invariant cache hit.
[2025-06-05 21:19:00] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:01] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4711 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/186 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 99/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:08] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:09] [INFO ] Deduced a trap along path composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/186 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 235 constraints, problems are : Problem set: 0 solved, 99 unsolved in 19021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 23761ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 23762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24047 ms. Remains : 86/86 places, 100/100 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 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
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 80 transition count 79
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 66 transition count 79
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 55 place count 59 transition count 72
Applied a total of 55 rules in 13 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2025-06-05 21:19:23] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:19:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 21:19:23] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:19:23] [INFO ] After 56ms 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-05 21:19:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-05 21:19:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 21:19:24] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 21:19:24] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 21:19:24] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Product exploration explored 100000 steps with 22370 reset in 121 ms.
Product exploration explored 100000 steps with 22430 reset in 122 ms.
Built C files in :
/tmp/ltsmin7474085050294338999
[2025-06-05 21:19:24] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2025-06-05 21:19:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:19:24] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2025-06-05 21:19:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:19:24] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2025-06-05 21:19:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:19:24] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7474085050294338999
Running compilation step : cd /tmp/ltsmin7474085050294338999;'/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 318 ms.
Running link step : cd /tmp/ltsmin7474085050294338999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7474085050294338999;'/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/stateBased6945494724485041384.hoa' '--buchi-type=spotba'
LTSmin run took 912 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 finished in 103082 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(X(p0)))))||G(p1)))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 125 transition count 163
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 125 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 125 transition count 161
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 112 transition count 148
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 112 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 112 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 103 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 103 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 93 place count 103 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 101 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 101 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 99 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 99 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 98 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 98 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 98 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 97 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 97 transition count 115
Applied a total of 107 rules in 13 ms. Remains 97 /141 variables (removed 44) and now considering 115/280 (removed 165) transitions.
// Phase 1: matrix 115 rows 97 cols
[2025-06-05 21:19:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:19:25] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-05 21:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:19:26] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-05 21:19:26] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2025-06-05 21:19:26] [INFO ] Invariant cache hit.
[2025-06-05 21:19:26] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/212 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 51/152 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:30] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:30] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/212 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 154 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8494 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/212 variables, 97/103 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 114/268 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:38] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:46] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:19:46] [INFO ] Deduced a trap along path composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 271 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38549ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 38550ms
Starting structural reductions in LTL mode, iteration 1 : 97/141 places, 115/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39126 ms. Remains : 97/141 places, 115/280 transitions.
Stuttering acceptance computed with spot in 460 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-03
Product exploration explored 100000 steps with 22491 reset in 213 ms.
Product exploration explored 100000 steps with 22369 reset in 129 ms.
Computed a total of 26 stabilizing places and 34 stable transitions
Graph (complete) has 310 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 26 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 13 states, 20 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9001 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1898 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4104 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4151 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4090 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2794 steps, run visited all 4 properties in 8 ms. (steps per millisecond=349 )
Probabilistic random walk after 2794 steps, saw 1415 distinct states, run finished after 11 ms. (steps per millisecond=254 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 378 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2025-06-05 21:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:20:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 21:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:20:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-05 21:20:07] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2025-06-05 21:20:07] [INFO ] Invariant cache hit.
[2025-06-05 21:20:07] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/212 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 51/152 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:20:11] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:20:11] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/212 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 154 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/212 variables, 97/103 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 114/268 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:20:19] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:20:27] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:20:27] [INFO ] Deduced a trap along path composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 271 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38549ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 38550ms
Finished structural reductions in LTL mode , in 1 iterations and 38853 ms. Remains : 97/97 places, 115/115 transitions.
Computed a total of 26 stabilizing places and 34 stable transitions
Graph (complete) has 310 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8991 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1880 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4033 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4111 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4137 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2794 steps, run visited all 4 properties in 9 ms. (steps per millisecond=310 )
Probabilistic random walk after 2794 steps, saw 1415 distinct states, run finished after 9 ms. (steps per millisecond=310 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22456 reset in 120 ms.
Product exploration explored 100000 steps with 22472 reset in 128 ms.
Applying partial POR strategy [true, false, true, false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 115/115 transitions.
Applied a total of 0 rules in 10 ms. Remains 97 /97 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:20:48] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2025-06-05 21:20:48] [INFO ] Invariant cache hit.
[2025-06-05 21:20:48] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/212 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 51/152 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:20:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:20:52] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/212 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 154 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/212 variables, 97/103 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 114/268 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:00] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:09] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:09] [INFO ] Deduced a trap along path composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 271 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38417ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 38418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38436 ms. Remains : 97/97 places, 115/115 transitions.
Built C files in :
/tmp/ltsmin10740849284750101311
[2025-06-05 21:21:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10740849284750101311
Running compilation step : cd /tmp/ltsmin10740849284750101311;'/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 201 ms.
Running link step : cd /tmp/ltsmin10740849284750101311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10740849284750101311;'/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/stateBased1922562463559988554.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 finished in 122036 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 p1)) U ((X((p1 U G(p2))) U p2) U X(p2))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 126 transition count 174
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 126 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 126 transition count 172
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 114 transition count 160
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 114 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 63 place count 114 transition count 153
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 106 transition count 144
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 106 transition count 144
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 87 place count 106 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 104 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 104 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 102 transition count 132
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 102 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 101 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 101 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 100 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 100 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 99 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 99 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 98 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 98 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 97 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 97 transition count 126
Applied a total of 105 rules in 21 ms. Remains 97 /141 variables (removed 44) and now considering 126/280 (removed 154) transitions.
// Phase 1: matrix 126 rows 97 cols
[2025-06-05 21:21:27] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:21:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 21:21:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:21:28] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-05 21:21:28] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-05 21:21:28] [INFO ] Invariant cache hit.
[2025-06-05 21:21:28] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/223 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 62/163 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/223 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/223 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 164 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:38] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 126/223 variables, 97/103 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 125/290 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 290 constraints, problems are : Problem set: 0 solved, 125 unsolved in 14944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24542ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 24544ms
Starting structural reductions in LTL mode, iteration 1 : 97/141 places, 126/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24887 ms. Remains : 97/141 places, 126/280 transitions.
Stuttering acceptance computed with spot in 437 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p2), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 finished in 25352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 125 transition count 173
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 125 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 125 transition count 171
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 112 transition count 158
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 112 transition count 158
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 112 transition count 151
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 103 transition count 140
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 103 transition count 140
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 94 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 101 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 99 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 97 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 97 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 109 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 95 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 95 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 94 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 93 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 93 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 92 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 92 transition count 116
Applied a total of 119 rules in 40 ms. Remains 92 /141 variables (removed 49) and now considering 116/280 (removed 164) transitions.
// Phase 1: matrix 116 rows 92 cols
[2025-06-05 21:21:53] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:21:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 21:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:21:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-05 21:21:53] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:21:53] [INFO ] Redundant transitions in 1 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-05 21:21:53] [INFO ] Invariant cache hit.
[2025-06-05 21:21:53] [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/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:54] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 115/269 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:07] [INFO ] Deduced a trap along path composed of 17 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 270 constraints, problems are : Problem set: 0 solved, 115 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28533ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 28534ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/141 places, 116/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28907 ms. Remains : 92/141 places, 116/280 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-05
Product exploration explored 100000 steps with 22472 reset in 186 ms.
Product exploration explored 100000 steps with 22458 reset in 186 ms.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 300 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (8937 resets) in 149 ms. (266 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (1917 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1847 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1946 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
[2025-06-05 21:22:23] [INFO ] Invariant cache hit.
[2025-06-05 21:22:23] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 103/175 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 43/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 33/208 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 152 constraints, problems are : Problem set: 0 solved, 5 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:23] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 20/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 103/175 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 43/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 33/208 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:23] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/208 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 159 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 515 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 116/116 transitions.
Graph (complete) has 265 edges and 92 vertex of which 91 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 91 transition count 114
Applied a total of 3 rules in 3 ms. Remains 91 /92 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 91/92 places, 114/116 transitions.
RANDOM walk for 40000 steps (8983 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1941 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1992 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 36099 steps, run visited all 5 properties in 125 ms. (steps per millisecond=288 )
Probabilistic random walk after 36099 steps, saw 16097 distinct states, run finished after 125 ms. (steps per millisecond=288 ) properties seen :5
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p2 (NOT p1)) p0))), (F (NOT (OR p2 (NOT p0) p1))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 13 factoid took 385 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2025-06-05 21:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:22:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 21:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:22:25] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-05 21:22:26] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:22:26] [INFO ] Redundant transitions in 1 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-05 21:22:26] [INFO ] Invariant cache hit.
[2025-06-05 21:22:26] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:27] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8401 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 115/269 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:39] [INFO ] Deduced a trap along path composed of 17 places in 29 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 270 constraints, problems are : Problem set: 0 solved, 115 unsolved in 19941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28374ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 28375ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28684 ms. Remains : 92/92 places, 116/116 transitions.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 300 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (9080 resets) in 140 ms. (283 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (1903 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1909 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1988 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
[2025-06-05 21:22:54] [INFO ] Invariant cache hit.
[2025-06-05 21:22:54] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 103/175 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 43/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 33/208 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 152 constraints, problems are : Problem set: 0 solved, 5 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:55] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 20/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 103/175 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 43/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 33/208 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 13/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/208 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 159 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1239ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 477 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 116/116 transitions.
Graph (complete) has 265 edges and 92 vertex of which 91 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 91 transition count 114
Applied a total of 3 rules in 3 ms. Remains 91 /92 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 91/92 places, 114/116 transitions.
RANDOM walk for 40000 steps (8964 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1935 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1954 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1937 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 36099 steps, run visited all 5 properties in 117 ms. (steps per millisecond=308 )
Probabilistic random walk after 36099 steps, saw 16097 distinct states, run finished after 117 ms. (steps per millisecond=308 ) properties seen :5
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p2 (NOT p1)) p0))), (F (NOT (OR p2 (NOT p0) p1))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 13 factoid took 365 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 22407 reset in 153 ms.
Product exploration explored 100000 steps with 22515 reset in 260 ms.
Built C files in :
/tmp/ltsmin4589266011195961013
[2025-06-05 21:22:58] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2025-06-05 21:22:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:22:58] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2025-06-05 21:22:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:22:58] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2025-06-05 21:22:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:22:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4589266011195961013
Running compilation step : cd /tmp/ltsmin4589266011195961013;'/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 248 ms.
Running link step : cd /tmp/ltsmin4589266011195961013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4589266011195961013;'/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/stateBased17195757807099479688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2025-06-05 21:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:23:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 21:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:23:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-05 21:23:13] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:23:13] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-05 21:23:13] [INFO ] Invariant cache hit.
[2025-06-05 21:23:13] [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/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:14] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:16] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8641 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 115/269 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:27] [INFO ] Deduced a trap along path composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 270 constraints, problems are : Problem set: 0 solved, 115 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28768ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 28769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29101 ms. Remains : 92/92 places, 116/116 transitions.
Built C files in :
/tmp/ltsmin5547782569993057898
[2025-06-05 21:23:42] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2025-06-05 21:23:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:23:42] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2025-06-05 21:23:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:23:42] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2025-06-05 21:23:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:23:42] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5547782569993057898
Running compilation step : cd /tmp/ltsmin5547782569993057898;'/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 256 ms.
Running link step : cd /tmp/ltsmin5547782569993057898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5547782569993057898;'/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/stateBased561765133580319569.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 21:23:57] [INFO ] Flatten gal took : 6 ms
[2025-06-05 21:23:57] [INFO ] Flatten gal took : 6 ms
[2025-06-05 21:23:57] [INFO ] Time to serialize gal into /tmp/LTL11209489874507197493.gal : 2 ms
[2025-06-05 21:23:57] [INFO ] Time to serialize properties into /tmp/LTL14655428759797578255.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/LTL11209489874507197493.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4957858727447480884.hoa' '-atoms' '/tmp/LTL14655428759797578255.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/LTL14655428759797578255.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4957858727447480884.hoa
Detected timeout of ITS tools.
[2025-06-05 21:24:12] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:24:12] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:24:12] [INFO ] Time to serialize gal into /tmp/LTL13338417740641634621.gal : 1 ms
[2025-06-05 21:24:12] [INFO ] Time to serialize properties into /tmp/LTL6919634946828542528.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/LTL13338417740641634621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6919634946828542528.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 : !((G(F(((!("((s1>=1)&&(l1197>=1))"))U(("((!((s1>=1)&&(l1197>=1)))&&(!((s1>=1)&&(l1201>=1))))")||(G(!("((s1>=1)&&(l1197>=1))")))))&&("(...178
Formula 0 simplified : FG(!"((s1<1)||(l356<1))" | ("((s1>=1)&&(l1197>=1))" M !"((!((s1>=1)&&(l1197>=1)))&&(!((s1>=1)&&(l1201>=1))))"))
Detected timeout of ITS tools.
[2025-06-05 21:24:27] [INFO ] Flatten gal took : 5 ms
[2025-06-05 21:24:27] [INFO ] Applying decomposition
[2025-06-05 21:24:27] [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/graph11772969477534551932.txt' '-o' '/tmp/graph11772969477534551932.bin' '-w' '/tmp/graph11772969477534551932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11772969477534551932.bin' '-l' '-1' '-v' '-w' '/tmp/graph11772969477534551932.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:24:27] [INFO ] Decomposing Gal with order
[2025-06-05 21:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:24:27] [INFO ] Removed a total of 96 redundant transitions.
[2025-06-05 21:24:27] [INFO ] Flatten gal took : 41 ms
[2025-06-05 21:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 7 ms.
[2025-06-05 21:24:27] [INFO ] Time to serialize gal into /tmp/LTL10230050720647750604.gal : 3 ms
[2025-06-05 21:24:27] [INFO ] Time to serialize properties into /tmp/LTL2095024363339612475.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/LTL10230050720647750604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2095024363339612475.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 : !((G(F(((!("((i1.u1.s1>=1)&&(u0.l1197>=1))"))U(("((!((i1.u1.s1>=1)&&(u0.l1197>=1)))&&(!((i1.u1.s1>=1)&&(u0.l1201>=1))))")||(G(!("((i1....226
Formula 0 simplified : FG(!"((i1.u1.s1<1)||(i1.u1.l356<1))" | ("((i1.u1.s1>=1)&&(u0.l1197>=1))" M !"((!((i1.u1.s1>=1)&&(u0.l1197>=1)))&&(!((i1.u1.s1>=1)&&(...173
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 finished in 169632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(X((!p1||F(G(!p2)))) U ((!p0&&X((!p1||F(G(!p2)))))||X((F(G(!p2))||G(!p1))))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 126 transition count 175
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 126 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 126 transition count 174
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 113 transition count 161
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 113 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 113 transition count 154
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 104 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 104 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 92 place count 104 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 101 transition count 130
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 101 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 98 transition count 127
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 98 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 96 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 96 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 111 place count 96 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 94 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 94 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 93 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 93 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 92 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 91 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 91 transition count 116
Applied a total of 121 rules in 15 ms. Remains 91 /141 variables (removed 50) and now considering 116/280 (removed 164) transitions.
// Phase 1: matrix 116 rows 91 cols
[2025-06-05 21:24:42] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:24:42] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 21:24:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:24:42] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-05 21:24:43] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-05 21:24:43] [INFO ] Invariant cache hit.
[2025-06-05 21:24:43] [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/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/207 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 55/150 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:24:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 151 constraints, problems are : Problem set: 0 solved, 115 unsolved in 9106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/207 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 55/151 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 115/266 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:24:56] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:25:02] [INFO ] Deduced a trap along path composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 268 constraints, problems are : Problem set: 0 solved, 115 unsolved in 29799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38941ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 38942ms
Starting structural reductions in LTL mode, iteration 1 : 91/141 places, 116/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39301 ms. Remains : 91/141 places, 116/280 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (NOT p0), (AND p1 p2), (AND p1 p2), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 finished in 39606 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(G(!p0))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 162
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 124 transition count 160
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 110 transition count 146
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 110 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 72 place count 110 transition count 138
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 100 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 100 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 100 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 97 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 97 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 94 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 92 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 87 transition count 102
Applied a total of 128 rules in 16 ms. Remains 87 /141 variables (removed 54) and now considering 102/280 (removed 178) transitions.
// Phase 1: matrix 102 rows 87 cols
[2025-06-05 21:25:22] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:25:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 21:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:25:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 21:25:22] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-05 21:25:22] [INFO ] Invariant cache hit.
[2025-06-05 21:25:22] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:25:32] [INFO ] Deduced a trap along path composed of 17 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:25:32] [INFO ] Deduced a trap along path composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 240 constraints, problems are : Problem set: 0 solved, 101 unsolved in 17932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22678ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 22679ms
Starting structural reductions in LTL mode, iteration 1 : 87/141 places, 102/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22970 ms. Remains : 87/141 places, 102/280 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-07
Product exploration explored 100000 steps with 22383 reset in 145 ms.
Product exploration explored 100000 steps with 22385 reset in 163 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 277 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (9015 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1889 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2938 steps, run visited all 1 properties in 7 ms. (steps per millisecond=419 )
Probabilistic random walk after 2938 steps, saw 1477 distinct states, run finished after 7 ms. (steps per millisecond=419 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 131 ms :[true, p0, p0, p0]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-06-05 21:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:25:46] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 21:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:25:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 21:25:46] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-05 21:25:46] [INFO ] Invariant cache hit.
[2025-06-05 21:25:46] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:25:56] [INFO ] Deduced a trap along path composed of 17 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:25:56] [INFO ] Deduced a trap along path composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 240 constraints, problems are : Problem set: 0 solved, 101 unsolved in 17788 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22512ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 22512ms
Finished structural reductions in LTL mode , in 1 iterations and 22781 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 277 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (8966 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2938 steps, run visited all 1 properties in 7 ms. (steps per millisecond=419 )
Probabilistic random walk after 2938 steps, saw 1477 distinct states, run finished after 7 ms. (steps per millisecond=419 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 124 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 22388 reset in 122 ms.
Product exploration explored 100000 steps with 22386 reset in 144 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0, p0]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:26:10] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-05 21:26:10] [INFO ] Invariant cache hit.
[2025-06-05 21:26:10] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4669 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:26:19] [INFO ] Deduced a trap along path composed of 17 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:26:20] [INFO ] Deduced a trap along path composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 240 constraints, problems are : Problem set: 0 solved, 101 unsolved in 17541 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22243ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 22244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22258 ms. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin12929849114349958275
[2025-06-05 21:26:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12929849114349958275
Running compilation step : cd /tmp/ltsmin12929849114349958275;'/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 183 ms.
Running link step : cd /tmp/ltsmin12929849114349958275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12929849114349958275;'/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/stateBased9632589404773026247.hoa' '--buchi-type=spotba'
LTSmin run took 697 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 finished in 71202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U ((p1||X(X(p1))) U p0)))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 125 transition count 163
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 125 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 125 transition count 162
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 111 transition count 148
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 111 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 69 place count 111 transition count 140
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 101 transition count 128
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 101 transition count 128
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 101 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 98 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 95 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 95 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 93 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 93 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 93 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 91 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 89 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 89 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 88 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 88 transition count 104
Applied a total of 125 rules in 13 ms. Remains 88 /141 variables (removed 53) and now considering 104/280 (removed 176) transitions.
// Phase 1: matrix 104 rows 88 cols
[2025-06-05 21:26:33] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:26:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 21:26:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:26:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 21:26:33] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-05 21:26:33] [INFO ] Invariant cache hit.
[2025-06-05 21:26:33] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 48/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 140 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3720 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 48/140 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 103/243 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:26:41] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:26:48] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:26:48] [INFO ] Deduced a trap along path composed of 17 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:26:50] [INFO ] Deduced a trap along path composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 247 constraints, problems are : Problem set: 0 solved, 103 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33759ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 33759ms
Starting structural reductions in LTL mode, iteration 1 : 88/141 places, 104/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34029 ms. Remains : 88/141 places, 104/280 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 finished in 34356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 162
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 124 transition count 160
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 110 transition count 146
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 110 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 72 place count 110 transition count 138
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 100 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 100 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 100 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 97 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 97 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 94 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 92 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 87 transition count 102
Applied a total of 128 rules in 21 ms. Remains 87 /141 variables (removed 54) and now considering 102/280 (removed 178) transitions.
// Phase 1: matrix 102 rows 87 cols
[2025-06-05 21:27:08] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:27:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 21:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:27:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 21:27:08] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:27:08] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-05 21:27:08] [INFO ] Invariant cache hit.
[2025-06-05 21:27:08] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:27:17] [INFO ] Deduced a trap along path composed of 17 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:27:18] [INFO ] Deduced a trap along path composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 240 constraints, problems are : Problem set: 0 solved, 101 unsolved in 17587 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22115ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 22115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/141 places, 102/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22424 ms. Remains : 87/141 places, 102/280 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 finished in 22473 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 p0))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 162
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 124 transition count 160
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 110 transition count 146
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 110 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 72 place count 110 transition count 138
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 100 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 100 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 100 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 97 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 97 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 94 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 92 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 87 transition count 102
Applied a total of 128 rules in 24 ms. Remains 87 /141 variables (removed 54) and now considering 102/280 (removed 178) transitions.
// Phase 1: matrix 102 rows 87 cols
[2025-06-05 21:27:30] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:27:30] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-05 21:27:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:27:30] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 21:27:30] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:27:30] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-05 21:27:30] [INFO ] Invariant cache hit.
[2025-06-05 21:27:30] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/189 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:27:32] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5616 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:27:36] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 102/189 variables, 87/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 101/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:27:42] [INFO ] Deduced a trap along path composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 241 constraints, problems are : Problem set: 0 solved, 101 unsolved in 17693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23341ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 23341ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/141 places, 102/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23700 ms. Remains : 87/141 places, 102/280 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 finished in 23786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 126 transition count 164
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 126 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 126 transition count 162
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 113 transition count 149
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 113 transition count 149
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 113 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 104 transition count 130
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 104 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 104 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 101 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 101 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 98 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 98 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 96 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 96 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 108 place count 96 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 94 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 94 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 93 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 92 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 92 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 91 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 91 transition count 108
Applied a total of 118 rules in 19 ms. Remains 91 /141 variables (removed 50) and now considering 108/280 (removed 172) transitions.
// Phase 1: matrix 108 rows 91 cols
[2025-06-05 21:27:54] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:27:54] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-05 21:27:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:27:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-05 21:27:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:27:54] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2025-06-05 21:27:54] [INFO ] Invariant cache hit.
[2025-06-05 21:27:54] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/199 variables, 91/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:27:56] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 145 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/199 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 107/252 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:28:06] [INFO ] Deduced a trap along path composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 18932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25230ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 25231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/141 places, 108/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25525 ms. Remains : 91/141 places, 108/280 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 finished in 25616 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)&&F(G((p1||X(p2)))))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 280/280 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 125 transition count 163
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 125 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 125 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 113 transition count 149
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 113 transition count 149
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 113 transition count 142
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 105 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 105 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 105 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 102 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 102 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 99 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 99 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 97 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 97 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 97 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 95 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 94 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 94 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 93 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 93 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 92 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 92 transition count 110
Applied a total of 115 rules in 13 ms. Remains 92 /141 variables (removed 49) and now considering 110/280 (removed 170) transitions.
// Phase 1: matrix 110 rows 92 cols
[2025-06-05 21:28:19] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:28:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 21:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:28:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-05 21:28:20] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-06-05 21:28:20] [INFO ] Invariant cache hit.
[2025-06-05 21:28:20] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/202 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 145 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4692 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/202 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 109/254 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:28:33] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:28:33] [INFO ] Deduced a trap along path composed of 17 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:28:39] [INFO ] Deduced a trap along path composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 257 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 34739ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 34740ms
Starting structural reductions in LTL mode, iteration 1 : 92/141 places, 110/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35003 ms. Remains : 92/141 places, 110/280 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-14
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 finished in 35128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p1 U (p2||G(!p1)))))))'
[2025-06-05 21:28:55] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin722983998772274173
[2025-06-05 21:28:55] [INFO ] Computing symmetric may disable matrix : 280 transitions.
[2025-06-05 21:28:55] [INFO ] Applying decomposition
[2025-06-05 21:28:55] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:28:55] [INFO ] Flatten gal took : 12 ms
[2025-06-05 21:28:55] [INFO ] Computing symmetric may enable matrix : 280 transitions.
[2025-06-05 21:28:55] [INFO ] Computation of Complete enable matrix. took 2 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/graph12002873869203392009.txt' '-o' '/tmp/graph12002873869203392009.bin' '-w' '/tmp/graph12002873869203392009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12002873869203392009.bin' '-l' '-1' '-v' '-w' '/tmp/graph12002873869203392009.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:28:55] [INFO ] Computing Do-Not-Accords matrix : 280 transitions.
[2025-06-05 21:28:55] [INFO ] Decomposing Gal with order
[2025-06-05 21:28:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:28:55] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:28:55] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin722983998772274173
Running compilation step : cd /tmp/ltsmin722983998772274173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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-05 21:28:55] [INFO ] Removed a total of 165 redundant transitions.
[2025-06-05 21:28:55] [INFO ] Flatten gal took : 33 ms
[2025-06-05 21:28:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 6 ms.
[2025-06-05 21:28:55] [INFO ] Time to serialize gal into /tmp/LTLFireability620622464502622152.gal : 6 ms
[2025-06-05 21:28:55] [INFO ] Time to serialize properties into /tmp/LTLFireability10154469030542653309.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/LTLFireability620622464502622152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10154469030542653309.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u0.s1<1)||(i5.i1.u18.l356<1))")&&((!("((u0.s1>=1)&&(u0.l1197>=1))"))U(("((!((u0.s1>=1)&&(u0.l1197>=1)))&&(!((u0.s1>=1)&&(u0...215
Formula 0 simplified : FG(!"((u0.s1<1)||(i5.i1.u18.l356<1))" | ("((u0.s1>=1)&&(u0.l1197>=1))" M !"((!((u0.s1>=1)&&(u0.l1197>=1)))&&(!((u0.s1>=1)&&(u0.l1201...165
Compilation finished in 613 ms.
Running link step : cd /tmp/ltsmin722983998772274173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin722983998772274173;'/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)&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-05 21:53:34] [INFO ] Flatten gal took : 43 ms
[2025-06-05 21:53:34] [INFO ] Time to serialize gal into /tmp/LTLFireability7051939516139435687.gal : 2 ms
[2025-06-05 21:53:34] [INFO ] Time to serialize properties into /tmp/LTLFireability5845360539281545289.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/LTLFireability7051939516139435687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5845360539281545289.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l356<1))")&&((!("((s1>=1)&&(l1197>=1))"))U(("((!((s1>=1)&&(l1197>=1)))&&(!((s1>=1)&&(l1201>=1))))")||(G(!("((s1>=1)...178
Formula 0 simplified : FG(!"((s1<1)||(l356<1))" | ("((s1>=1)&&(l1197>=1))" M !"((!((s1>=1)&&(l1197>=1)))&&(!((s1>=1)&&(l1201>=1))))"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.049: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.049: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.075: Initializing POR dependencies: labels 283, guards 280
pins2lts-mc-linux64( 1/ 8), 0.082: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.082: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.124: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.134: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.300: LTL layer: formula: [](<>(((LTLAPp0==true)&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.300: "[](<>(((LTLAPp0==true)&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.300: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.596: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.601: There are 284 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.601: State length is 142, there are 288 groups
pins2lts-mc-linux64( 0/ 8), 0.601: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.601: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.601: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.601: Visible groups: 0 / 288, labels: 3 / 284
pins2lts-mc-linux64( 0/ 8), 0.601: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.601: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.641: [Blue] ~45 levels ~960 states ~2240 transitions
pins2lts-mc-linux64( 0/ 8), 0.658: [Blue] ~48 levels ~1920 states ~4080 transitions
pins2lts-mc-linux64( 0/ 8), 0.705: [Blue] ~59 levels ~3840 states ~8944 transitions
pins2lts-mc-linux64( 7/ 8), 0.812: [Blue] ~92 levels ~7680 states ~18072 transitions
pins2lts-mc-linux64( 7/ 8), 0.998: [Blue] ~92 levels ~15360 states ~34424 transitions
pins2lts-mc-linux64( 2/ 8), 1.375: [Blue] ~232 levels ~30720 states ~68976 transitions
pins2lts-mc-linux64( 0/ 8), 1.952: [Blue] ~219 levels ~61440 states ~135536 transitions
pins2lts-mc-linux64( 0/ 8), 3.276: [Blue] ~219 levels ~122880 states ~272384 transitions
pins2lts-mc-linux64( 2/ 8), 5.613: [Blue] ~302 levels ~245760 states ~537336 transitions
pins2lts-mc-linux64( 4/ 8), 9.774: [Blue] ~828 levels ~491520 states ~1057696 transitions
pins2lts-mc-linux64( 6/ 8), 17.367: [Blue] ~1071 levels ~983040 states ~2158328 transitions
pins2lts-mc-linux64( 3/ 8), 32.842: [Blue] ~3286 levels ~1966080 states ~4328368 transitions
pins2lts-mc-linux64( 4/ 8), 63.669: [Blue] ~867 levels ~3932160 states ~8730752 transitions
pins2lts-mc-linux64( 2/ 8), 126.034: [Blue] ~652 levels ~7864320 states ~17754120 transitions
pins2lts-mc-linux64( 2/ 8), 263.201: [Blue] ~792 levels ~15728640 states ~35541688 transitions
pins2lts-mc-linux64( 1/ 8), 523.633: [Blue] ~29327 levels ~31457280 states ~71500760 transitions
pins2lts-mc-linux64( 1/ 8), 1029.974: [Blue] ~56928 levels ~62914560 states ~144003016 transitions
pins2lts-mc-linux64( 1/ 8), 2045.433: [Blue] ~108693 levels ~125829120 states ~289346280 transitions
pins2lts-mc-linux64( 3/ 8), 2288.135: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2288.233:
pins2lts-mc-linux64( 0/ 8), 2288.233: Explored 130608518 states 317443095 transitions, fanout: 2.430
pins2lts-mc-linux64( 0/ 8), 2288.233: Total exploration time 2287.620 sec (2287.530 sec minimum, 2287.569 sec on average)
pins2lts-mc-linux64( 0/ 8), 2288.233: States per second: 57094, Transitions per second: 138766
pins2lts-mc-linux64( 0/ 8), 2288.233:
pins2lts-mc-linux64( 0/ 8), 2288.233: State space has 134217336 states, 79445 are accepting
pins2lts-mc-linux64( 0/ 8), 2288.233: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2288.233: blue states: 130608518 (97.31%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2288.233: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2288.233: all-red states: 79445 (0.06%), bogus 7 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2288.233:
pins2lts-mc-linux64( 0/ 8), 2288.233: Total memory used for local state coloring: 9.8MB
pins2lts-mc-linux64( 0/ 8), 2288.233:
pins2lts-mc-linux64( 0/ 8), 2288.233: Queue width: 8B, total height: 640334, memory: 4.89MB
pins2lts-mc-linux64( 0/ 8), 2288.233: Tree memory: 1116.9MB, 8.7 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 2288.233: Tree fill ratio (roots/leafs): 99.0%/36.0%
pins2lts-mc-linux64( 0/ 8), 2288.233: Stored 282 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2288.233: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2288.233: Est. total memory use: 1121.8MB (~1028.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin722983998772274173;'/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)&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin722983998772274173;'/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)&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)

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

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

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