Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749157932011

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-05 21:12:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 21:12:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 21:12:13] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-06-05 21:12:13] [INFO ] Transformed 1295 places.
[2025-06-05 21:12:13] [INFO ] Transformed 749 transitions.
[2025-06-05 21:12:13] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 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 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 315 place count 184 transition count 236
Iterating global reduction 1 with 58 rules applied. Total rules applied 373 place count 184 transition count 236
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 380 place count 184 transition count 229
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 418 place count 146 transition count 191
Iterating global reduction 2 with 38 rules applied. Total rules applied 456 place count 146 transition count 191
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 466 place count 146 transition count 181
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 493 place count 119 transition count 152
Iterating global reduction 3 with 27 rules applied. Total rules applied 520 place count 119 transition count 152
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 535 place count 119 transition count 137
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 539 place count 115 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 543 place count 115 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 546 place count 112 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 549 place count 112 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 550 place count 111 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 551 place count 111 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 552 place count 111 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 553 place count 110 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 554 place count 110 transition count 125
Applied a total of 554 rules in 78 ms. Remains 110 /259 variables (removed 149) and now considering 125/749 (removed 624) transitions.
// Phase 1: matrix 125 rows 110 cols
[2025-06-05 21:12:13] [INFO ] Computed 5 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:12:13] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-05 21:12:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:12:14] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-05 21:12:14] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-05 21:12:14] [INFO ] Invariant cache hit.
[2025-06-05 21:12:14] [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/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:16] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:16] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 125/235 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 51/168 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/235 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 168 constraints, problems are : Problem set: 0 solved, 124 unsolved in 8581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 125/235 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 51/168 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 124/292 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:28] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:29] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:34] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:41] [INFO ] Deduced a trap along path composed of 4 places in 41 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:52] [INFO ] Deduced a trap along path composed of 10 places in 23 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 297 constraints, problems are : Problem set: 0 solved, 124 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38750ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 38759ms
Starting structural reductions in LTL mode, iteration 1 : 110/259 places, 125/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39380 ms. Remains : 110/259 places, 125/749 transitions.
Support contains 6 out of 110 places after structural reductions.
[2025-06-05 21:12:53] [INFO ] Flatten gal took : 29 ms
[2025-06-05 21:12:53] [INFO ] Flatten gal took : 14 ms
[2025-06-05 21:12:53] [INFO ] Input system was already deterministic with 125 transitions.
RANDOM walk for 40000 steps (8955 resets) in 1246 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (4200 resets) in 668 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4175 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4154 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4144 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4145 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4169 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 793881 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :2 out of 6
Probabilistic random walk after 793881 steps, saw 384142 distinct states, run finished after 3006 ms. (steps per millisecond=264 ) properties seen :2
[2025-06-05 21:12:57] [INFO ] Invariant cache hit.
[2025-06-05 21:12:57] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 68/72 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 3 (OVERLAPS) 21/93 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/205 variables, 93/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 38/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/235 variables, 17/153 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 13/166 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/235 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 166 constraints, problems are : Problem set: 2 solved, 2 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 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: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/71 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/93 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 112/205 variables, 93/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 38/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/235 variables, 17/155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 13/168 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:12:57] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 1/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/235 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 169 constraints, problems are : Problem set: 2 solved, 2 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 637ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 125/125 transitions.
Graph (complete) has 309 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 123
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 105 transition count 119
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 105 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 105 transition count 118
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 102 transition count 115
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 102 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 102 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 99 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 29 place count 96 transition count 105
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 96 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 93 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 93 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 93 transition count 100
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 42 place count 90 transition count 97
Iterating global reduction 4 with 3 rules applied. Total rules applied 45 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 47 place count 88 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 88 transition count 95
Applied a total of 49 rules in 33 ms. Remains 88 /110 variables (removed 22) and now considering 95/125 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 88/110 places, 95/125 transitions.
RANDOM walk for 40000 steps (8922 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4075 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4175 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 891721 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :0 out of 2
Probabilistic random walk after 891721 steps, saw 419164 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
// Phase 1: matrix 95 rows 88 cols
[2025-06-05 21:13:01] [INFO ] Computed 4 invariants in 6 ms
[2025-06-05 21:13:01] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/64 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 74/138 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/164 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 28/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/183 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 9/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 129 constraints, problems are : Problem set: 0 solved, 2 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/64 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 74/138 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:01] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/164 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 19/183 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 88/88 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2025-06-05 21:13:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:13:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 21:13:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:13:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 21:13:01] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:13:01] [INFO ] Redundant transitions in 3 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-05 21:13:01] [INFO ] Invariant cache hit.
[2025-06-05 21:13:01] [INFO ] State equation strengthened by 37 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, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/183 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 37/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 129 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 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, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/183 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 37/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 94/223 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:08] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:13] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:24] [INFO ] Deduced a trap along path composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/183 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 226 constraints, problems are : Problem set: 0 solved, 94 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33180ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 33182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33424 ms. Remains : 88/88 places, 95/95 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 88 transition count 89
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 84 transition count 89
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 10 place count 84 transition count 73
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 42 place count 68 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 62 transition count 67
Applied a total of 54 rules in 20 ms. Remains 62 /88 variables (removed 26) and now considering 67/95 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 67 rows 62 cols
[2025-06-05 21:13:34] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:13:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 21:13:34] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 35 ms returned sat
[2025-06-05 21:13:35] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2025-06-05 21:13:35] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2025-06-05 21:13:35] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:13:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-05 21:13:35] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 21:13:35] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:35] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 3 ms to minimize.
[2025-06-05 21:13:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 1
[2025-06-05 21:13:35] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 21:13:35] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 439 ms.
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 38 stable transitions
Graph (complete) has 348 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 105 transition count 119
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 101 transition count 115
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 101 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 101 transition count 111
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 98 transition count 107
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 95 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 95 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 92 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 92 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 92 transition count 99
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 89 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 87 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 87 transition count 94
Applied a total of 52 rules in 19 ms. Remains 87 /110 variables (removed 23) and now considering 94/125 (removed 31) transitions.
// Phase 1: matrix 94 rows 87 cols
[2025-06-05 21:13:35] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:13:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-05 21:13:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:13:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 21:13:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:13:35] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2025-06-05 21:13:35] [INFO ] Invariant cache hit.
[2025-06-05 21:13:35] [INFO ] State equation strengthened by 37 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, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:36] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:36] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 94/181 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:39] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:39] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:39] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:39] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:39] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/181 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:39] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:40] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:40] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:40] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:40] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:40] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:40] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:40] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/181 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 144 constraints, problems are : Problem set: 0 solved, 93 unsolved in 8126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 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, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/181 variables, 87/107 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:13:47] [INFO ] Deduced a trap along path composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 238 constraints, problems are : Problem set: 0 solved, 93 unsolved in 17673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25842ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 25843ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/110 places, 94/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26229 ms. Remains : 87/110 places, 94/125 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08
Product exploration explored 100000 steps with 22449 reset in 276 ms.
Product exploration explored 100000 steps with 22501 reset in 158 ms.
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 273 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8873 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4091 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 976547 steps, run visited all 1 properties in 1025 ms. (steps per millisecond=952 )
Probabilistic random walk after 976547 steps, saw 460889 distinct states, run finished after 1028 ms. (steps per millisecond=949 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08 finished in 28231 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 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 125/125 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 101 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 101 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 101 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 98 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 95 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 95 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 92 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 89 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 86 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 85 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 84 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 83 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 83 transition count 90
Applied a total of 58 rules in 25 ms. Remains 83 /110 variables (removed 27) and now considering 90/125 (removed 35) transitions.
// Phase 1: matrix 90 rows 83 cols
[2025-06-05 21:14:03] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:14:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 21:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:14:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-05 21:14:03] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:14:03] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2025-06-05 21:14:03] [INFO ] Invariant cache hit.
[2025-06-05 21:14:03] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:04] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:04] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:05] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:05] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:06] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:06] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 131 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:09] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/173 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/132 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 89/221 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:12] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:12] [INFO ] Deduced a trap along path composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 223 constraints, problems are : Problem set: 0 solved, 89 unsolved in 15501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 21150ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 21150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/110 places, 90/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21443 ms. Remains : 83/110 places, 90/125 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15
Product exploration explored 100000 steps with 22399 reset in 117 ms.
Product exploration explored 100000 steps with 22449 reset in 121 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8966 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4098 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 9 ms. (steps per millisecond=421 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 9 ms. (steps per millisecond=421 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 90/90 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-06-05 21:14:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:14:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 21:14:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:14:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-05 21:14:26] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:14:26] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2025-06-05 21:14:26] [INFO ] Invariant cache hit.
[2025-06-05 21:14:26] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:26] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:27] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:28] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:28] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:28] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:28] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:29] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 131 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/173 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/132 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 89/221 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:34] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:14:34] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 223 constraints, problems are : Problem set: 0 solved, 89 unsolved in 15617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 21306ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 21307ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21572 ms. Remains : 83/83 places, 90/90 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8946 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4161 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 8 ms. (steps per millisecond=474 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 8 ms. (steps per millisecond=474 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22558 reset in 94 ms.
Product exploration explored 100000 steps with 22535 reset in 141 ms.
Built C files in :
/tmp/ltsmin10662405751231040762
[2025-06-05 21:14:48] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2025-06-05 21:14:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:14:48] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2025-06-05 21:14:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:14:48] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2025-06-05 21:14:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:14:48] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10662405751231040762
Running compilation step : cd /tmp/ltsmin10662405751231040762;'/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 477 ms.
Running link step : cd /tmp/ltsmin10662405751231040762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10662405751231040762;'/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/stateBased10159470540069629992.hoa' '--buchi-type=spotba'
LTSmin run took 318 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 finished in 45507 ms.
All properties solved by simple procedures.
Total runtime 155884 ms.

BK_STOP 1749158089172

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-174901994300419"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;