Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K 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 102K 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-15-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-15-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-15-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-15-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-15-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749250162993

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 22:49:24] [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:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:49:24] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2025-06-06 22:49:24] [INFO ] Transformed 427 places.
[2025-06-06 22:49:24] [INFO ] Transformed 451 transitions.
[2025-06-06 22:49:24] [INFO ] Found NUPN structural information;
[2025-06-06 22:49:24] [INFO ] Parsed PT model containing 427 places and 451 transitions and 1038 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 134 places in 5 ms
Reduce places removed 134 places and 107 transitions.
FORMULA SmartHome-PT-15-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 282 transition count 344
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 64 place count 229 transition count 291
Iterating global reduction 1 with 53 rules applied. Total rules applied 117 place count 229 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 229 transition count 288
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 130 place count 219 transition count 278
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 219 transition count 278
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 148 place count 211 transition count 270
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 211 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 210 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 210 transition count 269
Applied a total of 158 rules in 74 ms. Remains 210 /293 variables (removed 83) and now considering 269/344 (removed 75) transitions.
// Phase 1: matrix 269 rows 210 cols
[2025-06-06 22:49:24] [INFO ] Computed 3 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:49:24] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-06 22:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:49:24] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-06 22:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/479 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 213 constraints, problems are : Problem set: 0 solved, 268 unsolved in 15035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/479 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 268/481 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:49:46] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:49:46] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 483 constraints, problems are : Problem set: 0 solved, 268 unsolved in 26697 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41810ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 41833ms
Starting structural reductions in LTL mode, iteration 1 : 210/293 places, 269/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42341 ms. Remains : 210/293 places, 269/344 transitions.
Support contains 81 out of 210 places after structural reductions.
[2025-06-06 22:50:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-06 22:50:06] [INFO ] Flatten gal took : 36 ms
[2025-06-06 22:50:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-15-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-CTLFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:50:07] [INFO ] Flatten gal took : 17 ms
[2025-06-06 22:50:07] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 62 out of 210 places (down from 81) after GAL structural reductions.
RANDOM walk for 40000 steps (190 resets) in 1493 ms. (26 steps per ms) remains 4/59 properties
BEST_FIRST walk for 40003 steps (30 resets) in 67 ms. (588 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (25 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
[2025-06-06 22:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/66 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/69 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/75 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 100/175 variables, 35/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/178 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 14 (OVERLAPS) 92/270 variables, 43/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 93/363 variables, 44/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/363 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 65/428 variables, 35/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 20 (OVERLAPS) 37/465 variables, 21/203 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/465 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 13/478 variables, 9/212 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/478 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/479 variables, 1/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/479 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/479 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 213 constraints, problems are : Problem set: 2 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/25 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/55 variables, 9/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 54/109 variables, 17/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/115 variables, 2/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 3/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/115 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 101/216 variables, 35/76 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 101/317 variables, 50/126 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/317 variables, 0/126 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/318 variables, 1/127 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/318 variables, 1/128 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/318 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 72/390 variables, 37/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/390 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 47/437 variables, 24/189 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/437 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 29/466 variables, 16/205 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/466 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 12/478 variables, 8/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/478 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/479 variables, 1/214 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/479 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/479 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 214 constraints, problems are : Problem set: 2 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 269/269 transitions.
Graph (trivial) has 215 edges and 210 vertex of which 110 / 210 are part of one of the 8 SCC in 1 ms
Free SCC test removed 102 places
Drop transitions (Empty/Sink Transition effects.) removed 146 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 108 transition count 86
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 138 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 46 rules applied. Total rules applied 82 place count 72 transition count 76
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 67 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 88 place count 67 transition count 71
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 96 place count 63 transition count 71
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 111 place count 48 transition count 56
Iterating global reduction 3 with 15 rules applied. Total rules applied 126 place count 48 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 130 place count 48 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 130 place count 48 transition count 49
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 136 place count 45 transition count 49
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 178 place count 24 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 39 edges and 24 vertex of which 13 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 4 with 14 rules applied. Total rules applied 192 place count 13 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 195 place count 13 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 12 transition count 7
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 202 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 204 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 204 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 206 place count 5 transition count 4
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 207 place count 4 transition count 3
Iterating global reduction 8 with 1 rules applied. Total rules applied 208 place count 4 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 209 place count 3 transition count 2
Applied a total of 209 rules in 20 ms. Remains 3 /210 variables (removed 207) and now considering 2/269 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 3/210 places, 2/269 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-15-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:50:08] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:50:08] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:50:08] [INFO ] Input system was already deterministic with 269 transitions.
Computed a total of 49 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 177 transition count 236
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 177 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 177 transition count 231
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 82 place count 166 transition count 220
Iterating global reduction 1 with 11 rules applied. Total rules applied 93 place count 166 transition count 220
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 159 transition count 213
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 159 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 157 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 157 transition count 209
Applied a total of 113 rules in 15 ms. Remains 157 /210 variables (removed 53) and now considering 209/269 (removed 60) transitions.
// Phase 1: matrix 209 rows 157 cols
[2025-06-06 22:50:08] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:50:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:50:08] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-06 22:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 160 constraints, problems are : Problem set: 0 solved, 208 unsolved in 8458 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 208/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:50:20] [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/366 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/366 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 369 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22119ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 22120ms
Starting structural reductions in LTL mode, iteration 1 : 157/210 places, 209/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22257 ms. Remains : 157/210 places, 209/269 transitions.
[2025-06-06 22:50:30] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:50:30] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:50:30] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-06 22:50:30] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:50:30] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:50:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14065601831356497494.gal : 4 ms
[2025-06-06 22:50:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16597171273405794343.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/CTLFireability14065601831356497494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16597171273405794343.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08052e+12,0.216224,13000,2,2558,5,43076,6,0,831,45888,0


Converting to forward existential form...Done !
original formula: AG(((AX(AX((p60==1))) + EG((p62==0))) + AG(((p191==0)||(p422==0)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((!(EX(!(!(EX(!((p60==1))))))) + EG((p62==0))))),TRUE) * !(((p191==0)||(p422==0))))] ...162
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t180, t183, t186,...268
(forward)formula 0,0,11.9916,409892,1,0,702,2.35391e+06,445,407,4890,2.94727e+06,895
FORMULA SmartHome-PT-15-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 184 transition count 243
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 184 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 184 transition count 240
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 175 transition count 231
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 175 transition count 231
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 169 transition count 225
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 169 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 169 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 167 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 167 transition count 222
Applied a total of 90 rules in 21 ms. Remains 167 /210 variables (removed 43) and now considering 222/269 (removed 47) transitions.
// Phase 1: matrix 222 rows 167 cols
[2025-06-06 22:50:42] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:50:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 22:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:50:42] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-06-06 22:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/389 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 170 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/389 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 221/391 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:50:56] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:50:56] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 393 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24967ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 24968ms
Starting structural reductions in LTL mode, iteration 1 : 167/210 places, 222/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25121 ms. Remains : 167/210 places, 222/269 transitions.
[2025-06-06 22:51:07] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:51:07] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:51:07] [INFO ] Input system was already deterministic with 222 transitions.
[2025-06-06 22:51:07] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:51:07] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:51:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1164545624583518902.gal : 2 ms
[2025-06-06 22:51:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12691547530139849634.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/CTLFireability1164545624583518902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12691547530139849634.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,4.23912e+12,0.371222,20436,2,4280,5,76556,6,0,884,81014,0


Converting to forward existential form...Done !
original formula: A(((AF(!((EF((p62==1)) * EF((p31==1))))) + EF((((p191==1)&&(p422==1))&&(p200==1)))) + ((p237==1)||(!(((p213==1)&&(p2==1))&&(p318==1))))) ...239
=> equivalent forward existential formula: [((Init * !(EG(!((E((!(EG((p321==1))) * E(TRUE U (p119==1))) U EG(!(E(TRUE U (p66==1))))) + E(TRUE U !(E(TRUE U ...610
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t12, t29, t32, t61, t66, t99, t102, t119, t122, t139, t143, t155, t158, t175, t179, t...290
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,26.1952,814416,1,0,882,5.28691e+06,486,587,5434,5.26683e+06,1051
FORMULA SmartHome-PT-15-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 181 transition count 240
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 181 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 181 transition count 237
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 172 transition count 228
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 172 transition count 228
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 85 place count 166 transition count 222
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 166 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 166 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 165 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 165 transition count 219
Applied a total of 95 rules in 21 ms. Remains 165 /210 variables (removed 45) and now considering 219/269 (removed 50) transitions.
// Phase 1: matrix 219 rows 165 cols
[2025-06-06 22:51:34] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:51:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:51:34] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-06 22:51: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/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/384 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 168 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9305 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/384 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 218/386 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:51:47] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:51:51] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 388 constraints, problems are : Problem set: 0 solved, 218 unsolved in 19171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 28489ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 28490ms
Starting structural reductions in LTL mode, iteration 1 : 165/210 places, 219/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28631 ms. Remains : 165/210 places, 219/269 transitions.
[2025-06-06 22:52:02] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:52:02] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:52:03] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-06 22:52:03] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:52:03] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:52:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4929330900897896860.gal : 1 ms
[2025-06-06 22:52:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5393251953853869007.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/CTLFireability4929330900897896860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5393251953853869007.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.77775e+12,0.305192,17280,2,3163,5,60443,6,0,873,66833,0


Converting to forward existential form...Done !
original formula: A(EG(((EG(EX((p126==1))) + (p185!=1)) + E((EF((p238==1)) * (p98!=1)) U (EF(((p129==1)&&(p417==1))) * (p58==1))))) U (!(AX((p27==1))) * ((...259
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EX(!((p27==1))))) * ((!((E(!(EG((p236==1))) U (!(E((p68==1) U !(E(TRUE U !((p186==1)))))) ...905
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t64, t92, t95, t112, t115, t132, t135, t138, t149, t152, t169, t1...289
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-06 22:52:33] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:52:33] [INFO ] Applying decomposition
[2025-06-06 22:52:33] [INFO ] Flatten gal took : 6 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/graph9326772231397871055.txt' '-o' '/tmp/graph9326772231397871055.bin' '-w' '/tmp/graph9326772231397871055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9326772231397871055.bin' '-l' '-1' '-v' '-w' '/tmp/graph9326772231397871055.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:52:33] [INFO ] Decomposing Gal with order
[2025-06-06 22:52:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:52:33] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-06 22:52:33] [INFO ] Flatten gal took : 40 ms
[2025-06-06 22:52:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2025-06-06 22:52:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7381578154806967445.gal : 3 ms
[2025-06-06 22:52:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8322305434323526757.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/CTLFireability7381578154806967445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8322305434323526757.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,4.77775e+12,0.101956,8840,394,40,9911,753,420,17414,63,2135,0


Converting to forward existential form...Done !
original formula: A(EG(((EG(EX((i4.i1.u20.p126==1))) + (i6.u31.p185!=1)) + E((EF((i8.i1.u32.p238==1)) * (i3.u15.p98!=1)) U (EF(((i4.i1.u17.p129==1)&&(i4.i1...374
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EX(!((i7.u1.p27==1))))) * ((!((E(!(EG((i8.i1.u32.p236==1))) U (!(E((i2.u8.p68==1) U !(E(TR...1190
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t95, t115, t135, t152, i0.t3, i0.u59.t8, i1.u5.t187, i3.u15.t169, i4.i1.t138, i4.i1...418
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 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
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 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 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 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 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
(forward)formula 0,1,4.46858,143496,1,0,238702,785,2783,511856,330,2864,240770
FORMULA SmartHome-PT-15-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 178 transition count 237
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 178 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 178 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 168 transition count 223
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 168 transition count 223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 162 transition count 217
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 162 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 162 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 160 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 160 transition count 214
Applied a total of 105 rules in 12 ms. Remains 160 /210 variables (removed 50) and now considering 214/269 (removed 55) transitions.
// Phase 1: matrix 214 rows 160 cols
[2025-06-06 22:52:37] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:52:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 22:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:52:37] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-06 22:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/374 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 163 constraints, problems are : Problem set: 0 solved, 213 unsolved in 8916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/374 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 213/376 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:52:50] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:52:50] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15290 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24218ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 24219ms
Starting structural reductions in LTL mode, iteration 1 : 160/210 places, 214/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24354 ms. Remains : 160/210 places, 214/269 transitions.
[2025-06-06 22:53:02] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:53:02] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:53:02] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-06 22:53:02] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:53:02] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:53:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12109696458439751032.gal : 1 ms
[2025-06-06 22:53:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8808844604738662657.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/CTLFireability12109696458439751032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8808844604738662657.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.37044e+12,0.264289,15372,2,2772,5,53365,6,0,848,56477,0


Converting to forward existential form...Done !
original formula: AX(((AX((p14==1)) + AX((p201==1))) + ((p120==0)||(p191==0))))
=> equivalent forward existential formula: [(EY(((EY(Init) * !(((p120==0)||(p191==0)))) * !(!(EX(!((p14==1))))))) * !((p201==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t94, t97, t114, t117, t134, t137, t149, t152, t169, t183, t186, ...279
(forward)formula 0,1,1.80391,67948,1,0,266,320047,449,184,4714,313541,438
FORMULA SmartHome-PT-15-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 178 transition count 237
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 178 transition count 237
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 178 transition count 232
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 80 place count 167 transition count 221
Iterating global reduction 1 with 11 rules applied. Total rules applied 91 place count 167 transition count 221
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 97 place count 161 transition count 215
Iterating global reduction 1 with 6 rules applied. Total rules applied 103 place count 161 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 161 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 159 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 159 transition count 212
Applied a total of 108 rules in 14 ms. Remains 159 /210 variables (removed 51) and now considering 212/269 (removed 57) transitions.
// Phase 1: matrix 212 rows 159 cols
[2025-06-06 22:53:04] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:53:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 22:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:53:04] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-06 22:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/371 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/371 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 162 constraints, problems are : Problem set: 0 solved, 211 unsolved in 8747 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/371 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 211/373 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:53:16] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 374 constraints, problems are : Problem set: 0 solved, 211 unsolved in 13983 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22743ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 22743ms
Starting structural reductions in LTL mode, iteration 1 : 159/210 places, 212/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22884 ms. Remains : 159/210 places, 212/269 transitions.
[2025-06-06 22:53:26] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:53:26] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:53:26] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-06 22:53:26] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:53:26] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:53:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2940276871530302821.gal : 1 ms
[2025-06-06 22:53:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14936390815421071793.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/CTLFireability2940276871530302821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14936390815421071793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22267e+12,0.242125,14060,2,2715,5,46930,6,0,842,50663,0


Converting to forward existential form...Done !
original formula: EF(EX(E(((p250==1)||(p88==1)) U (p409==1))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),((p250==1)||(p88==1))) * (p409==1))] != FALSE
Hit Full ! (commute/partial/dont) 208/0/4
(forward)formula 0,1,0.328502,14316,1,0,9,46930,15,1,1631,50663,5
FORMULA SmartHome-PT-15-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 179 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 179 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 179 transition count 233
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 168 transition count 222
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 168 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 161 transition count 215
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 161 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 161 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 159 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 159 transition count 211
Applied a total of 109 rules in 15 ms. Remains 159 /210 variables (removed 51) and now considering 211/269 (removed 58) transitions.
// Phase 1: matrix 211 rows 159 cols
[2025-06-06 22:53:27] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:53:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 22:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:53:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2025-06-06 22:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/370 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 0/370 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 162 constraints, problems are : Problem set: 0 solved, 210 unsolved in 8640 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/370 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 210/372 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:53:39] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 373 constraints, problems are : Problem set: 0 solved, 210 unsolved in 13942 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22594ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 22594ms
Starting structural reductions in LTL mode, iteration 1 : 159/210 places, 211/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22732 ms. Remains : 159/210 places, 211/269 transitions.
[2025-06-06 22:53:49] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:53:50] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:53:50] [INFO ] Input system was already deterministic with 211 transitions.
[2025-06-06 22:53:50] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:53:50] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:53:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1495491485686919088.gal : 1 ms
[2025-06-06 22:53:50] [INFO ] Time to serialize properties into /tmp/CTLFireability951297209658762160.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/CTLFireability1495491485686919088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability951297209658762160.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.30799e+12,0.219894,13788,2,2661,5,45574,6,0,841,48662,0


Converting to forward existential form...Done !
original formula: EX((EF((p98==1)) + ((p224==1) * !(E((p90==1) U (p137==1))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * (p98==1))] != FALSE + [((EY(Init) * (p224==1)) * !(E((p90==1) U (p137==1))))] != FALSE)
(forward)formula 0,1,0.357831,14428,1,0,9,47025,9,1,1623,50120,4
FORMULA SmartHome-PT-15-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 177 transition count 236
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 177 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 177 transition count 231
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 82 place count 166 transition count 220
Iterating global reduction 1 with 11 rules applied. Total rules applied 93 place count 166 transition count 220
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 159 transition count 213
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 159 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 157 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 157 transition count 209
Applied a total of 113 rules in 14 ms. Remains 157 /210 variables (removed 53) and now considering 209/269 (removed 60) transitions.
// Phase 1: matrix 209 rows 157 cols
[2025-06-06 22:53:50] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:53:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:53:50] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-06 22:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 160 constraints, problems are : Problem set: 0 solved, 208 unsolved in 8358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 208/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:54:02] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/366 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 369 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13487 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21859ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 21860ms
Starting structural reductions in LTL mode, iteration 1 : 157/210 places, 209/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21987 ms. Remains : 157/210 places, 209/269 transitions.
[2025-06-06 22:54:12] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:54:12] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:54:12] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-06 22:54:12] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:54:12] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:54:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11116336190636611181.gal : 1 ms
[2025-06-06 22:54:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3157651701657800978.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/CTLFireability11116336190636611181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3157651701657800978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08052e+12,0.215151,13256,2,2558,5,43076,6,0,831,45888,0


Converting to forward existential form...Done !
original formula: EX(AG(!(E(EG((p67==1)) U EF((p0==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(E(EG((p67==1)) U E(TRUE U (p0==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t180, t183, t186,...268
(forward)formula 0,1,1.78054,66804,1,0,287,321049,449,196,4867,318961,487
FORMULA SmartHome-PT-15-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 180 transition count 239
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 180 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 180 transition count 235
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 73 place count 171 transition count 226
Iterating global reduction 1 with 9 rules applied. Total rules applied 82 place count 171 transition count 226
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 166 transition count 221
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 166 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 166 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 165 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 165 transition count 218
Applied a total of 96 rules in 7 ms. Remains 165 /210 variables (removed 45) and now considering 218/269 (removed 51) transitions.
// Phase 1: matrix 218 rows 165 cols
[2025-06-06 22:54:14] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:54:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 22:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:54:14] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-06 22:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/383 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 168 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9246 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/383 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 217/385 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:54:27] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:54:31] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 28375ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 28376ms
Starting structural reductions in LTL mode, iteration 1 : 165/210 places, 218/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28510 ms. Remains : 165/210 places, 218/269 transitions.
[2025-06-06 22:54:42] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:54:42] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:54:42] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-06 22:54:42] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:54:42] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:54:42] [INFO ] Time to serialize gal into /tmp/CTLFireability603547513853518202.gal : 1 ms
[2025-06-06 22:54:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5030703791106897177.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/CTLFireability603547513853518202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5030703791106897177.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.97167e+12,0.269779,16088,2,3093,5,55931,6,0,872,58724,0


Converting to forward existential form...Done !
original formula: EG((((p178==0) * EF((p183==1))) * ((!(E(!(((p2==1)&&(p286==1))) U (p60==1))) + !(E((p82==1) U (p27==1)))) + AX((p264==0)))))
=> equivalent forward existential formula: [FwdG(Init,(((p178==0) * E(TRUE U (p183==1))) * ((!(E(!(((p2==1)&&(p286==1))) U (p60==1))) + !(E((p82==1) U (p27...197
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t32, t62, t94, t98, t118, t121, t138, t141, t153, t156, t173, t187, t190, t191,...274
Detected timeout of ITS tools.
[2025-06-06 22:55:12] [INFO ] Flatten gal took : 13 ms
[2025-06-06 22:55:12] [INFO ] Applying decomposition
[2025-06-06 22:55:12] [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/graph12533967097248217416.txt' '-o' '/tmp/graph12533967097248217416.bin' '-w' '/tmp/graph12533967097248217416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12533967097248217416.bin' '-l' '-1' '-v' '-w' '/tmp/graph12533967097248217416.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:55:12] [INFO ] Decomposing Gal with order
[2025-06-06 22:55:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:55:12] [INFO ] Removed a total of 55 redundant transitions.
[2025-06-06 22:55:12] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:55:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-06-06 22:55:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17908807469813436038.gal : 2 ms
[2025-06-06 22:55:12] [INFO ] Time to serialize properties into /tmp/CTLFireability235406665061432834.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/CTLFireability17908807469813436038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability235406665061432834.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.97167e+12,0.073952,7184,397,39,6353,504,466,9860,50,1704,0


Converting to forward existential form...Done !
original formula: EG((((i6.i1.u28.p178==0) * EF((i6.i1.u27.p183==1))) * ((!(E(!(((i0.u1.p2==1)&&(i8.i0.u54.p286==1))) U (i1.i1.u7.p60==1))) + !(E((i3.u13.p...210
=> equivalent forward existential formula: [FwdG(Init,(((i6.i1.u28.p178==0) * E(TRUE U (i6.i1.u27.p183==1))) * ((!(E(!(((i0.u1.p2==1)&&(i8.i0.u54.p286==1))...265
Reverse transition relation is NOT exact ! Due to transitions t10, t121, t141, t156, i0.u1.t190, i0.u1.t191, i1.i1.u8.t187, i2.u62.t8, i3.u10.t173, i4.t196...397
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
(forward)formula 0,1,14.3939,366096,1,0,760662,504,2967,969130,240,2267,602608
FORMULA SmartHome-PT-15-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 179 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 179 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 179 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 169 transition count 223
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 169 transition count 223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 163 transition count 217
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 163 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 163 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 161 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 161 transition count 214
Applied a total of 104 rules in 14 ms. Remains 161 /210 variables (removed 49) and now considering 214/269 (removed 55) transitions.
// Phase 1: matrix 214 rows 161 cols
[2025-06-06 22:55:27] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:55:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 22:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:55:27] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-06 22:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/375 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 164 constraints, problems are : Problem set: 0 solved, 213 unsolved in 8851 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/375 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 213/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:55:40] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/375 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22887ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 22888ms
Starting structural reductions in LTL mode, iteration 1 : 161/210 places, 214/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23031 ms. Remains : 161/210 places, 214/269 transitions.
[2025-06-06 22:55:50] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:55:50] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:55:50] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-06 22:55:50] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:55:50] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:55:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17613306088818431892.gal : 1 ms
[2025-06-06 22:55:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17808895494219973661.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/CTLFireability17613306088818431892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17808895494219973661.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.48793e+12,0.284908,16396,2,3208,5,57084,6,0,852,62432,0


Converting to forward existential form...Done !
original formula: EF((A(!(EX(((p248==1)&&(p324==1)))) U ((p318==1)&&(p340==1))) * (p142==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p142==1)) * !(EG(!(((p318==1)&&(p340==1)))))) * !(E(!(((p318==1)&&(p340==1))) U (!(!(EX((...221
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t64, t96, t99, t116, t119, t136, t139, t151, t154, t171, t185, t188, t...272
(forward)formula 0,1,22.9451,611740,1,0,880,3.50868e+06,453,506,4719,4.44305e+06,1104
FORMULA SmartHome-PT-15-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 180 transition count 239
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 180 transition count 239
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 180 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 171 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 171 transition count 225
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 164 transition count 218
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 164 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 164 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 162 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 162 transition count 214
Applied a total of 103 rules in 6 ms. Remains 162 /210 variables (removed 48) and now considering 214/269 (removed 55) transitions.
// Phase 1: matrix 214 rows 162 cols
[2025-06-06 22:56:13] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:56:13] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:56:13] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-06 22:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 165 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9062 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 213/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:56:26] [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/376 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 379 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23136ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 23137ms
Starting structural reductions in LTL mode, iteration 1 : 162/210 places, 214/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23263 ms. Remains : 162/210 places, 214/269 transitions.
[2025-06-06 22:56:36] [INFO ] Flatten gal took : 14 ms
[2025-06-06 22:56:36] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:56:36] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-06 22:56:36] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:56:36] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:56:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13162938094137734708.gal : 1 ms
[2025-06-06 22:56:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6102227407673038861.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/CTLFireability13162938094137734708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6102227407673038861.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.84893e+12,0.238026,13704,2,2599,5,45373,6,0,856,48723,0


Converting to forward existential form...Done !
original formula: AF(E((EX((p232==1)) + (p206==1)) U A((AG((p297==1)) + ((p159!=1)&&(p77!=1))) U EF((((p191==1)&&(p323==1))&&(p227==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((EX((p232==1)) + (p206==1)) U !((E(!(E(TRUE U (((p191==1)&&(p323==1))&&(p227==1)))) U (!((!(E(TRU...321
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t29, t32, t61, t93, t96, t113, t116, t118, t134, t137, t149, t152, t171, t185, t...278
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,11.9355,428768,1,0,764,2.57334e+06,469,529,5284,3.12959e+06,900
FORMULA SmartHome-PT-15-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 178 transition count 237
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 178 transition count 237
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 178 transition count 232
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 80 place count 167 transition count 221
Iterating global reduction 1 with 11 rules applied. Total rules applied 91 place count 167 transition count 221
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 98 place count 160 transition count 214
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 160 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 160 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 158 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 158 transition count 210
Applied a total of 111 rules in 14 ms. Remains 158 /210 variables (removed 52) and now considering 210/269 (removed 59) transitions.
// Phase 1: matrix 210 rows 158 cols
[2025-06-06 22:56:48] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:56:48] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 22:56:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:56:49] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-06-06 22:56:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 209 unsolved in 8538 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 209/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:57:00] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/368 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 371 constraints, problems are : Problem set: 0 solved, 209 unsolved in 12774 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21323ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 21324ms
Starting structural reductions in LTL mode, iteration 1 : 158/210 places, 210/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21477 ms. Remains : 158/210 places, 210/269 transitions.
[2025-06-06 22:57:10] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:57:10] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:57:10] [INFO ] Input system was already deterministic with 210 transitions.
[2025-06-06 22:57:10] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:57:10] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8227967645067082192.gal : 1 ms
[2025-06-06 22:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15147196104993763651.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/CTLFireability8227967645067082192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15147196104993763651.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.13718e+12,0.219605,13664,2,2704,5,44648,6,0,836,48453,0


Converting to forward existential form...Done !
original formula: (AG((p277!=1)) + EX(EF(EX(AX((p88==1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(E(TRUE U EX(!(EX(!((p88==1))))))))),TRUE) * !((p277!=1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t150, t167, t181, t184, t187,...268
(forward)formula 0,1,5.70579,201768,1,0,321,1.30042e+06,444,214,4760,984571,504
FORMULA SmartHome-PT-15-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 179 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 179 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 179 transition count 234
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 169 transition count 224
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 169 transition count 224
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 163 transition count 218
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 163 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 163 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 161 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 161 transition count 214
Applied a total of 104 rules in 12 ms. Remains 161 /210 variables (removed 49) and now considering 214/269 (removed 55) transitions.
// Phase 1: matrix 214 rows 161 cols
[2025-06-06 22:57:16] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:16] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 22:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:57:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-06 22:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/375 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 164 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/375 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 213/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:57:29] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/375 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23433ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 23434ms
Starting structural reductions in LTL mode, iteration 1 : 161/210 places, 214/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23580 ms. Remains : 161/210 places, 214/269 transitions.
[2025-06-06 22:57:39] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:57:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:57:39] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-06 22:57:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:57:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:57:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13114811502150506112.gal : 1 ms
[2025-06-06 22:57:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11237335121170938525.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/CTLFireability13114811502150506112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11237335121170938525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.42305e+12,0.222249,14100,2,2799,5,47337,6,0,852,49198,0


Converting to forward existential form...Done !
original formula: EG(E(EF((AG((p241==1)) + (p256==1))) U ((AX(AX((p300==1))) * !(((p186==1)&&(p58==1)))) * A(!(((p2==1)&&(p238==1))) U AF((p284==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (!(E(TRUE U !((p241==1)))) + (p256==1))) U ((!(EX(!(!(EX(!((p300==1))))))) * !(((p186==1)&...298
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t32, t60, t95, t98, t115, t118, t135, t138, t150, t153, t170, t184, t1...277
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.4887,428344,1,0,775,2.59471e+06,477,537,5273,2.97944e+06,1064
FORMULA SmartHome-PT-15-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-06 22:57:52] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:57:52] [INFO ] Flatten gal took : 4 ms
Total runtime 508193 ms.

BK_STOP 1749250672446

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-15"
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-15, 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-174901995100802"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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