Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K 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 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 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 DBSingleClientW-PT-d2m06-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2023-15
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-00
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-01
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-02
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-03
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-04
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-05
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-06
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-07
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-08
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-09
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-10
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748607429148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 12:17:11] [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-05-30 12:17:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:17:12] [INFO ] Load time of PNML (sax parser for PT used): 502 ms
[2025-05-30 12:17:12] [INFO ] Transformed 4763 places.
[2025-05-30 12:17:12] [INFO ] Transformed 2478 transitions.
[2025-05-30 12:17:12] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 799 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 50 ms.
Deduced a syphon composed of 3580 places in 58 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 379 places :
Symmetric choice reduction at 1 with 379 rule applications. Total rules 624 place count 758 transition count 1227
Iterating global reduction 1 with 379 rules applied. Total rules applied 1003 place count 758 transition count 1227
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1012 place count 758 transition count 1218
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 1316 place count 454 transition count 914
Iterating global reduction 2 with 304 rules applied. Total rules applied 1620 place count 454 transition count 914
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1632 place count 454 transition count 902
Discarding 226 places :
Symmetric choice reduction at 3 with 226 rule applications. Total rules 1858 place count 228 transition count 586
Iterating global reduction 3 with 226 rules applied. Total rules applied 2084 place count 228 transition count 586
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 3 with 199 rules applied. Total rules applied 2283 place count 228 transition count 387
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2304 place count 207 transition count 350
Iterating global reduction 4 with 21 rules applied. Total rules applied 2325 place count 207 transition count 350
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2330 place count 207 transition count 345
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2344 place count 193 transition count 331
Iterating global reduction 5 with 14 rules applied. Total rules applied 2358 place count 193 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2361 place count 193 transition count 328
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2373 place count 181 transition count 316
Iterating global reduction 6 with 12 rules applied. Total rules applied 2385 place count 181 transition count 316
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2398 place count 181 transition count 303
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2400 place count 179 transition count 296
Iterating global reduction 7 with 2 rules applied. Total rules applied 2402 place count 179 transition count 296
Applied a total of 2402 rules in 463 ms. Remains 179 /1183 variables (removed 1004) and now considering 296/2478 (removed 2182) transitions.
// Phase 1: matrix 296 rows 179 cols
[2025-05-30 12:17:13] [INFO ] Computed 2 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:14] [INFO ] Implicit Places using invariants in 887 ms returned []
[2025-05-30 12:17:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:14] [INFO ] State equation strengthened by 125 read => feed constraints.
[2025-05-30 12:17:18] [INFO ] Implicit Places using invariants and state equation in 4131 ms returned []
Implicit Place search using SMT with State Equation took 5130 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-05-30 12:17:18] [INFO ] Invariant cache hit.
[2025-05-30 12:17:18] [INFO ] State equation strengthened by 125 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 296/475 variables, 179/181 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 125/306 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 306 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 179/179 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 296/475 variables, 179/181 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 125/306 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 295/601 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 601 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 179/179 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60865ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60892ms
Starting structural reductions in LTL mode, iteration 1 : 179/1183 places, 296/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66542 ms. Remains : 179/1183 places, 296/2478 transitions.
Support contains 17 out of 179 places after structural reductions.
[2025-05-30 12:18:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2025-05-30 12:18:19] [INFO ] Flatten gal took : 102 ms
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:18:19] [INFO ] Flatten gal took : 54 ms
[2025-05-30 12:18:19] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 6 out of 179 places (down from 17) after GAL structural reductions.
RANDOM walk for 40000 steps (9228 resets) in 2177 ms. (18 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3732 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3945 resets) in 424 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3760 resets) in 954 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3802 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3801 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3779 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 575335 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :3 out of 6
Probabilistic random walk after 575335 steps, saw 231658 distinct states, run finished after 3006 ms. (steps per millisecond=191 ) properties seen :3
[2025-05-30 12:18:24] [INFO ] Invariant cache hit.
[2025-05-30 12:18:24] [INFO ] State equation strengthened by 125 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/72 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/114 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:18:24] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 189/303 variables, 114/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 18/135 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 465/475 variables, and 195 constraints, problems are : Problem set: 3 solved, 0 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/179 constraints, ReadFeed: 18/125 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2025-05-30 12:18:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:18:24] [INFO ] Flatten gal took : 24 ms
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:18:24] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:18:24] [INFO ] Input system was already deterministic with 296 transitions.
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 671 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 296/296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 163 transition count 274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 163 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 163 transition count 272
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 149 transition count 256
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 149 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 149 transition count 252
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 140 transition count 233
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 140 transition count 233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 92 place count 140 transition count 225
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 132 transition count 183
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 132 transition count 183
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 129 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 129 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 129 transition count 179
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 127 transition count 177
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 127 transition count 177
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 126 transition count 175
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 126 transition count 175
Applied a total of 121 rules in 25 ms. Remains 126 /179 variables (removed 53) and now considering 175/296 (removed 121) transitions.
// Phase 1: matrix 175 rows 126 cols
[2025-05-30 12:18:24] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:18:25] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-05-30 12:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:18:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-30 12:18:25] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-05-30 12:18:25] [INFO ] Invariant cache hit.
[2025-05-30 12:18:25] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/301 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:18:33] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:18:34] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:18:40] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:18:40] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:18:41] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:18:41] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/301 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 189 constraints, problems are : Problem set: 0 solved, 174 unsolved in 28108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/301 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 55/189 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 174/363 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 363 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58351ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 58353ms
Starting structural reductions in LTL mode, iteration 1 : 126/179 places, 175/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59154 ms. Remains : 126/179 places, 175/296 transitions.
[2025-05-30 12:19:24] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:19:24] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:19:24] [INFO ] Input system was already deterministic with 175 transitions.
[2025-05-30 12:19:24] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:19:24] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:19:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality17764367583511904579.gal : 6 ms
[2025-05-30 12:19:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality297498449460917475.ctl : 7 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/CTLCardinality17764367583511904579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality297498449460917475.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,1.74297e+06,11.4138,247956,2,21759,5,662280,6,0,679,891626,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(AF((l3845<=0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(EG(!((l3845<=0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t112, t122, t123...563
(forward)formula 0,1,22.858,387540,1,0,403,1.65962e+06,378,166,4920,910243,494
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 273
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 162 transition count 271
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 147 transition count 253
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 147 transition count 253
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 71 place count 147 transition count 248
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 138 transition count 229
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 138 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 138 transition count 221
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 105 place count 130 transition count 179
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 130 transition count 179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 127 transition count 176
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 127 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 127 transition count 175
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 125 transition count 173
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 125 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 124 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 124 transition count 171
Applied a total of 126 rules in 24 ms. Remains 124 /179 variables (removed 55) and now considering 171/296 (removed 125) transitions.
// Phase 1: matrix 171 rows 124 cols
[2025-05-30 12:19:47] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:47] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 12:19:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:47] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 12:19:48] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-05-30 12:19:48] [INFO ] Invariant cache hit.
[2025-05-30 12:19:48] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:19:54] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:19:54] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:19:54] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 181 constraints, problems are : Problem set: 0 solved, 170 unsolved in 21553 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/295 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 52/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 170/351 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 351 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51650ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 51653ms
Starting structural reductions in LTL mode, iteration 1 : 124/179 places, 171/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52424 ms. Remains : 124/179 places, 171/296 transitions.
[2025-05-30 12:20:39] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:20:39] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:20:39] [INFO ] Input system was already deterministic with 171 transitions.
[2025-05-30 12:20:39] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:20:39] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:20:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality14046225567885738160.gal : 6 ms
[2025-05-30 12:20:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality252001262241998671.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/CTLCardinality14046225567885738160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality252001262241998671.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,1.6637e+06,11.6576,252340,2,20752,5,667465,6,0,667,880467,0


Converting to forward existential form...Done !
original formula: EG(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t110, t119, t120...557
(forward)formula 0,0,18.2624,259124,1,0,306,971361,363,121,4728,880467,358
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 273
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 162 transition count 271
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 147 transition count 253
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 147 transition count 253
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 71 place count 147 transition count 248
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 138 transition count 229
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 138 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 138 transition count 221
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 105 place count 130 transition count 179
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 130 transition count 179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 127 transition count 176
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 127 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 127 transition count 175
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 125 transition count 173
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 125 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 124 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 124 transition count 171
Applied a total of 126 rules in 26 ms. Remains 124 /179 variables (removed 55) and now considering 171/296 (removed 125) transitions.
[2025-05-30 12:20:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:58] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-30 12:20:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:58] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 12:20:58] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-05-30 12:20:59] [INFO ] Invariant cache hit.
[2025-05-30 12:20:59] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:05] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:06] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:06] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 181 constraints, problems are : Problem set: 0 solved, 170 unsolved in 20669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/295 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 52/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 170/351 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 351 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50785ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 50785ms
Starting structural reductions in LTL mode, iteration 1 : 124/179 places, 171/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51597 ms. Remains : 124/179 places, 171/296 transitions.
[2025-05-30 12:21:49] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:21:49] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:21:49] [INFO ] Input system was already deterministic with 171 transitions.
[2025-05-30 12:21:49] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:21:49] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:21:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality367946907144165407.gal : 5 ms
[2025-05-30 12:21:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1469995832646238167.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/CTLCardinality367946907144165407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1469995832646238167.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,1.6637e+06,14.3392,252076,2,20752,5,667465,6,0,667,880467,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t110, t119, t120...557
Detected timeout of ITS tools.
[2025-05-30 12:22:19] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:22:19] [INFO ] Applying decomposition
[2025-05-30 12:22:19] [INFO ] Flatten gal took : 10 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/graph8412601488008252283.txt' '-o' '/tmp/graph8412601488008252283.bin' '-w' '/tmp/graph8412601488008252283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8412601488008252283.bin' '-l' '-1' '-v' '-w' '/tmp/graph8412601488008252283.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:22:20] [INFO ] Decomposing Gal with order
[2025-05-30 12:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:22:20] [INFO ] Removed a total of 191 redundant transitions.
[2025-05-30 12:22:20] [INFO ] Flatten gal took : 86 ms
[2025-05-30 12:22:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 21 ms.
[2025-05-30 12:22:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5539445733634631731.gal : 8 ms
[2025-05-30 12:22:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality14847039847369190836.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/CTLCardinality5539445733634631731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14847039847369190836.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.
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.6637e+06,9.53325,185680,2110,1180,120942,26566,580,1.54193e+06,125,350675,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t68, t83, t110, t119, t121, t122, t123, t124, t125, t126, t127, t128, t129, t130, t1...582
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 296/296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 163 transition count 274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 163 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 163 transition count 272
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 149 transition count 255
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 149 transition count 255
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 149 transition count 250
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 141 transition count 236
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 141 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 91 place count 141 transition count 228
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 98 place count 134 transition count 187
Iterating global reduction 3 with 7 rules applied. Total rules applied 105 place count 134 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 132 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 132 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 130 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 129 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 129 transition count 181
Applied a total of 115 rules in 19 ms. Remains 129 /179 variables (removed 50) and now considering 181/296 (removed 115) transitions.
// Phase 1: matrix 181 rows 129 cols
[2025-05-30 12:22:50] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:50] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-30 12:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 12:22:51] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-05-30 12:22:51] [INFO ] Invariant cache hit.
[2025-05-30 12:22:51] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/310 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 54/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 185 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/310 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 54/185 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 180/365 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 365 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42162ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 42163ms
Starting structural reductions in LTL mode, iteration 1 : 129/179 places, 181/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43122 ms. Remains : 129/179 places, 181/296 transitions.
[2025-05-30 12:23:33] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:23:33] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:23:33] [INFO ] Input system was already deterministic with 181 transitions.
[2025-05-30 12:23:33] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:23:33] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:23:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16611308074312469330.gal : 3 ms
[2025-05-30 12:23:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11336746848068098687.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/CTLCardinality16611308074312469330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11336746848068098687.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,2.75825e+06,24.7371,449968,2,30225,5,1.18315e+06,6,0,697,1.6949e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:24:03] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:24:03] [INFO ] Applying decomposition
[2025-05-30 12:24:03] [INFO ] Flatten gal took : 9 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/graph12447316104477608190.txt' '-o' '/tmp/graph12447316104477608190.bin' '-w' '/tmp/graph12447316104477608190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12447316104477608190.bin' '-l' '-1' '-v' '-w' '/tmp/graph12447316104477608190.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:24:03] [INFO ] Decomposing Gal with order
[2025-05-30 12:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:24:03] [INFO ] Removed a total of 195 redundant transitions.
[2025-05-30 12:24:03] [INFO ] Flatten gal took : 26 ms
[2025-05-30 12:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 15 ms.
[2025-05-30 12:24:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2457960999769423679.gal : 5 ms
[2025-05-30 12:24:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality11635804750014959488.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/CTLCardinality2457960999769423679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11635804750014959488.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.
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.75825e+06,6.14282,126836,2590,1219,156415,16935,581,551999,199,151214,0


Converting to forward existential form...Done !
original formula: !(E(AG((i4.u18.l4143>=1)) U EX(TRUE)))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(E(TRUE U !((i4.u18.l4143>=1)))))) * TRUE)] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t13, t14, t71, t73, t74, t75, t83, t85, t86, t87, t90, t112, t117, t128, t129, t130, t133...583
(forward)formula 0,0,9.40845,127348,1,0,156415,43848,2535,636703,1107,299900,348516
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 296/296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 163 transition count 274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 163 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 163 transition count 272
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 149 transition count 255
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 149 transition count 255
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 149 transition count 250
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 141 transition count 233
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 141 transition count 233
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 90 place count 141 transition count 226
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 97 place count 134 transition count 191
Iterating global reduction 3 with 7 rules applied. Total rules applied 104 place count 134 transition count 191
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 131 transition count 188
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 131 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 131 transition count 187
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 129 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 128 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 128 transition count 183
Applied a total of 117 rules in 64 ms. Remains 128 /179 variables (removed 51) and now considering 183/296 (removed 113) transitions.
// Phase 1: matrix 183 rows 128 cols
[2025-05-30 12:24:13] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:24:13] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 12:24:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:24:13] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 12:24:14] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:24:14] [INFO ] Redundant transitions in 8 ms returned []
Running 182 sub problems to find dead transitions.
[2025-05-30 12:24:14] [INFO ] Invariant cache hit.
[2025-05-30 12:24:14] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:22] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:22] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:23] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:23] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:24:27] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 196 constraints, problems are : Problem set: 0 solved, 182 unsolved in 26769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/311 variables, 128/135 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 61/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 182/378 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 378 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56877ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 56878ms
Starting structural reductions in SI_CTL mode, iteration 1 : 128/179 places, 183/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58102 ms. Remains : 128/179 places, 183/296 transitions.
[2025-05-30 12:25:11] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:25:11] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:25:11] [INFO ] Input system was already deterministic with 183 transitions.
[2025-05-30 12:25:11] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:25:11] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:25:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1302005227558896084.gal : 7 ms
[2025-05-30 12:25:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5443279530625232560.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1302005227558896084.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5443279530625232560.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (9194 resets) in 327 ms. (121 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality5443279530625232560.prop.
BEST_FIRST walk for 40002 steps (3971 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 88
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88 after 152
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :152 after 246
SDD proceeding with computation,1 properties remain. new max is 256
Finished probabilistic random walk after 42542 steps, run visited all 1 properties in 88 ms. (steps per millisecond=483 )
Probabilistic random walk after 42542 steps, saw 19881 distinct states, run finished after 93 ms. (steps per millisecond=457 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD size :246 after 406
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 273
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 162 transition count 271
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 147 transition count 253
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 147 transition count 253
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 71 place count 147 transition count 248
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 138 transition count 229
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 138 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 138 transition count 221
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 105 place count 130 transition count 179
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 130 transition count 179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 127 transition count 176
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 127 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 127 transition count 175
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 125 transition count 173
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 125 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 124 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 124 transition count 171
Applied a total of 126 rules in 23 ms. Remains 124 /179 variables (removed 55) and now considering 171/296 (removed 125) transitions.
// Phase 1: matrix 171 rows 124 cols
[2025-05-30 12:25:11] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:11] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 12:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:25:11] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 12:25:12] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-05-30 12:25:12] [INFO ] Invariant cache hit.
[2025-05-30 12:25:12] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:19] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:19] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:19] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 181 constraints, problems are : Problem set: 0 solved, 170 unsolved in 22761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/295 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 52/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 170/351 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 351 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52858ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 52859ms
Starting structural reductions in LTL mode, iteration 1 : 124/179 places, 171/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53667 ms. Remains : 124/179 places, 171/296 transitions.
[2025-05-30 12:26:05] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:26:05] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:26:05] [INFO ] Input system was already deterministic with 171 transitions.
[2025-05-30 12:26:05] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:26:05] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:26:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality9288665254638723244.gal : 2 ms
[2025-05-30 12:26:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality16436717259342853026.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/CTLCardinality9288665254638723244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16436717259342853026.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.6637e+06,12.4881,253012,2,20752,5,667465,6,0,667,880467,0


Converting to forward existential form...Done !
original formula: AF(AG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EX(!(FALSE))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t110, t119, t120...557
Detected timeout of ITS tools.
[2025-05-30 12:26:35] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:26:35] [INFO ] Applying decomposition
[2025-05-30 12:26:35] [INFO ] Flatten gal took : 10 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/graph10323034189067672750.txt' '-o' '/tmp/graph10323034189067672750.bin' '-w' '/tmp/graph10323034189067672750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10323034189067672750.bin' '-l' '-1' '-v' '-w' '/tmp/graph10323034189067672750.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:26:35] [INFO ] Decomposing Gal with order
[2025-05-30 12:26:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:26:35] [INFO ] Removed a total of 186 redundant transitions.
[2025-05-30 12:26:35] [INFO ] Flatten gal took : 35 ms
[2025-05-30 12:26:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 18 ms.
[2025-05-30 12:26:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality7348904839147370550.gal : 5 ms
[2025-05-30 12:26:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality11486995990144906278.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/CTLCardinality7348904839147370550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11486995990144906278.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.
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.6637e+06,3.6668,74184,1494,1130,55057,9224,534,512357,172,151579,0


Converting to forward existential form...Done !
original formula: AF(AG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EX(!(FALSE))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t13, t15, t73, t74, t75, t81, t83, t86, t87, t90, t110, t121, t122, t124, t125, t126,...499
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,16.4031,281120,1,0,208590,44027,2168,2.23071e+06,862,499105,452616
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-05-30 12:26:52] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:26:52] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:26:52] [INFO ] Applying decomposition
[2025-05-30 12:26:52] [INFO ] Flatten gal took : 10 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/graph18109562678344987608.txt' '-o' '/tmp/graph18109562678344987608.bin' '-w' '/tmp/graph18109562678344987608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18109562678344987608.bin' '-l' '-1' '-v' '-w' '/tmp/graph18109562678344987608.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:26:52] [INFO ] Decomposing Gal with order
[2025-05-30 12:26:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:26:52] [INFO ] Removed a total of 310 redundant transitions.
[2025-05-30 12:26:52] [INFO ] Flatten gal took : 31 ms
[2025-05-30 12:26:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 11 ms.
[2025-05-30 12:26:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality13620602810768907795.gal : 4 ms
[2025-05-30 12:26:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality2239795456791503097.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/CTLCardinality13620602810768907795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2239795456791503097.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.
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,7.67463e+06,61.2042,1068976,5861,10095,511936,1.46315e+06,704,4.75756e+06,361,6.43445e+06,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t13, t29, t33, t35, t41, t50, t106, t108, t109, t111, t114, t123, t125, t133, t135, t...930
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,194.019,2202980,1,0,1.21026e+06,1.61225e+06,1783,1.07501e+07,1065,1.80102e+07,608491
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 775647 ms.

BK_STOP 1748608207186

--------------------
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="DBSingleClientW-PT-d2m06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063600129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m06.tgz
mv DBSingleClientW-PT-d2m06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;