Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 63K 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-07-LTLFireability-00
FORMULA_NAME SmartHome-PT-07-LTLFireability-01
FORMULA_NAME SmartHome-PT-07-LTLFireability-02
FORMULA_NAME SmartHome-PT-07-LTLFireability-03
FORMULA_NAME SmartHome-PT-07-LTLFireability-04
FORMULA_NAME SmartHome-PT-07-LTLFireability-05
FORMULA_NAME SmartHome-PT-07-LTLFireability-06
FORMULA_NAME SmartHome-PT-07-LTLFireability-07
FORMULA_NAME SmartHome-PT-07-LTLFireability-08
FORMULA_NAME SmartHome-PT-07-LTLFireability-09
FORMULA_NAME SmartHome-PT-07-LTLFireability-10
FORMULA_NAME SmartHome-PT-07-LTLFireability-11
FORMULA_NAME SmartHome-PT-07-LTLFireability-12
FORMULA_NAME SmartHome-PT-07-LTLFireability-13
FORMULA_NAME SmartHome-PT-07-LTLFireability-14
FORMULA_NAME SmartHome-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749247728918

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 22:08:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 22:08:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:08:50] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-06 22:08:50] [INFO ] Transformed 251 places.
[2025-06-06 22:08:50] [INFO ] Transformed 290 transitions.
[2025-06-06 22:08:50] [INFO ] Found NUPN structural information;
[2025-06-06 22:08:50] [INFO ] Parsed PT model containing 251 places and 290 transitions and 658 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 30 transitions.
FORMULA SmartHome-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 260
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 58 place count 164 transition count 209
Iterating global reduction 1 with 51 rules applied. Total rules applied 109 place count 164 transition count 209
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 115 place count 164 transition count 203
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 125 place count 154 transition count 193
Iterating global reduction 2 with 10 rules applied. Total rules applied 135 place count 154 transition count 193
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 147 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 147 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 146 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 146 transition count 185
Applied a total of 151 rules in 62 ms. Remains 146 /222 variables (removed 76) and now considering 185/260 (removed 75) transitions.
// Phase 1: matrix 185 rows 146 cols
[2025-06-06 22:08:50] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:08:50] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-06-06 22:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:08:50] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-06 22:08:50] [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, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/331 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/331 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 149 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7556 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 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, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/331 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 184/333 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:09:01] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 334 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10627 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18232ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 18246ms
Starting structural reductions in LTL mode, iteration 1 : 146/222 places, 185/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18700 ms. Remains : 146/222 places, 185/260 transitions.
Support contains 25 out of 146 places after structural reductions.
[2025-06-06 22:09:09] [INFO ] Flatten gal took : 30 ms
[2025-06-06 22:09:09] [INFO ] Flatten gal took : 13 ms
[2025-06-06 22:09:09] [INFO ] Input system was already deterministic with 185 transitions.
RANDOM walk for 27589 steps (191 resets) in 549 ms. (50 steps per ms) remains 0/25 properties
Computed a total of 36 stabilizing places and 35 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Graph (trivial) has 142 edges and 146 vertex of which 63 / 146 are part of one of the 5 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 87 transition count 77
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 41 rules applied. Total rules applied 73 place count 56 transition count 67
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 51 transition count 67
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 78 place count 51 transition count 62
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 88 place count 46 transition count 62
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 93 place count 41 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 98 place count 41 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 41 transition count 55
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 40 transition count 54
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 132 place count 25 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 137 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 24 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 138 place count 24 transition count 32
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 140 place count 23 transition count 32
Applied a total of 140 rules in 27 ms. Remains 23 /146 variables (removed 123) and now considering 32/185 (removed 153) transitions.
[2025-06-06 22:09:09] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2025-06-06 22:09:09] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:09] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:09:09] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2025-06-06 22:09:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 22:09:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:09:10] [INFO ] Redundant transitions in 23 ms returned []
Running 31 sub problems to find dead transitions.
[2025-06-06 22:09:10] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2025-06-06 22:09:10] [INFO ] Invariant cache hit.
[2025-06-06 22:09:10] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 24/47 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/48 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 38 constraints, problems are : Problem set: 0 solved, 31 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 24/47 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 31/68 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/48 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 69 constraints, problems are : Problem set: 0 solved, 31 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 994ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 996ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/146 places, 32/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1124 ms. Remains : 23/146 places, 32/185 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-01 finished in 1386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||F(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 135 transition count 174
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 135 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 127 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 127 transition count 166
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 123 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 123 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 122 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 122 transition count 160
Applied a total of 49 rules in 12 ms. Remains 122 /146 variables (removed 24) and now considering 160/185 (removed 25) transitions.
// Phase 1: matrix 160 rows 122 cols
[2025-06-06 22:09:11] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:11] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:09:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2025-06-06 22:09:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 125 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5359 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 159/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:09:19] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 285 constraints, problems are : Problem set: 0 solved, 159 unsolved in 8990 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14362ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 14363ms
Starting structural reductions in LTL mode, iteration 1 : 122/146 places, 160/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14485 ms. Remains : 122/146 places, 160/185 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 217 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Computed a total of 27 stabilizing places and 26 stable transitions
Computed a total of 27 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-07-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-07-LTLFireability-02 finished in 15034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G(p0)) U p1)||X(X(X(X(F(p2))))))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 135 transition count 174
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 135 transition count 174
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 128 transition count 167
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 128 transition count 167
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 124 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 124 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 124 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 123 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 123 transition count 161
Applied a total of 47 rules in 13 ms. Remains 123 /146 variables (removed 23) and now considering 161/185 (removed 24) transitions.
// Phase 1: matrix 161 rows 123 cols
[2025-06-06 22:09:26] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 22:09:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:26] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-06 22:09:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 126 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 160/286 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:09:34] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13766ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13766ms
Starting structural reductions in LTL mode, iteration 1 : 123/146 places, 161/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13885 ms. Remains : 123/146 places, 161/185 transitions.
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-03
Product exploration explored 100000 steps with 16685 reset in 88 ms.
Product exploration explored 100000 steps with 16619 reset in 161 ms.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Detected a total of 29/123 stabilizing places and 28/161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 22694 steps (162 resets) in 112 ms. (200 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F p1)]
Knowledge based reduction with 4 factoid took 321 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 161/161 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2025-06-06 22:09:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:09:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:09:42] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-06 22:09: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/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 126 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5494 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 160/286 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:09:50] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13747ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13748ms
Finished structural reductions in LTL mode , in 1 iterations and 13856 ms. Remains : 123/123 places, 161/161 transitions.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Detected a total of 29/123 stabilizing places and 28/161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 3448 steps (24 resets) in 16 ms. (202 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F p1)]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16677 reset in 73 ms.
Product exploration explored 100000 steps with 16648 reset in 126 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 161/161 transitions.
Graph (trivial) has 115 edges and 123 vertex of which 63 / 123 are part of one of the 6 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 66 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 17 place count 66 transition count 82
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 66 transition count 82
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 58 transition count 74
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 58 transition count 74
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 54 place count 58 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 58 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 50 transition count 64
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 50 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 50 transition count 64
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 48 transition count 62
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 48 transition count 62
Deduced a syphon composed of 20 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 48 transition count 53
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 108 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 46 transition count 52
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 87 rules in 22 ms. Remains 46 /123 variables (removed 77) and now considering 52/161 (removed 109) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:09:58] [INFO ] Redundant transitions in 26 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 22:09:58] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
// Phase 1: matrix 47 rows 46 cols
[2025-06-06 22:09:58] [INFO ] Computed 2 invariants in 1 ms
[2025-06-06 22:09:58] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:09:59] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 8 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 49 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 5 (OVERLAPS) 46/92 variables, 46/49 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 17/66 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 1/93 variables, 1/67 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/67 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/93 variables, 0/67 constraints. Problems are: Problem set: 19 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 67 constraints, problems are : Problem set: 19 solved, 32 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 3/29 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/2 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/30 variables, 1/3 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 46/76 variables, 30/33 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 17/50 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 32/82 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/82 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 16/92 variables, 16/98 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/98 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 1/93 variables, 1/99 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/93 variables, 0/99 constraints. Problems are: Problem set: 19 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 99 constraints, problems are : Problem set: 19 solved, 32 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 32/51 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2096ms problems are : Problem set: 19 solved, 32 unsolved
Search for dead transitions found 19 dead transitions in 2096ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 46/123 places, 33/161 transitions.
Graph (complete) has 63 edges and 46 vertex of which 27 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 27 /46 variables (removed 19) and now considering 33/33 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/123 places, 33/161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2155 ms. Remains : 27/123 places, 33/161 transitions.
Built C files in :
/tmp/ltsmin1403061480951923497
[2025-06-06 22:10:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1403061480951923497
Running compilation step : cd /tmp/ltsmin1403061480951923497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin1403061480951923497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1403061480951923497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11158925912690350377.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA SmartHome-PT-07-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-07-LTLFireability-03 finished in 35274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Graph (trivial) has 145 edges and 146 vertex of which 74 / 146 are part of one of the 6 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 77 transition count 71
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 53 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 51 transition count 66
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 56 place count 51 transition count 60
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 68 place count 45 transition count 60
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 42 transition count 57
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 42 transition count 57
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 108 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 118 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 24 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 24 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 21 transition count 27
Applied a total of 123 rules in 13 ms. Remains 21 /146 variables (removed 125) and now considering 27/185 (removed 158) transitions.
[2025-06-06 22:10:01] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 22:10:01] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-06 22:10:01] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-06 22:10:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:01] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:10:01] [INFO ] Redundant transitions in 27 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 22:10:01] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-06 22:10:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/43 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 170 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/42 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 212 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 387ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/146 places, 27/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 21/146 places, 27/185 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-04 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(!p0))) U G(p1)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Graph (trivial) has 143 edges and 146 vertex of which 71 / 146 are part of one of the 6 SCC in 0 ms
Free SCC test removed 65 places
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 80 transition count 74
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 60 place count 54 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 51 transition count 67
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 63 place count 51 transition count 62
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 73 place count 46 transition count 62
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 42 transition count 58
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 42 transition count 58
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 113 place count 26 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 123 place count 26 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 24 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 125 place count 24 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 23 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 22 transition count 29
Applied a total of 128 rules in 15 ms. Remains 22 /146 variables (removed 124) and now considering 29/185 (removed 156) transitions.
[2025-06-06 22:10:02] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2025-06-06 22:10:02] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 22:10:02] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:10:02] [INFO ] Redundant transitions in 25 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 22:10:02] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/46 variables, and 22 constraints, problems are : Problem set: 0 solved, 14 unsolved in 173 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/44 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/45 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 265 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 441ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/146 places, 29/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 22/146 places, 29/185 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-05 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Graph (trivial) has 143 edges and 146 vertex of which 66 / 146 are part of one of the 6 SCC in 0 ms
Free SCC test removed 60 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 85 transition count 77
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 37 rules applied. Total rules applied 66 place count 57 transition count 68
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 71 place count 53 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 52 transition count 67
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 72 place count 52 transition count 62
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 82 place count 47 transition count 62
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 86 place count 43 transition count 58
Iterating global reduction 4 with 4 rules applied. Total rules applied 90 place count 43 transition count 58
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 122 place count 27 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 132 place count 27 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 25 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 134 place count 25 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 23 transition count 29
Applied a total of 137 rules in 12 ms. Remains 23 /146 variables (removed 123) and now considering 29/185 (removed 156) transitions.
[2025-06-06 22:10:02] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 23 cols
[2025-06-06 22:10:02] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 22:10:02] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:10:02] [INFO ] Redundant transitions in 31 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-06 22:10:02] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/46 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 24 constraints, problems are : Problem set: 0 solved, 15 unsolved in 169 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/46 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 39 constraints, problems are : Problem set: 0 solved, 15 unsolved in 179 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/146 places, 29/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 23/146 places, 29/185 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-06
Stuttering criterion allowed to conclude after 28 steps with 2 reset in 1 ms.
FORMULA SmartHome-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-06 finished in 612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F((p1||G(F(p2)))))))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 135 transition count 174
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 135 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 127 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 127 transition count 166
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 123 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 123 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 122 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 122 transition count 160
Applied a total of 49 rules in 11 ms. Remains 122 /146 variables (removed 24) and now considering 160/185 (removed 25) transitions.
// Phase 1: matrix 160 rows 122 cols
[2025-06-06 22:10:03] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:03] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2025-06-06 22:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 125 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 159/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:10:10] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 285 constraints, problems are : Problem set: 0 solved, 159 unsolved in 8176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13346ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 13346ms
Starting structural reductions in LTL mode, iteration 1 : 122/146 places, 160/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13468 ms. Remains : 122/146 places, 160/185 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-07
Entered a terminal (fully accepting) state of product in 127 steps with 1 reset in 2 ms.
FORMULA SmartHome-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-07 finished in 13763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&(F(p2)||X(G(p3)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 176
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 176
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 131 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 131 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 128 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 128 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 128 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 127 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 127 transition count 165
Applied a total of 39 rules in 10 ms. Remains 127 /146 variables (removed 19) and now considering 165/185 (removed 20) transitions.
// Phase 1: matrix 165 rows 127 cols
[2025-06-06 22:10:17] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:17] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 22:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:17] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-06 22:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/292 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 130 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/292 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 164/294 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:10:25] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/292 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 295 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13899ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 13900ms
Starting structural reductions in LTL mode, iteration 1 : 127/146 places, 165/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14014 ms. Remains : 127/146 places, 165/185 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), true, (NOT p2)]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-09 finished in 14259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 135 transition count 174
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 135 transition count 174
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 128 transition count 167
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 128 transition count 167
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 124 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 124 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 124 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 123 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 123 transition count 161
Applied a total of 47 rules in 6 ms. Remains 123 /146 variables (removed 23) and now considering 161/185 (removed 24) transitions.
// Phase 1: matrix 161 rows 123 cols
[2025-06-06 22:10:31] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 22:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:31] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-06 22:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 126 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5415 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 160/286 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:10:39] [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/284 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13959ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13959ms
Starting structural reductions in LTL mode, iteration 1 : 123/146 places, 161/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14079 ms. Remains : 123/146 places, 161/185 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-10 finished in 14238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&(X(p2) U G(p0)))))))'
Support contains 1 out of 146 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Graph (trivial) has 139 edges and 146 vertex of which 47 / 146 are part of one of the 6 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 104 transition count 92
Reduce places removed 37 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 43 rules applied. Total rules applied 81 place count 67 transition count 86
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 64 transition count 84
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 91 place count 62 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 61 transition count 81
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 92 place count 61 transition count 73
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 108 place count 53 transition count 73
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 111 place count 50 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 114 place count 50 transition count 70
Performed 22 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 158 place count 28 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 168 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 169 place count 27 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 169 place count 27 transition count 33
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 171 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 172 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 173 place count 24 transition count 32
Applied a total of 173 rules in 15 ms. Remains 24 /146 variables (removed 122) and now considering 32/185 (removed 153) transitions.
[2025-06-06 22:10:45] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2025-06-06 22:10:45] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 22:10:45] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2025-06-06 22:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:10:45] [INFO ] Redundant transitions in 21 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-06 22:10:45] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2025-06-06 22:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 25/47 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/48 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/51 variables, and 24 constraints, problems are : Problem set: 0 solved, 16 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 25/47 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/48 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/49 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/50 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/50 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/51 variables, and 41 constraints, problems are : Problem set: 0 solved, 16 unsolved in 294 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/146 places, 32/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 24/146 places, 32/185 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-11 finished in 642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 185/185 transitions.
Graph (trivial) has 145 edges and 146 vertex of which 74 / 146 are part of one of the 6 SCC in 0 ms
Free SCC test removed 68 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 77 transition count 71
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 53 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 51 transition count 66
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 56 place count 51 transition count 60
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 68 place count 45 transition count 60
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 42 transition count 57
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 42 transition count 57
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 108 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 118 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 24 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 24 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 21 transition count 27
Applied a total of 123 rules in 12 ms. Remains 21 /146 variables (removed 125) and now considering 27/185 (removed 158) transitions.
[2025-06-06 22:10:46] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 22:10:46] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 22:10:46] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-06 22:10:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:10:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:10:46] [INFO ] Redundant transitions in 19 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 22:10:46] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-06 22:10:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/43 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/42 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 214 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 369ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/146 places, 27/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 451 ms. Remains : 21/146 places, 27/185 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLFireability-15 finished in 497 ms.
All properties solved by simple procedures.
Total runtime 116772 ms.

BK_STOP 1749247846875

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-07"
export BK_EXAMINATION="LTLFireability"
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-07, examination is LTLFireability"
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-174901995000740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-07.tgz
mv SmartHome-PT-07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;