fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r212-tall-174901995000777
Last Updated
June 24, 2025

About the Execution of ITS-Tools for SmartHome-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 312993.00 0.00 0.00 FFTFTTTFFTTTTTTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 90K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749249167984

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 22:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 22:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:32:49] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-06-06 22:32:49] [INFO ] Transformed 376 places.
[2025-06-06 22:32:49] [INFO ] Transformed 399 transitions.
[2025-06-06 22:32:49] [INFO ] Found NUPN structural information;
[2025-06-06 22:32:49] [INFO ] Parsed PT model containing 376 places and 399 transitions and 909 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 104 places in 4 ms
Reduce places removed 104 places and 80 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-12-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 265 transition count 319
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 61 place count 211 transition count 265
Iterating global reduction 1 with 54 rules applied. Total rules applied 115 place count 211 transition count 265
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 121 place count 211 transition count 259
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 129 place count 203 transition count 251
Iterating global reduction 2 with 8 rules applied. Total rules applied 137 place count 203 transition count 251
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 144 place count 196 transition count 244
Iterating global reduction 2 with 7 rules applied. Total rules applied 151 place count 196 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 196 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 195 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 195 transition count 242
Applied a total of 154 rules in 72 ms. Remains 195 /272 variables (removed 77) and now considering 242/319 (removed 77) transitions.
// Phase 1: matrix 242 rows 195 cols
[2025-06-06 22:32:49] [INFO ] Computed 6 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:32:49] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-06 22:32:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:32:49] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-06 22:32:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 4/195 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 242/437 variables, 195/201 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 0/437 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 201 constraints, problems are : Problem set: 0 solved, 241 unsolved in 11555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 4/195 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 242/437 variables, 195/201 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 241/442 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:33:06] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:33:06] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 444 constraints, problems are : Problem set: 0 solved, 241 unsolved in 19415 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31048ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 31065ms
Starting structural reductions in LTL mode, iteration 1 : 195/272 places, 242/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31586 ms. Remains : 195/272 places, 242/319 transitions.
Support contains 51 out of 195 places after structural reductions.
[2025-06-06 22:33:21] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-06 22:33:21] [INFO ] Flatten gal took : 38 ms
FORMULA SmartHome-PT-12-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:33:21] [INFO ] Flatten gal took : 16 ms
[2025-06-06 22:33:21] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 49 out of 195 places (down from 51) after GAL structural reductions.
RANDOM walk for 40000 steps (220 resets) in 1225 ms. (32 steps per ms) remains 6/31 properties
BEST_FIRST walk for 40004 steps (34 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 150 ms. (264 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
[2025-06-06 22:33:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 51/88 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 107/195 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 101/296 variables, 47/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 75/371 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 45/416 variables, 24/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 15/431 variables, 10/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/436 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/436 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/437 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/437 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/437 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 201 constraints, problems are : Problem set: 0 solved, 4 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 51/88 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 107/195 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 101/296 variables, 47/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 75/371 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 45/416 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 15/431 variables, 10/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 5/436 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/436 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/437 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/437 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/437 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 205 constraints, problems are : Problem set: 0 solved, 4 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 886ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 120 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=120 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 72 ms.
[2025-06-06 22:33:22] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:33:22] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:33:22] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 56 stabilizing places and 52 stable transitions
Graph (complete) has 299 edges and 195 vertex of which 192 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 242
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 170 transition count 219
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 170 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 217
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 60 place count 160 transition count 207
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 160 transition count 207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 152 transition count 199
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 152 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 152 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 148 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 148 transition count 194
Applied a total of 95 rules in 12 ms. Remains 148 /195 variables (removed 47) and now considering 194/242 (removed 48) transitions.
// Phase 1: matrix 194 rows 148 cols
[2025-06-06 22:33:22] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:33:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:23] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-06 22:33:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 2/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/342 variables, 148/152 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 0/342 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 152 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7124 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 2/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/342 variables, 148/152 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 193/345 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:33:33] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 346 constraints, problems are : Problem set: 0 solved, 193 unsolved in 12411 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19570ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 19571ms
Starting structural reductions in LTL mode, iteration 1 : 148/195 places, 194/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19705 ms. Remains : 148/195 places, 194/242 transitions.
[2025-06-06 22:33:42] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:33:42] [INFO ] Flatten gal took : 13 ms
[2025-06-06 22:33:42] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-06 22:33:42] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:33:42] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:33:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3522586923346245603.gal : 21 ms
[2025-06-06 22:33:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17318281694938799200.ctl : 3 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/CTLCardinality3522586923346245603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17318281694938799200.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,2.01485e+11,0.210177,12140,2,2408,5,38750,6,0,778,41197,0


Converting to forward existential form...Done !
original formula: AF((EF(EX(AG((p368==0)))) + (EF((p2==1)) * E(AG((p111==0)) U (p65==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EX(!(E(TRUE U !((p368==0)))))) + (E(TRUE U (p2==1)) * E(!(E(TRUE U !((p111==0)))) U (p65=...172
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t150, t166, t169, t172, t...260
(forward)formula 0,1,3.68542,142336,1,0,345,858655,423,236,4562,798613,522
FORMULA SmartHome-PT-12-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 242
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 176 transition count 226
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 176 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 176 transition count 225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 170 transition count 219
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 170 transition count 219
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 166 transition count 215
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 166 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 166 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 165 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 165 transition count 213
Applied a total of 59 rules in 26 ms. Remains 165 /195 variables (removed 30) and now considering 213/242 (removed 29) transitions.
// Phase 1: matrix 213 rows 165 cols
[2025-06-06 22:33:46] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:46] [INFO ] Implicit Places using invariants in 355 ms returned []
[2025-06-06 22:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:46] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-06 22:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/378 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/378 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 168 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/378 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 212/380 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:33:59] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 381 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14296 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23358ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 23359ms
Starting structural reductions in LTL mode, iteration 1 : 165/195 places, 213/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23838 ms. Remains : 165/195 places, 213/242 transitions.
[2025-06-06 22:34:10] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:34:10] [INFO ] Flatten gal took : 20 ms
[2025-06-06 22:34:10] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-06 22:34:10] [INFO ] Flatten gal took : 17 ms
[2025-06-06 22:34:10] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:34:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality16818705375734857156.gal : 2 ms
[2025-06-06 22:34:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality5470696707016172632.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/CTLCardinality16818705375734857156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5470696707016172632.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,3.63976e+11,0.211655,13324,2,2783,5,42544,6,0,868,45544,0


Converting to forward existential form...Done !
original formula: (AF(AX((EF((p237==1)) + AG(((p86==1)&&(p198==1)))))) + (A(!(EX(TRUE)) U ((p226==0)||(p163==1))) * AG(E(A((((p215==0)||(p67==1))&&(p162==0...224
=> equivalent forward existential formula: (([(EY((FwdU((Init * !(!(EG(!(!(EX(!((E(TRUE U (p237==1)) + !(E(TRUE U !(((p86==1)&&(p198==1)))))))))))))),!(((p...687
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t30, t33, t64, t69, t98, t103, t120, t123, t141, t145, t158, t164, t184, t187, t...272
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.6235,577056,1,0,837,3.30078e+06,484,479,5374,4.27698e+06,1041
FORMULA SmartHome-PT-12-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Graph (trivial) has 194 edges and 195 vertex of which 89 / 195 are part of one of the 7 SCC in 9 ms
Free SCC test removed 82 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Graph (complete) has 191 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 109 transition count 89
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 60 rules applied. Total rules applied 108 place count 63 transition count 75
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 56 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 55 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 117 place count 55 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 121 place count 53 transition count 72
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 131 place count 43 transition count 62
Iterating global reduction 4 with 10 rules applied. Total rules applied 141 place count 43 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 43 transition count 61
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 178 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 24 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 24 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 192 place count 24 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 194 place count 22 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 194 place count 22 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 20 transition count 27
Applied a total of 197 rules in 34 ms. Remains 20 /195 variables (removed 175) and now considering 27/242 (removed 215) transitions.
[2025-06-06 22:34:27] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 20 cols
[2025-06-06 22:34:27] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:34:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 22:34:27] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:34:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:34:27] [INFO ] Redundant transitions in 22 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 22:34:27] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/41 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 184 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 398ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/195 places, 27/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 515 ms. Remains : 20/195 places, 27/242 transitions.
[2025-06-06 22:34:27] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:34:27] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:34:27] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 22:34:27] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:34:27] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:34:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality4244028133678880663.gal : 1 ms
[2025-06-06 22:34:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17858954708557960042.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/CTLCardinality4244028133678880663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17858954708557960042.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,13248,0.009494,3836,2,60,5,315,6,0,89,301,0


Converting to forward existential form...Done !
original formula: EF(AG((p247==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p247==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t18, t23, t24, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,0,0.015358,4092,1,0,52,2348,69,23,516,1917,57
FORMULA SmartHome-PT-12-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 242
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 172 transition count 221
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 172 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 172 transition count 219
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 54 place count 164 transition count 211
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 164 transition count 211
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 158 transition count 205
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 158 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 158 transition count 204
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 78 place count 155 transition count 201
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 155 transition count 201
Applied a total of 81 rules in 24 ms. Remains 155 /195 variables (removed 40) and now considering 201/242 (removed 41) transitions.
// Phase 1: matrix 201 rows 155 cols
[2025-06-06 22:34:27] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:34:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 22:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:34:27] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-06 22:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 2/155 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/356 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 159 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7953 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 2/155 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/359 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:34:39] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 360 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13255 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21224ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 21225ms
Starting structural reductions in LTL mode, iteration 1 : 155/195 places, 201/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21397 ms. Remains : 155/195 places, 201/242 transitions.
[2025-06-06 22:34:49] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:34:49] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:34:49] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-06 22:34:49] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:34:49] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:34:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2322549252901230333.gal : 2 ms
[2025-06-06 22:34:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13806260212852281581.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/CTLCardinality2322549252901230333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13806260212852281581.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,2.42581e+11,0.216421,12960,2,2470,5,41546,6,0,813,45247,0


Converting to forward existential form...Done !
original formula: (AG(((p361==0)&&(p256==0))) + AG((!(E(AX((p50==1)) U ((p245!=1)&&((p291==0)||(p136==1))))) + EG(((p264==0)&&(p245==0))))))
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(!(E(TRUE U !(((p361==0)&&(p256==0))))))),TRUE) * !(EG(((p264==0)&&(p245==0))))),!(EX(!((p...213
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t30, t37, t66, t98, t101, t119, t122, t139, t142, t154, t173, t176, t179, t185, Int...251
(forward)formula 0,0,10.6814,361384,1,0,677,2.14582e+06,439,391,5043,2.43715e+06,870
FORMULA SmartHome-PT-12-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Graph (trivial) has 194 edges and 195 vertex of which 97 / 195 are part of one of the 7 SCC in 0 ms
Free SCC test removed 90 places
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Graph (complete) has 181 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 101 transition count 85
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 51 rules applied. Total rules applied 93 place count 61 transition count 74
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 56 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 98 place count 56 transition count 71
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 53 transition count 71
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 113 place count 44 transition count 62
Iterating global reduction 3 with 9 rules applied. Total rules applied 122 place count 44 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 44 transition count 61
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 159 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 25 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 25 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 173 place count 25 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 175 place count 23 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 175 place count 23 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 21 transition count 27
Applied a total of 178 rules in 17 ms. Remains 21 /195 variables (removed 174) and now considering 27/242 (removed 215) transitions.
[2025-06-06 22:34:59] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2025-06-06 22:34:59] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:34:59] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-06 22:34:59] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:34:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-06 22:35:00] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:35:00] [INFO ] Redundant transitions in 24 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 22:35:00] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:35:00] [INFO ] Invariant cache hit.
[2025-06-06 22:35:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/42 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 135 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/42 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 258 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/195 places, 27/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 565 ms. Remains : 21/195 places, 27/242 transitions.
[2025-06-06 22:35:00] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:35:00] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:35:00] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 22:35:00] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:35:00] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:35:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8872268171770679187.gal : 0 ms
[2025-06-06 22:35:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13351720827524559326.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/CTLCardinality8872268171770679187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13351720827524559326.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,12032,0.005047,3840,2,94,5,466,6,0,92,456,0


Converting to forward existential form...Done !
original formula: EF(EG((p160!=0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p160!=0))] != FALSE
Hit Full ! (commute/partial/dont) 25/0/2
(forward)formula 0,1,0.011089,4096,1,0,8,1923,19,2,479,1663,8
FORMULA SmartHome-PT-12-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 242
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 169 transition count 219
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 169 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 169 transition count 217
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 61 place count 159 transition count 207
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 159 transition count 207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 151 transition count 199
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 151 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 151 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 147 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 147 transition count 194
Applied a total of 96 rules in 13 ms. Remains 147 /195 variables (removed 48) and now considering 194/242 (removed 48) transitions.
// Phase 1: matrix 194 rows 147 cols
[2025-06-06 22:35:00] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:00] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 22:35:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:00] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-06 22:35:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7544 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:35:14] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/341 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 344 constraints, problems are : Problem set: 0 solved, 193 unsolved in 15691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23269ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 23270ms
Starting structural reductions in LTL mode, iteration 1 : 147/195 places, 194/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23445 ms. Remains : 147/195 places, 194/242 transitions.
[2025-06-06 22:35:23] [INFO ] Flatten gal took : 15 ms
[2025-06-06 22:35:23] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:35:24] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-06 22:35:24] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:35:24] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:35:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10043861567425809051.gal : 1 ms
[2025-06-06 22:35:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9105858855715875956.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/CTLCardinality10043861567425809051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9105858855715875956.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.92753e+11,0.195025,12028,2,2192,5,36318,6,0,777,39081,0


Converting to forward existential form...Done !
original formula: AX(EG((p96==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((p96==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t136, t147, t166, t169, t174, t178,...256
(forward)formula 0,1,7.96656,283860,1,0,634,1.6475e+06,410,366,4311,2.02912e+06,812
FORMULA SmartHome-PT-12-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 242
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 168 transition count 218
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 168 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 168 transition count 216
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 158 transition count 206
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 158 transition count 206
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 150 transition count 198
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 150 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 150 transition count 197
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 94 place count 146 transition count 193
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 146 transition count 193
Applied a total of 98 rules in 9 ms. Remains 146 /195 variables (removed 49) and now considering 193/242 (removed 49) transitions.
// Phase 1: matrix 193 rows 146 cols
[2025-06-06 22:35:32] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:32] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-06 22:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-06 22:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 7304 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:35:42] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 342 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18902ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 18902ms
Starting structural reductions in LTL mode, iteration 1 : 146/195 places, 193/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19141 ms. Remains : 146/195 places, 193/242 transitions.
[2025-06-06 22:35:51] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:35:51] [INFO ] Flatten gal took : 17 ms
[2025-06-06 22:35:51] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-06 22:35:51] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:35:51] [INFO ] Flatten gal took : 22 ms
[2025-06-06 22:35:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5755658818656605872.gal : 1 ms
[2025-06-06 22:35:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality5922890638046785104.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/CTLCardinality5755658818656605872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5922890638046785104.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.88956e+11,0.209776,11712,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: AX(AX(AX(((p241==0) * EX(TRUE)))))
=> equivalent forward existential formula: ([(EY(EY(EY(Init))) * !((p241==0)))] = FALSE * [(EY(EY(EY(Init))) * !(EX(TRUE)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,1,1.20666,46712,1,0,241,205467,403,169,4273,206982,396
FORMULA SmartHome-PT-12-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 242
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 172 transition count 221
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 172 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 172 transition count 220
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 164 transition count 212
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 164 transition count 212
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 158 transition count 206
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 158 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 155 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 155 transition count 202
Applied a total of 80 rules in 7 ms. Remains 155 /195 variables (removed 40) and now considering 202/242 (removed 40) transitions.
// Phase 1: matrix 202 rows 155 cols
[2025-06-06 22:35:52] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:52] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-06 22:35:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:52] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-06 22:35:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 2/155 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/357 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/357 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 159 constraints, problems are : Problem set: 0 solved, 201 unsolved in 8165 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 2/155 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/357 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 201/360 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:36:04] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:36:04] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/357 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 362 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13663 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 21846ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 21847ms
Starting structural reductions in LTL mode, iteration 1 : 155/195 places, 202/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22109 ms. Remains : 155/195 places, 202/242 transitions.
[2025-06-06 22:36:14] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:36:14] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:36:14] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-06 22:36:14] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:36:14] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:36:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3613350698639278959.gal : 1 ms
[2025-06-06 22:36:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11442108417528441268.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/CTLCardinality3613350698639278959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11442108417528441268.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,3.40952e+11,0.252321,13744,2,2615,5,44042,6,0,814,49654,0


Converting to forward existential form...Done !
original formula: AX((EX(AG(EF((p37==0)))) + ((((p329==1)&&(p27==1)) * (EG(((p281==0)||(p364==1))) * (p287==0))) * (p264==1))))
=> equivalent forward existential formula: [((EY(Init) * !(((((p329==1)&&(p27==1)) * (EG(((p281==0)||(p364==1))) * (p287==0))) * (p264==1)))) * !(EX(!(E(TR...195
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t34, t37, t66, t98, t101, t118, t121, t138, t141, t153, t172, t175, t176, t181, t185...257
(forward)formula 0,1,12.5997,437876,1,0,659,2.53205e+06,435,383,4796,3.11146e+06,849
FORMULA SmartHome-PT-12-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Graph (trivial) has 186 edges and 195 vertex of which 85 / 195 are part of one of the 6 SCC in 0 ms
Free SCC test removed 79 places
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Graph (complete) has 196 edges and 116 vertex of which 113 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 112 transition count 96
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 57 rules applied. Total rules applied 103 place count 68 transition count 83
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 62 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 61 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 111 place count 61 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 119 place count 57 transition count 78
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 130 place count 46 transition count 67
Iterating global reduction 4 with 11 rules applied. Total rules applied 141 place count 46 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 144 place count 46 transition count 64
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 146 place count 45 transition count 63
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 180 place count 28 transition count 45
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 181 place count 27 transition count 44
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 27 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 193 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 194 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 194 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 196 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 197 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 198 place count 23 transition count 31
Applied a total of 198 rules in 21 ms. Remains 23 /195 variables (removed 172) and now considering 31/242 (removed 211) transitions.
[2025-06-06 22:36:27] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 23 cols
[2025-06-06 22:36:27] [INFO ] Computed 1 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 22:36:27] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2025-06-06 22:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:36:27] [INFO ] Redundant transitions in 23 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-06 22:36:27] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2025-06-06 22:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 23/42 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2/44 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/49 variables, and 22 constraints, problems are : Problem set: 0 solved, 16 unsolved in 192 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 23/42 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2/44 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/46 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/49 variables, and 39 constraints, problems are : Problem set: 0 solved, 16 unsolved in 256 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 484ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/195 places, 31/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 622 ms. Remains : 23/195 places, 31/242 transitions.
[2025-06-06 22:36:27] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:36:27] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:36:27] [INFO ] Input system was already deterministic with 31 transitions.
[2025-06-06 22:36:27] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:36:27] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:36:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3517424947082192584.gal : 0 ms
[2025-06-06 22:36:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12958168448864647576.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/CTLCardinality3517424947082192584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12958168448864647576.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,33120,0.004078,3916,2,56,5,300,6,0,107,269,0


Converting to forward existential form...Done !
original formula: EF((AG(EF(((p113==0)||(p66==0)))) * EF((p48==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((p113==0)||(p66==0))))))),TRUE) * (p48==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t19, t27, t28, Intersection with reachable at each step enabled. (destroyed/revers...184
(forward)formula 0,1,0.011617,4300,1,0,58,2701,79,28,647,2294,69
FORMULA SmartHome-PT-12-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 242
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 169 transition count 219
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 169 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 169 transition count 217
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 160 transition count 208
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 160 transition count 208
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 153 transition count 201
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 153 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 153 transition count 200
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 149 transition count 196
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 149 transition count 196
Applied a total of 92 rules in 7 ms. Remains 149 /195 variables (removed 46) and now considering 196/242 (removed 46) transitions.
// Phase 1: matrix 196 rows 149 cols
[2025-06-06 22:36:28] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 22:36:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:28] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-06 22:36:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 152 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 195/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:36:39] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 348 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12562 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20270ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 20271ms
Starting structural reductions in LTL mode, iteration 1 : 149/195 places, 196/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20431 ms. Remains : 149/195 places, 196/242 transitions.
[2025-06-06 22:36:48] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:36:48] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:36:48] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-06 22:36:48] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:36:48] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:36:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality18115242611770758372.gal : 1 ms
[2025-06-06 22:36:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11207635380211540396.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/CTLCardinality18115242611770758372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11207635380211540396.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.01668e+11,0.152502,11008,2,2053,5,31703,6,0,787,33590,0


Converting to forward existential form...Done !
original formula: AG(EX(EF(((AF((p109==1)) + (p130==0)) + (p177==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U ((!(EG(!((p109==1)))) + (p130==0)) + (p177==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t117, t134, t137, t149, t168, t171, t174, t176, t180,...256
(forward)formula 0,0,7.7974,287368,1,0,663,1.65978e+06,422,383,4612,2.04483e+06,847
FORMULA SmartHome-PT-12-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 242
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 171 transition count 221
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 171 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 171 transition count 219
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 56 place count 162 transition count 210
Iterating global reduction 2 with 9 rules applied. Total rules applied 65 place count 162 transition count 210
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 155 transition count 203
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 155 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 152 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 152 transition count 200
Applied a total of 85 rules in 5 ms. Remains 152 /195 variables (removed 43) and now considering 200/242 (removed 42) transitions.
// Phase 1: matrix 200 rows 152 cols
[2025-06-06 22:36:56] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 22:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:56] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-06-06 22:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 155 constraints, problems are : Problem set: 0 solved, 199 unsolved in 7938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 199/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:37:07] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 355 constraints, problems are : Problem set: 0 solved, 199 unsolved in 11992 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19944ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 19944ms
Starting structural reductions in LTL mode, iteration 1 : 152/195 places, 200/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20101 ms. Remains : 152/195 places, 200/242 transitions.
[2025-06-06 22:37:16] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:37:16] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:16] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-06 22:37:16] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:16] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12055304115700867613.gal : 1 ms
[2025-06-06 22:37:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality12385919028766898861.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/CTLCardinality12055304115700867613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12385919028766898861.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.46398e+11,0.197549,12436,2,2341,5,38087,6,0,803,41324,0


Converting to forward existential form...Done !
original formula: ((AG(EX(((p83==1)||(p216==0)))) * AX(FALSE)) + (AF((p197==0)) * AG(EF((p275==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !((!(E(TRUE U !(EX(((p83==1)||(p216==0)))))) * !(EX(!(FALSE)))))),!((p197==0)))] = FALSE * [(FwdU...271
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t29, t32, t65, t97, t100, t117, t120, t137, t140, t153, t172, t175, t178, t180, t184...257
(forward)formula 0,0,4.01988,144800,1,0,305,866332,423,208,4818,713542,492
FORMULA SmartHome-PT-12-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 242
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 170 transition count 219
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 170 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 217
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 60 place count 160 transition count 207
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 160 transition count 207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 153 transition count 200
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 153 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 153 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 151 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 151 transition count 197
Applied a total of 89 rules in 13 ms. Remains 151 /195 variables (removed 44) and now considering 197/242 (removed 45) transitions.
// Phase 1: matrix 197 rows 151 cols
[2025-06-06 22:37:20] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:20] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-06 22:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 2/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/348 variables, 151/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 155 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7111 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 2/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/348 variables, 151/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 196/351 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:37:31] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 352 constraints, problems are : Problem set: 0 solved, 196 unsolved in 11699 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18823ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 18833ms
Starting structural reductions in LTL mode, iteration 1 : 151/195 places, 197/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19006 ms. Remains : 151/195 places, 197/242 transitions.
[2025-06-06 22:37:39] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:37:39] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:37:39] [INFO ] Input system was already deterministic with 197 transitions.
[2025-06-06 22:37:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5971794163493550478.gal : 1 ms
[2025-06-06 22:37:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10290565276380762018.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/CTLCardinality5971794163493550478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10290565276380762018.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,2.06009e+11,0.161066,11528,2,2310,5,32869,6,0,793,35294,0


Converting to forward existential form...Done !
original formula: AG(AX(A(EF(AG((p254==1))) U (((p368==0)||(p193==1))||((p148==0)||(p258!=0))))))
=> equivalent forward existential formula: ([((FwdU(EY(FwdU(Init,TRUE)),!((((p368==0)||(p193==1))||((p148==0)||(p258!=0))))) * !((((p368==0)||(p193==1))||(...321
Hit Full ! (commute/partial/dont) 190/21/7
(forward)formula 0,0,0.659666,29620,1,0,12,163389,20,3,3668,55281,13
FORMULA SmartHome-PT-12-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 242/242 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 242
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 169 transition count 219
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 169 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 169 transition count 217
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 160 transition count 208
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 160 transition count 208
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 77 place count 152 transition count 200
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 152 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 152 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 148 transition count 195
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 148 transition count 195
Applied a total of 94 rules in 21 ms. Remains 148 /195 variables (removed 47) and now considering 195/242 (removed 47) transitions.
// Phase 1: matrix 195 rows 148 cols
[2025-06-06 22:37:40] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 22:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:40] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-06 22:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 194/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:37:51] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/343 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 346 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12587 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20121ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 20121ms
Starting structural reductions in LTL mode, iteration 1 : 148/195 places, 195/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20261 ms. Remains : 148/195 places, 195/242 transitions.
[2025-06-06 22:38:00] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:38:00] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:00] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-06 22:38:00] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:00] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1860079682240531569.gal : 1 ms
[2025-06-06 22:38:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14892530209278191911.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/CTLCardinality1860079682240531569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14892530209278191911.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,2.04143e+11,0.192069,12392,2,2302,5,38153,6,0,782,41207,0


Converting to forward existential form...Done !
original formula: EX(EF((p94==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p94==1))] != FALSE
(forward)formula 0,1,0.307008,12904,1,0,9,39460,9,1,1510,42407,4
FORMULA SmartHome-PT-12-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 22:38:00] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:00] [INFO ] Flatten gal took : 4 ms
Total runtime 311690 ms.

BK_STOP 1749249480977

--------------------
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="SmartHome-PT-12"
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 SmartHome-PT-12, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901995000777"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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