Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 92K 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-13-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2023-15
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-00
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-01
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-02
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-03
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-04
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-05
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-06
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-07
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-08
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-09
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-10
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749249536711

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 22:38:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 22:38:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:38:58] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-06 22:38:58] [INFO ] Transformed 385 places.
[2025-06-06 22:38:58] [INFO ] Transformed 407 transitions.
[2025-06-06 22:38:58] [INFO ] Found NUPN structural information;
[2025-06-06 22:38:58] [INFO ] Parsed PT model containing 385 places and 407 transitions and 935 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 113 places in 4 ms
Reduce places removed 113 places and 88 transitions.
FORMULA SmartHome-PT-13-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 263 transition count 319
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 63 place count 209 transition count 265
Iterating global reduction 1 with 54 rules applied. Total rules applied 117 place count 209 transition count 265
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 124 place count 209 transition count 258
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 201 transition count 250
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 201 transition count 250
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 195 transition count 244
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 195 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 195 transition count 243
Applied a total of 153 rules in 66 ms. Remains 195 /272 variables (removed 77) and now considering 243/319 (removed 76) transitions.
// Phase 1: matrix 243 rows 195 cols
[2025-06-06 22:38:58] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:38:58] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-06 22:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:38:58] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-06 22:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 2/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/438 variables, 195/199 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 0/438 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 199 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11742 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 2/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/438 variables, 195/199 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 242/441 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:39:15] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:39:25] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/438 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 443 constraints, problems are : Problem set: 0 solved, 242 unsolved in 29885 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41692ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 41709ms
Starting structural reductions in LTL mode, iteration 1 : 195/272 places, 243/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42180 ms. Remains : 195/272 places, 243/319 transitions.
Support contains 70 out of 195 places after structural reductions.
[2025-06-06 22:39:40] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2025-06-06 22:39:40] [INFO ] Flatten gal took : 37 ms
[2025-06-06 22:39:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-06 22:39:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-13-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:39:40] [INFO ] Flatten gal took : 15 ms
[2025-06-06 22:39:40] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 35 out of 195 places (down from 70) after GAL structural reductions.
RANDOM walk for 40000 steps (219 resets) in 1061 ms. (37 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (29 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (30 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
[2025-06-06 22:39:41] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/28 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/68 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/164 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 98/262 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 73/335 variables, 39/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 56/391 variables, 27/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 32/423 variables, 19/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 12/435 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 3/438 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/438 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 199 constraints, problems are : Problem set: 0 solved, 3 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/28 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/68 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/164 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 98/262 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 73/335 variables, 39/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 56/391 variables, 27/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 32/423 variables, 19/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 12/435 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/435 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 3/438 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/438 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 202 constraints, problems are : Problem set: 0 solved, 3 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 800ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 170 ms.
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 243/243 transitions.
Graph (trivial) has 189 edges and 195 vertex of which 98 / 195 are part of one of the 7 SCC in 2 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 129 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 130 transitions.
Graph (complete) has 162 edges and 104 vertex of which 101 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 101 transition count 77
Reduce places removed 34 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 39 rules applied. Total rules applied 77 place count 67 transition count 72
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 80 place count 65 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 64 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 64 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 61 transition count 68
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 94 place count 54 transition count 61
Iterating global reduction 4 with 7 rules applied. Total rules applied 101 place count 54 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 54 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 102 place count 54 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 104 place count 53 transition count 59
Performed 24 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 152 place count 29 transition count 33
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 48 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 12 rules applied. Total rules applied 164 place count 27 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 27 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 166 place count 27 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 167 place count 26 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 168 place count 25 transition count 19
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 174 place count 20 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 175 place count 19 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 175 place count 19 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 179 place count 17 transition count 16
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 10 with 4 rules applied. Total rules applied 183 place count 15 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 184 place count 15 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 185 place count 14 transition count 13
Applied a total of 185 rules in 25 ms. Remains 14 /195 variables (removed 181) and now considering 13/243 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 14/195 places, 13/243 transitions.
RANDOM walk for 6754 steps (2 resets) in 24 ms. (270 steps per ms) remains 0/3 properties
[2025-06-06 22:39:42] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:39:42] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:39:42] [INFO ] Input system was already deterministic with 243 transitions.
Computed a total of 50 stabilizing places and 48 stable transitions
Graph (complete) has 297 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 243/243 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 243
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 170 transition count 219
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 170 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 170 transition count 218
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 162 transition count 210
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 162 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 162 transition count 209
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 158 transition count 205
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 158 transition count 205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 156 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 156 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 155 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 155 transition count 202
Applied a total of 81 rules in 25 ms. Remains 155 /195 variables (removed 40) and now considering 202/243 (removed 41) transitions.
// Phase 1: matrix 202 rows 155 cols
[2025-06-06 22:39:42] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 22:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:42] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-06 22:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/357 variables, 155/158 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/357 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 158 constraints, problems are : Problem set: 0 solved, 201 unsolved in 8058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/357 variables, 155/158 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 201/359 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:39:53] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/357 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 360 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21134ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 21134ms
Starting structural reductions in LTL mode, iteration 1 : 155/195 places, 202/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21290 ms. Remains : 155/195 places, 202/243 transitions.
[2025-06-06 22:40:03] [INFO ] Flatten gal took : 13 ms
[2025-06-06 22:40:03] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:40:03] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-06 22:40:03] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:40:03] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:40:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality18309208695033718030.gal : 3 ms
[2025-06-06 22:40:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2779255765022596737.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18309208695033718030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2779255765022596737.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.61719e+11,0.201826,12300,2,2521,5,37823,6,0,817,40858,0


Converting to forward existential form...Done !
original formula: E(EX(AG((AX(FALSE) + E((p100==0) U ((p116==0)||(p67==1)))))) U E(EX(TRUE) U !(AX((p375==0)))))
=> equivalent forward existential formula: [(EY(FwdU(FwdU(Init,EX(!(E(TRUE U !((!(EX(!(FALSE))) + E((p100==0) U ((p116==0)||(p67==1))))))))),EX(TRUE))) * !...177
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t115, t134, t139, t151, t157, t174, t177, t180, t182,...262
Detected timeout of ITS tools.
[2025-06-06 22:40:33] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:40:33] [INFO ] Applying decomposition
[2025-06-06 22:40:33] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph602655004544660014.txt' '-o' '/tmp/graph602655004544660014.bin' '-w' '/tmp/graph602655004544660014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph602655004544660014.bin' '-l' '-1' '-v' '-w' '/tmp/graph602655004544660014.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:40:33] [INFO ] Decomposing Gal with order
[2025-06-06 22:40:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:40:33] [INFO ] Removed a total of 42 redundant transitions.
[2025-06-06 22:40:33] [INFO ] Flatten gal took : 42 ms
[2025-06-06 22:40:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-06 22:40:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality17743583454035458536.gal : 4 ms
[2025-06-06 22:40:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality14440011588736204763.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/CTLCardinality17743583454035458536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14440011588736204763.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 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.61719e+11,0.066927,6892,406,46,5822,667,424,9540,66,2188,0


Converting to forward existential form...Done !
original formula: E(EX(AG((AX(FALSE) + E((i2.u16.p100==0) U ((i4.i1.u20.p116==0)||(i3.i0.u11.p67==1)))))) U E(EX(TRUE) U !(AX((i10.u55.p375==0)))))
=> equivalent forward existential formula: [(EY(FwdU(FwdU(Init,EX(!(E(TRUE U !((!(EX(!(FALSE))) + E((i2.u16.p100==0) U ((i4.i1.u20.p116==0)||(i3.i0.u11.p67...212
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t157, i0.i0.u53.t8, i0.i1.u2.t177, i1.u10.t174, i2.t182, i2.u13.t151, i2.u13.t...370
(forward)formula 0,1,5.42962,153964,1,0,344074,811,2602,411195,327,4523,307234
FORMULA SmartHome-PT-13-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 243/243 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 243
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 172 transition count 221
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 172 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 172 transition count 220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 163 transition count 211
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 163 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 163 transition count 210
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 71 place count 157 transition count 204
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 157 transition count 204
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 153 transition count 200
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 153 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 152 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 152 transition count 199
Applied a total of 87 rules in 19 ms. Remains 152 /195 variables (removed 43) and now considering 199/243 (removed 44) transitions.
// Phase 1: matrix 199 rows 152 cols
[2025-06-06 22:40:39] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:40:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 22:40:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:40:39] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-06 22:40: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/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/351 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/351 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 155 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7771 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/351 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 198/353 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:40:50] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 354 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20686ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 20687ms
Starting structural reductions in LTL mode, iteration 1 : 152/195 places, 199/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20841 ms. Remains : 152/195 places, 199/243 transitions.
[2025-06-06 22:41:00] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:00] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:00] [INFO ] Input system was already deterministic with 199 transitions.
[2025-06-06 22:41:00] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:00] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality18318544282442880321.gal : 2 ms
[2025-06-06 22:41:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality3931969856776273809.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/CTLCardinality18318544282442880321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3931969856776273809.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50493e+11,0.179091,11856,2,2283,5,35998,6,0,802,38181,0


Converting to forward existential form...Done !
original formula: E((E(((p280==1) + AF((p49==1))) U EF(((p93==0)||(p285==0)))) + !(EX((p200==1)))) U AF(AG(A(((p97==1)&&(p105==0)) U (p192==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(E(((p280==1) + !(EG(!((p49==1))))) U E(TRUE U ((p93==0)||(p285==0)))) + !(EX((p200==1))))) * !(EG(!...269
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t12, t28, t31, t60, t93, t96, t113, t116, t134, t137, t141, t152, t171, t174, t1...271
(forward)formula 0,0,10.8166,363220,1,0,748,2.19373e+06,431,425,4704,2.40533e+06,961
FORMULA SmartHome-PT-13-CTLCardinality-2025-04 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 : 195/195 places, 243/243 transitions.
Graph (trivial) has 188 edges and 195 vertex of which 83 / 195 are part of one of the 7 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Graph (complete) has 199 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 117 transition count 104
Reduce places removed 41 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 48 rules applied. Total rules applied 91 place count 76 transition count 97
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 97 place count 73 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 70 transition count 94
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 100 place count 70 transition count 89
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 110 place count 65 transition count 89
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 118 place count 57 transition count 81
Iterating global reduction 4 with 8 rules applied. Total rules applied 126 place count 57 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 57 transition count 80
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 169 place count 36 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 172 place count 36 transition count 56
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 176 place count 34 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 187 place count 34 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 33 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 188 place count 33 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 190 place count 32 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 31 transition count 41
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 12 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 193 place count 29 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 195 place count 29 transition count 39
Applied a total of 195 rules in 30 ms. Remains 29 /195 variables (removed 166) and now considering 39/243 (removed 204) transitions.
[2025-06-06 22:41:11] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 29 cols
[2025-06-06 22:41:11] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:11] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:41:11] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2025-06-06 22:41:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:41:11] [INFO ] Redundant transitions in 21 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-06 22:41:11] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2025-06-06 22:41:11] [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, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 30/56 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 3/59 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/62 variables, and 29 constraints, problems are : Problem set: 0 solved, 20 unsolved in 247 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/29 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 30/56 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 3/59 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1/61 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/61 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/61 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/62 variables, and 50 constraints, problems are : Problem set: 0 solved, 20 unsolved in 402 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 655ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/195 places, 39/243 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 772 ms. Remains : 29/195 places, 39/243 transitions.
[2025-06-06 22:41:11] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:41:11] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:41:11] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-06 22:41:11] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:41:11] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:41:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality14230015781491055541.gal : 0 ms
[2025-06-06 22:41:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12173091823444327919.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/CTLCardinality14230015781491055541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12173091823444327919.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,114048,0.011007,3904,2,113,5,538,6,0,139,479,0


Converting to forward existential form...Done !
original formula: A(((EF((p183==0)) + (p172==0)) + (p59!=1)) U EG(!(AG(((p94==0)||(p88==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(!(E(TRUE U !(((p94==0)||(p88==1))))))))))) * !(E(!(EG(!(!(E(TRUE U !(((p94==0)||(p88==1)))...276
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t18, t22, t23, t26, t28, Intersection with reachable at each step enabled. (destroy...193
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,0.107761,9536,1,0,166,33835,107,108,858,49838,184
FORMULA SmartHome-PT-13-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 243/243 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 243
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 170 transition count 219
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 170 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 170 transition count 218
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 60 place count 160 transition count 208
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 160 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 160 transition count 207
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 78 place count 153 transition count 200
Iterating global reduction 3 with 7 rules applied. Total rules applied 85 place count 153 transition count 200
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 149 transition count 196
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 149 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 148 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 148 transition count 195
Applied a total of 95 rules in 15 ms. Remains 148 /195 variables (removed 47) and now considering 195/243 (removed 48) transitions.
// Phase 1: matrix 195 rows 148 cols
[2025-06-06 22:41:12] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:12] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 22:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:12] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-06 22:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 194/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:41:22] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/343 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 346 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18885ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 18886ms
Starting structural reductions in LTL mode, iteration 1 : 148/195 places, 195/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19023 ms. Remains : 148/195 places, 195/243 transitions.
[2025-06-06 22:41:31] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:41:31] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:31] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-06 22:41:31] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:31] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality13777849662165454576.gal : 1 ms
[2025-06-06 22:41:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality933448325890311937.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/CTLCardinality13777849662165454576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality933448325890311937.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.09614e+11,0.165999,11624,2,2165,5,34991,6,0,782,37462,0


Converting to forward existential form...Done !
original formula: !(E(A(EX(AG((p114==0))) U AF(EX(TRUE))) U !(EF(((p140==0)||(p194==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(!(EG(!(EX(TRUE))))) U (!(EX(!(E(TRUE U !((p114==0)))))) * !(!(EG(!(EX(TRUE))))))) + EG(!(!(EG...222
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t92, t95, t112, t115, t133, t136, t148, t167, t170, t173, t175, t179,...256
(forward)formula 0,1,1.42168,54636,1,0,238,263428,411,167,4334,231704,400
FORMULA SmartHome-PT-13-CTLCardinality-2025-07 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 : 195/195 places, 243/243 transitions.
Graph (trivial) has 191 edges and 195 vertex of which 76 / 195 are part of one of the 6 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 205 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 123 transition count 102
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 60 rules applied. Total rules applied 111 place count 74 transition count 91
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 119 place count 68 transition count 89
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 121 place count 67 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 66 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 122 place count 66 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 132 place count 61 transition count 83
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 142 place count 51 transition count 73
Iterating global reduction 5 with 10 rules applied. Total rules applied 152 place count 51 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 155 place count 51 transition count 70
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 50 transition count 69
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 197 place count 30 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 199 place count 30 transition count 47
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 200 place count 29 transition count 46
Iterating global reduction 8 with 1 rules applied. Total rules applied 201 place count 29 transition count 46
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 205 place count 27 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 216 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 217 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 217 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 219 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 220 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 9 edges and 23 vertex of which 2 / 23 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 222 place count 22 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 224 place count 22 transition count 29
Applied a total of 224 rules in 26 ms. Remains 22 /195 variables (removed 173) and now considering 29/243 (removed 214) transitions.
[2025-06-06 22:41:32] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2025-06-06 22:41:32] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:32] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 22:41:32] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:41:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:41:32] [INFO ] Redundant transitions in 19 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 22:41:32] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:41:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/45 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 23 constraints, problems are : Problem set: 0 solved, 14 unsolved in 156 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 4/45 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 145 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/195 places, 29/243 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 414 ms. Remains : 22/195 places, 29/243 transitions.
[2025-06-06 22:41:32] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:41:32] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:41:32] [INFO ] Input system was already deterministic with 29 transitions.
[2025-06-06 22:41:32] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:41:32] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:41:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17674720475351283665.gal : 1 ms
[2025-06-06 22:41:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality6304816238278106848.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/CTLCardinality17674720475351283665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6304816238278106848.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,26496,0.004173,3868,2,63,5,319,6,0,101,297,0


Converting to forward existential form...Done !
original formula: EF((EF((p265==0)) * EG((p206==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(TRUE U (p265==0))),(p206==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t18, t23, t24, Intersection with reachable at each step enabled. (destroyed/reverse/...182
Hit Full ! (commute/partial/dont) 26/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.014056,4380,1,0,57,3351,83,28,636,3241,68
FORMULA SmartHome-PT-13-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 243/243 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 243
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 169 transition count 218
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 169 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 169 transition count 217
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 159 transition count 207
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 159 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 159 transition count 206
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 80 place count 152 transition count 199
Iterating global reduction 3 with 7 rules applied. Total rules applied 87 place count 152 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 148 transition count 195
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 148 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 147 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 147 transition count 194
Applied a total of 97 rules in 10 ms. Remains 147 /195 variables (removed 48) and now considering 194/243 (removed 49) transitions.
// Phase 1: matrix 194 rows 147 cols
[2025-06-06 22:41:32] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 22:41:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:33] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-06 22:41:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7450 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:41:43] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 344 constraints, problems are : Problem set: 0 solved, 193 unsolved in 11760 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19233ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 19233ms
Starting structural reductions in LTL mode, iteration 1 : 147/195 places, 194/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19362 ms. Remains : 147/195 places, 194/243 transitions.
[2025-06-06 22:41:52] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:41:52] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:52] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-06 22:41:52] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:41:52] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:41:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality2809594061211443697.gal : 1 ms
[2025-06-06 22:41:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14708427785160681111.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/CTLCardinality2809594061211443697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14708427785160681111.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.96514e+11,0.186195,11992,2,2191,5,35823,6,0,777,38567,0


Converting to forward existential form...Done !
original formula: EF(((EF((p247==1)) * AX(((p290==0)||(p187==1)))) * (p178==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p178==1)) * E(TRUE U (p247==1))) * !(EX(!(((p290==0)||(p187==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t92, t95, t112, t115, t132, t135, t147, t166, t169, t172, t174, t178,...256
(forward)formula 0,1,1.45118,57512,1,0,249,275468,412,175,4424,242078,412
FORMULA SmartHome-PT-13-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 243/243 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 243
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 170 transition count 219
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 170 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 170 transition count 218
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 59 place count 161 transition count 209
Iterating global reduction 2 with 9 rules applied. Total rules applied 68 place count 161 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 161 transition count 208
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 75 place count 155 transition count 202
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 155 transition count 202
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 151 transition count 198
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 151 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 150 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 150 transition count 197
Applied a total of 91 rules in 8 ms. Remains 150 /195 variables (removed 45) and now considering 197/243 (removed 46) transitions.
// Phase 1: matrix 197 rows 150 cols
[2025-06-06 22:41:53] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 22:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-06 22:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 153 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 196/349 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:42:04] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 350 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20293ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 20294ms
Starting structural reductions in LTL mode, iteration 1 : 150/195 places, 197/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20417 ms. Remains : 150/195 places, 197/243 transitions.
[2025-06-06 22:42:14] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:42:14] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:42:14] [INFO ] Input system was already deterministic with 197 transitions.
[2025-06-06 22:42:14] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:42:14] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:42:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14461289584345773204.gal : 1 ms
[2025-06-06 22:42:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12038678449094938624.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/CTLCardinality14461289584345773204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12038678449094938624.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.35814e+11,0.163564,11524,2,2121,5,32920,6,0,792,35211,0


Converting to forward existential form...Done !
original formula: (AX(((p212!=0)&&(p225!=1))) + AX(EG(AG(AF(((p381==0)||(p106==1)))))))
=> equivalent forward existential formula: [(EY((Init * !(!(EX(!(((p212!=0)&&(p225!=1)))))))) * !(EG(!(E(TRUE U !(!(EG(!(((p381==0)||(p106==1)))))))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t92, t95, t112, t115, t135, t138, t150, t169, t172, t175, t177, t181,...256
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.2964,420976,1,0,1024,2.44987e+06,430,632,4880,3.14215e+06,1154
FORMULA SmartHome-PT-13-CTLCardinality-2025-10 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 : 195/195 places, 243/243 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 243
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 170 transition count 219
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 170 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 170 transition count 218
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 60 place count 160 transition count 208
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 160 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 160 transition count 207
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 78 place count 153 transition count 200
Iterating global reduction 3 with 7 rules applied. Total rules applied 85 place count 153 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 150 transition count 197
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 150 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 149 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 149 transition count 196
Applied a total of 93 rules in 6 ms. Remains 149 /195 variables (removed 46) and now considering 196/243 (removed 47) transitions.
// Phase 1: matrix 196 rows 149 cols
[2025-06-06 22:42:26] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:26] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 22:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:26] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-06 22:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 152 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 195/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:42:37] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 348 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19786ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19787ms
Starting structural reductions in LTL mode, iteration 1 : 149/195 places, 196/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19927 ms. Remains : 149/195 places, 196/243 transitions.
[2025-06-06 22:42:46] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:42:46] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:42:46] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-06 22:42:46] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:42:46] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:42:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality7340956371128640437.gal : 1 ms
[2025-06-06 22:42:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6781842824504334731.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/CTLCardinality7340956371128640437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6781842824504334731.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09574e+11,0.224654,13944,2,2808,5,46743,6,0,787,51540,0


Converting to forward existential form...Done !
original formula: AX(((p56==0) * ((p65==0) + AX((p303==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !((p56==0)))] = FALSE * [(EY((EY(Init) * !((p65==0)))) * !((p303==1)))] = FALSE)
(forward)formula 0,1,0.238134,14200,1,0,13,46743,13,5,970,51540,4
FORMULA SmartHome-PT-13-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 243/243 transitions.
Graph (trivial) has 191 edges and 195 vertex of which 90 / 195 are part of one of the 7 SCC in 1 ms
Free SCC test removed 83 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Graph (complete) has 190 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 110 transition count 95
Reduce places removed 42 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 49 rules applied. Total rules applied 93 place count 68 transition count 88
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 97 place count 65 transition count 87
Reduce places removed 1 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 3 rules applied. Total rules applied 100 place count 64 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 63 transition count 85
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 101 place count 63 transition count 81
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 109 place count 59 transition count 81
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 118 place count 50 transition count 72
Iterating global reduction 5 with 9 rules applied. Total rules applied 127 place count 50 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 128 place count 50 transition count 71
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 168 place count 30 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 170 place count 30 transition count 49
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 29 transition count 48
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 29 transition count 48
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 7 with 4 rules applied. Total rules applied 176 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 188 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 190 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 190 place count 25 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 192 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 193 place count 23 transition count 32
Applied a total of 193 rules in 18 ms. Remains 23 /195 variables (removed 172) and now considering 32/243 (removed 211) transitions.
[2025-06-06 22:42:46] [INFO ] Flow matrix only has 26 transitions (discarded 6 similar events)
// Phase 1: matrix 26 rows 23 cols
[2025-06-06 22:42:46] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 22:42:46] [INFO ] Flow matrix only has 26 transitions (discarded 6 similar events)
[2025-06-06 22:42:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:42:46] [INFO ] Redundant transitions in 24 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 22:42:46] [INFO ] Flow matrix only has 26 transitions (discarded 6 similar events)
[2025-06-06 22:42:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/46 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/49 variables, and 23 constraints, problems are : Problem set: 0 solved, 14 unsolved in 167 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/46 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/49 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 344ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/195 places, 32/243 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 441 ms. Remains : 23/195 places, 32/243 transitions.
[2025-06-06 22:42:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:42:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:42:47] [INFO ] Input system was already deterministic with 32 transitions.
[2025-06-06 22:42:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:42:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:42:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18396735337142033163.gal : 1 ms
[2025-06-06 22:42:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality8766023108339593685.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/CTLCardinality18396735337142033163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8766023108339593685.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,39744,0.007569,3916,2,70,5,366,6,0,108,339,0


Converting to forward existential form...Done !
original formula: EF((EF((p89==0)) * AG(((p260==0)||(p212==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(TRUE U (p89==0))) * !(E(TRUE U !(((p260==0)||(p212==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t16, t23, t26, t27, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,0.019341,4556,1,0,64,4031,80,32,613,3535,75
FORMULA SmartHome-PT-13-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-06 22:42:47] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:42:47] [INFO ] Flatten gal took : 5 ms
Total runtime 229438 ms.

BK_STOP 1749249767401

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-13"
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-13, 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-174901995000785"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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