Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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 56K 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-06-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-06-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-06-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-06-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-06-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749247061652

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 21:57:42] [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 21:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 21:57:42] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-06 21:57:42] [INFO ] Transformed 219 places.
[2025-06-06 21:57:42] [INFO ] Transformed 254 transitions.
[2025-06-06 21:57:42] [INFO ] Found NUPN structural information;
[2025-06-06 21:57:42] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-06-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 165 transition count 199
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 165 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 77 place count 165 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 162 transition count 193
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 162 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 160 transition count 191
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 160 transition count 191
Applied a total of 87 rules in 41 ms. Remains 160 /202 variables (removed 42) and now considering 191/236 (removed 45) transitions.
// Phase 1: matrix 191 rows 160 cols
[2025-06-06 21:57:43] [INFO ] Computed 9 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:43] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-06-06 21:57:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:57:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-06 21:57:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:45] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:45] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:45] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:45] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:45] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:46] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:46] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:47] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:48] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:48] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:48] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/351 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 184 constraints, problems are : Problem set: 0 solved, 190 unsolved in 11114 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/351 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 190/374 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:56] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:57] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:59] [INFO ] Deduced a trap along path composed of 4 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:57:59] [INFO ] Deduced a trap along path composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:03] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 379 constraints, problems are : Problem set: 0 solved, 190 unsolved in 23952 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 35138ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 35153ms
Starting structural reductions in LTL mode, iteration 1 : 160/202 places, 191/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35586 ms. Remains : 160/202 places, 191/236 transitions.
Support contains 77 out of 160 places after structural reductions.
[2025-06-06 21:58:18] [INFO ] Flatten gal took : 34 ms
[2025-06-06 21:58:18] [INFO ] Flatten gal took : 13 ms
[2025-06-06 21:58:18] [INFO ] Input system was already deterministic with 191 transitions.
Support contains 75 out of 160 places (down from 77) after GAL structural reductions.
RANDOM walk for 40000 steps (293 resets) in 1621 ms. (24 steps per ms) remains 8/55 properties
BEST_FIRST walk for 40003 steps (51 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (52 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (50 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (55 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (53 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (57 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (265 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
[2025-06-06 21:58:19] [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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 136/151 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:19] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/160 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 191/351 variables, 160/170 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 170 constraints, problems are : Problem set: 3 solved, 4 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/151 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:20] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/160 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 191/351 variables, 160/172 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 4/176 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 176 constraints, problems are : Problem set: 3 solved, 4 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 272 ms.
Support contains 8 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 191/191 transitions.
Graph (trivial) has 149 edges and 160 vertex of which 69 / 160 are part of one of the 5 SCC in 2 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Graph (complete) has 183 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 92 transition count 68
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 63 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 60 transition count 61
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 75 place count 60 transition count 55
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 87 place count 54 transition count 55
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 96 place count 45 transition count 46
Iterating global reduction 3 with 9 rules applied. Total rules applied 105 place count 45 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 45 transition count 44
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 30 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 82 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 142 place count 29 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 28 transition count 23
Applied a total of 143 rules in 21 ms. Remains 28 /160 variables (removed 132) and now considering 23/191 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 28/160 places, 23/191 transitions.
RANDOM walk for 40000 steps (5862 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1438 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1455 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1723 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 91 steps, run visited all 3 properties in 8 ms. (steps per millisecond=11 )
Probabilistic random walk after 91 steps, saw 78 distinct states, run finished after 13 ms. (steps per millisecond=7 ) properties seen :3
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2025-06-06 21:58:20] [INFO ] Flatten gal took : 9 ms
[2025-06-06 21:58:20] [INFO ] Flatten gal took : 9 ms
[2025-06-06 21:58:20] [INFO ] Input system was already deterministic with 191 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 135 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 126 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 126 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 122 transition count 151
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 122 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 122 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 119 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 119 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 118 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 118 transition count 146
Applied a total of 87 rules in 20 ms. Remains 118 /160 variables (removed 42) and now considering 146/191 (removed 45) transitions.
// Phase 1: matrix 146 rows 118 cols
[2025-06-06 21:58:20] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 21:58:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:21] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2025-06-06 21:58:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:22] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:22] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:22] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/264 variables, 118/130 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 130 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5077 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/264 variables, 118/130 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 145/275 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:28] [INFO ] Deduced a trap along path composed of 21 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:28] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:31] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:31] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:31] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/264 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 280 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11505 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16594ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 16595ms
Starting structural reductions in LTL mode, iteration 1 : 118/160 places, 146/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16750 ms. Remains : 118/160 places, 146/191 transitions.
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 8 ms
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 11 ms
[2025-06-06 21:58:37] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:37] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5048305185556453867.gal : 3 ms
[2025-06-06 21:58:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2263946880236971217.ctl : 2 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/CTLFireability5048305185556453867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2263946880236971217.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.59716e+07,0.187441,11380,2,2239,5,36811,6,0,620,31641,0


Converting to forward existential form...Done !
original formula: EG(AG(EX((p147==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX((p147==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t34, t37, t68, t88, t122, Intersection with reachable at each step enabled...205
(forward)formula 0,0,1.62192,57100,1,0,212,282693,319,136,3679,221555,335
FORMULA SmartHome-PT-06-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Graph (trivial) has 155 edges and 160 vertex of which 69 / 160 are part of one of the 5 SCC in 2 ms
Free SCC test removed 64 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 95 transition count 82
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 61 place count 68 transition count 76
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 66 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 65 transition count 75
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 65 place count 65 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 79 place count 58 transition count 68
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 90 place count 47 transition count 57
Iterating global reduction 4 with 11 rules applied. Total rules applied 101 place count 47 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 103 place count 47 transition count 55
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 131 place count 33 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 132 place count 33 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 134 place count 32 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 142 place count 32 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 143 place count 31 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 145 place count 29 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 146 place count 28 transition count 29
Applied a total of 146 rules in 23 ms. Remains 28 /160 variables (removed 132) and now considering 29/191 (removed 162) transitions.
[2025-06-06 21:58:39] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 28 cols
[2025-06-06 21:58:39] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 21:58:39] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2025-06-06 21:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:58:39] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2025-06-06 21:58:39] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2025-06-06 21:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 17 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 52 constraints, problems are : Problem set: 0 solved, 17 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 456ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/160 places, 29/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 550 ms. Remains : 28/160 places, 29/191 transitions.
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:58:39] [INFO ] Input system was already deterministic with 29 transitions.
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:58:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 21:58:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13367167391070663279.gal : 1 ms
[2025-06-06 21:58:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2860046502375988685.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/CTLFireability13367167391070663279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2860046502375988685.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,1024,0.005176,3984,2,83,5,519,6,0,139,390,0


Converting to forward existential form...Done !
original formula: EF(EG(AG((p86==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((p86==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.010346,4112,1,0,8,1766,21,2,672,881,7
FORMULA SmartHome-PT-06-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 137 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 137 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 137 transition count 166
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 56 place count 129 transition count 158
Iterating global reduction 1 with 8 rules applied. Total rules applied 64 place count 129 transition count 158
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 125 transition count 154
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 125 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 125 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 123 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 123 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 122 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 122 transition count 150
Applied a total of 79 rules in 7 ms. Remains 122 /160 variables (removed 38) and now considering 150/191 (removed 41) transitions.
// Phase 1: matrix 150 rows 122 cols
[2025-06-06 21:58:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 21:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:58:40] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-06 21:58: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/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:41] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 134 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5473 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 149/283 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:46] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:46] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:47] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:48] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:48] [INFO ] Deduced a trap along path composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:50] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:58:52] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 290 constraints, problems are : Problem set: 0 solved, 149 unsolved in 14129 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 19615ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 19615ms
Starting structural reductions in LTL mode, iteration 1 : 122/160 places, 150/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19739 ms. Remains : 122/160 places, 150/191 transitions.
[2025-06-06 21:58:59] [INFO ] Flatten gal took : 7 ms
[2025-06-06 21:58:59] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:59] [INFO ] Input system was already deterministic with 150 transitions.
[2025-06-06 21:58:59] [INFO ] Flatten gal took : 6 ms
[2025-06-06 21:58:59] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:58:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10640627356088142308.gal : 2 ms
[2025-06-06 21:58:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1994986575902571726.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/CTLFireability10640627356088142308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1994986575902571726.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.22716e+08,0.136798,10292,2,2182,5,30730,6,0,640,25359,0


Converting to forward existential form...Done !
original formula: AG((EF((p178==1)) * ((EG((p148==0)) + AX((((p135==0)&&((p2==0)||(p151==0)))&&(p83==1)))) + ((AF((p177==0)) * (p172==1)) * ((p89==0)||(p14...165
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (p178==1))))] = FALSE * (([FwdG((FwdU(Init,TRUE) * !((EG((p148==0)) + !(EX(!((((...493
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t15, t36, t38, t69, t92, t126, Intersection with reachable at each step enabled...205
(forward)formula 0,0,5.07013,160264,1,0,540,992505,328,307,3614,897725,677
FORMULA SmartHome-PT-06-CTLFireability-2025-02 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 : 160/160 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 137 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 137 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 137 transition count 167
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 127 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 127 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 123 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 123 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 123 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 120 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 120 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 119 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 119 transition count 148
Applied a total of 84 rules in 8 ms. Remains 119 /160 variables (removed 41) and now considering 148/191 (removed 43) transitions.
// Phase 1: matrix 148 rows 119 cols
[2025-06-06 21:59:04] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:04] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 21:59:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:04] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-06 21:59:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:06] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:06] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/267 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 131 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5216 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/267 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 147/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:11] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:14] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:16] [INFO ] Deduced a trap along path composed of 11 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:16] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 283 constraints, problems are : Problem set: 0 solved, 147 unsolved in 13319 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 18547ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 18549ms
Starting structural reductions in LTL mode, iteration 1 : 119/160 places, 148/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18685 ms. Remains : 119/160 places, 148/191 transitions.
[2025-06-06 21:59:23] [INFO ] Flatten gal took : 26 ms
[2025-06-06 21:59:23] [INFO ] Flatten gal took : 14 ms
[2025-06-06 21:59:23] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-06 21:59:23] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:23] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7755506856172723874.gal : 1 ms
[2025-06-06 21:59:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3559223044900185249.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/CTLFireability7755506856172723874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3559223044900185249.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22033e+08,0.23161,15148,2,3163,5,51263,6,0,626,51421,0


Converting to forward existential form...Done !
original formula: A(!(EX(EF((((p1==1)||(p88==1))&&(p4!=1))))) U (EF(((p189==1) * EG((p48==1)))) + ((p2==1)&&(p151==1))))
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((p189==1) * EG((p48==1)))) + ((p2==1)&&(p151==1))))))) * !(E(!((E(TRUE U ((p189==1) ...331
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t13, t15, t28, t31, t35, t60, t63, t67, t80, t83, t87, t105, t122, t123, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,14.2472,488136,1,0,653,3.15763e+06,332,411,3898,3.07726e+06,760
FORMULA SmartHome-PT-06-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Graph (trivial) has 151 edges and 160 vertex of which 61 / 160 are part of one of the 5 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 103 transition count 89
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 38 rules applied. Total rules applied 69 place count 73 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 69 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 73 place count 69 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 87 place count 62 transition count 74
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 97 place count 52 transition count 64
Iterating global reduction 3 with 10 rules applied. Total rules applied 107 place count 52 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 52 transition count 62
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 137 place count 38 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 38 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 37 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 148 place count 37 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 36 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 34 transition count 36
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 15 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 153 place count 32 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 155 place count 32 transition count 34
Applied a total of 155 rules in 17 ms. Remains 32 /160 variables (removed 128) and now considering 34/191 (removed 157) transitions.
[2025-06-06 21:59:37] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 32 cols
[2025-06-06 21:59:37] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 21:59:38] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2025-06-06 21:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-06 21:59:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 21:59:38] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 21:59:38] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2025-06-06 21:59:38] [INFO ] Invariant cache hit.
[2025-06-06 21:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 3/32 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 29/61 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:38] [INFO ] Deduced a trap along path composed of 8 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:38] [INFO ] Deduced a trap along path composed of 11 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/62 variables, and 42 constraints, problems are : Problem set: 0 solved, 22 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 3/32 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 29/61 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/62 variables, and 64 constraints, problems are : Problem set: 0 solved, 22 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 702ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/160 places, 34/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 789 ms. Remains : 32/160 places, 34/191 transitions.
[2025-06-06 21:59:38] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:59:38] [INFO ] Flatten gal took : 3 ms
[2025-06-06 21:59:38] [INFO ] Input system was already deterministic with 34 transitions.
[2025-06-06 21:59:38] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:59:38] [INFO ] Flatten gal took : 1 ms
[2025-06-06 21:59:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8327807362775256554.gal : 1 ms
[2025-06-06 21:59:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7445953752421997331.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/CTLFireability8327807362775256554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7445953752421997331.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2784,0.008578,3908,2,137,5,694,6,0,159,514,0


Converting to forward existential form...Done !
original formula: AG(E(((p60==1)||(p107==1)) U EF((p52==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p60==1)||(p107==1)) U E(TRUE U (p52==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,0,0.036483,5316,1,0,67,8361,88,36,906,8052,87
FORMULA SmartHome-PT-06-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 137 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 137 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 137 transition count 167
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 128 transition count 158
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 128 transition count 158
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 124 transition count 154
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 124 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 124 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 122 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 122 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 121 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 121 transition count 150
Applied a total of 80 rules in 13 ms. Remains 121 /160 variables (removed 39) and now considering 150/191 (removed 41) transitions.
// Phase 1: matrix 150 rows 121 cols
[2025-06-06 21:59:38] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 21:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 21:59:38] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-06 21:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:39] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:40] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/271 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 132 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5383 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/271 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 149/281 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:45] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:45] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:45] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:45] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:47] [INFO ] Deduced a trap along path composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 21:59:49] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 287 constraints, problems are : Problem set: 0 solved, 149 unsolved in 12616 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18011ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 18012ms
Starting structural reductions in LTL mode, iteration 1 : 121/160 places, 150/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18146 ms. Remains : 121/160 places, 150/191 transitions.
[2025-06-06 21:59:56] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:56] [INFO ] Flatten gal took : 5 ms
[2025-06-06 21:59:56] [INFO ] Input system was already deterministic with 150 transitions.
[2025-06-06 21:59:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:59:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 21:59:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14164415667163612696.gal : 1 ms
[2025-06-06 21:59:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7962804818707386649.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/CTLFireability14164415667163612696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7962804818707386649.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.77657e+08,0.124708,9652,2,1859,5,26080,6,0,636,25220,0


Converting to forward existential form...Done !
original formula: EX(EF(AX(((A((p157==1) U ((p42==1)&&(p188==1))) * ((p104==0)||(p188==0))) * ((p75==1)||(p6==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(!(((!((E(!(((p42==1)&&(p188==1))) U (!((p157==1)) * !(((p42==1)&&(p188==1))))) + EG...246
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t35, t67, t87, t90, t124, t125, Intersection with reachable at each step e...212
(forward)formula 0,1,4.83969,180304,1,0,600,1.08204e+06,330,331,3792,1.05282e+06,746
FORMULA SmartHome-PT-06-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 139 transition count 170
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 139 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 139 transition count 168
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 131 transition count 160
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 131 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 128 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 128 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 126 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 126 transition count 155
Applied a total of 70 rules in 15 ms. Remains 126 /160 variables (removed 34) and now considering 155/191 (removed 36) transitions.
// Phase 1: matrix 155 rows 126 cols
[2025-06-06 22:00:01] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 22:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:02] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-06 22:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:03] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:03] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 155/281 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 137 constraints, problems are : Problem set: 0 solved, 154 unsolved in 5621 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 155/281 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 154/291 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:08] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:09] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:10] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:13] [INFO ] Deduced a trap along path composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 295 constraints, problems are : Problem set: 0 solved, 154 unsolved in 14355 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 19987ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 19988ms
Starting structural reductions in LTL mode, iteration 1 : 126/160 places, 155/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20132 ms. Remains : 126/160 places, 155/191 transitions.
[2025-06-06 22:00:22] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:00:22] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:00:22] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-06 22:00:22] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:00:22] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:00:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7505558697614387024.gal : 1 ms
[2025-06-06 22:00:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8870883740144019561.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/CTLFireability7505558697614387024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8870883740144019561.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34988e+08,0.13179,10180,2,2073,5,28822,6,0,661,24520,0


Converting to forward existential form...Done !
original formula: AF(!(E(!((((p169==1)||(p81==1)) * AG((p183==1)))) U ((AX((p116==1)) * ((p114==1)||(p130==1))) * A((p123==1) U (p187==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!((((p169==1)||(p81==1)) * !(E(TRUE U !((p183==1)))))) U ((!(EX(!((p116==1)))) * ((p114==1)||(p...252
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t37, t76, t97, t131, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,1,5.19346,157520,1,0,549,978789,352,313,3926,855362,706
FORMULA SmartHome-PT-06-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 134 transition count 165
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 134 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 134 transition count 163
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 124 transition count 153
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 124 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 120 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 120 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 120 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 117 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 117 transition count 145
Applied a total of 89 rules in 13 ms. Remains 117 /160 variables (removed 43) and now considering 145/191 (removed 46) transitions.
// Phase 1: matrix 145 rows 117 cols
[2025-06-06 22:00:27] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 22:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:27] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-06 22:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:28] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:28] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 128 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5126 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/272 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:34] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:34] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:34] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:36] [INFO ] Deduced a trap along path composed of 22 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:36] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 277 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9988 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15121ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 15123ms
Starting structural reductions in LTL mode, iteration 1 : 117/160 places, 145/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15260 ms. Remains : 117/160 places, 145/191 transitions.
[2025-06-06 22:00:42] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:00:42] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:00:42] [INFO ] Input system was already deterministic with 145 transitions.
[2025-06-06 22:00:42] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:00:42] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:00:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4426754824561084657.gal : 1 ms
[2025-06-06 22:00:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8406194435054459221.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/CTLFireability4426754824561084657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8406194435054459221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.54506e+07,0.158042,11160,2,2055,5,33249,6,0,615,29862,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(AX((p108==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(!(EX(!((p108==0)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t35, t67, t87, t121, Intersection with reachable at each step enabled. (de...200
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.810356,36664,1,0,203,147115,320,135,3820,127021,327
FORMULA SmartHome-PT-06-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 134 transition count 165
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 134 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 134 transition count 163
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 63 place count 125 transition count 154
Iterating global reduction 1 with 9 rules applied. Total rules applied 72 place count 125 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 122 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 122 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 122 transition count 150
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 120 transition count 148
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 120 transition count 148
Applied a total of 83 rules in 3 ms. Remains 120 /160 variables (removed 40) and now considering 148/191 (removed 43) transitions.
// Phase 1: matrix 148 rows 120 cols
[2025-06-06 22:00:43] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 22:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:43] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-06 22:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:44] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:44] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/268 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/268 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 131 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5214 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/268 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 147/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:50] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:51] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:00:51] [INFO ] Deduced a trap along path composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 281 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 14459ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 14460ms
Starting structural reductions in LTL mode, iteration 1 : 120/160 places, 148/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14598 ms. Remains : 120/160 places, 148/191 transitions.
[2025-06-06 22:00:58] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:00:58] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:00:58] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-06 22:00:58] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:00:58] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:00:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10861204054478437804.gal : 1 ms
[2025-06-06 22:00:58] [INFO ] Time to serialize properties into /tmp/CTLFireability220742718933050309.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/CTLFireability10861204054478437804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability220742718933050309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0343e+08,0.167733,11304,2,2258,5,35207,6,0,630,31927,0


Converting to forward existential form...Done !
original formula: EX(EG((EG(EF((p128==1))) + (EG((p98==1)) * ((p2==0)||(p183==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(EG(E(TRUE U (p128==1))) + (EG((p98==1)) * ((p2==0)||(p183==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t36, t70, t90, t124, Intersection with reachable at each step enabled. (de...200
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.1966,478132,1,0,548,1.91486e+06,335,365,3919,3.51473e+06,590
FORMULA SmartHome-PT-06-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Graph (trivial) has 119 edges and 160 vertex of which 22 / 160 are part of one of the 3 SCC in 1 ms
Free SCC test removed 19 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 140 transition count 126
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 87 place count 100 transition count 120
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 97 transition count 118
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 100 place count 96 transition count 111
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 111 place count 89 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 113 place count 87 transition count 107
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 113 place count 87 transition count 101
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 125 place count 81 transition count 101
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 138 place count 68 transition count 88
Iterating global reduction 6 with 13 rules applied. Total rules applied 151 place count 68 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 156 place count 68 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 157 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 158 place count 66 transition count 82
Iterating global reduction 8 with 1 rules applied. Total rules applied 159 place count 66 transition count 82
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 183 place count 54 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 184 place count 54 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 186 place count 53 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 192 place count 53 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 193 place count 53 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 194 place count 52 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 195 place count 51 transition count 61
Applied a total of 195 rules in 29 ms. Remains 51 /160 variables (removed 109) and now considering 61/191 (removed 130) transitions.
[2025-06-06 22:01:14] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
// Phase 1: matrix 57 rows 51 cols
[2025-06-06 22:01:14] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:01:14] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 22:01:14] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2025-06-06 22:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:01:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-06 22:01:14] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:01:14] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-06 22:01:14] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2025-06-06 22:01:14] [INFO ] Invariant cache hit.
[2025-06-06 22:01:14] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 56/107 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/108 variables, and 63 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 56/107 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:15] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:16] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:16] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/108 variables, and 120 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2482ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2482ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/160 places, 61/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2594 ms. Remains : 51/160 places, 61/191 transitions.
[2025-06-06 22:01:16] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:01:16] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:01:16] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-06 22:01:16] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:01:16] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:01:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14261992062165525318.gal : 0 ms
[2025-06-06 22:01:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1584626432914958297.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/CTLFireability14261992062165525318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1584626432914958297.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,106248,0.02337,4356,2,453,5,2754,6,0,262,2265,0


Converting to forward existential form...Done !
original formula: (AG((p39==0)) + !(E(!((((((p73==1)&&(p188==1))||(p121==1)) * A((p211==1) U (p65==1))) + ((((p99==1)||(p132==1))&&(p15==1))&&(p174==1)))) ...212
=> equivalent forward existential formula: [((FwdU((Init * !(!(E(TRUE U !((p39==0)))))),!((((((p73==1)&&(p188==1))||(p121==1)) * !((E(!((p65==1)) U (!((p21...320
Reverse transition relation is NOT exact ! Due to transitions t26, t28, t33, t52, t53, Intersection with reachable at each step enabled. (destroyed/revers...184
(forward)formula 0,0,0.82306,38428,1,0,488,201562,166,298,1641,237584,627
FORMULA SmartHome-PT-06-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 136 transition count 165
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 128 transition count 157
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 128 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 124 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 124 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 124 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 122 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 122 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 121 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 121 transition count 149
Applied a total of 81 rules in 13 ms. Remains 121 /160 variables (removed 39) and now considering 149/191 (removed 42) transitions.
// Phase 1: matrix 149 rows 121 cols
[2025-06-06 22:01:17] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:01:17] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 22:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:01:17] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-06 22:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:18] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:18] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/270 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 132 constraints, problems are : Problem set: 0 solved, 148 unsolved in 5321 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/270 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 148/280 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:24] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:24] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:26] [INFO ] Deduced a trap along path composed of 13 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:26] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 284 constraints, problems are : Problem set: 0 solved, 148 unsolved in 11264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16593ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 16593ms
Starting structural reductions in LTL mode, iteration 1 : 121/160 places, 149/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16722 ms. Remains : 121/160 places, 149/191 transitions.
[2025-06-06 22:01:34] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:01:34] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:01:34] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-06 22:01:34] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:01:34] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8751853757519782778.gal : 1 ms
[2025-06-06 22:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4154185470150360934.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/CTLFireability8751853757519782778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4154185470150360934.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22537e+08,0.102515,8104,2,1511,5,19299,6,0,635,17621,0


Converting to forward existential form...Done !
original formula: E(((AG(!(AF((p164==1)))) + AG(!(AG((p83==1))))) + E(AX((p145==1)) U (p156==1))) U AF(!(E(EF((p58==1)) U EG((p53==1))))))
=> equivalent forward existential formula: [(FwdU(Init,((!(E(TRUE U !(!(!(EG(!((p164==1)))))))) + !(E(TRUE U !(!(!(E(TRUE U !((p83==1))))))))) + E(!(EX(!((...244
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t15, t35, t67, t89, t125, Intersection with reachable at each step enabled. (de...200
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.87996,267876,1,0,903,1.79472e+06,350,637,4172,1.50199e+06,1167
FORMULA SmartHome-PT-06-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 137 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 137 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 137 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 128 transition count 157
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 128 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 125 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 125 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 125 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 123 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 123 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 122 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 122 transition count 150
Applied a total of 79 rules in 12 ms. Remains 122 /160 variables (removed 38) and now considering 150/191 (removed 41) transitions.
// Phase 1: matrix 150 rows 122 cols
[2025-06-06 22:01:42] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:01:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 22:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:01:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-06 22:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:43] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:43] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 133 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5342 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/133 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 149/282 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:49] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:49] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:49] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:49] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:49] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:49] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:49] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 7/289 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:51] [INFO ] Deduced a trap along path composed of 22 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:01:51] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 291 constraints, problems are : Problem set: 0 solved, 149 unsolved in 10655 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16007ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 16007ms
Starting structural reductions in LTL mode, iteration 1 : 122/160 places, 150/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16138 ms. Remains : 122/160 places, 150/191 transitions.
[2025-06-06 22:01:58] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:01:58] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:01:58] [INFO ] Input system was already deterministic with 150 transitions.
[2025-06-06 22:01:58] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:01:58] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:01:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2268456057125677444.gal : 0 ms
[2025-06-06 22:01:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17146176179777148361.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/CTLFireability2268456057125677444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17146176179777148361.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.27047e+08,0.198866,12724,2,2571,5,41882,6,0,640,38721,0


Converting to forward existential form...Done !
original formula: E(AX(E(E((p170==1) U (p17==1)) U ((p34==1)||(p123==1)))) U (AG(((p42==1)&&(p188==1))) + AF((p14==1))))
=> equivalent forward existential formula: ([(FwdU(Init,!(EX(!(E(E((p170==1) U (p17==1)) U ((p34==1)||(p123==1))))))) * !(E(TRUE U !(((p42==1)&&(p188==1)))...277
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t15, t38, t71, t91, t123, t126, Intersection with reachable at each step en...211
(forward)formula 0,0,5.71952,191980,1,0,616,1.211e+06,343,358,3786,1.03244e+06,762
FORMULA SmartHome-PT-06-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Graph (trivial) has 143 edges and 160 vertex of which 45 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 118 transition count 102
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 45 rules applied. Total rules applied 82 place count 82 transition count 93
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 89 place count 77 transition count 91
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 93 place count 76 transition count 88
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 96 place count 73 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 96 place count 73 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 106 place count 68 transition count 83
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 118 place count 56 transition count 71
Iterating global reduction 5 with 12 rules applied. Total rules applied 130 place count 56 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 135 place count 56 transition count 66
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 137 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 138 place count 54 transition count 64
Iterating global reduction 7 with 1 rules applied. Total rules applied 139 place count 54 transition count 64
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 167 place count 40 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 168 place count 40 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 170 place count 39 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 178 place count 39 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 179 place count 38 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 181 place count 38 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 183 place count 36 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 184 place count 35 transition count 38
Applied a total of 184 rules in 11 ms. Remains 35 /160 variables (removed 125) and now considering 38/191 (removed 153) transitions.
[2025-06-06 22:02:04] [INFO ] Flow matrix only has 35 transitions (discarded 3 similar events)
// Phase 1: matrix 35 rows 35 cols
[2025-06-06 22:02:04] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:02:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-06 22:02:04] [INFO ] Flow matrix only has 35 transitions (discarded 3 similar events)
[2025-06-06 22:02:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:02:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:02:04] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-06 22:02:04] [INFO ] Flow matrix only has 35 transitions (discarded 3 similar events)
[2025-06-06 22:02:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 34/69 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/70 variables, and 42 constraints, problems are : Problem set: 0 solved, 26 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 34/69 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/70 variables, and 68 constraints, problems are : Problem set: 0 solved, 26 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 751ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/160 places, 38/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 847 ms. Remains : 35/160 places, 38/191 transitions.
[2025-06-06 22:02:05] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:02:05] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:02:05] [INFO ] Input system was already deterministic with 38 transitions.
[2025-06-06 22:02:05] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:02:05] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:02:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7461786141051419625.gal : 0 ms
[2025-06-06 22:02:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8833308520084375208.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/CTLFireability7461786141051419625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8833308520084375208.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3360,0.007114,3952,2,115,5,681,6,0,177,544,0


Converting to forward existential form...Done !
original formula: AG((EG((AF((p209==0)) + ((EG((p64==1)) * (p56==1)) * ((p50==0)&&((p215==0)||(p218==0)))))) * ((p151==0)||(p208==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((!(EG(!((p209==0)))) + ((EG((p64==1)) * (p56==1)) * ((p50==0)&&((p215==0)||(p218==0)))...228
(forward)formula 0,0,0.007778,4208,1,0,7,681,9,2,188,544,1
FORMULA SmartHome-PT-06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 136 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 136 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 136 transition count 166
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 126 transition count 156
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 126 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 122 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 122 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 122 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 119 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 119 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 118 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 118 transition count 147
Applied a total of 86 rules in 5 ms. Remains 118 /160 variables (removed 42) and now considering 147/191 (removed 44) transitions.
// Phase 1: matrix 147 rows 118 cols
[2025-06-06 22:02:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:02:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:02:05] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-06 22:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:06] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:06] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:06] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:06] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/265 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 131 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5208 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:11] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/265 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 146/278 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:12] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:13] [INFO ] Deduced a trap along path composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:17] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:02:17] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 283 constraints, problems are : Problem set: 0 solved, 146 unsolved in 15744 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 20964ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 20965ms
Starting structural reductions in LTL mode, iteration 1 : 118/160 places, 147/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21078 ms. Remains : 118/160 places, 147/191 transitions.
[2025-06-06 22:02:26] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:02:26] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:02:26] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-06 22:02:26] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:02:26] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:02:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9002923884814201196.gal : 0 ms
[2025-06-06 22:02:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6302108361078389982.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/CTLFireability9002923884814201196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6302108361078389982.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12218e+08,0.198264,12448,2,2234,5,39922,6,0,621,36106,0


Converting to forward existential form...Done !
original formula: EF(AX((!(E((p5==1) U (p190==1))) + ((p73==1)&&(p199==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(E((p5==1) U (p190==1))) + ((p73==1)&&(p199==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t13, t15, t35, t67, t87, t121, t122, Intersection with reachable at each step e...212
(forward)formula 0,1,5.01073,166012,1,0,607,1.06097e+06,315,335,3428,897296,723
FORMULA SmartHome-PT-06-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 191/191 transitions.
Graph (trivial) has 151 edges and 160 vertex of which 69 / 160 are part of one of the 5 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 95 transition count 80
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 66 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 63 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 69 place count 63 transition count 68
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 79 place count 58 transition count 68
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 91 place count 46 transition count 56
Iterating global reduction 3 with 12 rules applied. Total rules applied 103 place count 46 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 46 transition count 54
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 133 place count 32 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 32 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 31 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 145 place count 31 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 147 place count 29 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 149 place count 27 transition count 27
Applied a total of 149 rules in 17 ms. Remains 27 /160 variables (removed 133) and now considering 27/191 (removed 164) transitions.
[2025-06-06 22:02:31] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 27 cols
[2025-06-06 22:02:31] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:02:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:02:31] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2025-06-06 22:02:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:02:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:02:31] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-06 22:02:31] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2025-06-06 22:02:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 16 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 16 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/160 places, 27/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 487 ms. Remains : 27/160 places, 27/191 transitions.
[2025-06-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:02:31] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:02:31] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 22:02:31] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:02:31] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:02:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17402891052163297225.gal : 0 ms
[2025-06-06 22:02:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17738260737641881704.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17402891052163297225.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17738260737641881704.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17738260737641881704.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 192
Reachability property SmartHome-PT-06-CTLFireability-2023-15 is true.
FORMULA SmartHome-PT-06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,384,0.016028,3824,2,91,10,592,6,0,133,370,0
Total reachable state count : 384

Verifying 1 reachability properties.
Reachability property SmartHome-PT-06-CTLFireability-2023-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SmartHome-PT-06-CTLFireability-2023-15,1,0.016729,3952,2,28,10,592,7,0,151,370,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 40000 steps (5834 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1721 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 111 steps, run visited all 1 properties in 3 ms. (steps per millisecond=37 )
Probabilistic random walk after 111 steps, saw 83 distinct states, run finished after 3 ms. (steps per millisecond=37 ) properties seen :1
[2025-06-06 22:02:32] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:02:32] [INFO ] Flatten gal took : 4 ms
Total runtime 289277 ms.

BK_STOP 1749247352129

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

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

Sequence of Actions to be Executed by the VM

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

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

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

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