Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1749177761616

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-d2m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 02:42:42] [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:42:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:42:43] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-06-06 02:42:43] [INFO ] Transformed 2398 places.
[2025-06-06 02:42:43] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:42:43] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 1984 places in 28 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 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 113 places :
Symmetric choice reduction at 1 with 113 rule applications. Total rules 966 place count 276 transition count 382
Iterating global reduction 1 with 113 rules applied. Total rules applied 1079 place count 276 transition count 382
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 1091 place count 276 transition count 370
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 1173 place count 194 transition count 288
Iterating global reduction 2 with 82 rules applied. Total rules applied 1255 place count 194 transition count 288
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 1282 place count 194 transition count 261
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1320 place count 156 transition count 208
Iterating global reduction 3 with 38 rules applied. Total rules applied 1358 place count 156 transition count 208
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1379 place count 156 transition count 187
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1386 place count 149 transition count 176
Iterating global reduction 4 with 7 rules applied. Total rules applied 1393 place count 149 transition count 176
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1400 place count 142 transition count 169
Iterating global reduction 4 with 7 rules applied. Total rules applied 1407 place count 142 transition count 169
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1411 place count 138 transition count 164
Iterating global reduction 4 with 4 rules applied. Total rules applied 1415 place count 138 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1417 place count 138 transition count 162
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1420 place count 135 transition count 159
Iterating global reduction 5 with 3 rules applied. Total rules applied 1423 place count 135 transition count 159
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1424 place count 134 transition count 158
Iterating global reduction 5 with 1 rules applied. Total rules applied 1425 place count 134 transition count 158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1426 place count 133 transition count 157
Iterating global reduction 5 with 1 rules applied. Total rules applied 1427 place count 133 transition count 157
Applied a total of 1427 rules in 100 ms. Remains 133 /414 variables (removed 281) and now considering 157/1954 (removed 1797) transitions.
// Phase 1: matrix 157 rows 133 cols
[2025-06-06 02:42:43] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:42:43] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-06-06 02:42:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:42:43] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-06 02:42:44] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-06 02:42:44] [INFO ] Invariant cache hit.
[2025-06-06 02:42:44] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:42:46] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:42:46] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/290 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 156 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/290 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 204 constraints, problems are : Problem set: 0 solved, 156 unsolved in 14915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/290 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 156/360 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:06] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:06] [INFO ] Deduced a trap composed of 63 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:43:07] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 3 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 3/363 constraints. Problems are: Problem set: 3 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:22] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 364 constraints, problems are : Problem set: 3 solved, 153 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45146ms problems are : Problem set: 3 solved, 153 unsolved
Search for dead transitions found 3 dead transitions in 45157ms
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 : 133/414 places, 154/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 154
Applied a total of 3 rules in 2 ms. Remains 130 /133 variables (removed 3) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 130 cols
[2025-06-06 02:43:29] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:43:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-06 02:43:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:43:29] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-06 02:43:29] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/414 places, 154/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46584 ms. Remains : 130/414 places, 154/1954 transitions.
Support contains 13 out of 130 places after structural reductions.
[2025-06-06 02:43:29] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2025-06-06 02:43:29] [INFO ] Flatten gal took : 30 ms
[2025-06-06 02:43:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:43:29] [INFO ] Flatten gal took : 14 ms
[2025-06-06 02:43:29] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 6 out of 130 places (down from 13) after GAL structural reductions.
RANDOM walk for 40000 steps (9061 resets) in 1408 ms. (28 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (4059 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4057 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4113 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
[2025-06-06 02:43:30] [INFO ] Invariant cache hit.
[2025-06-06 02:43:30] [INFO ] State equation strengthened by 63 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) 79/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 3 (OVERLAPS) 21/103 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/240 variables, 103/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 46/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 44/284 variables, 27/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 17/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/284 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 197 constraints, problems are : Problem set: 1 solved, 2 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 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) 80/82 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/103 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/240 variables, 103/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 46/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 44/284 variables, 27/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 17/199 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 1/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/284 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 200 constraints, problems are : Problem set: 1 solved, 2 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 489ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 364 ms.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 154/154 transitions.
Graph (complete) has 376 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 152
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 121 transition count 144
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 121 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 121 transition count 142
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 26 place count 116 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 116 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 116 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 39 place count 111 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 44 place count 111 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 108 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 108 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 106 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 106 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 105 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 104 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 103 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 103 transition count 115
Applied a total of 60 rules in 35 ms. Remains 103 /130 variables (removed 27) and now considering 115/154 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 103/130 places, 115/154 transitions.
RANDOM walk for 40000 steps (8992 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4113 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4083 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 910945 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 2
Probabilistic random walk after 910945 steps, saw 427295 distinct states, run finished after 3006 ms. (steps per millisecond=303 ) properties seen :0
// Phase 1: matrix 115 rows 103 cols
[2025-06-06 02:43:34] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 02:43:34] [INFO ] State equation strengthened by 43 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) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 76/138 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/179 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 39/218 variables, 23/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/218 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 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) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 76/138 variables, 62/65 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 02:43:34] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 41/179 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 39/218 variables, 23/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 16/152 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 02:43:34] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/218 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 153 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2025-06-06 02:43:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:43:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 02:43:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:43:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 02:43:35] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:43:35] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2025-06-06 02:43:35] [INFO ] Invariant cache hit.
[2025-06-06 02:43:35] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 5 (OVERLAPS) 115/218 variables, 103/106 constraints. Problems are: Problem set: 3 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 43/149 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:38] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/218 variables, 1/150 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/218 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 150 constraints, problems are : Problem set: 3 solved, 111 unsolved in 6730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 114/214 variables, 100/103 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 42/145 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 14/159 constraints. Problems are: Problem set: 3 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:44] [INFO ] Deduced a trap along path composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 1/160 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 4/218 variables, 3/163 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 1/164 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 97/261 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 1/262 constraints. Problems are: Problem set: 3 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:52] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:43:52] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 2/264 constraints. Problems are: Problem set: 5 solved, 109 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/264 constraints. Problems are: Problem set: 5 solved, 109 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/264 constraints. Problems are: Problem set: 5 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 264 constraints, problems are : Problem set: 5 solved, 109 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 111/114 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36812ms problems are : Problem set: 5 solved, 109 unsolved
Search for dead transitions found 5 dead transitions in 36813ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 110/115 transitions.
Graph (complete) has 282 edges and 103 vertex of which 98 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 98 /103 variables (removed 5) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 98 cols
[2025-06-06 02:44:12] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:44:12] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:44:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:44:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 02:44:12] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/103 places, 110/115 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37340 ms. Remains : 98/103 places, 110/115 transitions.
RANDOM walk for 40000 steps (9029 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4100 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4096 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 791951 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 2
Probabilistic random walk after 791951 steps, saw 370910 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2025-06-06 02:44:15] [INFO ] Invariant cache hit.
[2025-06-06 02:44:15] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.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) 34/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 58/96 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 63/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 49/208 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 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 75.0 s and query timeout 7500.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) 34/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 58/96 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 63/159 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 49/208 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 34 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 97 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 96 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 96 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 96 transition count 107
Applied a total of 5 rules in 11 ms. Remains 96 /98 variables (removed 2) and now considering 107/110 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 96/98 places, 107/110 transitions.
RANDOM walk for 40000 steps (9050 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4179 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2220253 steps, run visited all 1 properties in 2413 ms. (steps per millisecond=920 )
Probabilistic random walk after 2220253 steps, saw 1039648 distinct states, run finished after 2417 ms. (steps per millisecond=918 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
[2025-06-06 02:44:18] [INFO ] Flatten gal took : 9 ms
[2025-06-06 02:44:18] [INFO ] Flatten gal took : 9 ms
[2025-06-06 02:44:18] [INFO ] Input system was already deterministic with 154 transitions.
Computed a total of 43 stabilizing places and 55 stable transitions
Graph (complete) has 418 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 154/154 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 120 transition count 142
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 112 transition count 134
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 112 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 46 place count 112 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 108 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 108 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 105 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 105 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 103 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 103 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 101 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 101 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 99 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 98 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 97 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 96 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 95 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 95 transition count 104
Applied a total of 80 rules in 16 ms. Remains 95 /130 variables (removed 35) and now considering 104/154 (removed 50) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:44:18] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:44:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 02:44:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:44:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:44:18] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 02:44:18] [INFO ] Invariant cache hit.
[2025-06-06 02:44:18] [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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3898 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: 0/0 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, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 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:44:25] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 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:44:34] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 26630 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: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 30565ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 30567ms
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/130 places, 101/154 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:44:49] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:44:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 02:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:44:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 02:44:49] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/130 places, 101/154 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31143 ms. Remains : 92/130 places, 101/154 transitions.
[2025-06-06 02:44:49] [INFO ] Flatten gal took : 10 ms
[2025-06-06 02:44:49] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:44:49] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 02:44:49] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:44:49] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:44:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality12710465638663796699.gal : 2 ms
[2025-06-06 02:44:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14358110356139345212.ctl : 2 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/CTLCardinality12710465638663796699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14358110356139345212.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,9.86386e+09,17.1133,365160,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != 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
Detected timeout of ITS tools.
[2025-06-06 02:45:19] [INFO ] Flatten gal took : 8 ms
[2025-06-06 02:45:19] [INFO ] Applying decomposition
[2025-06-06 02:45:19] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6600109036500941929.txt' '-o' '/tmp/graph6600109036500941929.bin' '-w' '/tmp/graph6600109036500941929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6600109036500941929.bin' '-l' '-1' '-v' '-w' '/tmp/graph6600109036500941929.weights' '-q' '0' '-e' '0.001'
[2025-06-06 02:45:19] [INFO ] Decomposing Gal with order
[2025-06-06 02:45:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 02:45:19] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-06 02:45:19] [INFO ] Flatten gal took : 40 ms
[2025-06-06 02:45:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 7 ms.
[2025-06-06 02:45:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality6878640948444597735.gal : 3 ms
[2025-06-06 02:45:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality16247239901526909244.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/CTLCardinality6878640948444597735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16247239901526909244.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 154/154 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 120 transition count 142
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 112 transition count 134
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 112 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 46 place count 112 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 108 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 108 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 105 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 105 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 103 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 103 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 101 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 101 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 99 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 98 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 97 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 96 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 95 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 95 transition count 104
Applied a total of 80 rules in 9 ms. Remains 95 /130 variables (removed 35) and now considering 104/154 (removed 50) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:45:49] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:45:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 02:45:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:45:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:45:50] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 02:45:50] [INFO ] Invariant cache hit.
[2025-06-06 02:45:50] [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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3699 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: 0/0 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, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 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:45:56] [INFO ] Deduced a trap along path composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 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:46:04] [INFO ] Deduced a trap along path composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 25657 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: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29392ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 29394ms
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/130 places, 101/154 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 1 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:46:19] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:46:19] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 02:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:46:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 02:46:19] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/130 places, 101/154 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29978 ms. Remains : 92/130 places, 101/154 transitions.
[2025-06-06 02:46:19] [INFO ] Flatten gal took : 9 ms
[2025-06-06 02:46:19] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:46:19] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 02:46:19] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:46:19] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:46:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality1627188153288377164.gal : 1 ms
[2025-06-06 02:46:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality11813499664385541483.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1627188153288377164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11813499664385541483.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,9.86386e+09,17.2859,366592,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: AG(EX(AG((l223<=0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U !((l223<=0)))))))] = 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,19.372,366592,1,0,189,1.43845e+06,224,96,3260,881166,224
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 154/154 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 121 transition count 143
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 115 transition count 137
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 115 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 115 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 110 transition count 124
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 110 transition count 124
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 107 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 107 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 105 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 105 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 103 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 103 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 101 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 100 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 100 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 99 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 99 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 98 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 98 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 97 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 97 transition count 107
Applied a total of 72 rules in 24 ms. Remains 97 /130 variables (removed 33) and now considering 107/154 (removed 47) transitions.
// Phase 1: matrix 107 rows 97 cols
[2025-06-06 02:46:39] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:46:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 02:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:46:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-06 02:46:39] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:46:39] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-06 02:46:39] [INFO ] Invariant cache hit.
[2025-06-06 02:46:39] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 5 (OVERLAPS) 107/204 variables, 97/101 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 42/143 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/143 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/143 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 143 constraints, problems are : Problem set: 3 solved, 103 unsolved in 3972 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 2/96 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 107/203 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 42/142 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 16/158 constraints. Problems are: Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:46:46] [INFO ] Deduced a trap along path composed of 21 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 1/204 variables, 1/160 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 87/247 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/247 constraints. Problems are: Problem set: 3 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:46:56] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/204 variables, 1/248 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 0/248 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 17 (OVERLAPS) 0/204 variables, 0/248 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 248 constraints, problems are : Problem set: 3 solved, 103 unsolved in 28170 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 103/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 32186ms problems are : Problem set: 3 solved, 103 unsolved
Search for dead transitions found 3 dead transitions in 32187ms
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 SI_CTL mode, iteration 1 : 97/130 places, 104/154 transitions.
Graph (complete) has 298 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 94 /97 variables (removed 3) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 94 cols
[2025-06-06 02:47:12] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:47:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 02:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:47:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 02:47:12] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 94/130 places, 104/154 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 32757 ms. Remains : 94/130 places, 104/154 transitions.
[2025-06-06 02:47:12] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:47:12] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:47:12] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-06 02:47:12] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:47:12] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:47:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality478557986275931203.gal : 1 ms
[2025-06-06 02:47:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12874821134639316638.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/CTLCardinality478557986275931203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12874821134639316638.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 -...283
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,2.1986e+10,21.7978,413932,2,13345,5,1.55423e+06,6,0,480,981500,0


Converting to forward existential form...Done !
original formula: AF((l283>0))
=> equivalent forward existential formula: [FwdG(Init,!((l283>0)))] = FALSE
Hit Full ! (commute/partial/dont) 102/0/2
Detected timeout of ITS tools.
[2025-06-06 02:47:42] [INFO ] Flatten gal took : 10 ms
[2025-06-06 02:47:42] [INFO ] Applying decomposition
[2025-06-06 02:47:42] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14639609200308768210.txt' '-o' '/tmp/graph14639609200308768210.bin' '-w' '/tmp/graph14639609200308768210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14639609200308768210.bin' '-l' '-1' '-v' '-w' '/tmp/graph14639609200308768210.weights' '-q' '0' '-e' '0.001'
[2025-06-06 02:47:42] [INFO ] Decomposing Gal with order
[2025-06-06 02:47:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 02:47:42] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-06 02:47:42] [INFO ] Flatten gal took : 10 ms
[2025-06-06 02:47:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 4 ms.
[2025-06-06 02:47:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14395701429687310319.gal : 1 ms
[2025-06-06 02:47:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5070774227008353276.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/CTLCardinality14395701429687310319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5070774227008353276.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 154/154 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 120 transition count 142
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 112 transition count 134
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 112 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 46 place count 112 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 108 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 108 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 105 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 105 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 103 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 103 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 101 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 101 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 99 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 98 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 97 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 96 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 95 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 95 transition count 104
Applied a total of 80 rules in 9 ms. Remains 95 /130 variables (removed 35) and now considering 104/154 (removed 50) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:48:12] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:48:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 02:48:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:48:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:48:12] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 02:48:12] [INFO ] Invariant cache hit.
[2025-06-06 02:48:12] [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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3898 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: 0/0 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, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 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:48:19] [INFO ] Deduced a trap along path composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 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:48:27] [INFO ] Deduced a trap along path composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 26356 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: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 30290ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 30291ms
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/130 places, 101/154 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:48:43] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:48:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 02:48:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:48:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 02:48:43] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/130 places, 101/154 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30840 ms. Remains : 92/130 places, 101/154 transitions.
[2025-06-06 02:48:43] [INFO ] Flatten gal took : 7 ms
[2025-06-06 02:48:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:48:43] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 02:48:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:48:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:48:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality2423057046717956377.gal : 1 ms
[2025-06-06 02:48:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality12766533359936787011.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/CTLCardinality2423057046717956377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12766533359936787011.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,9.86386e+09,16.8208,365552,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,16.8239,365552,1,0,6,1.43845e+06,7,1,625,881166,1
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 154/154 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 121 transition count 143
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 114 transition count 136
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 114 transition count 136
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 41 place count 114 transition count 129
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 110 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 110 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 107 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 107 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 105 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 104 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 103 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 103 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 102 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 102 transition count 114
Applied a total of 65 rules in 20 ms. Remains 102 /130 variables (removed 28) and now considering 114/154 (removed 40) transitions.
// Phase 1: matrix 114 rows 102 cols
[2025-06-06 02:49:00] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 02:49:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 02:49:00] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:49:00] [INFO ] Redundant transitions in 4 ms returned []
Running 113 sub problems to find dead transitions.
[2025-06-06 02:49:00] [INFO ] Invariant cache hit.
[2025-06-06 02:49:00] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 5 (OVERLAPS) 114/216 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 43/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:03] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/150 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 150 constraints, problems are : Problem set: 3 solved, 110 unsolved in 6650 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 114/215 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 43/148 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 17/165 constraints. Problems are: Problem set: 3 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:08] [INFO ] Deduced a trap along path composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 1/216 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 93/260 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/261 constraints. Problems are: Problem set: 3 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 1/262 constraints. Problems are: Problem set: 5 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/262 constraints. Problems are: Problem set: 5 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 0/216 variables, 0/262 constraints. Problems are: Problem set: 5 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 262 constraints, problems are : Problem set: 5 solved, 108 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/113 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36724ms problems are : Problem set: 5 solved, 108 unsolved
Search for dead transitions found 5 dead transitions in 36725ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 102/130 places, 109/154 transitions.
Graph (complete) has 310 edges and 102 vertex of which 97 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 97 /102 variables (removed 5) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-06-06 02:49:37] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 02:49:37] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 97/130 places, 109/154 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 37418 ms. Remains : 97/130 places, 109/154 transitions.
[2025-06-06 02:49:37] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:49:37] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:49:37] [INFO ] Input system was already deterministic with 109 transitions.
[2025-06-06 02:49:37] [INFO ] Flatten gal took : 4 ms
[2025-06-06 02:49:37] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:49:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17862646158965390650.gal : 1 ms
[2025-06-06 02:49:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1556319232999912901.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/CTLCardinality17862646158965390650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1556319232999912901.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,1.00707e+10,6.74165,178184,2,11851,5,745472,6,0,497,769406,0


Converting to forward existential form...Done !
original formula: AF(AG((p15>0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p15>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t19, t20, t21, t24, t26, t44, t47, t75, t82, t83, t84, t85, t86, t87, t88, t89, t90,...323
(forward)formula 0,0,15.9765,294804,1,0,242,1.22932e+06,244,100,3550,1.14722e+06,280
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 154/154 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 120 transition count 142
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 112 transition count 134
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 112 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 46 place count 112 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 108 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 108 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 105 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 105 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 103 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 103 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 101 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 101 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 99 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 98 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 97 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 96 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 95 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 95 transition count 104
Applied a total of 80 rules in 8 ms. Remains 95 /130 variables (removed 35) and now considering 104/154 (removed 50) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 02:49:53] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:49:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 02:49:53] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 02:49:53] [INFO ] Invariant cache hit.
[2025-06-06 02:49:53] [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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3981 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: 0/0 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, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 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:50:00] [INFO ] Deduced a trap along path composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 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:50:09] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 26122 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: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 30142ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 30143ms
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/130 places, 101/154 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:50:24] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:50:24] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 02:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:50:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 02:50:24] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/130 places, 101/154 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30702 ms. Remains : 92/130 places, 101/154 transitions.
[2025-06-06 02:50:24] [INFO ] Flatten gal took : 6 ms
[2025-06-06 02:50:24] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:50:24] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 02:50:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:50:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 02:50:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality157036512202003660.gal : 1 ms
[2025-06-06 02:50:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3666887323750710193.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/CTLCardinality157036512202003660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3666887323750710193.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 -...282
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,9.86386e+09,16.8329,364728,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,16.8369,364728,1,0,6,1.43845e+06,7,1,625,881166,1
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-06 02:50:41] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:50:41] [INFO ] Flatten gal took : 5 ms
[2025-06-06 02:50:41] [INFO ] Applying decomposition
[2025-06-06 02:50:41] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5836256694670850623.txt' '-o' '/tmp/graph5836256694670850623.bin' '-w' '/tmp/graph5836256694670850623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5836256694670850623.bin' '-l' '-1' '-v' '-w' '/tmp/graph5836256694670850623.weights' '-q' '0' '-e' '0.001'
[2025-06-06 02:50:41] [INFO ] Decomposing Gal with order
[2025-06-06 02:50:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 02:50:41] [INFO ] Removed a total of 146 redundant transitions.
[2025-06-06 02:50:41] [INFO ] Flatten gal took : 13 ms
[2025-06-06 02:50:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 5 ms.
[2025-06-06 02:50:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality18207504010115135004.gal : 2 ms
[2025-06-06 02:50:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality13467225997447281537.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/CTLCardinality18207504010115135004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13467225997447281537.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 2 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,3.45088e+10,894.011,3920696,13932,7196,2.02464e+06,363351,441,3.26466e+07,139,1.0282e+07,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t18, t19, t20, t39, t61, t109, t116, t117, t118, t119, t120, t121, t122, t124, t127,...372
ITS-tools command line returned an error code 139
[2025-06-06 03:09:19] [INFO ] Flatten gal took : 6 ms
[2025-06-06 03:09:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality14368922404664024556.gal : 1 ms
[2025-06-06 03:09:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality4964662020961844982.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/CTLCardinality14368922404664024556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4964662020961844982.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 2 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,3.45088e+10,52.8271,1222116,2,27931,5,3.45256e+06,6,0,674,2.43227e+06,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t12, t18, t19, t20, t42, t44, t45, t50, t51, t52, t57, t63, t64, t77, t109, t116, t11...384
(forward)formula 0,1,164.892,2214408,1,0,1490,9.77343e+06,13,919,1981,1.02554e+07,484
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((l283>0))
=> equivalent forward existential formula: [FwdG(Init,!((l283>0)))] = FALSE
Hit Full ! (commute/partial/dont) 151/0/3
ITS-tools command line returned an error code 139
[2025-06-06 03:12:48] [INFO ] Flatten gal took : 7 ms
[2025-06-06 03:12:48] [INFO ] Input system was already deterministic with 154 transitions.
[2025-06-06 03:12:48] [INFO ] Transformed 130 places.
[2025-06-06 03:12:48] [INFO ] Transformed 154 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-06 03:12:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6850939126693517145.gal : 1 ms
[2025-06-06 03:12:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17420750789467870025.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/CTLCardinality6850939126693517145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17420750789467870025.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
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,3.45088e+10,691.125,3733064,2,51246,5,1.68917e+07,6,0,674,3.75607e+06,0


Converting to forward existential form...Done !
original formula: AF((l283>0))
=> equivalent forward existential formula: [FwdG(Init,!((l283>0)))] = FALSE
Hit Full ! (commute/partial/dont) 151/0/3
(forward)formula 0,0,1334.13,13517496,1,0,53,6.47036e+07,5,3,1278,1.41794e+07,1
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Total runtime 3142077 ms.

BK_STOP 1749180904916

--------------------
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-d2m18"
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-d2m18, 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-174901994400465"
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 [ "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 ;