Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 92K 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-13-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-13-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-13-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-13-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-13-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749249536851

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 22:38:57] [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:38:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:38:58] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-06-06 22:38:58] [INFO ] Transformed 385 places.
[2025-06-06 22:38:58] [INFO ] Transformed 407 transitions.
[2025-06-06 22:38:58] [INFO ] Found NUPN structural information;
[2025-06-06 22:38:58] [INFO ] Parsed PT model containing 385 places and 407 transitions and 935 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 113 places in 4 ms
Reduce places removed 113 places and 88 transitions.
FORMULA SmartHome-PT-13-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 262 transition count 319
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 78 place count 194 transition count 251
Iterating global reduction 1 with 68 rules applied. Total rules applied 146 place count 194 transition count 251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 194 transition count 243
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 167 place count 181 transition count 230
Iterating global reduction 2 with 13 rules applied. Total rules applied 180 place count 181 transition count 230
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 189 place count 172 transition count 221
Iterating global reduction 2 with 9 rules applied. Total rules applied 198 place count 172 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 172 transition count 220
Applied a total of 199 rules in 68 ms. Remains 172 /272 variables (removed 100) and now considering 220/319 (removed 99) transitions.
// Phase 1: matrix 220 rows 172 cols
[2025-06-06 22:38:58] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:38:58] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-06 22:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:38:58] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-06 22:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/392 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 175 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9866 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/392 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 219/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:39:15] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 9 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/392 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 395 constraints, problems are : Problem set: 0 solved, 219 unsolved in 17495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27412ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 27427ms
Starting structural reductions in LTL mode, iteration 1 : 172/272 places, 220/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27861 ms. Remains : 172/272 places, 220/319 transitions.
Support contains 52 out of 172 places after structural reductions.
[2025-06-06 22:39:26] [INFO ] Flatten gal took : 30 ms
[2025-06-06 22:39:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-13-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 22:39:26] [INFO ] Flatten gal took : 19 ms
[2025-06-06 22:39:26] [INFO ] Input system was already deterministic with 220 transitions.
Support contains 47 out of 172 places (down from 52) after GAL structural reductions.
FORMULA SmartHome-PT-13-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (229 resets) in 901 ms. (44 steps per ms) remains 1/45 properties
BEST_FIRST walk for 40004 steps (31 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2025-06-06 22:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/40 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/96 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/99 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 85/184 variables, 35/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 73/257 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 64/321 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 53/374 variables, 28/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/389 variables, 11/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/392 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/392 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/40 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/96 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/99 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 85/184 variables, 35/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/257 variables, 34/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/321 variables, 30/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 53/374 variables, 28/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 15/389 variables, 11/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/392 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 220/220 transitions.
Graph (trivial) has 175 edges and 172 vertex of which 93 / 172 are part of one of the 7 SCC in 2 ms
Free SCC test removed 86 places
Drop transitions (Empty/Sink Transition effects.) removed 125 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 128 transitions.
Graph (complete) has 125 edges and 86 vertex of which 71 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 71 transition count 42
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 83 place count 39 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 36 transition count 36
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 86 place count 36 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 30 transition count 30
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 26 transition count 26
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 26 transition count 26
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 24 transition count 24
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 24 transition count 24
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 134 place count 12 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 16 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 139 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 8 transition count 5
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 145 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 147 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 147 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 149 place count 2 transition count 2
Applied a total of 149 rules in 17 ms. Remains 2 /172 variables (removed 170) and now considering 2/220 (removed 218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 2/172 places, 2/220 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
[2025-06-06 22:39:27] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:39:27] [INFO ] Flatten gal took : 9 ms
[2025-06-06 22:39:27] [INFO ] Input system was already deterministic with 220 transitions.
Computed a total of 46 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 158 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 158 transition count 206
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 158 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 153 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 153 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 149 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 149 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 147 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 147 transition count 194
Applied a total of 51 rules in 14 ms. Remains 147 /172 variables (removed 25) and now considering 194/220 (removed 26) transitions.
// Phase 1: matrix 194 rows 147 cols
[2025-06-06 22:39:27] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 22:39:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:27] [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 193 sub problems to find dead transitions.
[2025-06-06 22:39:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7384 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:39:37] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 344 constraints, problems are : Problem set: 0 solved, 193 unsolved in 11333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18737ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 18738ms
Starting structural reductions in LTL mode, iteration 1 : 147/172 places, 194/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18872 ms. Remains : 147/172 places, 194/220 transitions.
[2025-06-06 22:39:45] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:39:45] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:39:46] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-06 22:39:46] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:39:46] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:39:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6799567428328851527.gal : 4 ms
[2025-06-06 22:39:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1019429410728304462.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/CTLFireability6799567428328851527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1019429410728304462.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.89096e+11,0.188435,12076,2,2214,5,36956,6,0,777,40002,0


Converting to forward existential form...Done !
original formula: A(EX(((p254==1) * AF((p143!=1)))) U EF(EG((p234==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EG((p234==1))))))) * !(E(!(E(TRUE U EG((p234==1)))) U (!(EX(((p254==1) * !(EG(!((p143!...207
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t31, t60, t92, t95, t112, t115, t132, t135, t147, t166, t169, t172, t174, t178,...256
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.66735,248636,1,0,678,1.47263e+06,428,450,4781,1.71113e+06,825
FORMULA SmartHome-PT-13-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Graph (trivial) has 141 edges and 172 vertex of which 37 / 172 are part of one of the 5 SCC in 2 ms
Free SCC test removed 32 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 140 transition count 138
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 51 rules applied. Total rules applied 94 place count 98 transition count 129
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 105 place count 93 transition count 123
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 110 place count 88 transition count 123
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 110 place count 88 transition count 114
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 128 place count 79 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 76 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 76 transition count 110
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 4 with 1 rules applied. Total rules applied 135 place count 76 transition count 109
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 137 place count 75 transition count 108
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 179 place count 54 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 184 place count 54 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 185 place count 53 transition count 81
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 8 with 4 rules applied. Total rules applied 189 place count 51 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 193 place count 51 transition count 75
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 196 place count 51 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 198 place count 51 transition count 73
Applied a total of 198 rules in 34 ms. Remains 51 /172 variables (removed 121) and now considering 73/220 (removed 147) transitions.
[2025-06-06 22:39:52] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
// Phase 1: matrix 66 rows 51 cols
[2025-06-06 22:39:52] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 22:39:52] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2025-06-06 22:39:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-06 22:39:52] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 75 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/172 places, 73/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 113 ms. Remains : 50/172 places, 73/220 transitions.
[2025-06-06 22:39:52] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:39:52] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:39:52] [INFO ] Input system was already deterministic with 73 transitions.
[2025-06-06 22:39:52] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:39:52] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11777445834689111814.gal : 1 ms
[2025-06-06 22:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15583835065548979406.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/CTLFireability11777445834689111814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15583835065548979406.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3999e+07,0.014416,4276,2,398,5,2448,6,0,263,2180,0


Converting to forward existential form...Done !
original formula: (((EF((EF((EF((p266==1)) + (p167==0))) + ((EF(((p254==0)||(p291==0))) * (p68==1)) * ((p274==0)&&(p123==0))))) * AF((p132==1))) * (AF((E((...305
=> equivalent forward existential formula: ([((Init * !(((E(TRUE U (E(TRUE U (E(TRUE U (p266==1)) + (p167==0))) + ((E(TRUE U ((p254==0)||(p291==0))) * (p68...770
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t16, t21, t26, t29, t31, t32, t35, t37, t40, t50, t62, Intersection with reachable ...224
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.14773,56792,1,0,594,267979,201,359,1734,448601,676
FORMULA SmartHome-PT-13-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Graph (trivial) has 174 edges and 172 vertex of which 91 / 172 are part of one of the 7 SCC in 0 ms
Free SCC test removed 84 places
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 87 transition count 78
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 57 transition count 72
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 54 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 53 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 72 place count 53 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 78 place count 50 transition count 68
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 84 place count 44 transition count 62
Iterating global reduction 4 with 6 rules applied. Total rules applied 90 place count 44 transition count 62
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 4 with 38 rules applied. Total rules applied 128 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 24 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 143 place count 24 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 22 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 145 place count 22 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 147 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 20 transition count 27
Applied a total of 148 rules in 13 ms. Remains 20 /172 variables (removed 152) and now considering 27/220 (removed 193) transitions.
[2025-06-06 22:39:54] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 20 cols
[2025-06-06 22:39:54] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-06 22:39:54] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:39:54] [INFO ] Redundant transitions in 19 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 22:39:54] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 22:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/41 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 206 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 323ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/172 places, 27/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 407 ms. Remains : 20/172 places, 27/220 transitions.
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:39:54] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 87 steps (8 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-13-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:39:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17668775949107751096.gal : 0 ms
[2025-06-06 22:39:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12093659204160245978.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17668775949107751096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12093659204160245978.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Graph (trivial) has 173 edges and 172 vertex of which 86 / 172 are part of one of the 7 SCC in 2 ms
Free SCC test removed 79 places
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 92 transition count 83
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 71 place count 60 transition count 77
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 57 transition count 76
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 77 place count 56 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 77 place count 56 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 52 transition count 71
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 91 place count 46 transition count 65
Iterating global reduction 4 with 6 rules applied. Total rules applied 97 place count 46 transition count 65
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 4 with 38 rules applied. Total rules applied 135 place count 27 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 27 transition count 44
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 141 place count 25 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 153 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 155 place count 23 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 155 place count 23 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 157 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 21 transition count 28
Applied a total of 158 rules in 13 ms. Remains 21 /172 variables (removed 151) and now considering 28/220 (removed 192) transitions.
[2025-06-06 22:39:54] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 22:39:54] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-06 22:39:54] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 22:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:39:54] [INFO ] Redundant transitions in 18 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 22:39:54] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 22:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 182 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 307ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/172 places, 28/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 391 ms. Remains : 21/172 places, 28/220 transitions.
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 1 ms
[2025-06-06 22:39:54] [INFO ] Input system was already deterministic with 28 transitions.
RANDOM walk for 40 steps (2 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-13-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:39:54] [INFO ] Flatten gal took : 2 ms
[2025-06-06 22:39:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11473297434196797394.gal : 1 ms
[2025-06-06 22:39:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2532662390044360743.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11473297434196797394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2532662390044360743.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality2532662390044360743.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.004641,4004,2,24,5,80,6,0,94,38,0
Total reachable state count : 8

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 158 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 158 transition count 206
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 158 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 153 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 153 transition count 200
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 148 transition count 195
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 148 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 146 transition count 193
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 146 transition count 193
Applied a total of 53 rules in 8 ms. Remains 146 /172 variables (removed 26) and now considering 193/220 (removed 27) transitions.
// Phase 1: matrix 193 rows 146 cols
[2025-06-06 22:39:54] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-06 22:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:39:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-06 22:39:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 7336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:40:05] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 342 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18893ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 18893ms
Starting structural reductions in LTL mode, iteration 1 : 146/172 places, 193/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19004 ms. Remains : 146/172 places, 193/220 transitions.
[2025-06-06 22:40:13] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:40:13] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:40:13] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-06 22:40:13] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:40:13] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:40:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8066701771155058045.gal : 2 ms
[2025-06-06 22:40:13] [INFO ] Time to serialize properties into /tmp/CTLFireability15273955135355343370.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/CTLFireability8066701771155058045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15273955135355343370.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88956e+11,0.165769,11712,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: AX((AX(FALSE) + (p151==1)))
=> equivalent forward existential formula: [(EY((EY(Init) * !((p151==1)))) * !(FALSE))] = FALSE
(forward)formula 0,0,0.17447,11968,1,0,9,35115,9,3,948,37329,3
FORMULA SmartHome-PT-13-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 160 transition count 208
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 160 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 160 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 156 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 156 transition count 203
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 152 transition count 199
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 152 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 150 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 150 transition count 197
Applied a total of 45 rules in 7 ms. Remains 150 /172 variables (removed 22) and now considering 197/220 (removed 23) transitions.
// Phase 1: matrix 197 rows 150 cols
[2025-06-06 22:40:14] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:40:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 22:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:40:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-06 22:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 153 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7533 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 196/349 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:40:24] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 350 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19779ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 19779ms
Starting structural reductions in LTL mode, iteration 1 : 150/172 places, 197/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19899 ms. Remains : 150/172 places, 197/220 transitions.
[2025-06-06 22:40:34] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:40:34] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:40:34] [INFO ] Input system was already deterministic with 197 transitions.
[2025-06-06 22:40:34] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:40:34] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5345288212817000930.gal : 1 ms
[2025-06-06 22:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12402084820089146363.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/CTLFireability5345288212817000930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12402084820089146363.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.96951e+11,0.191669,12548,2,2397,5,39414,6,0,792,42616,0


Converting to forward existential form...Done !
original formula: EG((EF((E((p198==1) U (p97==1)) + (EG((p257==1)) * A((p268==1) U (p128==1))))) + ((p281==1) * (E(EX((p48==1)) U AG((p122==1))) + ((AX((p1...211
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (E((p198==1) U (p97==1)) + (EG((p257==1)) * !((E(!((p128==1)) U (!((p268==1)) * !((p128==1)...378
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t33, t62, t95, t98, t115, t118, t135, t138, t150, t169, t172, t175, t177, t181,...256
Detected timeout of ITS tools.
[2025-06-06 22:41:04] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:41:04] [INFO ] Applying decomposition
[2025-06-06 22:41:04] [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/graph6130615246219355150.txt' '-o' '/tmp/graph6130615246219355150.bin' '-w' '/tmp/graph6130615246219355150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6130615246219355150.bin' '-l' '-1' '-v' '-w' '/tmp/graph6130615246219355150.weights' '-q' '0' '-e' '0.001'
[2025-06-06 22:41:04] [INFO ] Decomposing Gal with order
[2025-06-06 22:41:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 22:41:04] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-06 22:41:04] [INFO ] Flatten gal took : 40 ms
[2025-06-06 22:41:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-06 22:41:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7724764936086010514.gal : 3 ms
[2025-06-06 22:41:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6529026716285630502.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/CTLFireability7724764936086010514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6529026716285630502.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,1.96951e+11,0.060213,6492,341,39,4289,349,414,9011,56,876,0


Converting to forward existential form...Done !
original formula: EG((EF((E((i5.i1.u34.p198==1) U (i1.u8.p97==1)) + (EG((i6.i2.u46.p257==1)) * A((i8.u50.p268==1) U (i2.u13.p128==1))))) + ((i8.u48.p281==1...305
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (E((i5.i1.u34.p198==1) U (i1.u8.p97==1)) + (EG((i6.i2.u46.p257==1)) * !((E(!((i2.u13.p128==...500
Reverse transition relation is NOT exact ! Due to transitions t10, t98, t118, t138, i0.u4.t169, i1.t177, i1.u8.t150, i1.u8.t175, i2.u13.t135, i3.i0.u54.t8,...357
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,14.2737,240476,1,0,350079,593,2585,780530,278,2634,276906
FORMULA SmartHome-PT-13-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 158 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 158 transition count 206
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 158 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 153 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 153 transition count 200
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 148 transition count 195
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 148 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 146 transition count 193
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 146 transition count 193
Applied a total of 53 rules in 6 ms. Remains 146 /172 variables (removed 26) and now considering 193/220 (removed 27) transitions.
// Phase 1: matrix 193 rows 146 cols
[2025-06-06 22:41:18] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 22:41:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:18] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-06 22:41: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/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 7175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:41:29] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 342 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18698ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 18699ms
Starting structural reductions in LTL mode, iteration 1 : 146/172 places, 193/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18816 ms. Remains : 146/172 places, 193/220 transitions.
[2025-06-06 22:41:37] [INFO ] Flatten gal took : 12 ms
[2025-06-06 22:41:37] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:41:37] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-06 22:41:37] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:41:37] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:41:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12933501984047961697.gal : 1 ms
[2025-06-06 22:41:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14593709220348854886.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/CTLFireability12933501984047961697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14593709220348854886.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88956e+11,0.166448,11716,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,0,1.11147,46556,1,0,237,205318,401,167,4159,207337,392
FORMULA SmartHome-PT-13-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 159 transition count 207
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 159 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 159 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 155 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 155 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 151 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 151 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 150 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 150 transition count 197
Applied a total of 45 rules in 12 ms. Remains 150 /172 variables (removed 22) and now considering 197/220 (removed 23) transitions.
// Phase 1: matrix 197 rows 150 cols
[2025-06-06 22:41:38] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:41:38] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-06 22:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 153 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 196/349 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:41:49] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 350 constraints, problems are : Problem set: 0 solved, 196 unsolved in 11741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19396ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 19398ms
Starting structural reductions in LTL mode, iteration 1 : 150/172 places, 197/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19518 ms. Remains : 150/172 places, 197/220 transitions.
[2025-06-06 22:41:58] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:41:58] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:41:58] [INFO ] Input system was already deterministic with 197 transitions.
[2025-06-06 22:41:58] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:41:58] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:41:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1415658639704086126.gal : 1 ms
[2025-06-06 22:41:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13525409242253689100.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/CTLFireability1415658639704086126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13525409242253689100.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05511e+11,0.181732,12164,2,2416,5,37841,6,0,792,39118,0


Converting to forward existential form...Done !
original formula: EG(AG(!(E(EX((p149==1)) U EG((p160==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(E(EX((p149==1)) U EG((p160==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t98, t115, t118, t135, t138, t150, t169, t172, t175, t177, t181,...256
(forward)formula 0,0,1.78886,74180,1,0,296,409289,429,196,4631,343371,474
FORMULA SmartHome-PT-13-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 159 transition count 207
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 159 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 159 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 155 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 155 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 151 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 151 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 149 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 149 transition count 196
Applied a total of 47 rules in 6 ms. Remains 149 /172 variables (removed 23) and now considering 196/220 (removed 24) transitions.
// Phase 1: matrix 196 rows 149 cols
[2025-06-06 22:41:59] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 22:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:00] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-06 22:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 152 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7259 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 195/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:42:10] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 348 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18907ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 18907ms
Starting structural reductions in LTL mode, iteration 1 : 149/172 places, 196/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19017 ms. Remains : 149/172 places, 196/220 transitions.
[2025-06-06 22:42:19] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:42:19] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:42:19] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-06 22:42:19] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:42:19] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:42:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17769388972479454542.gal : 1 ms
[2025-06-06 22:42:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16528879674916433970.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/CTLFireability17769388972479454542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16528879674916433970.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.04409e+11,0.170176,11124,2,2091,5,32142,6,0,787,35025,0


Converting to forward existential form...Done !
original formula: AG(EF((EF((p49==0)) * AX((p68==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U (p49==0)) * !(EX(!((p68==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t151, t168, t171, t174, t176,...262
(forward)formula 0,1,3.14017,114172,1,0,293,687318,415,196,4484,541248,467
FORMULA SmartHome-PT-13-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 158 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 158 transition count 206
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 158 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 153 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 153 transition count 200
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 148 transition count 195
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 148 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 147 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 147 transition count 194
Applied a total of 51 rules in 15 ms. Remains 147 /172 variables (removed 25) and now considering 194/220 (removed 26) transitions.
// Phase 1: matrix 194 rows 147 cols
[2025-06-06 22:42:22] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 22:42:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:22] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-06 22:42:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:42:32] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 344 constraints, problems are : Problem set: 0 solved, 193 unsolved in 11574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18944ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 18945ms
Starting structural reductions in LTL mode, iteration 1 : 147/172 places, 194/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19067 ms. Remains : 147/172 places, 194/220 transitions.
[2025-06-06 22:42:41] [INFO ] Flatten gal took : 10 ms
[2025-06-06 22:42:41] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:42:41] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-06 22:42:41] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:42:41] [INFO ] Flatten gal took : 4 ms
[2025-06-06 22:42:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4310571177246581139.gal : 1 ms
[2025-06-06 22:42:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14233388384289664698.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/CTLFireability4310571177246581139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14233388384289664698.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.93094e+11,0.180132,12120,2,2388,5,37694,6,0,777,40032,0


Converting to forward existential form...Done !
original formula: EF(AX(AX((((p141==1)||(p149==1))||(p248==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!((((p141==1)||(p149==1))||(p248==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t95, t112, t115, t132, t135, t147, t166, t169, t172, t174, t178,...256
(forward)formula 0,1,1.38668,59508,1,0,244,298987,405,170,4184,285631,399
FORMULA SmartHome-PT-13-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 158 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 158 transition count 206
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 158 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 153 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 153 transition count 200
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 148 transition count 195
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 148 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 146 transition count 193
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 146 transition count 193
Applied a total of 53 rules in 5 ms. Remains 146 /172 variables (removed 26) and now considering 193/220 (removed 27) transitions.
// Phase 1: matrix 193 rows 146 cols
[2025-06-06 22:42:42] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 22:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:42:42] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-06 22:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 7058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:42:53] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 342 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18421ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 18421ms
Starting structural reductions in LTL mode, iteration 1 : 146/172 places, 193/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18539 ms. Remains : 146/172 places, 193/220 transitions.
[2025-06-06 22:43:01] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:43:01] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:43:01] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-06 22:43:01] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:43:01] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:43:01] [INFO ] Time to serialize gal into /tmp/CTLFireability653159601059672367.gal : 1 ms
[2025-06-06 22:43:01] [INFO ] Time to serialize properties into /tmp/CTLFireability660292190558652536.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/CTLFireability653159601059672367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability660292190558652536.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88956e+11,0.180113,11720,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: AF(EG(AX(EF(EX(((p97==1)&&(p374==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(E(TRUE U EX(((p97==1)&&(p374==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.39189,159416,1,0,504,1.00726e+06,419,327,4756,954029,670
FORMULA SmartHome-PT-13-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 220/220 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 161 transition count 209
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 161 transition count 209
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 157 transition count 205
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 157 transition count 205
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 153 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 153 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 152 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 152 transition count 200
Applied a total of 40 rules in 9 ms. Remains 152 /172 variables (removed 20) and now considering 200/220 (removed 20) transitions.
// Phase 1: matrix 200 rows 152 cols
[2025-06-06 22:43:05] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:43:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 22:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:43:05] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-06-06 22:43: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/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 155 constraints, problems are : Problem set: 0 solved, 199 unsolved in 7701 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 199/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:43:16] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 355 constraints, problems are : Problem set: 0 solved, 199 unsolved in 12267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19977ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 19977ms
Starting structural reductions in LTL mode, iteration 1 : 152/172 places, 200/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20093 ms. Remains : 152/172 places, 200/220 transitions.
[2025-06-06 22:43:25] [INFO ] Flatten gal took : 16 ms
[2025-06-06 22:43:25] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:43:25] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-06 22:43:25] [INFO ] Flatten gal took : 3 ms
[2025-06-06 22:43:25] [INFO ] Flatten gal took : 5 ms
[2025-06-06 22:43:25] [INFO ] Time to serialize gal into /tmp/CTLFireability14167119972143792359.gal : 1 ms
[2025-06-06 22:43:25] [INFO ] Time to serialize properties into /tmp/CTLFireability324653837677915264.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/CTLFireability14167119972143792359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability324653837677915264.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.35817e+11,0.159097,11292,2,2103,5,32651,6,0,803,34513,0


Converting to forward existential form...Done !
original formula: (AX((((((p221==0) + AX((p208==0))) * EF((p184==1))) * (AX(!(E((p153==1) U (p225==1)))) * AX(((p277==1)||(p92==1))))) * ((p254!=1)||(p334!...182
=> equivalent forward existential formula: ((([(EY((EY((Init * !(E(TRUE U EG((p382==1)))))) * !((p221==0)))) * !((p208==0)))] = FALSE * [(EY((Init * !(E(TR...470
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t61, t98, t101, t118, t121, t138, t141, t153, t172, t175, t178, t180, t184...257
(forward)formula 0,1,1.63592,67956,1,0,295,368630,443,199,4723,305756,481
FORMULA SmartHome-PT-13-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-06 22:43:27] [INFO ] Flatten gal took : 11 ms
[2025-06-06 22:43:27] [INFO ] Flatten gal took : 3 ms
Total runtime 269632 ms.

BK_STOP 1749249807643

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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