Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400467.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749179153865

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-d2m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 03:05:54] [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 03:05:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 03:05:55] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-06-06 03:05:55] [INFO ] Transformed 2398 places.
[2025-06-06 03:05:55] [INFO ] Transformed 1954 transitions.
[2025-06-06 03:05:55] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1984 places in 27 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 969 place count 273 transition count 399
Iterating global reduction 1 with 116 rules applied. Total rules applied 1085 place count 273 transition count 399
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1096 place count 273 transition count 388
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1186 place count 183 transition count 298
Iterating global reduction 2 with 90 rules applied. Total rules applied 1276 place count 183 transition count 298
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1316 place count 183 transition count 258
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1351 place count 148 transition count 209
Iterating global reduction 3 with 35 rules applied. Total rules applied 1386 place count 148 transition count 209
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1412 place count 148 transition count 183
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1420 place count 140 transition count 171
Iterating global reduction 4 with 8 rules applied. Total rules applied 1428 place count 140 transition count 171
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1436 place count 132 transition count 163
Iterating global reduction 4 with 8 rules applied. Total rules applied 1444 place count 132 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1448 place count 128 transition count 158
Iterating global reduction 4 with 4 rules applied. Total rules applied 1452 place count 128 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1454 place count 128 transition count 156
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1458 place count 124 transition count 152
Iterating global reduction 5 with 4 rules applied. Total rules applied 1462 place count 124 transition count 152
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1465 place count 121 transition count 149
Iterating global reduction 5 with 3 rules applied. Total rules applied 1468 place count 121 transition count 149
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1469 place count 120 transition count 148
Iterating global reduction 5 with 1 rules applied. Total rules applied 1470 place count 120 transition count 148
Applied a total of 1470 rules in 94 ms. Remains 120 /414 variables (removed 294) and now considering 148/1954 (removed 1806) transitions.
// Phase 1: matrix 148 rows 120 cols
[2025-06-06 03:05:55] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:05:55] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-06 03:05:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:05:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-06 03:05:56] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-06 03:05:56] [INFO ] Invariant cache hit.
[2025-06-06 03:05:56] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/120 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:58] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:05:58] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/268 variables, 120/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 65/192 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 192 constraints, problems are : Problem set: 0 solved, 147 unsolved in 11032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/120 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/268 variables, 120/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 65/192 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 147/339 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:16] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:18] [INFO ] Deduced a trap composed of 54 places in 983 ms of which 5 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD136 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 3/342 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/342 constraints. Problems are: Problem set: 3 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 342 constraints, problems are : Problem set: 3 solved, 144 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41237ms problems are : Problem set: 3 solved, 144 unsolved
Search for dead transitions found 3 dead transitions in 41248ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 120/414 places, 145/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 145
Applied a total of 3 rules in 5 ms. Remains 117 /120 variables (removed 3) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 117 cols
[2025-06-06 03:06:37] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:06:37] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-06 03:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:06:37] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-06 03:06:38] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/414 places, 145/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42851 ms. Remains : 117/414 places, 145/1954 transitions.
Support contains 3 out of 117 places after structural reductions.
[2025-06-06 03:06:38] [INFO ] Flatten gal took : 30 ms
[2025-06-06 03:06:38] [INFO ] Flatten gal took : 14 ms
[2025-06-06 03:06:38] [INFO ] Input system was already deterministic with 145 transitions.
RANDOM walk for 40000 steps (8972 resets) in 1883 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4219 resets) in 295 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4063 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4099 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 572635 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 3
Probabilistic random walk after 572635 steps, saw 284502 distinct states, run finished after 3007 ms. (steps per millisecond=190 ) properties seen :0
[2025-06-06 03:06:42] [INFO ] Invariant cache hit.
[2025-06-06 03:06:42] [INFO ] State equation strengthened by 64 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/90 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 128/218 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 44/262 variables, 27/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 17/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 185 constraints, problems are : Problem set: 1 solved, 2 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/89 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/205 variables, 89/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 35/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 2/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 57/262 variables, 28/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 29/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 187 constraints, problems are : Problem set: 1 solved, 2 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 366ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 216 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 145/145 transitions.
Graph (complete) has 342 edges and 117 vertex of which 116 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 116 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 115 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 115 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 113 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 113 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 113 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 112 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 112 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 111 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 111 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 110 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 110 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 109 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 109 transition count 122
Applied a total of 19 rules in 33 ms. Remains 109 /117 variables (removed 8) and now considering 122/145 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 109/117 places, 122/145 transitions.
RANDOM walk for 40000 steps (8981 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4169 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4073 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 994895 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 2
Probabilistic random walk after 994895 steps, saw 465522 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
// Phase 1: matrix 122 rows 109 cols
[2025-06-06 03:06:45] [INFO ] Computed 3 invariants in 6 ms
[2025-06-06 03:06:45] [INFO ] State equation strengthened by 46 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) 62/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 83/151 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/192 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 30/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 39/231 variables, 23/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 16/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 158 constraints, problems are : Problem set: 0 solved, 2 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 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) 62/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 83/151 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:46] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 41/192 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 39/231 variables, 23/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 16/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 122/122 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 109/109 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-06 03:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:06:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 03:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:06:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-06 03:06:46] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:06:46] [INFO ] Redundant transitions in 3 ms returned []
Running 121 sub problems to find dead transitions.
[2025-06-06 03:06:46] [INFO ] Invariant cache hit.
[2025-06-06 03:06:46] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 4 (OVERLAPS) 122/231 variables, 109/112 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 46/158 constraints. Problems are: Problem set: 3 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:49] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 159 constraints, problems are : Problem set: 3 solved, 118 unsolved in 8078 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 121/227 variables, 106/109 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 45/154 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 14/168 constraints. Problems are: Problem set: 3 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:57] [INFO ] Deduced a trap along path composed of 26 places in 34 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 4/231 variables, 3/172 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 104/277 constraints. Problems are: Problem set: 3 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/278 constraints. Problems are: Problem set: 3 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:10] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 4 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 1/279 constraints. Problems are: Problem set: 11 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/279 constraints. Problems are: Problem set: 11 solved, 110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 279 constraints, problems are : Problem set: 11 solved, 110 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 118/121 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38170ms problems are : Problem set: 11 solved, 110 unsolved
Search for dead transitions found 11 dead transitions in 38171ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/109 places, 111/122 transitions.
Graph (complete) has 286 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 8 ms. Remains 101 /109 variables (removed 8) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 101 cols
[2025-06-06 03:07:25] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:07:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 03:07:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:07:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 03:07:25] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/109 places, 111/122 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38824 ms. Remains : 101/109 places, 111/122 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (9036 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4151 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2237941 steps, run visited all 1 properties in 2423 ms. (steps per millisecond=923 )
Probabilistic random walk after 2237941 steps, saw 1048589 distinct states, run finished after 2427 ms. (steps per millisecond=922 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 37 stable transitions
Graph (complete) has 382 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 113 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 113 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 111 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 111 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 111 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 110 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 109 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 109 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 108 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 108 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 107 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 107 transition count 119
Applied a total of 23 rules in 11 ms. Remains 107 /117 variables (removed 10) and now considering 119/145 (removed 26) transitions.
// Phase 1: matrix 119 rows 107 cols
[2025-06-06 03:07:27] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:07:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 03:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:07:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-06 03:07:28] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2025-06-06 03:07:28] [INFO ] Invariant cache hit.
[2025-06-06 03:07:28] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 5 (OVERLAPS) 119/226 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 45/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 156 constraints, problems are : Problem set: 3 solved, 115 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 119/225 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 45/155 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 17/172 constraints. Problems are: Problem set: 3 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:35] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:38] [INFO ] Deduced a trap along path composed of 26 places in 28 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/174 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 13 (OVERLAPS) 1/226 variables, 1/175 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 98/273 constraints. Problems are: Problem set: 3 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:07:51] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 4 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 2/275 constraints. Problems are: Problem set: 6 solved, 112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 275 constraints, problems are : Problem set: 6 solved, 112 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/118 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35106ms problems are : Problem set: 6 solved, 112 unsolved
Search for dead transitions found 6 dead transitions in 35108ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 107/117 places, 113/145 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 113
Applied a total of 6 rules in 4 ms. Remains 101 /107 variables (removed 6) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 101 cols
[2025-06-06 03:08:03] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:08:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-06 03:08:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:08:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 03:08:03] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/117 places, 113/145 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35862 ms. Remains : 101/117 places, 113/145 transitions.
Stuttering acceptance computed with spot in 183 ms :[p0, p0, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLCardinality-02 finished in 36106 ms.
All properties solved by simple procedures.
Total runtime 129025 ms.

BK_STOP 1749179284037

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

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