Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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 4.0K 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-d1m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749174002944

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-d1m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 01:40:04] [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-06 01:40:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 01:40:04] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-06 01:40:04] [INFO ] Transformed 1295 places.
[2025-06-06 01:40:04] [INFO ] Transformed 749 transitions.
[2025-06-06 01:40:04] [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 2 formulas.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 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 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 316 place count 183 transition count 235
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 235
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 381 place count 183 transition count 229
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 424 place count 140 transition count 186
Iterating global reduction 2 with 43 rules applied. Total rules applied 467 place count 140 transition count 186
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 482 place count 140 transition count 171
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 507 place count 115 transition count 144
Iterating global reduction 3 with 25 rules applied. Total rules applied 532 place count 115 transition count 144
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 546 place count 115 transition count 130
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 553 place count 108 transition count 120
Iterating global reduction 4 with 7 rules applied. Total rules applied 560 place count 108 transition count 120
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 567 place count 101 transition count 113
Iterating global reduction 4 with 7 rules applied. Total rules applied 574 place count 101 transition count 113
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 578 place count 97 transition count 108
Iterating global reduction 4 with 4 rules applied. Total rules applied 582 place count 97 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 583 place count 97 transition count 107
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 586 place count 94 transition count 104
Iterating global reduction 5 with 3 rules applied. Total rules applied 589 place count 94 transition count 104
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 591 place count 92 transition count 102
Iterating global reduction 5 with 2 rules applied. Total rules applied 593 place count 92 transition count 102
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 594 place count 91 transition count 100
Iterating global reduction 5 with 1 rules applied. Total rules applied 595 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 596 place count 90 transition count 99
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 90 transition count 99
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 598 place count 89 transition count 98
Iterating global reduction 5 with 1 rules applied. Total rules applied 599 place count 89 transition count 98
Applied a total of 599 rules in 87 ms. Remains 89 /259 variables (removed 170) and now considering 98/749 (removed 651) transitions.
// Phase 1: matrix 98 rows 89 cols
[2025-06-06 01:40:04] [INFO ] Computed 5 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 01:40:04] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-06 01:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 01:40:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-06 01:40:05] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-06 01:40:05] [INFO ] Invariant cache hit.
[2025-06-06 01:40:05] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:06] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:06] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/187 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:08] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:08] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:08] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:08] [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-06 01:40:08] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:09] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:09] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:11] [INFO ] Deduced a trap along path composed of 17 places in 37 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 147 constraints, problems are : Problem set: 0 solved, 97 unsolved in 10711 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:16] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/187 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 42/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 97/244 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 245 constraints, problems are : Problem set: 0 solved, 97 unsolved in 14158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24976ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 24996ms
Starting structural reductions in LTL mode, iteration 1 : 89/259 places, 98/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25654 ms. Remains : 89/259 places, 98/749 transitions.
Support contains 4 out of 89 places after structural reductions.
[2025-06-06 01:40:30] [INFO ] Flatten gal took : 24 ms
[2025-06-06 01:40:30] [INFO ] Flatten gal took : 11 ms
[2025-06-06 01:40:30] [INFO ] Input system was already deterministic with 98 transitions.
RANDOM walk for 40000 steps (8856 resets) in 938 ms. (42 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (3938 resets) in 427 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3863 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
[2025-06-06 01:40:30] [INFO ] Invariant cache hit.
[2025-06-06 01:40:30] [INFO ] State equation strengthened by 42 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 3 (OVERLAPS) 18/71 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/155 variables, 71/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 28/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/187 variables, 18/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 14/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/187 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 136 constraints, problems are : Problem set: 1 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/52 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/71 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/155 variables, 71/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 28/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/187 variables, 18/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 14/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 137 constraints, problems are : Problem set: 1 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 98/98 transitions.
Graph (complete) has 245 edges and 89 vertex of which 88 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 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 86 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 86 transition count 94
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 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 85 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 85 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 84 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 83 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 82 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 82 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 81 transition count 86
Applied a total of 20 rules in 24 ms. Remains 81 /89 variables (removed 8) and now considering 86/98 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 81/89 places, 86/98 transitions.
RANDOM walk for 40000 steps (8905 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4017 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2742 steps, run visited all 1 properties in 15 ms. (steps per millisecond=182 )
Probabilistic random walk after 2742 steps, saw 1379 distinct states, run finished after 19 ms. (steps per millisecond=144 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 20 stable transitions
Graph (complete) has 279 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 86 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 86 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 84 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 84 transition count 92
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 84 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 82 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 82 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 81 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 80 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 80 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 79 transition count 84
Applied a total of 24 rules in 10 ms. Remains 79 /89 variables (removed 10) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 79 cols
[2025-06-06 01:40:31] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 01:40:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 01:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 01:40:31] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-06 01:40:31] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-06 01:40:31] [INFO ] Invariant cache hit.
[2025-06-06 01:40:31] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:32] [INFO ] Deduced a trap composed of 23 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-06 01:40:32] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/163 variables, 79/86 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:33] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:33] [INFO ] Deduced a trap composed of 23 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-06 01:40:33] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:33] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:33] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 126 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4544 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/163 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 83/209 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:39] [INFO ] Deduced a trap along path composed of 5 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:39] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 211 constraints, problems are : Problem set: 0 solved, 83 unsolved in 9397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13981ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 13982ms
Starting structural reductions in LTL mode, iteration 1 : 79/89 places, 84/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14198 ms. Remains : 79/89 places, 84/98 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Graph (complete) has 246 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 19 stable transitions
Detected a total of 15/79 stabilizing places and 19/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLCardinality-04 finished in 14925 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 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 87 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 94
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 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 85 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 83 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 83 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 82 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 82 transition count 88
Applied a total of 17 rules in 15 ms. Remains 82 /89 variables (removed 7) and now considering 88/98 (removed 10) transitions.
// Phase 1: matrix 88 rows 82 cols
[2025-06-06 01:40:46] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 01:40:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 01:40:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 01:40:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-06 01:40:46] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 01:40:46] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-06 01:40:46] [INFO ] Invariant cache hit.
[2025-06-06 01:40:46] [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/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:47] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/170 variables, 82/88 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 125 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3423 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 88/170 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 87/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:40:53] [INFO ] Deduced a trap along path composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/170 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 215 constraints, problems are : Problem set: 0 solved, 87 unsolved in 13366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16834ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 16835ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/89 places, 88/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17095 ms. Remains : 82/89 places, 88/98 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLCardinality-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLCardinality-05 finished in 17165 ms.
All properties solved by simple procedures.
Total runtime 59134 ms.

BK_STOP 1749174063332

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

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