Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 120K 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-16-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-16-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-16-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-16-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-16-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749250666800

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 22:57:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 22:57:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:57:48] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2025-06-06 22:57:48] [INFO ] Transformed 499 places.
[2025-06-06 22:57:48] [INFO ] Transformed 533 transitions.
[2025-06-06 22:57:48] [INFO ] Found NUPN structural information;
[2025-06-06 22:57:48] [INFO ] Parsed PT model containing 499 places and 533 transitions and 1222 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 156 places in 6 ms
Reduce places removed 156 places and 129 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-16-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 404/404 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 330 transition count 404
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 85 place count 258 transition count 332
Iterating global reduction 1 with 72 rules applied. Total rules applied 157 place count 258 transition count 332
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 164 place count 258 transition count 325
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 174 place count 248 transition count 315
Iterating global reduction 2 with 10 rules applied. Total rules applied 184 place count 248 transition count 315
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 241 transition count 308
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 241 transition count 308
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 200 place count 239 transition count 306
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 239 transition count 306
Applied a total of 202 rules in 77 ms. Remains 239 /343 variables (removed 104) and now considering 306/404 (removed 98) transitions.
// Phase 1: matrix 306 rows 239 cols
[2025-06-06 22:57:48] [INFO ] Computed 3 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:48] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-06 22:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:48] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-06 22:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/545 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 242 constraints, problems are : Problem set: 0 solved, 305 unsolved in 18777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/545 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 305/547 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:58:15] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 548 constraints, problems are : Problem set: 0 solved, 305 unsolved in 29308 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48156ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 48176ms
Starting structural reductions in LTL mode, iteration 1 : 239/343 places, 306/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48680 ms. Remains : 239/343 places, 306/404 transitions.
Support contains 67 out of 239 places after structural reductions.
[2025-06-06 22:58:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-06 22:58:37] [INFO ] Flatten gal took : 39 ms
[2025-06-06 22:58:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-16-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:58:37] [INFO ] Flatten gal took : 18 ms
[2025-06-06 22:58:37] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 52 out of 239 places (down from 67) after GAL structural reductions.
RANDOM walk for 40000 steps (169 resets) in 1380 ms. (28 steps per ms) remains 0/49 properties
[2025-06-06 22:58:37] [INFO ] Flatten gal took : 17 ms
[2025-06-06 22:58:37] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:58:37] [INFO ] Input system was already deterministic with 306 transitions.
Computed a total of 59 stabilizing places and 58 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Graph (trivial) has 249 edges and 239 vertex of which 129 / 239 are part of one of the 10 SCC in 2 ms
Free SCC test removed 119 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 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 50 place count 119 transition count 100
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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 107 place count 70 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 67 transition count 92
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 110 place count 67 transition count 88
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 63 transition count 88
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 53 transition count 78
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 53 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 53 transition count 77
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 187 place count 29 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 188 place count 29 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 28 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 27 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 205 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 207 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 207 place count 25 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 209 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 211 place count 22 transition count 28
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 21 transition count 27
Applied a total of 214 rules in 29 ms. Remains 21 /239 variables (removed 218) and now considering 27/306 (removed 279) transitions.
[2025-06-06 22:58:37] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2025-06-06 22:58:37] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:58:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-06 22:58:37] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:58:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-06 22:58:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:58:37] [INFO ] Redundant transitions in 21 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 22:58:37] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:58:37] [INFO ] Invariant cache hit.
[2025-06-06 22:58:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/42 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 119 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/42 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 198 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 323ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/239 places, 27/306 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 447 ms. Remains : 21/239 places, 27/306 transitions.
[2025-06-06 22:58:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:58:38] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:58:38] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-16-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 22:58:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:58:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:58:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3694153306806667426.gal : 1 ms
[2025-06-06 22:58:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11466309407216071658.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3694153306806667426.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11466309407216071658.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 217 transition count 284
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 217 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 217 transition count 282
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 206 transition count 271
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 206 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 77 place count 197 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 86 place count 197 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 191 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 191 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 190 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 190 transition count 255
Applied a total of 100 rules in 31 ms. Remains 190 /239 variables (removed 49) and now considering 255/306 (removed 51) transitions.
// Phase 1: matrix 255 rows 190 cols
[2025-06-06 22:58:38] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:58:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 22:58:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:58:38] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2025-06-06 22:58:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/445 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/445 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 193 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/445 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 254/447 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:58:56] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 448 constraints, problems are : Problem set: 0 solved, 254 unsolved in 20332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32686ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 32687ms
Starting structural reductions in LTL mode, iteration 1 : 190/239 places, 255/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32868 ms. Remains : 190/239 places, 255/306 transitions.
[2025-06-06 22:59:11] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:59:11] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:59:11] [INFO ] Input system was already deterministic with 255 transitions.
[2025-06-06 22:59:11] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:59:11] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:59:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10065202360093195901.gal : 3 ms
[2025-06-06 22:59:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4679572550409668447.ctl : 6 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/CTLFireability10065202360093195901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4679572550409668447.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,7.10728e+14,0.400806,19948,2,3347,5,75630,6,0,1007,78089,0


Converting to forward existential form...Done !
original formula: EG((AG((EX((p269!=1)) * ((p286==0)||(p316==0)))) * !(E((p122==1) U (p401==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((EX((p269!=1)) * ((p286==0)||(p316==0)))))) * !(E((p122==1) U (p401==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t62, t65, t98, t101, t118, t121, t138, t141, t153, t156, t173, t190, t...290
(forward)formula 0,0,11.2539,371996,1,0,448,2.48071e+06,543,289,5872,1.88847e+06,684
FORMULA SmartHome-PT-16-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 215 transition count 282
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 215 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 215 transition count 280
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 203 transition count 268
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 203 transition count 268
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 84 place count 193 transition count 258
Iterating global reduction 1 with 10 rules applied. Total rules applied 94 place count 193 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 193 transition count 256
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 102 place count 187 transition count 250
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 187 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 186 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 186 transition count 249
Applied a total of 110 rules in 27 ms. Remains 186 /239 variables (removed 53) and now considering 249/306 (removed 57) transitions.
// Phase 1: matrix 249 rows 186 cols
[2025-06-06 22:59:22] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:59:22] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 22:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:59:22] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-06 22:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/435 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/435 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 189 constraints, problems are : Problem set: 0 solved, 248 unsolved in 11903 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/435 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 248/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:59:39] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/435 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 0 solved, 248 unsolved in 18354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30275ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 30276ms
Starting structural reductions in LTL mode, iteration 1 : 186/239 places, 249/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30493 ms. Remains : 186/239 places, 249/306 transitions.
[2025-06-06 22:59:53] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:59:53] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:59:53] [INFO ] Input system was already deterministic with 249 transitions.
[2025-06-06 22:59:53] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:59:53] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:59:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16319575747751692892.gal : 4 ms
[2025-06-06 22:59:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12965462331719509400.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/CTLFireability16319575747751692892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12965462331719509400.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,4.25882e+14,0.314287,17300,2,3056,5,60948,6,0,985,61257,0


Converting to forward existential form...Done !
original formula: EF(AG(EX((EF((p57==0)) * ((p273==0)||(p143==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX((E(TRUE U (p57==0)) * ((p273==0)||(p143==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t168, t183, t203, t218,...280
(forward)formula 0,0,7.33279,235888,1,0,366,1.51671e+06,520,249,5594,1.12572e+06,598
FORMULA SmartHome-PT-16-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 213 transition count 280
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 213 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 213 transition count 278
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 200 transition count 265
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 200 transition count 265
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 190 transition count 255
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 190 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 190 transition count 253
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 184 transition count 247
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 184 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 183 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 183 transition count 246
Applied a total of 116 rules in 24 ms. Remains 183 /239 variables (removed 56) and now considering 246/306 (removed 60) transitions.
// Phase 1: matrix 246 rows 183 cols
[2025-06-06 23:00:00] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 23:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:00] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-06 23:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 186 constraints, problems are : Problem set: 0 solved, 245 unsolved in 11562 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 245/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:00:16] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 432 constraints, problems are : Problem set: 0 solved, 245 unsolved in 17762 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29340ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 29341ms
Starting structural reductions in LTL mode, iteration 1 : 183/239 places, 246/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29509 ms. Remains : 183/239 places, 246/306 transitions.
[2025-06-06 23:00:30] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:00:30] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:00:30] [INFO ] Input system was already deterministic with 246 transitions.
[2025-06-06 23:00:30] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:00:30] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:00:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5101297743000886643.gal : 2 ms
[2025-06-06 23:00:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3801837963442142467.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/CTLFireability5101297743000886643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3801837963442142467.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.44653e+14,0.319583,17792,2,3078,5,63243,6,0,970,66795,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + EF(AG((p490==0))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U !(E(TRUE U !((p490==0)))))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t215,...280
(forward)formula 0,1,3.15467,100052,1,0,308,512103,514,219,5360,453382,525
FORMULA SmartHome-PT-16-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Graph (trivial) has 250 edges and 239 vertex of which 129 / 239 are part of one of the 10 SCC in 3 ms
Free SCC test removed 119 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 119 transition count 99
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 58 rules applied. Total rules applied 109 place count 69 transition count 91
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 113 place count 66 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 65 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 114 place count 65 transition count 87
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 120 place count 62 transition count 87
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 130 place count 52 transition count 77
Iterating global reduction 4 with 10 rules applied. Total rules applied 140 place count 52 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 52 transition count 76
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 187 place count 29 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 188 place count 29 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 190 place count 28 transition count 50
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 27 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 205 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 207 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 207 place count 25 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 209 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 211 place count 22 transition count 28
Iterating global reduction 7 with 2 rules applied. Total rules applied 213 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 214 place count 21 transition count 27
Applied a total of 214 rules in 26 ms. Remains 21 /239 variables (removed 218) and now considering 27/306 (removed 279) transitions.
[2025-06-06 23:00:33] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2025-06-06 23:00:33] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:33] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 23:00:33] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 23:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-06 23:00:33] [INFO ] Implicit Places using invariants and state equation in 28 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 23:00:33] [INFO ] Redundant transitions in 19 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 23:00:33] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 23:00:33] [INFO ] Invariant cache hit.
[2025-06-06 23:00:33] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 2/39 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 31 constraints, problems are : Problem set: 0 solved, 23 unsolved in 171 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 2/39 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1/41 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/41 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/41 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 55 constraints, problems are : Problem set: 0 solved, 23 unsolved in 422 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 597ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/239 places, 27/306 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 705 ms. Remains : 21/239 places, 27/306 transitions.
[2025-06-06 23:00:34] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:00:34] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:00:34] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 23:00:34] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:00:34] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:00:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10668772312164036633.gal : 0 ms
[2025-06-06 23:00:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1374519666469109231.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/CTLFireability10668772312164036633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1374519666469109231.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,22404,0.013774,3892,2,80,5,416,6,0,97,383,0


Converting to forward existential form...Done !
original formula: EF(AG((p309==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p309==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t8, t10, t12, t15, t17, t19, t20, Intersection with reachable at each step enabl...206
(forward)formula 0,0,0.021262,4276,1,0,67,3236,69,31,583,2711,60
FORMULA SmartHome-PT-16-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 221 transition count 288
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 221 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 221 transition count 286
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 213 transition count 278
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 213 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 207 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 207 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 207 transition count 271
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 202 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 202 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 201 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 201 transition count 265
Applied a total of 79 rules in 16 ms. Remains 201 /239 variables (removed 38) and now considering 265/306 (removed 41) transitions.
// Phase 1: matrix 265 rows 201 cols
[2025-06-06 23:00:34] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:34] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-06 23:00:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:00:34] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-06 23:00:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/466 variables, 201/204 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 204 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/466 variables, 201/204 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 264/468 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:00:53] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/466 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 469 constraints, problems are : Problem set: 0 solved, 264 unsolved in 22644 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36244ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 36244ms
Starting structural reductions in LTL mode, iteration 1 : 201/239 places, 265/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36413 ms. Remains : 201/239 places, 265/306 transitions.
[2025-06-06 23:01:10] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:01:10] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:01:10] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-06 23:01:10] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:01:10] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:01:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3579152172717145097.gal : 1 ms
[2025-06-06 23:01:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16620307988917129621.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/CTLFireability3579152172717145097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16620307988917129621.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,8.29996e+14,0.804095,33184,2,7167,5,135218,6,0,1061,135463,0


Converting to forward existential form...Done !
original formula: ((EF(EX(E(((p2==1)&&(p226==1)) U ((p257==1)&&(p494==1))))) * AX(((p352==0)||(p436==0)))) * (!(E(EG((((p275==1)||(p347==1)) + EF((p390==1)...375
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(E(((p2==1)&&(p226==1)) U ((p257==1)&&(p494==1)))))))] = FALSE * [(EY(Init) * !(((p352==...909
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t13, t30, t33, t37, t70, t102, t109, t129, t132, t149, t152, t164, t167, t184, t199, ...297
Detected timeout of ITS tools.
[2025-06-06 23:01:40] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:01:40] [INFO ] Applying decomposition
[2025-06-06 23:01:40] [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/graph10705645088203641714.txt' '-o' '/tmp/graph10705645088203641714.bin' '-w' '/tmp/graph10705645088203641714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10705645088203641714.bin' '-l' '-1' '-v' '-w' '/tmp/graph10705645088203641714.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:01:40] [INFO ] Decomposing Gal with order
[2025-06-06 23:01:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:01:40] [INFO ] Removed a total of 54 redundant transitions.
[2025-06-06 23:01:40] [INFO ] Flatten gal took : 48 ms
[2025-06-06 23:01:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-06 23:01:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12141159382735763642.gal : 4 ms
[2025-06-06 23:01:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8614049151299184919.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/CTLFireability12141159382735763642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8614049151299184919.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.29996e+14,0.080421,7020,502,41,5811,620,488,8408,63,1786,0


Converting to forward existential form...Done !
original formula: ((EF(EX(E(((i0.u2.p2==1)&&(i6.u32.p226==1)) U ((i7.i0.u42.p257==1)&&(i10.i2.u74.p494==1))))) * AX(((i10.i0.u64.p352==0)||(i0.u0.p436==0))...583
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(E(((i0.u2.p2==1)&&(i6.u32.p226==1)) U ((i7.i0.u42.p257==1)&&(i10.i2.u74.p494==1)))))))]...1261
Reverse transition relation is NOT exact ! Due to transitions t33, t109, t132, t152, t167, t202, i0.u2.t237, i0.u71.t8, i0.u71.t9, i1.u20.t199, i2.u10.t234...437
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 213 transition count 280
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 213 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 213 transition count 278
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 200 transition count 265
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 200 transition count 265
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 190 transition count 255
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 190 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 190 transition count 253
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 184 transition count 247
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 184 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 183 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 183 transition count 246
Applied a total of 116 rules in 11 ms. Remains 183 /239 variables (removed 56) and now considering 246/306 (removed 60) transitions.
// Phase 1: matrix 246 rows 183 cols
[2025-06-06 23:02:10] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:10] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-06 23:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:11] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-06 23:02: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/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 186 constraints, problems are : Problem set: 0 solved, 245 unsolved in 11456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 245/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:02:27] [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/429 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 432 constraints, problems are : Problem set: 0 solved, 245 unsolved in 17561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29050ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 29050ms
Starting structural reductions in LTL mode, iteration 1 : 183/239 places, 246/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29340 ms. Remains : 183/239 places, 246/306 transitions.
[2025-06-06 23:02:40] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:02:40] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:02:40] [INFO ] Input system was already deterministic with 246 transitions.
[2025-06-06 23:02:40] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:02:40] [INFO ] Flatten gal took : 18 ms
[2025-06-06 23:02:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13135810729560994842.gal : 2 ms
[2025-06-06 23:02:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11376701218089517489.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/CTLFireability13135810729560994842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11376701218089517489.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,3.44653e+14,0.362843,17788,2,3078,5,63243,6,0,970,66795,0


Converting to forward existential form...Done !
original formula: EX(EG(AX(EG((p288==0)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(!(EG((p288==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t215,...280
Detected timeout of ITS tools.
[2025-06-06 23:03:10] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:03:10] [INFO ] Applying decomposition
[2025-06-06 23:03:10] [INFO ] Flatten gal took : 4 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/graph18109673132309543069.txt' '-o' '/tmp/graph18109673132309543069.bin' '-w' '/tmp/graph18109673132309543069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18109673132309543069.bin' '-l' '-1' '-v' '-w' '/tmp/graph18109673132309543069.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:03:10] [INFO ] Decomposing Gal with order
[2025-06-06 23:03:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:03:10] [INFO ] Removed a total of 61 redundant transitions.
[2025-06-06 23:03:10] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:03:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-06 23:03:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6980520060692375619.gal : 2 ms
[2025-06-06 23:03:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4844082157242538435.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/CTLFireability6980520060692375619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4844082157242538435.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 -...262
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.44653e+14,0.108805,7128,319,48,5989,764,441,10591,61,2187,0


Converting to forward existential form...Done !
original formula: EX(EG(AX(EG((i9.i0.u43.p288==0)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(!(EG((i9.i0.u43.p288==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i0.u66.t8, i1.i0.u1.t218, i2.u6.t215, i3.u9.t201, i4.u13.t18...393
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,19.4127,327768,1,0,567938,1424,2808,992063,326,8133,497354
FORMULA SmartHome-PT-16-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 214 transition count 281
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 214 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 214 transition count 280
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 201 transition count 267
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 201 transition count 267
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 192 transition count 258
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 192 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 192 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 187 transition count 251
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 187 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 186 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 186 transition count 250
Applied a total of 109 rules in 11 ms. Remains 186 /239 variables (removed 53) and now considering 250/306 (removed 56) transitions.
// Phase 1: matrix 250 rows 186 cols
[2025-06-06 23:03:30] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 23:03:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:30] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-06 23:03:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/436 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 189 constraints, problems are : Problem set: 0 solved, 249 unsolved in 11583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/436 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 249/438 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:03:46] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:03:46] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 440 constraints, problems are : Problem set: 0 solved, 249 unsolved in 18513 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 30135ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 30137ms
Starting structural reductions in LTL mode, iteration 1 : 186/239 places, 250/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30290 ms. Remains : 186/239 places, 250/306 transitions.
[2025-06-06 23:04:00] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:04:00] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:04:00] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-06 23:04:00] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:04:00] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8972115713696345113.gal : 2 ms
[2025-06-06 23:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10402011146827112622.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/CTLFireability8972115713696345113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10402011146827112622.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,5.39615e+14,0.449669,20304,2,3423,5,75304,6,0,986,78878,0


Converting to forward existential form...Done !
original formula: AG(((AF((p27==0)) + (p156==0)) + (AX(!(A((p63==1) U ((p164==1)&&(p389==1))))) + EG(((p260==1)||(p128==1))))))
=> equivalent forward existential formula: [((EY(((FwdU(Init,TRUE) * !((!(EG(!((p27==0)))) + (p156==0)))) * !(EG(((p260==1)||(p128==1)))))) * !(EG(!(((p164...263
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t96, t113, t116, t133, t136, t148, t151, t168, t183, t203, t217,...286
Detected timeout of ITS tools.
[2025-06-06 23:04:30] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:04:30] [INFO ] Applying decomposition
[2025-06-06 23:04:30] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17051488444928998004.txt' '-o' '/tmp/graph17051488444928998004.bin' '-w' '/tmp/graph17051488444928998004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17051488444928998004.bin' '-l' '-1' '-v' '-w' '/tmp/graph17051488444928998004.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:04:30] [INFO ] Decomposing Gal with order
[2025-06-06 23:04:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:04:30] [INFO ] Removed a total of 62 redundant transitions.
[2025-06-06 23:04:30] [INFO ] Flatten gal took : 23 ms
[2025-06-06 23:04:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-06 23:04:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11193117054920522055.gal : 15 ms
[2025-06-06 23:04:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14375599183942212522.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/CTLFireability11193117054920522055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14375599183942212522.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,5.39615e+14,0.09317,7584,350,40,7055,684,451,11851,63,2090,0


Converting to forward existential form...Done !
original formula: AG(((AF((i7.u2.p27==0)) + (i4.u22.p156==0)) + (AX(!(A((i1.u8.p63==1) U ((i4.u19.p164==1)&&(i7.i0.u68.p389==1))))) + EG(((i8.u40.p260==1)|...177
=> equivalent forward existential formula: [((EY(((FwdU(Init,TRUE) * !((!(EG(!((i7.u2.p27==0)))) + (i4.u22.p156==0)))) * !(EG(((i8.u40.p260==1)||(i3.u18.p1...347
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t116, t136, t151, i1.u9.t217, i2.u10.t203, i3.u18.t183, i4.u19.t168, i5.t226, i5.u2...413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,0.369933,21024,1,0,33222,684,2953,65349,321,2090,63228
FORMULA SmartHome-PT-16-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 214 transition count 281
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 214 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 214 transition count 279
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 202 transition count 267
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 202 transition count 267
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 85 place count 193 transition count 258
Iterating global reduction 1 with 9 rules applied. Total rules applied 94 place count 193 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 193 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 188 transition count 251
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 188 transition count 251
Applied a total of 106 rules in 20 ms. Remains 188 /239 variables (removed 51) and now considering 251/306 (removed 55) transitions.
// Phase 1: matrix 251 rows 188 cols
[2025-06-06 23:04:30] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 23:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:31] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2025-06-06 23:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/439 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 191 constraints, problems are : Problem set: 0 solved, 250 unsolved in 11831 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/439 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 250/441 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:04:47] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 0/439 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 442 constraints, problems are : Problem set: 0 solved, 250 unsolved in 18310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30155ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 30155ms
Starting structural reductions in LTL mode, iteration 1 : 188/239 places, 251/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30343 ms. Remains : 188/239 places, 251/306 transitions.
[2025-06-06 23:05:01] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:05:01] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:05:01] [INFO ] Input system was already deterministic with 251 transitions.
[2025-06-06 23:05:01] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:05:01] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:05:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2465539137562600450.gal : 2 ms
[2025-06-06 23:05:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8038676134905793688.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/CTLFireability2465539137562600450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8038676134905793688.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,4.13584e+14,0.458834,20132,2,3606,5,75363,6,0,995,76972,0


Converting to forward existential form...Done !
original formula: E((EG(!(AF((p352==1)))) * !((AG(A((p333==1) U (p158==1))) + EX((p280==1))))) U !(EG(EF((p187!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,(EG(!(!(EG(!((p352==1)))))) * !((!(E(TRUE U !(!((E(!((p158==1)) U (!((p333==1)) * !((p158==1)))) + E...235
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t96, t99, t116, t119, t136, t139, t151, t154, t171, t186, t206, t220,...280
(forward)formula 0,0,8.67372,291768,1,0,393,1.86675e+06,526,263,5803,1.42963e+06,634
FORMULA SmartHome-PT-16-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 213 transition count 280
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 213 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 213 transition count 278
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 200 transition count 265
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 200 transition count 265
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 190 transition count 255
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 190 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 190 transition count 253
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 184 transition count 247
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 184 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 183 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 183 transition count 246
Applied a total of 116 rules in 20 ms. Remains 183 /239 variables (removed 56) and now considering 246/306 (removed 60) transitions.
// Phase 1: matrix 246 rows 183 cols
[2025-06-06 23:05:10] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:10] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-06 23:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:10] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-06 23:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 186 constraints, problems are : Problem set: 0 solved, 245 unsolved in 11596 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 245/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:05:26] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 432 constraints, problems are : Problem set: 0 solved, 245 unsolved in 17705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29326ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 29327ms
Starting structural reductions in LTL mode, iteration 1 : 183/239 places, 246/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29542 ms. Remains : 183/239 places, 246/306 transitions.
[2025-06-06 23:05:39] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:05:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:05:39] [INFO ] Input system was already deterministic with 246 transitions.
[2025-06-06 23:05:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:05:39] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:05:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5379236878918465167.gal : 1 ms
[2025-06-06 23:05:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1065485897853213674.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/CTLFireability5379236878918465167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1065485897853213674.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.44653e+14,0.319778,17916,2,3078,5,63243,6,0,970,66795,0


Converting to forward existential form...Done !
original formula: EX(AG((p128==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p128==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t215,...280
(forward)formula 0,0,3.44217,108412,1,0,308,580772,514,221,5529,501861,531
FORMULA SmartHome-PT-16-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 215 transition count 282
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 215 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 215 transition count 280
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 203 transition count 268
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 203 transition count 268
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 82 place count 195 transition count 260
Iterating global reduction 1 with 8 rules applied. Total rules applied 90 place count 195 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 195 transition count 258
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 192 transition count 255
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 192 transition count 255
Applied a total of 98 rules in 7 ms. Remains 192 /239 variables (removed 47) and now considering 255/306 (removed 51) transitions.
// Phase 1: matrix 255 rows 192 cols
[2025-06-06 23:05:43] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 23:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:43] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2025-06-06 23:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/447 variables, 192/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/447 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 195 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12317 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/447 variables, 192/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 254/449 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:06:00] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/447 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 450 constraints, problems are : Problem set: 0 solved, 254 unsolved in 18811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31153ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 31154ms
Starting structural reductions in LTL mode, iteration 1 : 192/239 places, 255/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31312 ms. Remains : 192/239 places, 255/306 transitions.
[2025-06-06 23:06:14] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:06:14] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:06:14] [INFO ] Input system was already deterministic with 255 transitions.
[2025-06-06 23:06:14] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:06:14] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:06:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14825098071631422793.gal : 1 ms
[2025-06-06 23:06:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17390669524783163461.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/CTLFireability14825098071631422793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17390669524783163461.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,4.21299e+14,0.337903,17076,2,3358,5,60721,6,0,1015,61595,0


Converting to forward existential form...Done !
original formula: (EX((p321==0)) + AX(AF(((EX(((p2==1)&&(p257==1))) + EX((p356==1))) * !(A((p227==1) U (p307==1)))))))
=> equivalent forward existential formula: [FwdG(EY((Init * !(EX((p321==0))))),!(((EX(((p2==1)&&(p257==1))) + EX((p356==1))) * !(!((E(!((p307==1)) U (!((p2...213
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t32, t61, t96, t99, t116, t123, t140, t143, t155, t158, t175, t190, t210, t224,...280
(forward)formula 0,1,20.3234,657880,1,0,860,4.04442e+06,544,499,5611,4.59093e+06,1094
FORMULA SmartHome-PT-16-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 215 transition count 282
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 215 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 215 transition count 280
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 202 transition count 267
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 202 transition count 267
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 86 place count 192 transition count 257
Iterating global reduction 1 with 10 rules applied. Total rules applied 96 place count 192 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 192 transition count 255
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 186 transition count 249
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 186 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 185 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 185 transition count 248
Applied a total of 112 rules in 9 ms. Remains 185 /239 variables (removed 54) and now considering 248/306 (removed 58) transitions.
// Phase 1: matrix 248 rows 185 cols
[2025-06-06 23:06:34] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:06:35] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-06 23:06:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:06:35] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-06 23:06:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 188 constraints, problems are : Problem set: 0 solved, 247 unsolved in 11515 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 247/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:06:51] [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/433 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/433 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 436 constraints, problems are : Problem set: 0 solved, 247 unsolved in 17932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29460ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 29463ms
Starting structural reductions in LTL mode, iteration 1 : 185/239 places, 248/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29698 ms. Remains : 185/239 places, 248/306 transitions.
[2025-06-06 23:07:04] [INFO ] Flatten gal took : 3 ms
[2025-06-06 23:07:04] [INFO ] Flatten gal took : 3 ms
[2025-06-06 23:07:04] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-06 23:07:04] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:07:04] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:07:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6797107675484323817.gal : 1 ms
[2025-06-06 23:07:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5471248454938500454.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/CTLFireability6797107675484323817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5471248454938500454.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.92138e+14,0.334282,17940,2,3147,5,63560,6,0,980,66738,0


Converting to forward existential form...Done !
original formula: !(A((AX(A((p250==1) U (p141==1))) + EX((EX(((p226==1)&&(p389==1))) + AG((p358==1))))) U AG(((p35!=1) + E((p366==1) U (p304==1))))))
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,!(!(E(TRUE U !(((p35!=1) + E((p366==1) U (p304==1)))))))) * !((!(EX(!(!((E(!((p141==1)) U (!...417
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t60, t92, t95, t112, t115, t132, t135, t147, t150, t168, t183, t203, t217,...280
(forward)formula 0,1,21.0691,695308,1,0,910,4.11668e+06,543,533,6067,4.91178e+06,1163
FORMULA SmartHome-PT-16-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 306/306 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 214 transition count 281
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 214 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 214 transition count 279
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 202 transition count 267
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 202 transition count 267
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 85 place count 193 transition count 258
Iterating global reduction 1 with 9 rules applied. Total rules applied 94 place count 193 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 193 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 188 transition count 251
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 188 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 187 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 187 transition count 250
Applied a total of 108 rules in 8 ms. Remains 187 /239 variables (removed 52) and now considering 250/306 (removed 56) transitions.
// Phase 1: matrix 250 rows 187 cols
[2025-06-06 23:07:25] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 23:07:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:07:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-06 23:07: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/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/437 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 190 constraints, problems are : Problem set: 0 solved, 249 unsolved in 11612 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/437 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 249/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:07:42] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 440 constraints, problems are : Problem set: 0 solved, 249 unsolved in 18657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30283ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 30283ms
Starting structural reductions in LTL mode, iteration 1 : 187/239 places, 250/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30459 ms. Remains : 187/239 places, 250/306 transitions.
[2025-06-06 23:07:56] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:07:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:07:56] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-06 23:07:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:07:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:07:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6564367484602494192.gal : 1 ms
[2025-06-06 23:07:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7002661882065409293.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/CTLFireability6564367484602494192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7002661882065409293.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.75515e+14,0.272587,14876,2,3001,5,51088,6,0,990,52047,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + AX((p227==0)))
=> equivalent forward existential formula: [(EY((Init * !(!(EX(!(FALSE)))))) * !((p227==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t118, t135, t138, t150, t153, t170, t185, t205, t219,...280
(forward)formula 0,1,2.2842,84748,1,0,300,388794,517,215,5463,373413,508
FORMULA SmartHome-PT-16-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-06 23:07:58] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:07:58] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:07:58] [INFO ] Applying decomposition
[2025-06-06 23:07:58] [INFO ] Flatten gal took : 4 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/graph8684053713283916105.txt' '-o' '/tmp/graph8684053713283916105.bin' '-w' '/tmp/graph8684053713283916105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8684053713283916105.bin' '-l' '-1' '-v' '-w' '/tmp/graph8684053713283916105.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:07:58] [INFO ] Decomposing Gal with order
[2025-06-06 23:07:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:07:58] [INFO ] Removed a total of 45 redundant transitions.
[2025-06-06 23:07:58] [INFO ] Flatten gal took : 23 ms
[2025-06-06 23:07:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-06-06 23:07:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14039692903634121542.gal : 1 ms
[2025-06-06 23:07:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5446994071559073798.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/CTLFireability14039692903634121542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5446994071559073798.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73393e+15,0.092192,7748,579,48,7074,767,523,11090,74,2079,0


Converting to forward existential form...Done !
original formula: ((EF(EX(E(((i3.u1.p2==1)&&(i7.u40.p226==1)) U ((i8.u44.p257==1)&&(i11.u88.p494==1))))) * AX(((i11.u64.p352==0)||(i5.u84.p436==0)))) * (!(...545
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(E(((i3.u1.p2==1)&&(i7.u40.p226==1)) U ((i8.u44.p257==1)&&(i11.u88.p494==1)))))))] = FAL...1198
Reverse transition relation is NOT exact ! Due to transitions t39, t127, t174, t193, t234, i0.u6.t272, i1.u11.t253, i2.u17.t231, i2.u18.t218, i3.u1.t275, i...488
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,51.633,712724,1,0,1.22274e+06,1086,4313,2.20866e+06,409,5549,869764
FORMULA SmartHome-PT-16-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 662462 ms.

BK_STOP 1749251330537

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-16"
export BK_EXAMINATION="CTLFireability"
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-16, examination is CTLFireability"
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-174901995100810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-16.tgz
mv SmartHome-PT-16 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;