About the Execution of ITS-Tools for SmartHome-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 203544.00 | 0.00 | 0.00 | FFTTTFTFTFTTFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994900729.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-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994900729
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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 56K 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-06-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2023-15
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-00
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-01
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-02
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-03
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-04
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-05
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-06
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-07
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-08
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-09
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-10
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1749247002888
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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 21:56:43] [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 21:56:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 21:56:44] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2025-06-06 21:56:44] [INFO ] Transformed 219 places.
[2025-06-06 21:56:44] [INFO ] Transformed 254 transitions.
[2025-06-06 21:56:44] [INFO ] Found NUPN structural information;
[2025-06-06 21:56:44] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-06-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 174 transition count 208
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 174 transition count 208
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 171 transition count 205
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 171 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 169 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 169 transition count 203
Applied a total of 66 rules in 38 ms. Remains 169 /202 variables (removed 33) and now considering 203/236 (removed 33) transitions.
// Phase 1: matrix 203 rows 169 cols
[2025-06-06 21:56:44] [INFO ] Computed 9 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:56:44] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-06 21:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:56:44] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2025-06-06 21:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:46] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:46] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:46] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:46] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:46] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:47] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:47] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:47] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:47] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:47] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:48] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/372 variables, 169/190 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 190 constraints, problems are : Problem set: 0 solved, 202 unsolved in 11410 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:56] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:57] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:57] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:57] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/372 variables, 169/194 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 202/396 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:59] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:56:59] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:00] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:00] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:01] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:02] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:06] [INFO ] Deduced a trap along path composed of 4 places in 43 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:06] [INFO ] Deduced a trap along path composed of 23 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:06] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:08] [INFO ] Deduced a trap along path composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:21] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/372 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 407 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 41482ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 41503ms
Starting structural reductions in LTL mode, iteration 1 : 169/202 places, 203/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41942 ms. Remains : 169/202 places, 203/236 transitions.
Support contains 84 out of 169 places after structural reductions.
[2025-06-06 21:57:26] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-06 21:57:26] [INFO ] Flatten gal took : 39 ms
FORMULA SmartHome-PT-06-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 21:57:26] [INFO ] Flatten gal took : 14 ms
[2025-06-06 21:57:26] [INFO ] Input system was already deterministic with 203 transitions.
Support contains 69 out of 169 places (down from 84) after GAL structural reductions.
FORMULA SmartHome-PT-06-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (259 resets) in 1608 ms. (24 steps per ms) remains 5/41 properties
BEST_FIRST walk for 40004 steps (47 resets) in 160 ms. (248 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (49 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (43 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (45 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
[2025-06-06 21:57:27] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 67/169 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 203/372 variables, 169/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 169/169 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:27] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 67/169 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 203/372 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:27] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 185 constraints, problems are : Problem set: 0 solved, 4 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 587ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 426 ms.
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 203/203 transitions.
Graph (trivial) has 158 edges and 169 vertex of which 67 / 169 are part of one of the 5 SCC in 2 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 107 transition count 86
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 72 place count 74 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 72 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 74 place count 72 transition count 75
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 86 place count 66 transition count 75
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 99 place count 53 transition count 62
Iterating global reduction 3 with 13 rules applied. Total rules applied 112 place count 53 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 53 transition count 58
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 150 place count 36 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 91 edges and 36 vertex of which 34 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 10 rules applied. Total rules applied 160 place count 34 transition count 30
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 166 place count 34 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 172 place count 28 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 27 transition count 23
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 5 rules applied. Total rules applied 178 place count 25 transition count 20
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 181 place count 22 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 181 place count 22 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 187 place count 19 transition count 17
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 188 place count 18 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 192 place count 16 transition count 15
Applied a total of 192 rules in 26 ms. Remains 16 /169 variables (removed 153) and now considering 15/203 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 16/169 places, 15/203 transitions.
RANDOM walk for 282 steps (0 resets) in 7 ms. (35 steps per ms) remains 0/4 properties
[2025-06-06 21:57:28] [INFO ] Flatten gal took : 10 ms
[2025-06-06 21:57:28] [INFO ] Flatten gal took : 9 ms
[2025-06-06 21:57:28] [INFO ] Input system was already deterministic with 203 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Graph (trivial) has 164 edges and 169 vertex of which 62 / 169 are part of one of the 5 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 111 transition count 90
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 86 place count 72 transition count 83
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 69 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 68 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 91 place count 68 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 105 place count 61 transition count 75
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 121 place count 45 transition count 59
Iterating global reduction 4 with 16 rules applied. Total rules applied 137 place count 45 transition count 59
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 141 place count 45 transition count 55
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 165 place count 33 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 33 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 168 place count 32 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 177 place count 32 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 179 place count 30 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 181 place count 28 transition count 29
Applied a total of 181 rules in 17 ms. Remains 28 /169 variables (removed 141) and now considering 29/203 (removed 174) transitions.
[2025-06-06 21:57:28] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 28 cols
[2025-06-06 21:57:28] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-06 21:57:28] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2025-06-06 21:57:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:57:28] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2025-06-06 21:57:28] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2025-06-06 21:57: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/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 17 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 52 constraints, problems are : Problem set: 0 solved, 17 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 433ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/169 places, 29/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 517 ms. Remains : 28/169 places, 29/203 transitions.
[2025-06-06 21:57:28] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:57:28] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:57:28] [INFO ] Input system was already deterministic with 29 transitions.
[2025-06-06 21:57:28] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:57:28] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:57:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality5165071288258103389.gal : 2 ms
[2025-06-06 21:57:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11197756039436605476.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5165071288258103389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11197756039436605476.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,1024,0.014594,3940,2,94,5,656,6,0,139,502,0
Converting to forward existential form...Done !
original formula: AG(EF((p143==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p143==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.019054,4068,1,0,7,1833,14,1,626,784,5
FORMULA SmartHome-PT-06-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 142 transition count 176
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 142 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 142 transition count 172
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 133 transition count 163
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 133 transition count 163
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 126 transition count 156
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 126 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 91 place count 126 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 122 transition count 151
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 122 transition count 151
Applied a total of 99 rules in 20 ms. Remains 122 /169 variables (removed 47) and now considering 151/203 (removed 52) transitions.
// Phase 1: matrix 151 rows 122 cols
[2025-06-06 21:57:28] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 21:57:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:28] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-06 21:57: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/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:30] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:30] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:30] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/273 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 135 constraints, problems are : Problem set: 0 solved, 150 unsolved in 5582 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:35] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 151/273 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 150/286 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:36] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:36] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:38] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:38] [INFO ] Deduced a trap along path composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 290 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10323 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15921ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15922ms
Starting structural reductions in LTL mode, iteration 1 : 122/169 places, 151/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16095 ms. Remains : 122/169 places, 151/203 transitions.
[2025-06-06 21:57:44] [INFO ] Flatten gal took : 10 ms
[2025-06-06 21:57:44] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:57:44] [INFO ] Input system was already deterministic with 151 transitions.
[2025-06-06 21:57:44] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:57:44] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:57:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality5644054556007398740.gal : 2 ms
[2025-06-06 21:57:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16287214429888322323.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/CTLCardinality5644054556007398740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16287214429888322323.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.64065e+08,0.127781,9784,2,1986,5,26903,6,0,641,24956,0
Converting to forward existential form...Done !
original formula: (EF(((AG((EG((p195==0)) * EX(((p130==0)&&(p207==1))))) * (((((p55==0)&&(p150==1))||((p135==0)&&(p141==1)))||((p218==0)||(p81==1)))||((p19...208
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((!(E(TRUE U !((EG((p195==0)) * EX(((p130==0)&&(p207==1))))))) * (((((p55==0)&&(p150==1))||...295
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t12, t13, t14, t16, t38, t39, t71, t92, t126, Intersection with reachable at each s...217
(forward)formula 0,0,5.03797,184896,1,0,567,1.1639e+06,332,317,3832,1.02273e+06,711
FORMULA SmartHome-PT-06-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 143 transition count 177
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 143 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 143 transition count 172
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 136 transition count 165
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 136 transition count 165
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 78 place count 129 transition count 158
Iterating global reduction 1 with 7 rules applied. Total rules applied 85 place count 129 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 129 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 126 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 126 transition count 154
Applied a total of 92 rules in 18 ms. Remains 126 /169 variables (removed 43) and now considering 154/203 (removed 49) transitions.
// Phase 1: matrix 154 rows 126 cols
[2025-06-06 21:57:50] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:50] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-06 21:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-06 21:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:51] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:51] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/280 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:53] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 138 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:57] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:57] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 154/280 variables, 126/140 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 153/293 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:58] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:58] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:58] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:00] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:00] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:04] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/280 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 299 constraints, problems are : Problem set: 0 solved, 153 unsolved in 15700 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 21918ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 21920ms
Starting structural reductions in LTL mode, iteration 1 : 126/169 places, 154/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22134 ms. Remains : 126/169 places, 154/203 transitions.
[2025-06-06 21:58:12] [INFO ] Flatten gal took : 9 ms
[2025-06-06 21:58:12] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:12] [INFO ] Input system was already deterministic with 154 transitions.
[2025-06-06 21:58:12] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:12] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8709852652829749380.gal : 2 ms
[2025-06-06 21:58:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13192923800015688350.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/CTLCardinality8709852652829749380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13192923800015688350.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.66132e+08,0.214333,13900,2,2813,5,47170,6,0,660,42309,0
Converting to forward existential form...Done !
original formula: EX(EX(A((p79==1) U E((((p29==0)||(p89==1))||((p96==0)||(p95==1))) U !(((p31==0)||(p171==1)))))))
=> equivalent forward existential formula: [((EY(EY(Init)) * !(EG(!(E((((p29==0)||(p89==1))||((p96==0)||(p95==1))) U !(((p31==0)||(p171==1)))))))) * !(E(!(...339
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t15, t37, t69, t88, t91, t111, t113, t130, t134, Intersection with reachabl...228
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.90496,224076,1,0,695,1.4765e+06,339,448,3882,1.24504e+06,834
FORMULA SmartHome-PT-06-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 141 transition count 175
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 141 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 141 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 135 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 135 transition count 164
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 129 transition count 158
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 129 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 129 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 127 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 127 transition count 155
Applied a total of 90 rules in 15 ms. Remains 127 /169 variables (removed 42) and now considering 155/203 (removed 48) transitions.
// Phase 1: matrix 155 rows 127 cols
[2025-06-06 21:58:18] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:18] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-06 21:58:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:18] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-06 21:58:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:19] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:19] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:19] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:19] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:19] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 155/282 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 142 constraints, problems are : Problem set: 0 solved, 154 unsolved in 5887 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:24] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 155/282 variables, 127/143 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 154/297 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:26] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:26] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:27] [INFO ] Deduced a trap along path composed of 22 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:28] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 301 constraints, problems are : Problem set: 0 solved, 154 unsolved in 11367 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 17267ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 17267ms
Starting structural reductions in LTL mode, iteration 1 : 127/169 places, 155/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17494 ms. Remains : 127/169 places, 155/203 transitions.
[2025-06-06 21:58:35] [INFO ] Flatten gal took : 12 ms
[2025-06-06 21:58:35] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:58:35] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-06 21:58:35] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:58:35] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality5746987479657135460.gal : 2 ms
[2025-06-06 21:58:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality11941380057741122151.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/CTLCardinality5746987479657135460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11941380057741122151.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.73004e+08,0.132348,10064,2,2141,5,27553,6,0,665,26640,0
Converting to forward existential form...Done !
original formula: (AG(((EF(((p163!=1)||((p47!=0)&&(p30!=1)))) * (((p104!=1)||(p84!=0))||((p188!=0)&&(p183!=1)))) * (EF(((p49!=0)&&(p77!=1))) * AX(FALSE))))...216
=> equivalent forward existential formula: [(EY(((FwdU((Init * !(!(E(TRUE U !(((E(TRUE U ((p163!=1)||((p47!=0)&&(p30!=1)))) * (((p104!=1)||(p84!=0))||((p18...309
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t14, t16, t37, t70, t93, t114, t116, t131, t135, Intersection with reachabl...228
(forward)formula 0,0,1.36616,55692,1,0,227,268217,340,152,4132,218738,352
FORMULA SmartHome-PT-06-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Graph (trivial) has 163 edges and 169 vertex of which 70 / 169 are part of one of the 5 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 103 transition count 86
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 72 place count 70 transition count 81
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 68 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 67 transition count 80
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 76 place count 67 transition count 73
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 90 place count 60 transition count 73
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 103 place count 47 transition count 60
Iterating global reduction 4 with 13 rules applied. Total rules applied 116 place count 47 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 47 transition count 58
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 142 place count 35 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 35 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 145 place count 34 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 153 place count 34 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 154 place count 33 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 156 place count 31 transition count 33
Applied a total of 156 rules in 20 ms. Remains 31 /169 variables (removed 138) and now considering 33/203 (removed 170) transitions.
[2025-06-06 21:58:37] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 31 cols
[2025-06-06 21:58:37] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 21:58:37] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2025-06-06 21:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:37] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:58:37] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2025-06-06 21:58:37] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2025-06-06 21:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 3/31 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 28/59 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/60 variables, and 39 constraints, problems are : Problem set: 0 solved, 19 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 3/31 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 28/59 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/60 variables, and 58 constraints, problems are : Problem set: 0 solved, 19 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/169 places, 33/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 731 ms. Remains : 31/169 places, 33/203 transitions.
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:58:37] [INFO ] Input system was already deterministic with 33 transitions.
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:58:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5058384485761552394.gal : 0 ms
[2025-06-06 21:58:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality12313956370883483040.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/CTLCardinality5058384485761552394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12313956370883483040.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,2448,0.00754,3920,2,96,5,839,6,0,155,846,0
Converting to forward existential form...Done !
original formula: EF((EG((((p198==1) + EF(((p5==0)&&(p214==1)))) + (p8==1))) * AF(EG((p57==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG((((p198==1) + E(TRUE U ((p5==0)&&(p214==1)))) + (p8==1)))) * !(EG(!(EG((p57==1))))))] !=...161
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.061583,6992,1,0,126,19435,33,88,807,20804,91
FORMULA SmartHome-PT-06-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Graph (trivial) has 147 edges and 169 vertex of which 25 / 169 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 147 transition count 124
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 64 rules applied. Total rules applied 117 place count 95 transition count 112
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 88 transition count 107
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 136 place count 83 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 82 transition count 105
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 137 place count 82 transition count 96
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 155 place count 73 transition count 96
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 169 place count 59 transition count 82
Iterating global reduction 5 with 14 rules applied. Total rules applied 183 place count 59 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 188 place count 59 transition count 77
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 216 place count 45 transition count 63
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 222 place count 45 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 223 place count 44 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 227 place count 42 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 236 place count 42 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 237 place count 41 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 239 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 14 edges and 38 vertex of which 2 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 241 place count 37 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 243 place count 37 transition count 42
Applied a total of 243 rules in 19 ms. Remains 37 /169 variables (removed 132) and now considering 42/203 (removed 161) transitions.
[2025-06-06 21:58:37] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
// Phase 1: matrix 39 rows 37 cols
[2025-06-06 21:58:37] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-06 21:58:37] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2025-06-06 21:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-06 21:58:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:58:38] [INFO ] Redundant transitions in 2 ms returned []
Running 37 sub problems to find dead transitions.
[2025-06-06 21:58:38] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2025-06-06 21:58:38] [INFO ] Invariant cache hit.
[2025-06-06 21:58:38] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 3/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:38] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 38/75 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/76 variables, and 54 constraints, problems are : Problem set: 0 solved, 37 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 3/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 38/75 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:39] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/75 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/76 variables, and 92 constraints, problems are : Problem set: 0 solved, 37 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1530ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1530ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/169 places, 42/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1627 ms. Remains : 37/169 places, 42/203 transitions.
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:58:39] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:58:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17121014434581712944.gal : 0 ms
[2025-06-06 21:58:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality16273535544809471314.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/CTLCardinality17121014434581712944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16273535544809471314.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,10808,0.008117,3964,2,194,5,1132,6,0,188,837,0
Converting to forward existential form...Done !
original formula: EF((!(E(((p42==0)||(p95==1)) U ((p145==0)||(p29==1)))) * ((p108==0)||((p162==0)&&(p68==0)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((p108==0)||((p162==0)&&(p68==0)))) * !(E(((p42==0)||(p95==1)) U ((p145==0)||(p29==1)))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t35, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.03101,5500,1,0,67,7361,99,39,1062,6020,97
FORMULA SmartHome-PT-06-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Graph (trivial) has 164 edges and 169 vertex of which 63 / 169 are part of one of the 5 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 110 transition count 92
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 82 place count 73 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 70 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 69 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 87 place count 69 transition count 76
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 103 place count 61 transition count 76
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 119 place count 45 transition count 60
Iterating global reduction 4 with 16 rules applied. Total rules applied 135 place count 45 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 139 place count 45 transition count 56
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 163 place count 33 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 33 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 169 place count 31 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 178 place count 31 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 180 place count 29 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 182 place count 27 transition count 28
Applied a total of 182 rules in 13 ms. Remains 27 /169 variables (removed 142) and now considering 28/203 (removed 175) transitions.
[2025-06-06 21:58:39] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 27 cols
[2025-06-06 21:58:39] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-06 21:58:39] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2025-06-06 21:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:58:39] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-06 21:58:39] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2025-06-06 21:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/51 variables, and 34 constraints, problems are : Problem set: 0 solved, 16 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 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/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 16 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 395ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/169 places, 28/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 471 ms. Remains : 27/169 places, 28/203 transitions.
[2025-06-06 21:58:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:58:40] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:58:40] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-06 21:58:40] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:58:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:58:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality12350934471272418237.gal : 1 ms
[2025-06-06 21:58:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality4785096505460952464.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/CTLCardinality12350934471272418237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4785096505460952464.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,768,0.008124,3968,2,94,5,556,6,0,134,429,0
Converting to forward existential form...Done !
original formula: AG(AF((p67==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p67==0)))] = FALSE
Hit Full ! (commute/partial/dont) 26/0/2
(forward)formula 0,0,0.014472,4224,1,0,8,2091,20,2,659,1450,8
FORMULA SmartHome-PT-06-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 145 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 145 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 145 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 141 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 141 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 137 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 137 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 135 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 135 transition count 164
Applied a total of 73 rules in 9 ms. Remains 135 /169 variables (removed 34) and now considering 164/203 (removed 39) transitions.
// Phase 1: matrix 164 rows 135 cols
[2025-06-06 21:58:40] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 21:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:40] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-06 21:58: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/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:42] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:42] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:42] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/299 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 152 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6967 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:47] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:47] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/299 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 163/317 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:49] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:51] [INFO ] Deduced a trap along path composed of 13 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:51] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/299 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 320 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13589 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20565ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 20566ms
Starting structural reductions in LTL mode, iteration 1 : 135/169 places, 164/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20690 ms. Remains : 135/169 places, 164/203 transitions.
[2025-06-06 21:59:00] [INFO ] Flatten gal took : 11 ms
[2025-06-06 21:59:00] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:00] [INFO ] Input system was already deterministic with 164 transitions.
[2025-06-06 21:59:00] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:00] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality14969770795072434353.gal : 1 ms
[2025-06-06 21:59:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality15856176378270945694.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/CTLCardinality14969770795072434353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15856176378270945694.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.5197e+08,0.16526,11356,2,2610,5,33408,6,0,706,30214,0
Converting to forward existential form...Done !
original formula: E(((AF((((p191==0)&&(((p106==0)||(p151==1))||((p199==0)||(p87==1)))) * A(((p154==0)||(p128==1)) U (p140==0)))) * (!(((!((p78==0)||(p142==...321
=> equivalent forward existential formula: [FwdG((FwdU(Init,((!(EG(!((((p191==0)&&(((p106==0)||(p151==1))||((p199==0)||(p87==1)))) * !((E(!((p140==0)) U (!...483
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t13, t16, t42, t83, t104, t126, t140, t144, Intersection with reachable at each...219
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,22.9493,744484,1,0,1749,3.88624e+06,404,1064,4187,5.1837e+06,1942
FORMULA SmartHome-PT-06-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 141 transition count 175
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 141 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 141 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 134 transition count 163
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 134 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 129 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 129 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 129 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 126 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 126 transition count 154
Applied a total of 92 rules in 12 ms. Remains 126 /169 variables (removed 43) and now considering 154/203 (removed 49) transitions.
// Phase 1: matrix 154 rows 126 cols
[2025-06-06 21:59:23] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 21:59:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:24] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-06 21:59:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:25] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:25] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/280 variables, 126/138 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 138 constraints, problems are : Problem set: 0 solved, 153 unsolved in 5649 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/280 variables, 126/138 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 153/291 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:31] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:31] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:31] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:32] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:34] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:34] [INFO ] Deduced a trap along path composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:35] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 298 constraints, problems are : Problem set: 0 solved, 153 unsolved in 13704 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 19361ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 19361ms
Starting structural reductions in LTL mode, iteration 1 : 126/169 places, 154/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19498 ms. Remains : 126/169 places, 154/203 transitions.
[2025-06-06 21:59:43] [INFO ] Flatten gal took : 11 ms
[2025-06-06 21:59:43] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:43] [INFO ] Input system was already deterministic with 154 transitions.
[2025-06-06 21:59:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:59:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:59:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13392333973952829626.gal : 0 ms
[2025-06-06 21:59:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality86473432626495100.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/CTLCardinality13392333973952829626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality86473432626495100.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41879e+08,0.123407,9544,2,2027,5,25857,6,0,660,24993,0
Converting to forward existential form...Done !
original formula: EF(EX(((AG((((p74==1)||(p67==0))||(p122==1))) + EX((p38==1))) + ((p45==0)&&(p169==1)))))
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((((p74==1)||(p67==0))||(p122==1))))))] != FALSE + [(EY(EY(FwdU(Init,TRUE)...240
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t35, t67, t91, t112, t115, t130, Intersection with reachable at each step ...213
(forward)formula 0,1,1.09176,46520,1,0,209,226912,330,139,3807,178640,337
FORMULA SmartHome-PT-06-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Graph (trivial) has 153 edges and 169 vertex of which 66 / 169 are part of one of the 5 SCC in 0 ms
Free SCC test removed 61 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 107 transition count 94
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 76 transition count 90
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 74 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 72 transition count 88
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 73 place count 72 transition count 81
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 87 place count 65 transition count 81
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 103 place count 49 transition count 65
Iterating global reduction 4 with 16 rules applied. Total rules applied 119 place count 49 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 123 place count 49 transition count 61
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 145 place count 38 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 147 place count 38 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 150 place count 38 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 37 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 152 place count 36 transition count 44
Applied a total of 152 rules in 17 ms. Remains 36 /169 variables (removed 133) and now considering 44/203 (removed 159) transitions.
[2025-06-06 21:59:44] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
// Phase 1: matrix 36 rows 36 cols
[2025-06-06 21:59:44] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 21:59:44] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
[2025-06-06 21:59:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:59:44] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-06 21:59:44] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
[2025-06-06 21:59:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 35/71 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/71 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/72 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 35/71 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/72 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 806ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/169 places, 44/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 884 ms. Remains : 36/169 places, 44/203 transitions.
[2025-06-06 21:59:45] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:59:45] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:59:45] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-06 21:59:45] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:59:45] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:59:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13184361249315240922.gal : 1 ms
[2025-06-06 21:59:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality3690148754308209606.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/CTLCardinality13184361249315240922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3690148754308209606.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,5880,0.008734,4112,2,189,5,1492,6,0,185,1124,0
Converting to forward existential form...Done !
original formula: AF(((!(A((p119==1) U (p188==0))) * EF(((p33==0)||(p125==1)))) * ((p217==0)||(p113==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((p188==0)) U (!((p119==1)) * !((p188==0)))) + EG(!((p188==0)))))) * E(TRUE U ((p33==0)||...204
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 37/0/7
Hit Full ! (commute/partial/dont) 37/0/7
(forward)formula 0,0,0.03261,5264,1,0,31,7575,34,26,942,5934,35
FORMULA SmartHome-PT-06-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 203/203 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 141 transition count 175
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 141 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 141 transition count 170
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 133 transition count 162
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 133 transition count 162
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 126 transition count 155
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 126 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 126 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 122 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 122 transition count 150
Applied a total of 100 rules in 5 ms. Remains 122 /169 variables (removed 47) and now considering 150/203 (removed 53) transitions.
// Phase 1: matrix 150 rows 122 cols
[2025-06-06 21:59:45] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 21:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:45] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-06 21:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:46] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 133 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5282 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 149/282 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:52] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:52] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:53] [INFO ] Deduced a trap along path composed of 22 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:54] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 286 constraints, problems are : Problem set: 0 solved, 149 unsolved in 9762 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15051ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 15051ms
Starting structural reductions in LTL mode, iteration 1 : 122/169 places, 150/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15193 ms. Remains : 122/169 places, 150/203 transitions.
[2025-06-06 22:00:00] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:00:00] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:00:00] [INFO ] Input system was already deterministic with 150 transitions.
[2025-06-06 22:00:00] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:00:00] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:00:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17577372868345122636.gal : 1 ms
[2025-06-06 22:00:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality2498326734760912477.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/CTLCardinality17577372868345122636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2498326734760912477.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.07129e+08,0.157447,11188,2,2322,5,32960,6,0,640,28946,0
Converting to forward existential form...Done !
original formula: A((p214==0) U AX(AG(A(AG((p184==1)) U AX(((p78==0)||(p109==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(E(TRUE U !(!((E(!(!(EX(!(((p78==0)||(p109==1)))))) U (!(!(E(TRUE U !((p184==1))))) * !...647
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t18, t38, t71, t92, t126, Intersection with reachable at each step enabled. (de...200
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.56038,198192,1,0,525,1.31838e+06,337,451,3968,1.03677e+06,742
FORMULA SmartHome-PT-06-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-06 22:00:06] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:00:06] [INFO ] Flatten gal took : 9 ms
Total runtime 202396 ms.
BK_STOP 1749247206432
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-06"
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-06, 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-174901994900729"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-06.tgz
mv SmartHome-PT-06 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 '
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 ;