About the Execution of ITS-Tools for SmartHome-PT-12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 282419.00 | 0.00 | 0.00 | FFTFFFFFFTTTTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r212-tall-174901995000778.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-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901995000778
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 90K 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-12-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-12-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-12-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-12-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-12-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749249228867
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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 22:33:50] [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:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:33:50] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-06 22:33:50] [INFO ] Transformed 376 places.
[2025-06-06 22:33:50] [INFO ] Transformed 399 transitions.
[2025-06-06 22:33:50] [INFO ] Found NUPN structural information;
[2025-06-06 22:33:50] [INFO ] Parsed PT model containing 376 places and 399 transitions and 909 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 104 places in 4 ms
Reduce places removed 104 places and 80 transitions.
FORMULA SmartHome-PT-12-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 262 transition count 319
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 70 place count 202 transition count 259
Iterating global reduction 1 with 60 rules applied. Total rules applied 130 place count 202 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 134 place count 202 transition count 255
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 145 place count 191 transition count 244
Iterating global reduction 2 with 11 rules applied. Total rules applied 156 place count 191 transition count 244
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 165 place count 182 transition count 235
Iterating global reduction 2 with 9 rules applied. Total rules applied 174 place count 182 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 182 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 176 place count 181 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 181 transition count 233
Applied a total of 177 rules in 75 ms. Remains 181 /272 variables (removed 91) and now considering 233/319 (removed 86) transitions.
// Phase 1: matrix 233 rows 181 cols
[2025-06-06 22:33:50] [INFO ] Computed 3 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:50] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-06 22:33:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:51] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2025-06-06 22:33:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 233/414 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/414 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 184 constraints, problems are : Problem set: 0 solved, 232 unsolved in 11112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 233/414 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 232/416 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:34:07] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:34:17] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/414 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 418 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41189ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 41209ms
Starting structural reductions in LTL mode, iteration 1 : 181/272 places, 233/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42057 ms. Remains : 181/272 places, 233/319 transitions.
Support contains 46 out of 181 places after structural reductions.
[2025-06-06 22:34:32] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-06 22:34:32] [INFO ] Flatten gal took : 35 ms
FORMULA SmartHome-PT-12-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:34:32] [INFO ] Flatten gal took : 14 ms
[2025-06-06 22:34:32] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 39 out of 181 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (208 resets) in 1498 ms. (26 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40000 steps (8 resets) in 326 ms. (122 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 326 ms. (122 steps per ms) remains 1/2 properties
[2025-06-06 22:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/57 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/67 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 79/146 variables, 34/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/221 variables, 32/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 81/302 variables, 38/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/302 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 57/359 variables, 28/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/359 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 34/393 variables, 19/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/393 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 15/408 variables, 9/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/413 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/413 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/414 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/414 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/414 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 181/181 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/57 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/61 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/67 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 79/146 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/221 variables, 32/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 81/302 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/302 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 57/359 variables, 28/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/359 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 34/393 variables, 19/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/393 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 15/408 variables, 9/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/413 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/413 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/414 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/414 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/414 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2905 steps, including 142 resets, run visited all 1 properties in 9 ms. (steps per millisecond=322 )
Parikh walk visited 1 properties in 13 ms.
[2025-06-06 22:34:33] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:34:33] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:34:33] [INFO ] Input system was already deterministic with 233 transitions.
Computed a total of 46 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 214
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 162 transition count 209
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 157 transition count 204
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 157 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 153 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 153 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 151 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 151 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 149 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 149 transition count 196
Applied a total of 69 rules in 16 ms. Remains 149 /181 variables (removed 32) and now considering 196/233 (removed 37) transitions.
// Phase 1: matrix 196 rows 149 cols
[2025-06-06 22:34:33] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:34:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:34:33] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-06 22:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 152 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7593 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 195/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:34:44] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 348 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11981 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19596ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19597ms
Starting structural reductions in LTL mode, iteration 1 : 149/181 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19739 ms. Remains : 149/181 places, 196/233 transitions.
[2025-06-06 22:34:53] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:34:53] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:34:53] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-06 22:34:53] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:34:53] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:34:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10807587335709394459.gal : 3 ms
[2025-06-06 22:34:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15339112165447466051.ctl : 4 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/CTLFireability10807587335709394459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15339112165447466051.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.01372e+11,0.186557,11676,2,2325,5,36963,6,0,787,38341,0
Converting to forward existential form...Done !
original formula: E(!(((!(AX(FALSE)) * (p161==1)) + !(((p66!=1)&&(!((p254==1)&&(p330==1))))))) U AF((p47==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(((!(!(EX(!(FALSE)))) * (p161==1)) + !(((p66!=1)&&(!((p254==1)&&(p330==1)))))))) * !(EG(!((p47==1))...168
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t97, t114, t117, t134, t137, t149, t168, t171, t174, t176, t180,...256
(forward)formula 0,0,13.1778,467440,1,0,880,2.51265e+06,422,534,4373,3.50919e+06,1070
FORMULA SmartHome-PT-12-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 214
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 162 transition count 209
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 156 transition count 203
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 156 transition count 203
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 151 transition count 198
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 151 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 149 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 149 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 147 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 147 transition count 194
Applied a total of 73 rules in 22 ms. Remains 147 /181 variables (removed 34) and now considering 194/233 (removed 39) transitions.
// Phase 1: matrix 194 rows 147 cols
[2025-06-06 22:35:06] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:06] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 22:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-06 22:35:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 8361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15905ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 15906ms
Starting structural reductions in LTL mode, iteration 1 : 147/181 places, 194/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16091 ms. Remains : 147/181 places, 194/233 transitions.
[2025-06-06 22:35:22] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:35:22] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:35:22] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-06 22:35:22] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:35:23] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:35:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15061788235907694453.gal : 3 ms
[2025-06-06 22:35:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17305722137432127802.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/CTLFireability15061788235907694453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17305722137432127802.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.01553e+11,0.161204,11736,2,2144,5,34876,6,0,777,36749,0
Converting to forward existential form...Done !
original formula: EF((((p206==1) * EG(AX((p133==1)))) * EG(((p373==0)||(p225==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * ((p206==1) * EG(!(EX(!((p133==1))))))),((p373==0)||(p225==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t112, t115, t132, t135, t147, t166, t169, t172, t174, t178,...256
Using saturation style SCC detection
(forward)formula 0,0,1.22335,51132,1,0,247,233549,421,172,4553,233509,411
FORMULA SmartHome-PT-12-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 161 transition count 213
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 161 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 161 transition count 208
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 155 transition count 202
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 155 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 150 transition count 197
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 150 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 148 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 148 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 146 transition count 193
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 146 transition count 193
Applied a total of 75 rules in 13 ms. Remains 146 /181 variables (removed 35) and now considering 193/233 (removed 40) transitions.
// Phase 1: matrix 193 rows 146 cols
[2025-06-06 22:35:24] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 22:35:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:24] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-06 22:35:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 7221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:35:34] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 342 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18465ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 18465ms
Starting structural reductions in LTL mode, iteration 1 : 146/181 places, 193/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18698 ms. Remains : 146/181 places, 193/233 transitions.
[2025-06-06 22:35:42] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:35:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:35:42] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-06 22:35:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:35:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:35:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10757387389611883808.gal : 3 ms
[2025-06-06 22:35:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8440143953981542644.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/CTLFireability10757387389611883808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8440143953981542644.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88956e+11,0.162758,11720,2,2117,5,35115,6,0,772,37329,0
Converting to forward existential form...Done !
original formula: AG(((p1==0) + EF(EX((p48==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p1==0))) * !(E(TRUE U EX((p48==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,1,1.5243,66568,1,0,254,364500,409,180,4392,312842,424
FORMULA SmartHome-PT-12-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 169 transition count 221
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 169 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 169 transition count 217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 166 transition count 214
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 166 transition count 214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 163 transition count 211
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 163 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 162 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 162 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 161 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 161 transition count 209
Applied a total of 44 rules in 13 ms. Remains 161 /181 variables (removed 20) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 161 cols
[2025-06-06 22:35:44] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 22:35:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:35:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-06 22:35:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/370 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/370 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 164 constraints, problems are : Problem set: 0 solved, 208 unsolved in 8461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 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/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/370 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 208/372 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:35:56] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 373 constraints, problems are : Problem set: 0 solved, 208 unsolved in 14323 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22799ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 22800ms
Starting structural reductions in LTL mode, iteration 1 : 161/181 places, 209/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22964 ms. Remains : 161/181 places, 209/233 transitions.
[2025-06-06 22:36:07] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:36:07] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:36:07] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-06 22:36:07] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:36:07] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:36:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6634049113730605669.gal : 2 ms
[2025-06-06 22:36:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10717498865743168405.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/CTLFireability6634049113730605669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10717498865743168405.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,6.01858e+11,0.298169,18000,2,3744,5,65042,6,0,848,68867,0
Converting to forward existential form...Done !
original formula: AG((!(A(((AX((p82==1)) * A((p182==1) U (p120==1))) + AF((p274==1))) U EF((p288==1)))) + EG((((((p181==1)&&((p302==0)||(p49==0)))||(p2==0)...209
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EG((((((p181==1)&&((p302==0)||(p49==0)))||(p2==0))||((p254==0)||(p280==0)))||((p253==0)&...395
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t9, t10, t15, t34, t37, t39, t67, t105, t108, t125, t128, t145, t148, t161, t180, t18...276
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-06 22:36:37] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:36:37] [INFO ] Applying decomposition
[2025-06-06 22:36:37] [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/graph4325266225184420458.txt' '-o' '/tmp/graph4325266225184420458.bin' '-w' '/tmp/graph4325266225184420458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4325266225184420458.bin' '-l' '-1' '-v' '-w' '/tmp/graph4325266225184420458.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:36:37] [INFO ] Decomposing Gal with order
[2025-06-06 22:36:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:36:37] [INFO ] Removed a total of 45 redundant transitions.
[2025-06-06 22:36:37] [INFO ] Flatten gal took : 39 ms
[2025-06-06 22:36:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2025-06-06 22:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16485888994326934589.gal : 4 ms
[2025-06-06 22:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16184359668589665182.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/CTLFireability16485888994326934589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16184359668589665182.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.01858e+11,0.130999,10292,440,53,12632,1460,438,22115,68,6903,0
Converting to forward existential form...Done !
original formula: AG((!(A(((AX((i9.u14.p82==1)) * A((i4.i1.u31.p182==1) U (i2.u17.p120==1))) + AF((i8.i1.u52.p274==1))) U EF((i8.i0.u47.p288==1)))) + EG(((...313
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EG((((((i4.i1.u30.p181==1)&&((i6.u55.p302==0)||(i1.u8.p49==0)))||(i0.u1.p2==0))||((i6.u3...533
Reverse transition relation is NOT exact ! Due to transitions t37, t108, t128, t148, i0.u1.t183, i1.u4.t180, i2.u19.t145, i3.u20.t125, i4.i0.u24.t105, i6.t...390
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found 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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found 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
(forward)formula 0,1,2.07295,88628,1,0,168058,1460,2857,321908,364,6903,167027
FORMULA SmartHome-PT-12-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 161 transition count 213
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 161 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 161 transition count 208
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 155 transition count 202
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 155 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 150 transition count 197
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 150 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 148 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 148 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 146 transition count 193
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 146 transition count 193
Applied a total of 75 rules in 8 ms. Remains 146 /181 variables (removed 35) and now considering 193/233 (removed 40) transitions.
// Phase 1: matrix 193 rows 146 cols
[2025-06-06 22:36:39] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 22:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:40] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-06 22:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 7218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:36:50] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 342 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18525ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 18526ms
Starting structural reductions in LTL mode, iteration 1 : 146/181 places, 193/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18647 ms. Remains : 146/181 places, 193/233 transitions.
[2025-06-06 22:36:58] [INFO ] Flatten gal took : 14 ms
[2025-06-06 22:36:58] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:36:58] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-06 22:36:58] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:36:58] [INFO ] Flatten gal took : 16 ms
[2025-06-06 22:36:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13313789826764153343.gal : 3 ms
[2025-06-06 22:36:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6926244654119148001.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/CTLFireability13313789826764153343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6926244654119148001.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88956e+11,0.166782,11724,2,2117,5,35115,6,0,772,37329,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.173537,11724,1,0,6,35115,7,1,939,37329,1
FORMULA SmartHome-PT-12-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 214
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 162 transition count 209
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 156 transition count 203
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 156 transition count 203
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 151 transition count 198
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 151 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 149 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 149 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 147 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 147 transition count 194
Applied a total of 73 rules in 7 ms. Remains 147 /181 variables (removed 34) and now considering 194/233 (removed 39) transitions.
// Phase 1: matrix 194 rows 147 cols
[2025-06-06 22:36:58] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 22:36:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:36:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-06 22:36: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/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:37:09] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 344 constraints, problems are : Problem set: 0 solved, 193 unsolved in 11514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19012ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 19014ms
Starting structural reductions in LTL mode, iteration 1 : 147/181 places, 194/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19156 ms. Remains : 147/181 places, 194/233 transitions.
[2025-06-06 22:37:17] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:37:17] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:37:17] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-06 22:37:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:17] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10876409001496554627.gal : 1 ms
[2025-06-06 22:37:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2444475825774546962.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/CTLFireability10876409001496554627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2444475825774546962.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.83083e+11,0.17705,11856,2,2153,5,35865,6,0,777,37943,0
Converting to forward existential form...Done !
original formula: AG(EX(AF((p301==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((p301==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t63, t92, t95, t112, t115, t132, t135, t147, t166, t169, t172, t1...265
(forward)formula 0,0,1.35318,56988,1,0,277,268147,411,183,4310,267089,443
FORMULA SmartHome-PT-12-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 214
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 162 transition count 210
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 156 transition count 204
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 156 transition count 204
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 151 transition count 199
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 151 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 149 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 149 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 147 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 147 transition count 195
Applied a total of 72 rules in 7 ms. Remains 147 /181 variables (removed 34) and now considering 195/233 (removed 38) transitions.
// Phase 1: matrix 195 rows 147 cols
[2025-06-06 22:37:19] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-06 22:37:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-06 22:37:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/342 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 150 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/342 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 194/344 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:37:29] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 345 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18992ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 18993ms
Starting structural reductions in LTL mode, iteration 1 : 147/181 places, 195/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19118 ms. Remains : 147/181 places, 195/233 transitions.
[2025-06-06 22:37:38] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:37:38] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:38] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-06 22:37:38] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:38] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:37:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15769355584584133105.gal : 1 ms
[2025-06-06 22:37:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14080393290593270193.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/CTLFireability15769355584584133105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14080393290593270193.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,1.96486e+11,0.182373,12144,2,2221,5,37066,6,0,778,40305,0
Converting to forward existential form...Done !
original formula: AG((!(E(EG((p142==1)) U ((p278==1)&&(p247==1)))) + AX(!(A((p150==1) U (p204==1))))))
=> equivalent forward existential formula: [((EY((FwdU(Init,TRUE) * !(!(E(EG((p142==1)) U ((p278==1)&&(p247==1))))))) * !(EG(!((p204==1))))) * !(E(!((p204=...203
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t64, t92, t95, t112, t115, t132, t135, t147, t166, t169, t172, t1...265
(forward)formula 0,0,8.84977,313520,1,0,799,1.85848e+06,426,468,4342,2.21542e+06,974
FORMULA SmartHome-PT-12-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 216
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 164 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 159 transition count 207
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 159 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 155 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 155 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 154 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 154 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 153 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 153 transition count 201
Applied a total of 60 rules in 8 ms. Remains 153 /181 variables (removed 28) and now considering 201/233 (removed 32) transitions.
// Phase 1: matrix 201 rows 153 cols
[2025-06-06 22:37:47] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:37:47] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-06 22:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/354 variables, 153/156 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 156 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7774 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/354 variables, 153/156 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 200/356 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:37:58] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 357 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19491ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19492ms
Starting structural reductions in LTL mode, iteration 1 : 153/181 places, 201/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19614 ms. Remains : 153/181 places, 201/233 transitions.
[2025-06-06 22:38:07] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:38:07] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:07] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-06 22:38:07] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:07] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11635836407356116844.gal : 1 ms
[2025-06-06 22:38:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10584939148455407479.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/CTLFireability11635836407356116844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10584939148455407479.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.01668e+11,0.197676,12832,2,2468,5,40212,6,0,808,43597,0
Converting to forward existential form...Done !
original formula: EX(((p187==1) * (EG(((p221==1) * EG((p89==1)))) + AX(EX(((p255==1)&&(p118==1)))))))
=> equivalent forward existential formula: ([FwdG((EY(Init) * (p187==1)),((p221==1) * EG((p89==1))))] != FALSE + [((EY(Init) * (p187==1)) * !(EX(!(EX(((p25...188
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t35, t66, t98, t101, t118, t122, t139, t142, t154, t173, t176, t179, t181, t185...257
(forward)formula 0,0,1.73457,72636,1,0,297,372431,431,196,4472,368493,472
FORMULA SmartHome-PT-12-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 233/233 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 163 transition count 215
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 163 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 163 transition count 212
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 157 transition count 206
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 157 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 153 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 153 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 151 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 151 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 149 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 149 transition count 198
Applied a total of 67 rules in 12 ms. Remains 149 /181 variables (removed 32) and now considering 198/233 (removed 35) transitions.
// Phase 1: matrix 198 rows 149 cols
[2025-06-06 22:38:08] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:38:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 22:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:38:08] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-06 22:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/347 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 152 constraints, problems are : Problem set: 0 solved, 197 unsolved in 7420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/347 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 197/349 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:38:19] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:38:19] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 351 constraints, problems are : Problem set: 0 solved, 197 unsolved in 12999 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20439ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 20439ms
Starting structural reductions in LTL mode, iteration 1 : 149/181 places, 198/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20567 ms. Remains : 149/181 places, 198/233 transitions.
[2025-06-06 22:38:29] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:38:29] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:29] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-06 22:38:29] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:38:29] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:38:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3606260585835499921.gal : 1 ms
[2025-06-06 22:38:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14535414478024783513.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/CTLFireability3606260585835499921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14535414478024783513.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.94873e+11,0.242201,14484,2,2680,5,48800,6,0,789,51772,0
Converting to forward existential form...Done !
original formula: (!(A((!((((p123==1)||(p32==1)) * AG((p196==1)))) * !(AX((((p2==1)&&(p254==1))||(p187==1))))) U (p253==1))) + AX(EF((((p2==1)&&(p286==1))|...169
=> equivalent forward existential formula: [(EY((Init * !(!(!((E(!((p253==1)) U (!((!((((p123==1)||(p32==1)) * !(E(TRUE U !((p196==1)))))) * !(!(EX(!((((p2...290
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t11, t28, t31, t33, t61, t93, t96, t113, t116, t133, t136, t148, t167, t170, t171, t1...271
(forward)formula 0,1,1.74284,67060,1,0,246,327117,417,170,4407,295608,409
FORMULA SmartHome-PT-12-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 22:38:31] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:38:31] [INFO ] Flatten gal took : 5 ms
Total runtime 281139 ms.
BK_STOP 1749249511286
--------------------
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-12"
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-12, 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-174901995000778"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-12.tgz
mv SmartHome-PT-12 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 '
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 ;