Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 68K 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-10-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-10-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-10-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-10-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-10-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749248504134

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 22:21:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 22:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:21:45] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-06 22:21:45] [INFO ] Transformed 273 places.
[2025-06-06 22:21:45] [INFO ] Transformed 308 transitions.
[2025-06-06 22:21:45] [INFO ] Found NUPN structural information;
[2025-06-06 22:21:45] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 187 transition count 217
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 187 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 187 transition count 215
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 181 transition count 209
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 181 transition count 209
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 177 transition count 205
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 177 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 176 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 176 transition count 204
Applied a total of 116 rules in 66 ms. Remains 176 /233 variables (removed 57) and now considering 204/263 (removed 59) transitions.
// Phase 1: matrix 204 rows 176 cols
[2025-06-06 22:21:45] [INFO ] Computed 12 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:45] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-06 22:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:45] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-06 22:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:49] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:49] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 204/380 variables, 176/198 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:53] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 199 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13112 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:00] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 204/380 variables, 176/200 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 203/403 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:02] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:02] [INFO ] Deduced a trap composed of 59 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 22:22:02] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:03] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:04] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:08] [INFO ] Deduced a trap along path composed of 19 places in 47 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:08] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:16] [INFO ] Deduced a trap along path composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 411 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43172ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 43181ms
Starting structural reductions in LTL mode, iteration 1 : 176/233 places, 204/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43656 ms. Remains : 176/233 places, 204/263 transitions.
Support contains 49 out of 176 places after structural reductions.
[2025-06-06 22:22:29] [INFO ] Flatten gal took : 30 ms
[2025-06-06 22:22:29] [INFO ] Flatten gal took : 16 ms
[2025-06-06 22:22:29] [INFO ] Input system was already deterministic with 204 transitions.
Reduction of identical properties reduced properties to check from 47 to 46
RANDOM walk for 40000 steps (282 resets) in 1336 ms. (29 steps per ms) remains 9/46 properties
BEST_FIRST walk for 40003 steps (48 resets) in 100 ms. (396 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 68 ms. (579 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (49 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (45 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
[2025-06-06 22:22:29] [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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 126/142 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:30] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 24/166 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/176 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:30] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 204/380 variables, 176/191 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/380 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 191 constraints, problems are : Problem set: 2 solved, 5 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 95/166 variables, 6/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/176 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 204/380 variables, 176/191 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 5/196 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/380 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 196 constraints, problems are : Problem set: 2 solved, 5 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 767ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 680 ms.
Support contains 8 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 204/204 transitions.
Graph (trivial) has 157 edges and 176 vertex of which 64 / 176 are part of one of the 5 SCC in 2 ms
Free SCC test removed 59 places
Drop transitions (Empty/Sink Transition effects.) removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 117 transition count 92
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 39 rules applied. Total rules applied 71 place count 86 transition count 84
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 9 rules applied. Total rules applied 80 place count 81 transition count 80
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 83 place count 79 transition count 79
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 78 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 85 place count 78 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 97 place count 72 transition count 72
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 103 place count 66 transition count 66
Iterating global reduction 5 with 6 rules applied. Total rules applied 109 place count 66 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 66 transition count 65
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 156 place count 43 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 130 edges and 43 vertex of which 41 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 7 rules applied. Total rules applied 163 place count 41 transition count 34
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 168 place count 41 transition count 29
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 173 place count 36 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 174 place count 35 transition count 28
Reduce places removed 4 places and 0 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 8 with 5 rules applied. Total rules applied 179 place count 31 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 180 place count 30 transition count 27
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 5 Pre rules applied. Total rules applied 180 place count 30 transition count 22
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 190 place count 25 transition count 22
Applied a total of 190 rules in 26 ms. Remains 25 /176 variables (removed 151) and now considering 22/204 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 25/176 places, 22/204 transitions.
RANDOM walk for 813 steps (73 resets) in 8 ms. (90 steps per ms) remains 0/5 properties
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2025-06-06 22:22:31] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:22:31] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:22:31] [INFO ] Input system was already deterministic with 204 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 159 transition count 187
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 159 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 159 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 153 transition count 180
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 153 transition count 180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 147 transition count 174
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 147 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 143 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 143 transition count 170
Applied a total of 67 rules in 14 ms. Remains 143 /176 variables (removed 33) and now considering 170/204 (removed 34) transitions.
// Phase 1: matrix 170 rows 143 cols
[2025-06-06 22:22:31] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:22:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 22:22:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:22:31] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-06-06 22:22: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/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:32] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:32] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 157 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6784 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 169/326 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:41] [INFO ] Deduced a trap along path composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 12031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18828ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 18829ms
Starting structural reductions in LTL mode, iteration 1 : 143/176 places, 170/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18983 ms. Remains : 143/176 places, 170/204 transitions.
[2025-06-06 22:22:50] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:22:50] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:22:50] [INFO ] Input system was already deterministic with 170 transitions.
[2025-06-06 22:22:50] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:22:50] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9830277359829965994.gal : 3 ms
[2025-06-06 22:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13551801364550523632.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/CTLFireability9830277359829965994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13551801364550523632.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.20668e+09,0.237206,14664,2,3776,5,53880,6,0,744,41024,0


Converting to forward existential form...Done !
original formula: (AX(EX(EX(AG(((p2==0)||(p89==0)))))) + EF(((p151==1)&&(p263==1))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U ((p151==1)&&(p263==1)))))) * !(EX(EX(!(E(TRUE U !(((p2==0)||(p89==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t143, Intersection with reachable at each step enabled. (destroyed/rever...187
(forward)formula 0,1,2.67119,104368,1,0,226,546140,363,157,4316,374338,382
FORMULA SmartHome-PT-10-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 161 transition count 189
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 161 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 161 transition count 188
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 158 transition count 185
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 158 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 155 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 155 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 154 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 154 transition count 181
Applied a total of 45 rules in 22 ms. Remains 154 /176 variables (removed 22) and now considering 181/204 (removed 23) transitions.
// Phase 1: matrix 181 rows 154 cols
[2025-06-06 22:22:53] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:22:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 22:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:22:53] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-06 22:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:54] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:22:54] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/335 variables, 154/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 168 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7533 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/335 variables, 154/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 180/348 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:02] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:02] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:02] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:03] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:03] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:05] [INFO ] Deduced a trap along path composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:09] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/335 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 355 constraints, problems are : Problem set: 0 solved, 180 unsolved in 19400 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 26945ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 26947ms
Starting structural reductions in LTL mode, iteration 1 : 154/176 places, 181/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27115 ms. Remains : 154/176 places, 181/204 transitions.
[2025-06-06 22:23:20] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:23:20] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:23:20] [INFO ] Input system was already deterministic with 181 transitions.
[2025-06-06 22:23:20] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:23:20] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:23:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3975517414148653850.gal : 2 ms
[2025-06-06 22:23:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13212009242806860834.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/CTLFireability3975517414148653850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13212009242806860834.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.06232e+09,0.319974,19048,2,6067,5,74111,6,0,799,56772,0


Converting to forward existential form...Done !
original formula: EF(EX(E((E((p232==1) U (p220==1)) + AX((p230==1))) U AX(((p34==1)&&(p76==1))))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),(E((p232==1) U (p220==1)) + !(EX(!((p230==1)))))) * !(EX(!(((p34==1)&&(p76==1))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t18, t65, t101, t125, t127, t154, Intersection with reachable at each step enabled...205
(forward)formula 0,1,3.19287,116720,1,0,240,492771,390,162,4466,447065,388
FORMULA SmartHome-PT-10-CTLFireability-2025-01 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 : 176/176 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 160 transition count 187
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 155 transition count 182
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 155 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 150 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 150 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 147 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 147 transition count 174
Applied a total of 59 rules in 9 ms. Remains 147 /176 variables (removed 29) and now considering 174/204 (removed 30) transitions.
// Phase 1: matrix 174 rows 147 cols
[2025-06-06 22:23:23] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:23:23] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 22:23:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:23:23] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-06 22:23:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:25] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:25] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 161 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 173/334 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:32] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:32] [INFO ] Deduced a trap composed of 51 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 22:23:32] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:23:35] [INFO ] Deduced a trap along path composed of 12 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:23:35] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 340 constraints, problems are : Problem set: 0 solved, 173 unsolved in 14589 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 21626ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 21627ms
Starting structural reductions in LTL mode, iteration 1 : 147/176 places, 174/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21779 ms. Remains : 147/176 places, 174/204 transitions.
[2025-06-06 22:23:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:23:45] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:23:45] [INFO ] Input system was already deterministic with 174 transitions.
[2025-06-06 22:23:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:23:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:23:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14404064811323948073.gal : 2 ms
[2025-06-06 22:23:45] [INFO ] Time to serialize properties into /tmp/CTLFireability18373958665727948677.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/CTLFireability14404064811323948073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18373958665727948677.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.31571e+09,0.308244,18428,2,5825,5,73776,6,0,764,52235,0


Converting to forward existential form...Done !
original formula: AF(EX(EX(AF((p217==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX(!(EG(!((p217==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t16, t66, t101, t147, Intersection with reachable at each step enabled. (destroyed...193
Detected timeout of ITS tools.
[2025-06-06 22:24:15] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:24:15] [INFO ] Applying decomposition
[2025-06-06 22:24:15] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11275479968368464211.txt' '-o' '/tmp/graph11275479968368464211.bin' '-w' '/tmp/graph11275479968368464211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11275479968368464211.bin' '-l' '-1' '-v' '-w' '/tmp/graph11275479968368464211.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:24:15] [INFO ] Decomposing Gal with order
[2025-06-06 22:24:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:24:15] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-06 22:24:15] [INFO ] Flatten gal took : 37 ms
[2025-06-06 22:24:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-06 22:24:15] [INFO ] Time to serialize gal into /tmp/CTLFireability291580491548858293.gal : 3 ms
[2025-06-06 22:24:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13844670010291665633.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/CTLFireability291580491548858293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13844670010291665633.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.31571e+09,0.050122,6108,303,74,4434,729,400,4870,80,1623,0


Converting to forward existential form...Done !
original formula: AF(EX(EX(AF((i8.i1.u35.p217==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX(!(EG(!((i8.i1.u35.p217==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t66, t101, i0.i0.u1.t147, i0.i0.u40.t13, i0.i0.u41.t12, i8.i0.u32.t16, Intersection with rea...232
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,5.49216,154972,1,0,305137,2030,2341,496951,444,10234,287325
FORMULA SmartHome-PT-10-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 163 transition count 191
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 163 transition count 191
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 159 transition count 187
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 159 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 156 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 156 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 154 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 154 transition count 182
Applied a total of 44 rules in 6 ms. Remains 154 /176 variables (removed 22) and now considering 182/204 (removed 22) transitions.
// Phase 1: matrix 182 rows 154 cols
[2025-06-06 22:24:21] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:24:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 22:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:24:21] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-06 22:24: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/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:22] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:22] [INFO ] Deduced a trap composed of 29 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:24:22] [INFO ] Deduced a trap composed of 18 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:24:22] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/336 variables, 154/170 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:24] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:25] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 172 constraints, problems are : Problem set: 0 solved, 181 unsolved in 8548 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/336 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 181/353 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:31] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:34] [INFO ] Deduced a trap along path composed of 17 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:34] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:34] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:24:36] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/336 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 358 constraints, problems are : Problem set: 0 solved, 181 unsolved in 17011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 25571ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 25571ms
Starting structural reductions in LTL mode, iteration 1 : 154/176 places, 182/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25714 ms. Remains : 154/176 places, 182/204 transitions.
[2025-06-06 22:24:46] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:24:46] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:24:46] [INFO ] Input system was already deterministic with 182 transitions.
[2025-06-06 22:24:46] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:24:46] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:24:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14424800037176308517.gal : 1 ms
[2025-06-06 22:24:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8528609884804946759.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/CTLFireability14424800037176308517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8528609884804946759.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.45073e+10,0.418271,21964,2,5698,5,89423,6,0,800,67771,0


Converting to forward existential form...Done !
original formula: (AG(EF((p57==1))) + (A((EF((p238!=1)) + !(((p132==1)||(p200==1)))) U ((!(EF((p210==1))) * !(AF((p84==1)))) * ((p151==1)&&(p268==1)))) * E...298
=> equivalent forward existential formula: [(FwdU((Init * !((!((E(!(((!(E(TRUE U (p210==1))) * !(!(EG(!((p84==1)))))) * ((p151==1)&&(p268==1)))) U (!((E(TR...606
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t16, t43, t70, t105, t126, t153, t154, Intersection with reachable at each st...216
Detected timeout of ITS tools.
[2025-06-06 22:25:17] [INFO ] Flatten gal took : 13 ms
[2025-06-06 22:25:17] [INFO ] Applying decomposition
[2025-06-06 22:25:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17568926781303886554.txt' '-o' '/tmp/graph17568926781303886554.bin' '-w' '/tmp/graph17568926781303886554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17568926781303886554.bin' '-l' '-1' '-v' '-w' '/tmp/graph17568926781303886554.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:25:17] [INFO ] Decomposing Gal with order
[2025-06-06 22:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:25:17] [INFO ] Removed a total of 35 redundant transitions.
[2025-06-06 22:25:17] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-06 22:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9428690703368321378.gal : 3 ms
[2025-06-06 22:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability9244412504933557.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/CTLFireability9428690703368321378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9244412504933557.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...259
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.45073e+10,0.048663,5932,331,74,3874,830,437,4669,85,1713,0


Converting to forward existential form...Done !
original formula: (AG(EF((i0.i0.u12.p57==1))) + (A((EF((i8.u43.p238!=1)) + !(((i4.u26.p132==1)||(i7.i0.u35.p200==1)))) U ((!(EF((i9.i1.u39.p210==1))) * !(A...434
=> equivalent forward existential formula: [(FwdU((Init * !((!((E(!(((!(E(TRUE U (i9.i1.u39.p210==1))) * !(!(EG(!((i2.i1.u18.p84==1)))))) * ((i4.u24.p151==...812
Reverse transition relation is NOT exact ! Due to transitions t16, t43, t70, t105, i0.i0.t126, i2.i1.u1.t153, i2.i1.u1.t154, i8.u43.t13, i8.u43.t14, i8.u44...261
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,0.880405,40364,1,0,71382,2619,3290,144484,552,9768,107685
FORMULA SmartHome-PT-10-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 160 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 154 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 154 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 148 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 148 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 144 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 144 transition count 171
Applied a total of 65 rules in 7 ms. Remains 144 /176 variables (removed 32) and now considering 171/204 (removed 33) transitions.
// Phase 1: matrix 171 rows 144 cols
[2025-06-06 22:25:18] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:18] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 22:25:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:18] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-06 22:25:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:19] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:19] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:19] [INFO ] Deduced a trap composed of 28 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:25:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 160 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6917 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 170/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:26] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:28] [INFO ] Deduced a trap along path composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:31] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 333 constraints, problems are : Problem set: 0 solved, 170 unsolved in 15447 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22373ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 22373ms
Starting structural reductions in LTL mode, iteration 1 : 144/176 places, 171/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22500 ms. Remains : 144/176 places, 171/204 transitions.
[2025-06-06 22:25:40] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:25:40] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:25:40] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-06 22:25:40] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:25:40] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11297616926821948991.gal : 1 ms
[2025-06-06 22:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15972317694752629042.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/CTLFireability11297616926821948991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15972317694752629042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.79347e+09,0.224526,14272,2,3700,5,51969,6,0,749,41214,0


Converting to forward existential form...Done !
original formula: EF(EG((((p190==0) * AX((p236==1))) * AX((((p250==1)&&(p253==1))&&(p256==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p190==0) * !(EX(!((p236==1))))) * !(EX(!((((p250==1)&&(p253==1))&&(p256==1)))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t16, t98, t144, Intersection with reachable at each step enabled. (destroyed/...192
(forward)formula 0,1,1.55236,62876,1,0,219,247569,368,148,4234,208673,365
FORMULA SmartHome-PT-10-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Graph (trivial) has 156 edges and 176 vertex of which 72 / 176 are part of one of the 5 SCC in 0 ms
Free SCC test removed 67 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 108 transition count 91
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 31 rules applied. Total rules applied 58 place count 82 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 79 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 61 place count 79 transition count 79
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 75 place count 72 transition count 79
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 84 place count 63 transition count 70
Iterating global reduction 3 with 9 rules applied. Total rules applied 93 place count 63 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 63 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 62 transition count 66
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 132 place count 45 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 45 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 138 place count 43 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 141 place count 43 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 142 place count 42 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 143 place count 41 transition count 41
Applied a total of 143 rules in 17 ms. Remains 41 /176 variables (removed 135) and now considering 41/204 (removed 163) transitions.
[2025-06-06 22:25:42] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
// Phase 1: matrix 36 rows 41 cols
[2025-06-06 22:25:42] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 22:25:42] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2025-06-06 22:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-06 22:25:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:25:42] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-06 22:25:42] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2025-06-06 22:25:42] [INFO ] Invariant cache hit.
[2025-06-06 22:25:42] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 35/76 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 72 constraints, problems are : Problem set: 0 solved, 40 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 35/76 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 40/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 112 constraints, problems are : Problem set: 0 solved, 40 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1626ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/176 places, 41/204 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1718 ms. Remains : 41/176 places, 41/204 transitions.
[2025-06-06 22:25:43] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:25:43] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:25:43] [INFO ] Input system was already deterministic with 41 transitions.
[2025-06-06 22:25:43] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:25:43] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:25:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14791891198626534205.gal : 0 ms
[2025-06-06 22:25:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9416747524309440798.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/CTLFireability14791891198626534205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9416747524309440798.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,12097,0.018177,4284,2,543,5,2597,6,0,202,1920,0


Converting to forward existential form...Done !
original formula: AF(EG(!(E(((p2==1)&&(p89==1)) U EF((p240==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(((p2==1)&&(p89==1)) U E(TRUE U (p240==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.208701,14652,1,0,233,61896,114,161,1317,64289,236
FORMULA SmartHome-PT-10-CTLFireability-2025-06 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 : 176/176 places, 204/204 transitions.
Graph (trivial) has 161 edges and 176 vertex of which 84 / 176 are part of one of the 6 SCC in 1 ms
Free SCC test removed 78 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 97 transition count 85
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 79 transition count 84
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 78 transition count 83
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 40 place count 78 transition count 75
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 56 place count 70 transition count 75
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 63 place count 63 transition count 68
Iterating global reduction 3 with 7 rules applied. Total rules applied 70 place count 63 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 63 transition count 67
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 109 place count 44 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 44 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 115 place count 42 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 120 place count 42 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 41 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 123 place count 39 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 124 place count 38 transition count 37
Applied a total of 124 rules in 25 ms. Remains 38 /176 variables (removed 138) and now considering 37/204 (removed 167) transitions.
[2025-06-06 22:25:44] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2025-06-06 22:25:44] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:25:44] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2025-06-06 22:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:44] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:25:44] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 22:25:44] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2025-06-06 22:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 31/69 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/70 variables, and 48 constraints, problems are : Problem set: 0 solved, 23 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 31/69 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/70 variables, and 71 constraints, problems are : Problem set: 0 solved, 23 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 641ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 641ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/176 places, 37/204 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 729 ms. Remains : 38/176 places, 37/204 transitions.
[2025-06-06 22:25:44] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:25:44] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:25:44] [INFO ] Input system was already deterministic with 37 transitions.
[2025-06-06 22:25:44] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:25:44] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:25:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11461392522140708338.gal : 1 ms
[2025-06-06 22:25:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13327183458014511249.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/CTLFireability11461392522140708338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13327183458014511249.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7936,0.016895,4344,2,743,5,3054,6,0,186,2174,0


Converting to forward existential form...Done !
original formula: EF(EG((p211==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p211==1))] != FALSE
Hit Full ! (commute/partial/dont) 35/0/2
(forward)formula 0,1,0.065503,6904,1,0,8,16162,19,2,923,8347,8
FORMULA SmartHome-PT-10-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 162 transition count 190
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 162 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 162 transition count 189
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 156 transition count 183
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 156 transition count 183
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 150 transition count 177
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 150 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 146 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 146 transition count 173
Applied a total of 61 rules in 15 ms. Remains 146 /176 variables (removed 30) and now considering 173/204 (removed 31) transitions.
// Phase 1: matrix 173 rows 146 cols
[2025-06-06 22:25:44] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 22:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:25:45] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2025-06-06 22:25:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:46] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:46] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/319 variables, 146/162 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:48] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 163 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7896 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:53] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/319 variables, 146/164 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 172/336 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:55] [INFO ] Deduced a trap along path composed of 13 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:25:55] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 338 constraints, problems are : Problem set: 0 solved, 172 unsolved in 13106 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 21013ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 21013ms
Starting structural reductions in LTL mode, iteration 1 : 146/176 places, 173/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21146 ms. Remains : 146/176 places, 173/204 transitions.
[2025-06-06 22:26:06] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:26:06] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:26:06] [INFO ] Input system was already deterministic with 173 transitions.
[2025-06-06 22:26:06] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:26:06] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:26:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17441714779069536658.gal : 1 ms
[2025-06-06 22:26:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15753347317344960670.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/CTLFireability17441714779069536658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15753347317344960670.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.71033e+09,0.200005,13120,2,3223,5,46121,6,0,759,37162,0


Converting to forward existential form...Done !
original formula: E(!(((!(E((p118==1) U AX(FALSE))) * AF((AX((p172==1)) + (p132==1)))) * !(EG((p119==1))))) U !(EF((p57==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(((!(E((p118==1) U !(EX(!(FALSE))))) * !(EG(!((!(EX(!((p172==1)))) + (p132==1)))))) * !(EG((p119==1...196
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t85, t86, t100, t146, t147, Intersection with reachable at each step enabled....204
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-06 22:26:36] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:26:36] [INFO ] Applying decomposition
[2025-06-06 22:26:36] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2549341121566946454.txt' '-o' '/tmp/graph2549341121566946454.bin' '-w' '/tmp/graph2549341121566946454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2549341121566946454.bin' '-l' '-1' '-v' '-w' '/tmp/graph2549341121566946454.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:26:36] [INFO ] Decomposing Gal with order
[2025-06-06 22:26:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:26:36] [INFO ] Removed a total of 38 redundant transitions.
[2025-06-06 22:26:36] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-06 22:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8110123605813302599.gal : 2 ms
[2025-06-06 22:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6723361624109532172.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/CTLFireability8110123605813302599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6723361624109532172.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.71033e+09,0.053716,6248,329,80,4663,836,418,5312,83,1724,0


Converting to forward existential form...Done !
original formula: E(!(((!(E((i4.i1.u23.p118==1) U AX(FALSE))) * AF((AX((i6.i0.u32.p172==1)) + (i5.u26.p132==1)))) * !(EG((i4.i1.u20.p119==1))))) U !(EF((i0...169
=> equivalent forward existential formula: [(FwdU(Init,!(((!(E((i4.i1.u23.p118==1) U !(EX(!(FALSE))))) * !(EG(!((!(EX(!((i6.i0.u32.p172==1)))) + (i5.u26.p1...239
Reverse transition relation is NOT exact ! Due to transitions t15, t100, i0.t147, i3.i0.u1.t146, i3.i0.u45.t13, i3.i0.u46.t12, i4.i1.u20.t85, i4.i1.u23.t86...256
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,6.76157,168296,1,0,346080,2070,2562,512738,468,8865,310180
FORMULA SmartHome-PT-10-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 160 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 154 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 154 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 149 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 149 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 147 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 147 transition count 174
Applied a total of 59 rules in 5 ms. Remains 147 /176 variables (removed 29) and now considering 174/204 (removed 30) transitions.
// Phase 1: matrix 174 rows 147 cols
[2025-06-06 22:26:42] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:26:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 22:26:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:26:43] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-06 22:26: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/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:26:44] [INFO ] Deduced a trap composed of 17 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 22:26:44] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 161 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6885 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 173/334 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:26:51] [INFO ] Deduced a trap composed of 19 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 22:26:51] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:26:53] [INFO ] Deduced a trap along path composed of 18 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:26:53] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 338 constraints, problems are : Problem set: 0 solved, 173 unsolved in 12035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18929ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 18929ms
Starting structural reductions in LTL mode, iteration 1 : 147/176 places, 174/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19075 ms. Remains : 147/176 places, 174/204 transitions.
[2025-06-06 22:27:02] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:27:02] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:27:02] [INFO ] Input system was already deterministic with 174 transitions.
[2025-06-06 22:27:02] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:27:02] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:27:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5872542656921356118.gal : 1 ms
[2025-06-06 22:27:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6757956813480275483.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/CTLFireability5872542656921356118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6757956813480275483.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,5.71728e+09,0.262848,16340,2,4268,5,60412,6,0,764,49895,0


Converting to forward existential form...Done !
original formula: EX((((p1==1) * AX(AX((p36==0)))) * (!(E((p84!=1) U (p78==1))) * EG((p132==0)))))
=> equivalent forward existential formula: [FwdG(((EY(Init) * ((p1==1) * !(EX(!(!(EX(!((p36==0))))))))) * !(E((p84!=1) U (p78==1)))),(p132==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t98, t120, t147, Intersection with reachable at each step enabled. (destroyed...193
Hit Full ! (commute/partial/dont) 171/0/3
(forward)formula 0,1,3.48534,133160,1,0,257,725793,381,174,4552,563438,410
FORMULA SmartHome-PT-10-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 160 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 154 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 154 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 149 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 149 transition count 176
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 146 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 146 transition count 173
Applied a total of 61 rules in 9 ms. Remains 146 /176 variables (removed 30) and now considering 173/204 (removed 31) transitions.
// Phase 1: matrix 173 rows 146 cols
[2025-06-06 22:27:05] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:27:05] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 22:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:27:05] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2025-06-06 22:27: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/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:07] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:07] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/319 variables, 146/160 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 160 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6967 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/319 variables, 146/160 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 172/332 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:14] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:15] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:18] [INFO ] Deduced a trap along path composed of 11 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:18] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/319 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 336 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 21028ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 21029ms
Starting structural reductions in LTL mode, iteration 1 : 146/176 places, 173/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21156 ms. Remains : 146/176 places, 173/204 transitions.
[2025-06-06 22:27:26] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:27:26] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:27:26] [INFO ] Input system was already deterministic with 173 transitions.
[2025-06-06 22:27:26] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:27:26] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:27:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13419339238864855717.gal : 1 ms
[2025-06-06 22:27:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10299748052895733040.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/CTLFireability13419339238864855717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10299748052895733040.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.42653e+09,0.261736,16324,2,4501,5,59890,6,0,759,46165,0


Converting to forward existential form...Done !
original formula: EX((AF(((p60==0) + AG(((p230==0)||(p235==0))))) * EX(AG(((p151==0)||(p263==0))))))
=> equivalent forward existential formula: [(EY((EY(Init) * !(EG(!(((p60==0) + !(E(TRUE U !(((p230==0)||(p235==0))))))))))) * !(E(TRUE U !(((p151==0)||(p26...175
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t119, t146, Intersection with reachable at each step enabled. (destroyed...193
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.78516,102692,1,0,239,503908,379,164,4737,370103,396
FORMULA SmartHome-PT-10-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 160 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 154 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 154 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 148 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 148 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 144 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 144 transition count 171
Applied a total of 65 rules in 12 ms. Remains 144 /176 variables (removed 32) and now considering 171/204 (removed 33) transitions.
// Phase 1: matrix 171 rows 144 cols
[2025-06-06 22:27:29] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:27:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 22:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:27:29] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-06 22:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:31] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:31] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 158 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6702 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 170/328 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:37] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:39] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:41] [INFO ] Deduced a trap along path composed of 13 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:41] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 332 constraints, problems are : Problem set: 0 solved, 170 unsolved in 13516 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20224ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 20225ms
Starting structural reductions in LTL mode, iteration 1 : 144/176 places, 171/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20362 ms. Remains : 144/176 places, 171/204 transitions.
[2025-06-06 22:27:49] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:27:49] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:27:49] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-06 22:27:49] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:27:49] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:27:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12575706359695653039.gal : 1 ms
[2025-06-06 22:27:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4409078846558890676.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/CTLFireability12575706359695653039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4409078846558890676.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.28152e+09,0.28702,16960,2,4182,5,64649,6,0,749,52597,0


Converting to forward existential form...Done !
original formula: (AX((p16==1)) + AG(((p57==0)||(p271==0))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!((p16==1)))))),TRUE) * !(((p57==0)||(p271==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t13, t15, t97, t141, t144, Intersection with reachable at each step enabled. (destr...197
(forward)formula 0,0,1.94978,77088,1,0,212,287737,362,145,4344,242763,352
FORMULA SmartHome-PT-10-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 160 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 154 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 154 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 148 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 148 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 144 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 144 transition count 171
Applied a total of 65 rules in 4 ms. Remains 144 /176 variables (removed 32) and now considering 171/204 (removed 33) transitions.
// Phase 1: matrix 171 rows 144 cols
[2025-06-06 22:27:51] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:27:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-06 22:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:27:52] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-06 22:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:27:53] [INFO ] Deduced a trap composed of 16 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:27:53] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 158 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6505 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 170/328 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:28:00] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:28:02] [INFO ] Deduced a trap along path composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:28:05] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 331 constraints, problems are : Problem set: 0 solved, 170 unsolved in 16624 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 23137ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 23137ms
Starting structural reductions in LTL mode, iteration 1 : 144/176 places, 171/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23258 ms. Remains : 144/176 places, 171/204 transitions.
[2025-06-06 22:28:15] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:28:15] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:28:15] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-06 22:28:15] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:28:15] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:28:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1293554567534827292.gal : 1 ms
[2025-06-06 22:28:15] [INFO ] Time to serialize properties into /tmp/CTLFireability705723135064001683.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/CTLFireability1293554567534827292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability705723135064001683.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.5516e+09,0.053481,6076,2,905,5,7826,6,0,749,8361,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(AF(EX((p150==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EG(!(EX((p150==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t13, t15, t64, t98, t144, Intersection with reachable at each step enabled. (destro...196
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.7991,151048,1,0,689,794147,371,461,4566,1.14143e+06,778
FORMULA SmartHome-PT-10-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 159 transition count 187
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 159 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 159 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 153 transition count 180
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 153 transition count 180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 147 transition count 174
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 147 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 143 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 143 transition count 170
Applied a total of 67 rules in 4 ms. Remains 143 /176 variables (removed 33) and now considering 170/204 (removed 34) transitions.
// Phase 1: matrix 170 rows 143 cols
[2025-06-06 22:28:19] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:28:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:28:19] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-06-06 22:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:28:20] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:28:20] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 157 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6444 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/157 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 169/326 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:28:27] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:28:29] [INFO ] Deduced a trap along path composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 11856 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18308ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 18308ms
Starting structural reductions in LTL mode, iteration 1 : 143/176 places, 170/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18437 ms. Remains : 143/176 places, 170/204 transitions.
[2025-06-06 22:28:37] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:28:37] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:28:37] [INFO ] Input system was already deterministic with 170 transitions.
[2025-06-06 22:28:37] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:28:37] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:28:37] [INFO ] Time to serialize gal into /tmp/CTLFireability372509684545046711.gal : 0 ms
[2025-06-06 22:28:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8100654598044979062.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/CTLFireability372509684545046711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8100654598044979062.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.20668e+09,0.235116,14900,2,3776,5,53880,6,0,744,41024,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((A((p192==1) U (p183==1)) * (p120==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((!((E(!((p183==1)) U (!((p192==1)) * !((p183==1)))) + EG(!((p183==1))))) *...181
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t143, Intersection with reachable at each step enabled. (destroyed/rever...187
(forward)formula 0,1,9.14592,322908,1,0,658,2.02036e+06,373,376,4419,1.65414e+06,849
FORMULA SmartHome-PT-10-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 204/204 transitions.
Graph (trivial) has 154 edges and 176 vertex of which 62 / 176 are part of one of the 4 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 117 transition count 98
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 39 rules applied. Total rules applied 71 place count 86 transition count 90
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 78 place count 81 transition count 88
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 80 transition count 87
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 80 place count 80 transition count 80
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 94 place count 73 transition count 80
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 103 place count 64 transition count 71
Iterating global reduction 4 with 9 rules applied. Total rules applied 112 place count 64 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 115 place count 64 transition count 68
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 63 transition count 67
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 155 place count 44 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 44 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 161 place count 42 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 167 place count 42 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 169 place count 40 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 171 place count 38 transition count 36
Applied a total of 171 rules in 17 ms. Remains 38 /176 variables (removed 138) and now considering 36/204 (removed 168) transitions.
[2025-06-06 22:28:46] [INFO ] Flow matrix only has 33 transitions (discarded 3 similar events)
// Phase 1: matrix 33 rows 38 cols
[2025-06-06 22:28:46] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:28:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 22:28:46] [INFO ] Flow matrix only has 33 transitions (discarded 3 similar events)
[2025-06-06 22:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:28:46] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:28:46] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-06 22:28:46] [INFO ] Flow matrix only has 33 transitions (discarded 3 similar events)
[2025-06-06 22:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/71 variables, and 48 constraints, problems are : Problem set: 0 solved, 26 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 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/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 26/74 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/70 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/71 variables, and 74 constraints, problems are : Problem set: 0 solved, 26 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 713ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/176 places, 36/204 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 805 ms. Remains : 38/176 places, 36/204 transitions.
[2025-06-06 22:28:47] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:28:47] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:28:47] [INFO ] Input system was already deterministic with 36 transitions.
[2025-06-06 22:28:47] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:28:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:28:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5663670643336057346.gal : 0 ms
[2025-06-06 22:28:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7483119288195243717.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/CTLFireability5663670643336057346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7483119288195243717.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,8928,0.028748,4860,2,1514,5,5321,6,0,187,3823,0


Converting to forward existential form...Done !
original formula: AF(AG((EF((p151==0)) + (p89==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U (p151==0)) + (p89==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.112097,9212,1,0,9,25285,21,3,931,13192,8
FORMULA SmartHome-PT-10-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 22:28:47] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:28:47] [INFO ] Flatten gal took : 4 ms
Total runtime 422474 ms.

BK_STOP 1749248927780

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

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