Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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-d2m06-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749176452916

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 02:20:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 02:20:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:20:54] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-06 02:20:54] [INFO ] Transformed 2398 places.
[2025-06-06 02:20:54] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:20:54] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 1984 places in 34 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 852 rules applied. Total rules applied 852 place count 390 transition count 1126
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 969 place count 273 transition count 397
Iterating global reduction 1 with 117 rules applied. Total rules applied 1086 place count 273 transition count 397
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1096 place count 273 transition count 387
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1186 place count 183 transition count 297
Iterating global reduction 2 with 90 rules applied. Total rules applied 1276 place count 183 transition count 297
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1314 place count 183 transition count 259
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1351 place count 146 transition count 208
Iterating global reduction 3 with 37 rules applied. Total rules applied 1388 place count 146 transition count 208
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1414 place count 146 transition count 182
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1422 place count 138 transition count 170
Iterating global reduction 4 with 8 rules applied. Total rules applied 1430 place count 138 transition count 170
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1438 place count 130 transition count 162
Iterating global reduction 4 with 8 rules applied. Total rules applied 1446 place count 130 transition count 162
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1450 place count 126 transition count 157
Iterating global reduction 4 with 4 rules applied. Total rules applied 1454 place count 126 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1456 place count 126 transition count 155
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1459 place count 123 transition count 152
Iterating global reduction 5 with 3 rules applied. Total rules applied 1462 place count 123 transition count 152
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1464 place count 121 transition count 150
Iterating global reduction 5 with 2 rules applied. Total rules applied 1466 place count 121 transition count 150
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1467 place count 120 transition count 149
Iterating global reduction 5 with 1 rules applied. Total rules applied 1468 place count 120 transition count 149
Applied a total of 1468 rules in 93 ms. Remains 120 /414 variables (removed 294) and now considering 149/1954 (removed 1805) transitions.
// Phase 1: matrix 149 rows 120 cols
[2025-06-06 02:20:54] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:20:54] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-06 02:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:20:54] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-06 02:20:55] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-06 02:20:55] [INFO ] Invariant cache hit.
[2025-06-06 02:20:55] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:56] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:56] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/119 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:58] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:58] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:58] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:58] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:58] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:20:58] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 149/268 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 66/198 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:01] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:01] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:02] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:02] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 3 ms to minimize.
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:02] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 8 ms to minimize.
Problem TDEAD52 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 5/203 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/269 variables, 1/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 204 constraints, problems are : Problem set: 3 solved, 145 unsolved in 20245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 4/119 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 10/18 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 149/268 variables, 119/137 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 66/203 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 140/343 constraints. Problems are: Problem set: 3 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/269 variables, and 343 constraints, problems are : Problem set: 3 solved, 145 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/120 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 140/148 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50521ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 50533ms
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, 146/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 146
Applied a total of 3 rules in 3 ms. Remains 117 /120 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 117 cols
[2025-06-06 02:21:45] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:21:45] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-06 02:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:21:45] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-06 02:21:46] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/414 places, 146/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51894 ms. Remains : 117/414 places, 146/1954 transitions.
Support contains 4 out of 117 places after structural reductions.
[2025-06-06 02:21:46] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2025-06-06 02:21:46] [INFO ] Flatten gal took : 37 ms
[2025-06-06 02:21:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:21:46] [INFO ] Flatten gal took : 16 ms
[2025-06-06 02:21:46] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 1 out of 117 places (down from 4) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9036 resets) in 1511 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4164 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
Probably explored full state space saw : 106890 states, properties seen :0
Probabilistic random walk after 268466 steps, saw 106890 distinct states, run finished after 365 ms. (steps per millisecond=735 ) properties seen :0
Explored full state space saw : 106890 states, properties seen :0
Exhaustive walk after 268466 steps, saw 106890 distinct states, run finished after 272 ms. (steps per millisecond=987 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:21:47] [INFO ] Flatten gal took : 24 ms
[2025-06-06 02:21:47] [INFO ] Flatten gal took : 11 ms
[2025-06-06 02:21:47] [INFO ] Input system was already deterministic with 146 transitions.
Computed a total of 27 stabilizing places and 33 stable transitions
Graph (complete) has 384 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 146/146 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 113 transition count 131
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 131
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 113 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 110 transition count 126
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 110 transition count 126
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 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 18 place count 107 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 107 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 107 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 26 place count 104 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 104 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 32 place count 101 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 101 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 37 place count 99 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 99 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 99 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 42 place count 97 transition count 106
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 96 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 95 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 95 transition count 104
Applied a total of 48 rules in 14 ms. Remains 95 /117 variables (removed 22) and now considering 104/146 (removed 42) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:21:47] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:21:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-06 02:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:21:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:21:48] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 02:21:48] [INFO ] Invariant cache hit.
[2025-06-06 02:21:48] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:49] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 6 (OVERLAPS) 104/199 variables, 95/100 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 40/140 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:51] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:51] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 2/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 142 constraints, problems are : Problem set: 3 solved, 100 unsolved in 7699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 2/94 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 104/198 variables, 94/101 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 40/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:21:58] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 1/199 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 84/243 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/243 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:22:22] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/199 variables, 1/244 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 199/199 variables, and 244 constraints, problems are : Problem set: 3 solved, 100 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37773ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 37775ms
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 : 95/117 places, 101/146 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 3 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 02:22:26] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:22:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 02:22:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:22:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 02:22:26] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/117 places, 101/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38489 ms. Remains : 92/117 places, 101/146 transitions.
[2025-06-06 02:22:26] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:22:26] [INFO ] Flatten gal took : 11 ms
[2025-06-06 02:22:26] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 02:22:26] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:22:26] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:22:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality14805210384705328906.gal : 3 ms
[2025-06-06 02:22:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality5131554705381517132.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14805210384705328906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5131554705381517132.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,75566,0.409043,22456,2,2668,5,61987,6,0,469,35045,0


Converting to forward existential form...Done !
original formula: EX(AF(AX(FALSE)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!(FALSE)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t38, t41, t69, t76, t77, t78, t79, t80, t81, t82, t83, t84, t88, t89, t92, t93, t95,...281
Using saturation style SCC detection
(forward)formula 0,0,2.07767,75848,1,0,353,365445,225,191,3163,242933,426
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 146/146 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 113 transition count 131
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 131
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 113 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 110 transition count 126
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 110 transition count 126
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 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 18 place count 107 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 107 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 107 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 26 place count 104 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 104 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 32 place count 101 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 101 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 37 place count 99 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 99 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 99 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 42 place count 97 transition count 106
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 96 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 95 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 95 transition count 104
Applied a total of 48 rules in 19 ms. Remains 95 /117 variables (removed 22) and now considering 104/146 (removed 42) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:22:28] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:22:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-06 02:22:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:22:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:22:28] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 02:22:28] [INFO ] Invariant cache hit.
[2025-06-06 02:22:28] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:22:29] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 6 (OVERLAPS) 104/199 variables, 95/100 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 40/140 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:22:31] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:22:31] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 2/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 142 constraints, problems are : Problem set: 3 solved, 100 unsolved in 7650 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 2/94 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 104/198 variables, 94/101 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 40/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:22:38] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 1/199 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 84/243 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/243 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:23:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/199 variables, 1/244 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 199/199 variables, and 244 constraints, problems are : Problem set: 3 solved, 100 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37706ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 37707ms
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 : 95/117 places, 101/146 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 3 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 02:23:06] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:23:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 02:23:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:23:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 02:23:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/117 places, 101/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38385 ms. Remains : 92/117 places, 101/146 transitions.
[2025-06-06 02:23:06] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:23:06] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:23:06] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 02:23:06] [INFO ] Flatten gal took : 14 ms
[2025-06-06 02:23:06] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:23:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality15903715538915980732.gal : 1 ms
[2025-06-06 02:23:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality3744547743888871770.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15903715538915980732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3744547743888871770.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,75566,0.397469,22816,2,2668,5,61987,6,0,469,35045,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.399336,22816,1,0,6,61987,7,1,625,35045,1
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 146/146 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 113 transition count 131
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 131
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 113 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 110 transition count 126
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 110 transition count 126
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 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 18 place count 107 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 107 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 107 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 26 place count 104 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 104 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 32 place count 101 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 101 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 37 place count 99 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 99 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 99 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 42 place count 97 transition count 106
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 96 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 95 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 95 transition count 104
Applied a total of 48 rules in 7 ms. Remains 95 /117 variables (removed 22) and now considering 104/146 (removed 42) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:23:07] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:23:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 02:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:23:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:23:07] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 02:23:07] [INFO ] Invariant cache hit.
[2025-06-06 02:23:07] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:23:08] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 6 (OVERLAPS) 104/199 variables, 95/100 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 40/140 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:23:10] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:23:10] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 2/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 142 constraints, problems are : Problem set: 3 solved, 100 unsolved in 7675 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 2/94 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 104/198 variables, 94/101 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 40/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:23:17] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 1/199 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 84/243 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/243 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:23:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/199 variables, 1/244 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 199/199 variables, and 244 constraints, problems are : Problem set: 3 solved, 100 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37723ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 37724ms
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 : 95/117 places, 101/146 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 3 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 02:23:45] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:23:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 02:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:23:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 02:23:45] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/117 places, 101/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38411 ms. Remains : 92/117 places, 101/146 transitions.
[2025-06-06 02:23:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:23:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:23:45] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 02:23:45] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:23:45] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:23:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11988733571724472083.gal : 1 ms
[2025-06-06 02:23:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12727273047354789531.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11988733571724472083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12727273047354789531.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,75566,0.394054,22816,2,2668,5,61987,6,0,469,35045,0


Converting to forward existential form...Done !
original formula: AG(AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t38, t41, t69, t76, t77, t78, t79, t80, t81, t82, t83, t84, t88, t89, t92, t93, t95,...281
(forward)formula 0,0,0.957702,36548,1,0,223,120547,223,92,3118,84734,258
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 02:23:46] [INFO ] Flatten gal took : 14 ms
[2025-06-06 02:23:46] [INFO ] Flatten gal took : 6 ms
Total runtime 172743 ms.

BK_STOP 1749176626822

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-d2m06"
export BK_EXAMINATION="CTLCardinality"
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-d2m06, examination is CTLCardinality"
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-174901994400457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m06.tgz
mv SieveSingleMsgMbox-PT-d2m06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;