Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K 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 101K 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-14-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-14-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-14-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-14-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-14-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749249850073

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 22:44:11] [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:44:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:44:11] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-06 22:44:11] [INFO ] Transformed 422 places.
[2025-06-06 22:44:11] [INFO ] Transformed 448 transitions.
[2025-06-06 22:44:11] [INFO ] Found NUPN structural information;
[2025-06-06 22:44:11] [INFO ] Parsed PT model containing 422 places and 448 transitions and 1026 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 104 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-14-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 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 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 74 place count 219 transition count 281
Iterating global reduction 1 with 63 rules applied. Total rules applied 137 place count 219 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 144 place count 219 transition count 274
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 157 place count 206 transition count 261
Iterating global reduction 2 with 13 rules applied. Total rules applied 170 place count 206 transition count 261
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 179 place count 197 transition count 252
Iterating global reduction 2 with 9 rules applied. Total rules applied 188 place count 197 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 197 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 196 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 196 transition count 249
Applied a total of 192 rules in 81 ms. Remains 196 /293 variables (removed 97) and now considering 249/344 (removed 95) transitions.
// Phase 1: matrix 249 rows 196 cols
[2025-06-06 22:44:11] [INFO ] Computed 3 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:44:11] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-06 22:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:44:11] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-06 22:44:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/445 variables, 196/199 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/445 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 199 constraints, problems are : Problem set: 0 solved, 248 unsolved in 13093 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/445 variables, 196/199 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 248/447 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:44:30] [INFO ] Deduced a trap along path composed of 5 places in 35 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 448 constraints, problems are : Problem set: 0 solved, 248 unsolved in 18888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32053ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 32069ms
Starting structural reductions in LTL mode, iteration 1 : 196/293 places, 249/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32571 ms. Remains : 196/293 places, 249/344 transitions.
Support contains 73 out of 196 places after structural reductions.
[2025-06-06 22:44:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-06 22:44:44] [INFO ] Flatten gal took : 55 ms
FORMULA SmartHome-PT-14-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:44:44] [INFO ] Flatten gal took : 26 ms
[2025-06-06 22:44:44] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 68 out of 196 places (down from 73) after GAL structural reductions.
RANDOM walk for 40000 steps (207 resets) in 1110 ms. (36 steps per ms) remains 2/54 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (30 resets) in 90 ms. (439 steps per ms) remains 1/2 properties
[2025-06-06 22:44:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/67 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/73 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 119/192 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/195 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 108/303 variables, 55/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/303 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/378 variables, 41/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/378 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 46/424 variables, 25/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 17/441 variables, 11/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/441 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/445 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/445 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/67 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/73 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 119/192 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/195 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/303 variables, 55/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 75/378 variables, 41/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 46/424 variables, 25/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/424 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 17/441 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/441 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/445 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/445 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/445 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 6 ms.
[2025-06-06 22:44:45] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:44:45] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:44:45] [INFO ] Input system was already deterministic with 249 transitions.
Computed a total of 48 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 175 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 175 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 169 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 169 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 166 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 166 transition count 218
Applied a total of 61 rules in 11 ms. Remains 166 /196 variables (removed 30) and now considering 218/249 (removed 31) transitions.
// Phase 1: matrix 218 rows 166 cols
[2025-06-06 22:44:45] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:44:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 22:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:44:45] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-06 22:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/384 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 169 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9696 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 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/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/384 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 217/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:44:58] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 387 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24119ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 24120ms
Starting structural reductions in LTL mode, iteration 1 : 166/196 places, 218/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24267 ms. Remains : 166/196 places, 218/249 transitions.
[2025-06-06 22:45:09] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:45:09] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:45:09] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-06 22:45:09] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:45:09] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:45:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13663081704934792576.gal : 4 ms
[2025-06-06 22:45:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5354724751121416533.ctl : 7 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/CTLFireability13663081704934792576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5354724751121416533.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.95593e+12,0.250874,14288,2,3100,5,49578,6,0,876,53111,0


Converting to forward existential form...Done !
original formula: EF(((AG(((p291==1) * EF((p270==1)))) * (p154==1)) * E(AX(E((p140==1) U (p84==1))) U (A((p247==1) U (p218==1)) + (p214==1)))))
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * (!(E(TRUE U !(((p291==1) * E(TRUE U (p270==1)))))) * (p154==1))),!(EX(!(E((p140==1) ...409
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t28, t31, t61, t98, t101, t118, t121, t139, t142, t154, t157, t175, t189, t192, t195...269
(forward)formula 0,0,17.347,566440,1,0,790,3.43105e+06,481,459,5131,3.97085e+06,1013
FORMULA SmartHome-PT-14-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 : 196/196 places, 249/249 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 229
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 176 transition count 228
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 170 transition count 222
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 170 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 167 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 167 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 165 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 165 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 164 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 164 transition count 216
Applied a total of 65 rules in 22 ms. Remains 164 /196 variables (removed 32) and now considering 216/249 (removed 33) transitions.
// Phase 1: matrix 216 rows 164 cols
[2025-06-06 22:45:27] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:45:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 22:45:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:45:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-06 22:45: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/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/380 variables, 164/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 167 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/380 variables, 164/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 215/382 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:45: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/380 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24604ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 24605ms
Starting structural reductions in LTL mode, iteration 1 : 164/196 places, 216/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24806 ms. Remains : 164/196 places, 216/249 transitions.
[2025-06-06 22:45:52] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:45:52] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:45:52] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-06 22:45:52] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:45:52] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:45:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2428298609113180889.gal : 2 ms
[2025-06-06 22:45:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8087341788005487483.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/CTLFireability2428298609113180889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8087341788005487483.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.9988e+12,0.267291,15724,2,3206,5,54040,6,0,866,59355,0


Converting to forward existential form...Done !
original formula: AG(E(EG(!(((p87==1)&&((p219==1)||(p280==1))))) U (A(EX((p304==1)) U EX((p53==1))) * (A(((p336==1)||(p311==1)) U !(((p2==1)&&(p98==1)))) +...169
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EG(!(((p87==1)&&((p219==1)||(p280==1))))) U (!((E(!(EX((p53==1))) U (!(EX((p304==1))) * ...349
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t29, t32, t35, t63, t95, t98, t115, t118, t135, t138, t150, t154, t172, t187, t1...277
Detected timeout of ITS tools.
[2025-06-06 22:46:22] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:46:22] [INFO ] Applying decomposition
[2025-06-06 22:46:22] [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/graph12139423955825519623.txt' '-o' '/tmp/graph12139423955825519623.bin' '-w' '/tmp/graph12139423955825519623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12139423955825519623.bin' '-l' '-1' '-v' '-w' '/tmp/graph12139423955825519623.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:46:22] [INFO ] Decomposing Gal with order
[2025-06-06 22:46:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:46:22] [INFO ] Removed a total of 46 redundant transitions.
[2025-06-06 22:46:22] [INFO ] Flatten gal took : 48 ms
[2025-06-06 22:46:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-06 22:46:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11341226492220867283.gal : 4 ms
[2025-06-06 22:46:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2815801986469739674.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/CTLFireability11341226492220867283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2815801986469739674.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.9988e+12,0.087532,7876,336,41,7559,744,400,13394,66,2003,0


Converting to forward existential form...Done !
original formula: AG(E(EG(!(((i2.u11.p87==1)&&((i6.u35.p219==1)||(i9.u47.p280==1))))) U (A(EX((i10.u51.p304==1)) U EX((i1.i0.u6.p53==1))) * (A(((i11.u57.p3...247
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EG(!(((i2.u11.p87==1)&&((i6.u35.p219==1)||(i9.u47.p280==1))))) U (!((E(!(EX((i1.i0.u6.p5...473
Reverse transition relation is NOT exact ! Due to transitions t11, t32, t98, t118, t138, i1.i1.u5.t187, i2.u10.t172, i2.u12.t154, i3.t195, i3.u18.t150, i3....395
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 1
Fast SCC detection found an SCC at level 2
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,0,1.15143,49604,1,0,85721,744,2498,187652,325,2137,107528
FORMULA SmartHome-PT-14-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 173 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 173 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 173 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 167 transition count 219
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 167 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 164 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 164 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 163 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 163 transition count 215
Applied a total of 67 rules in 14 ms. Remains 163 /196 variables (removed 33) and now considering 215/249 (removed 34) transitions.
// Phase 1: matrix 215 rows 163 cols
[2025-06-06 22:46:23] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:46:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 22:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:46:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-06 22:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/378 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 166 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9383 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/378 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 214/380 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:46:36] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 381 constraints, problems are : Problem set: 0 solved, 214 unsolved in 13865 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23292ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 23293ms
Starting structural reductions in LTL mode, iteration 1 : 163/196 places, 215/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23475 ms. Remains : 163/196 places, 215/249 transitions.
[2025-06-06 22:46:47] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:46:47] [INFO ] Flatten gal took : 20 ms
[2025-06-06 22:46:47] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-06 22:46:47] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:46:47] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:46:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12391497173293109673.gal : 1 ms
[2025-06-06 22:46:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17206992191557553536.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/CTLFireability12391497173293109673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17206992191557553536.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.49395e+12,0.209075,12828,2,2729,5,40780,6,0,861,42584,0


Converting to forward existential form...Done !
original formula: (AF(((p286==1)&&(p372==1))) + AG(A(EX(TRUE) U (((((p175==1)&&(p121==1))&&((p67==1)&&(p259==1))) * EX((p267==1))) + !(((p162==1)&&(p242==1...162
=> equivalent forward existential formula: (([(((FwdU(FwdU((Init * !(!(EG(!(((p286==1)&&(p372==1))))))),TRUE),!((((((p175==1)&&(p121==1))&&((p67==1)&&(p259...737
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t94, t97, t114, t120, t137, t140, t152, t155, t172, t186, t189, t192,...268
(forward)formula 0,0,11.3654,395844,1,0,786,2.28302e+06,462,442,5070,2.79634e+06,998
FORMULA SmartHome-PT-14-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 174 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 174 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 174 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 168 transition count 220
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 168 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 165 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 165 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 163 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 163 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 162 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 162 transition count 214
Applied a total of 69 rules in 9 ms. Remains 162 /196 variables (removed 34) and now considering 214/249 (removed 35) transitions.
// Phase 1: matrix 214 rows 162 cols
[2025-06-06 22:46:58] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:46:58] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 22:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:46:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-06 22:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 9199 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:47:11] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/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 13395 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 22613ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 22615ms
Starting structural reductions in LTL mode, iteration 1 : 162/196 places, 214/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22745 ms. Remains : 162/196 places, 214/249 transitions.
[2025-06-06 22:47:21] [INFO ] Flatten gal took : 13 ms
[2025-06-06 22:47:21] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:47:21] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-06 22:47:21] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:47:21] [INFO ] Flatten gal took : 17 ms
[2025-06-06 22:47:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6855548469029750629.gal : 1 ms
[2025-06-06 22:47:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3253544622083367686.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/CTLFireability6855548469029750629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3253544622083367686.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(((EF(AG(AF((p124==0)))) + (p141==1)) + A((A((p266==1) U (p213==1)) * EG((p162==1))) U AX((p155==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(E(TRUE U !(!(EG(!((p124==0)))))))) + (p141==1)) + !((E(!(!(EX(!((p155==1))))) U (!((!(...312
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t31, t60, t93, t96, t113, t119, t136, t139, t151, t154, t171, t185, t188, t191,...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,18.2863,592640,1,0,825,3.66279e+06,484,489,5276,3.95408e+06,1095
FORMULA SmartHome-PT-14-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Graph (trivial) has 199 edges and 196 vertex of which 107 / 196 are part of one of the 8 SCC in 3 ms
Free SCC test removed 99 places
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 96 transition count 92
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 37 rules applied. Total rules applied 67 place count 67 transition count 84
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 63 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 62 transition count 83
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 73 place count 62 transition count 80
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 59 transition count 80
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 90 place count 48 transition count 69
Iterating global reduction 4 with 11 rules applied. Total rules applied 101 place count 48 transition count 69
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 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 143 place count 27 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 26 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 159 place count 26 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 161 place count 24 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 161 place count 24 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 23 transition count 31
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 22 transition count 29
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 21 transition count 28
Applied a total of 166 rules in 29 ms. Remains 21 /196 variables (removed 175) and now considering 28/249 (removed 221) transitions.
[2025-06-06 22:47:39] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 22:47:39] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:47:39] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:47:39] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 22:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:47:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:47:39] [INFO ] Redundant transitions in 18 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 22:47:39] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 22:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 135 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 205 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 345ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/196 places, 28/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 451 ms. Remains : 21/196 places, 28/249 transitions.
[2025-06-06 22:47:40] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:47:40] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:47:40] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-06 22:47:40] [INFO ] Flatten gal took : 0 ms
[2025-06-06 22:47:40] [INFO ] Flatten gal took : 0 ms
[2025-06-06 22:47:40] [INFO ] Time to serialize gal into /tmp/CTLFireability262834727204931286.gal : 0 ms
[2025-06-06 22:47:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15328729721689842314.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/CTLFireability262834727204931286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15328729721689842314.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,26496,0.003852,3852,2,61,5,309,6,0,94,282,0


Converting to forward existential form...Done !
original formula: EG(EF((p119==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p119==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t19, t22, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,1,0.022277,4876,1,0,94,5801,76,69,559,8407,107
FORMULA SmartHome-PT-14-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Graph (trivial) has 191 edges and 196 vertex of which 89 / 196 are part of one of the 7 SCC in 1 ms
Free SCC test removed 82 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Reduce places removed 1 places and 1 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 113 transition count 107
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 77 place count 78 transition count 101
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 75 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 74 transition count 100
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 82 place count 74 transition count 95
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 92 place count 69 transition count 95
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 103 place count 58 transition count 84
Iterating global reduction 4 with 11 rules applied. Total rules applied 114 place count 58 transition count 84
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 160 place count 35 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 35 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 167 place count 33 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 175 place count 33 transition count 47
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 177 place count 32 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 178 place count 31 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 178 place count 31 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 180 place count 30 transition count 45
Applied a total of 180 rules in 14 ms. Remains 30 /196 variables (removed 166) and now considering 45/249 (removed 204) transitions.
[2025-06-06 22:47:40] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
// Phase 1: matrix 35 rows 30 cols
[2025-06-06 22:47:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:47:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-06 22:47:40] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
[2025-06-06 22:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:47:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-06 22:47:40] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:47:40] [INFO ] Redundant transitions in 25 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-06 22:47:40] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
[2025-06-06 22:47:40] [INFO ] Invariant cache hit.
[2025-06-06 22:47:40] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 34/64 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 44 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 34/64 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 44/83 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1435ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1435ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/196 places, 45/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1530 ms. Remains : 30/196 places, 45/249 transitions.
[2025-06-06 22:47:41] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:47:41] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:47:41] [INFO ] Input system was already deterministic with 45 transitions.
[2025-06-06 22:47:41] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:47:41] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:47:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7685288281169888663.gal : 0 ms
[2025-06-06 22:47:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3465969978652192885.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/CTLFireability7685288281169888663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3465969978652192885.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,158977,0.007774,3952,2,110,5,847,6,0,151,751,0


Converting to forward existential form...Done !
original formula: EG((AF((p274==1)) + !(E(!(((p2==1)&&(p286==1))) U EG((p267==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((p274==1)))) + !(E(!(((p2==1)&&(p286==1))) U EG((p267==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t8, t10, t12, t14, t16, t18, t22, t24, t27, t39, Intersection with reachable at each...217
(forward)formula 0,0,0.087765,8560,1,0,209,30026,120,121,940,32790,250
FORMULA SmartHome-PT-14-CTLFireability-2025-05 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 : 196/196 places, 249/249 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 174 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 174 transition count 227
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 167 transition count 220
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 167 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 163 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 163 transition count 216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 161 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 161 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 160 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 160 transition count 213
Applied a total of 72 rules in 14 ms. Remains 160 /196 variables (removed 36) and now considering 213/249 (removed 36) transitions.
// Phase 1: matrix 213 rows 160 cols
[2025-06-06 22:47:41] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:47:42] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 22:47:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:47:42] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-06 22:47: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/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 163 constraints, problems are : Problem set: 0 solved, 212 unsolved in 8844 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 212/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:47:54] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/373 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 376 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23294ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 23296ms
Starting structural reductions in LTL mode, iteration 1 : 160/196 places, 213/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23525 ms. Remains : 160/196 places, 213/249 transitions.
[2025-06-06 22:48:05] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:48:05] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:48:05] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-06 22:48:05] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:48:05] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:48:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7100805719085020936.gal : 1 ms
[2025-06-06 22:48:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8160945022774292674.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/CTLFireability7100805719085020936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8160945022774292674.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.4611e+12,0.21707,13696,2,2735,5,45653,6,0,847,48740,0


Converting to forward existential form...Done !
original formula: (AG(AF(((p191==0)||(p323==0)))) + EX(((A(AF((p171==1)) U (((p143==1)&&(p122==1)) * EX((p413==1)))) * EX(((p2==1)&&(p238==1)))) * (((EF((p...221
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX(((!((E(!((((p143==1)&&(p122==1)) * EX((p413==1)))) U (!(!(EG(!((p171==1))))) * !((((p143...403
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t64, t92, t95, t113, t116, t133, t136, t148, t151, t169, t183, t1...277
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 197/15/16
(forward)formula 0,0,22.0312,742916,1,0,1010,4.22484e+06,478,719,5663,5.49649e+06,1325
FORMULA SmartHome-PT-14-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Graph (trivial) has 198 edges and 196 vertex of which 100 / 196 are part of one of the 7 SCC in 0 ms
Free SCC test removed 93 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 102 transition count 96
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 41 rules applied. Total rules applied 75 place count 69 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 65 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 79 place count 65 transition count 84
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 87 place count 61 transition count 84
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 97 place count 51 transition count 74
Iterating global reduction 3 with 10 rules applied. Total rules applied 107 place count 51 transition count 74
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 153 place count 28 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 157 place count 28 transition count 46
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 159 place count 27 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 163 place count 25 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 176 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 23 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 178 place count 23 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 181 place count 21 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 21 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 20 transition count 26
Applied a total of 183 rules in 14 ms. Remains 20 /196 variables (removed 176) and now considering 26/249 (removed 223) transitions.
[2025-06-06 22:48:27] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 20 cols
[2025-06-06 22:48:27] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 22:48:27] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-06 22:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:27] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:48:27] [INFO ] Redundant transitions in 23 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 22:48:27] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-06 22:48: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/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 12 unsolved in 138 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/36 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/38 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/41 variables, and 32 constraints, problems are : Problem set: 0 solved, 12 unsolved in 190 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 332ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/196 places, 26/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 432 ms. Remains : 20/196 places, 26/249 transitions.
[2025-06-06 22:48:28] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:28] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:28] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-06 22:48:28] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:28] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15054006109247638336.gal : 0 ms
[2025-06-06 22:48:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4721006071938320537.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/CTLFireability15054006109247638336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4721006071938320537.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,19872,0.003849,3832,2,62,5,330,6,0,89,302,0


Converting to forward existential form...Done !
original formula: EF(EG((p191==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p191==1))] != FALSE
Hit Full ! (commute/partial/dont) 22/0/4
(forward)formula 0,1,0.008093,4088,1,0,8,1401,19,2,468,1273,8
FORMULA SmartHome-PT-14-CTLFireability-2025-07 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 : 196/196 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 173 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 173 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 173 transition count 225
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 168 transition count 220
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 168 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 165 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 165 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 164 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 164 transition count 216
Applied a total of 65 rules in 11 ms. Remains 164 /196 variables (removed 32) and now considering 216/249 (removed 33) transitions.
// Phase 1: matrix 216 rows 164 cols
[2025-06-06 22:48:28] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 22:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:28] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-06 22:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/380 variables, 164/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 167 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/380 variables, 164/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 215/382 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:48:40] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23114ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 23114ms
Starting structural reductions in LTL mode, iteration 1 : 164/196 places, 216/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23242 ms. Remains : 164/196 places, 216/249 transitions.
[2025-06-06 22:48:51] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:48:51] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:48:51] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-06 22:48:51] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:48:51] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:48:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1542436464085331137.gal : 1 ms
[2025-06-06 22:48:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4559383727756182582.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/CTLFireability1542436464085331137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4559383727756182582.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.56369e+12,0.263108,15660,2,3042,5,52997,6,0,866,58821,0


Converting to forward existential form...Done !
original formula: AX(AG((((p195!=1)&&(p56!=1)) + (EF((p319==0)) * EX(TRUE)))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * !(((p195!=1)&&(p56!=1)))) * !(E(TRUE U (p319==0))))] = FALSE * [((FwdU(EY(Init),TRUE) ...207
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t31, t34, t63, t96, t99, t116, t119, t136, t139, t151, t154, t171, t187, t190, t193,...268
(forward)formula 0,1,2.47638,94720,1,0,269,451915,456,192,5358,452366,451
FORMULA SmartHome-PT-14-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Graph (trivial) has 199 edges and 196 vertex of which 109 / 196 are part of one of the 8 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 94 transition count 90
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 37 rules applied. Total rules applied 67 place count 65 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 61 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 71 place count 61 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 58 transition count 79
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 88 place count 47 transition count 68
Iterating global reduction 3 with 11 rules applied. Total rules applied 99 place count 47 transition count 68
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 141 place count 26 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 26 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 25 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 157 place count 25 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 159 place count 23 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 159 place count 23 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 21 transition count 29
Applied a total of 162 rules in 15 ms. Remains 21 /196 variables (removed 175) and now considering 29/249 (removed 220) transitions.
[2025-06-06 22:48:53] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 22:48:53] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:48:54] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2025-06-06 22:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:54] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:48:54] [INFO ] Redundant transitions in 17 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 22:48:54] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2025-06-06 22:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 315ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/196 places, 29/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 404 ms. Remains : 21/196 places, 29/249 transitions.
[2025-06-06 22:48:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:54] [INFO ] Input system was already deterministic with 29 transitions.
RANDOM walk for 41 steps (3 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-14-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 22:48:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:48:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4341477242306261122.gal : 0 ms
[2025-06-06 22:48:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13765623454574706064.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4341477242306261122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13765623454574706064.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 174 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 174 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 174 transition count 226
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 169 transition count 221
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 169 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 166 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 166 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 164 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 164 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 163 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 163 transition count 215
Applied a total of 67 rules in 8 ms. Remains 163 /196 variables (removed 33) and now considering 215/249 (removed 34) transitions.
// Phase 1: matrix 215 rows 163 cols
[2025-06-06 22:48:54] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 22:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:48:54] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-06 22:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/378 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 166 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/378 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 214/380 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:49:07] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 381 constraints, problems are : Problem set: 0 solved, 214 unsolved in 13976 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23036ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 23036ms
Starting structural reductions in LTL mode, iteration 1 : 163/196 places, 215/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23159 ms. Remains : 163/196 places, 215/249 transitions.
[2025-06-06 22:49:17] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:49:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:49:17] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-06 22:49:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:49:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:49:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16417542725698275482.gal : 1 ms
[2025-06-06 22:49:17] [INFO ] Time to serialize properties into /tmp/CTLFireability9836935372959751657.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/CTLFireability16417542725698275482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9836935372959751657.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.64422e+12,0.229378,14236,2,2916,5,47501,6,0,861,51450,0


Converting to forward existential form...Done !
original formula: EF((((p89==0) * A(((p129==1)&&(p408==1)) U (p226==1))) * ((((p238==0)||(p323==0))||((p318==0)||(p340==0))) * (AX(((p160==1)&&(p323==1))) ...183
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((p89==0) * !((E(!((p226==1)) U (!(((p129==1)&&(p408==1))) * !((p226==1)))) + EG(!((p226=...474
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t92, t95, t112, t115, t132, t136, t149, t155, t172, t186, t189, t192,...268
(forward)formula 0,1,12.0813,427408,1,0,725,2.49054e+06,462,422,4765,3.0298e+06,923
FORMULA SmartHome-PT-14-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 : 196/196 places, 249/249 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 171 transition count 224
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 171 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 171 transition count 223
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 164 transition count 216
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 164 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 160 transition count 212
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 160 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 158 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 158 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 157 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 157 transition count 209
Applied a total of 79 rules in 8 ms. Remains 157 /196 variables (removed 39) and now considering 209/249 (removed 40) transitions.
// Phase 1: matrix 209 rows 157 cols
[2025-06-06 22:49:29] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:49:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 22:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:49:29] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-06 22:49:29] [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 8428 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:49:41] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/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 13287 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 21725ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 21725ms
Starting structural reductions in LTL mode, iteration 1 : 157/196 places, 209/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21857 ms. Remains : 157/196 places, 209/249 transitions.
[2025-06-06 22:49:51] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:49:51] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:49:51] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-06 22:49:51] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:49:51] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:49:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16441578108745204481.gal : 1 ms
[2025-06-06 22:49:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15773845893211065604.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/CTLFireability16441578108745204481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15773845893211065604.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.210531,13240,2,2558,5,43076,6,0,831,45888,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.218422,13240,1,0,6,43076,7,1,1011,45888,1
FORMULA SmartHome-PT-14-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 175 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 175 transition count 227
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 168 transition count 220
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 168 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 164 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 164 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 162 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 162 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 161 transition count 213
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 161 transition count 213
Applied a total of 71 rules in 14 ms. Remains 161 /196 variables (removed 35) and now considering 213/249 (removed 36) transitions.
// Phase 1: matrix 213 rows 161 cols
[2025-06-06 22:49:51] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:49:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:49:52] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-06 22:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 164 constraints, problems are : Problem set: 0 solved, 212 unsolved in 8835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 212/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:50:08] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/374 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 377 constraints, problems are : Problem set: 0 solved, 212 unsolved in 18955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27800ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 27800ms
Starting structural reductions in LTL mode, iteration 1 : 161/196 places, 213/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27930 ms. Remains : 161/196 places, 213/249 transitions.
[2025-06-06 22:50:19] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:50:19] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:50:19] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-06 22:50:19] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:50:19] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:50:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11841631451039096820.gal : 1 ms
[2025-06-06 22:50:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12667875155487075749.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/CTLFireability11841631451039096820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12667875155487075749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG(EF((p337==1))) * AG((((AX((p226==0)) * ((p175==1)||(((p2==0)||(p318==0))&&((p191==0)||(p417==0))))) + (p278==0)) * (((p324==1)&&(p228...180
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U (p337==1)))))] = FALSE * (([(EY((FwdU(Init,TRUE) * !((p278==0)))) * !((p226==0)))] = FAL...351
(forward)formula 0,0,0.369654,16252,1,0,11,55704,11,4,1367,62119,3
FORMULA SmartHome-PT-14-CTLFireability-2023-13 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 : 196/196 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 173 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 173 transition count 226
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 167 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 167 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 163 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 163 transition count 216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 161 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 161 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 160 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 160 transition count 213
Applied a total of 72 rules in 11 ms. Remains 160 /196 variables (removed 36) and now considering 213/249 (removed 36) transitions.
// Phase 1: matrix 213 rows 160 cols
[2025-06-06 22:50:20] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:50:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 22:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:50:20] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-06 22:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 163 constraints, problems are : Problem set: 0 solved, 212 unsolved in 8880 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 212/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:50:33] [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/373 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/373 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 376 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23087ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 23087ms
Starting structural reductions in LTL mode, iteration 1 : 160/196 places, 213/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23233 ms. Remains : 160/196 places, 213/249 transitions.
[2025-06-06 22:50:43] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:50:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:50:43] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-06 22:50:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:50:43] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:50:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2343039051462708164.gal : 1 ms
[2025-06-06 22:50:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11561139170358597802.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/CTLFireability2343039051462708164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11561139170358597802.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.29343e+12,0.236721,13828,2,2917,5,46246,6,0,847,48452,0


Converting to forward existential form...Done !
original formula: (EF(((EF((p312==1)) + AG(EF(((p286==0)||(p371==0))))) + AF((((p209==1)||(p102==1))||(p236==1))))) * AX((p181==1)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((E(TRUE U (p312==1)) + !(E(TRUE U !(E(TRUE U ((p286==0)||(p371==0))))))) + !(EG(!((((p209=...237
(forward)formula 0,0,0.24717,14084,1,0,9,46246,9,2,1034,48452,2
FORMULA SmartHome-PT-14-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-06 22:50:43] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:50:43] [INFO ] Flatten gal took : 4 ms
Total runtime 392527 ms.

BK_STOP 1749250243839

--------------------
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-14"
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-14, 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-174901995100794"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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