Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 120K 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-16-LTLFireability-00
FORMULA_NAME SmartHome-PT-16-LTLFireability-01
FORMULA_NAME SmartHome-PT-16-LTLFireability-02
FORMULA_NAME SmartHome-PT-16-LTLFireability-03
FORMULA_NAME SmartHome-PT-16-LTLFireability-04
FORMULA_NAME SmartHome-PT-16-LTLFireability-05
FORMULA_NAME SmartHome-PT-16-LTLFireability-06
FORMULA_NAME SmartHome-PT-16-LTLFireability-07
FORMULA_NAME SmartHome-PT-16-LTLFireability-08
FORMULA_NAME SmartHome-PT-16-LTLFireability-09
FORMULA_NAME SmartHome-PT-16-LTLFireability-10
FORMULA_NAME SmartHome-PT-16-LTLFireability-11
FORMULA_NAME SmartHome-PT-16-LTLFireability-12
FORMULA_NAME SmartHome-PT-16-LTLFireability-13
FORMULA_NAME SmartHome-PT-16-LTLFireability-14
FORMULA_NAME SmartHome-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749250904856

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 23:01:46] [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 23:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:01:46] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-06-06 23:01:46] [INFO ] Transformed 499 places.
[2025-06-06 23:01:46] [INFO ] Transformed 533 transitions.
[2025-06-06 23:01:46] [INFO ] Found NUPN structural information;
[2025-06-06 23:01:46] [INFO ] Parsed PT model containing 499 places and 533 transitions and 1222 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 156 places in 4 ms
Reduce places removed 156 places and 129 transitions.
FORMULA SmartHome-PT-16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 404/404 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 330 transition count 404
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 102 place count 241 transition count 315
Iterating global reduction 1 with 89 rules applied. Total rules applied 191 place count 241 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 200 place count 241 transition count 306
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 216 place count 225 transition count 290
Iterating global reduction 2 with 16 rules applied. Total rules applied 232 place count 225 transition count 290
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 248 place count 209 transition count 274
Iterating global reduction 2 with 16 rules applied. Total rules applied 264 place count 209 transition count 274
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 203 transition count 268
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 203 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 277 place count 202 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 202 transition count 267
Applied a total of 278 rules in 78 ms. Remains 202 /343 variables (removed 141) and now considering 267/404 (removed 137) transitions.
// Phase 1: matrix 267 rows 202 cols
[2025-06-06 23:01:46] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:01:46] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-06 23:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:01:46] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-06 23:01: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/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/469 variables, 202/205 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/469 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 205 constraints, problems are : Problem set: 0 solved, 266 unsolved in 13994 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/469 variables, 202/205 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 266/471 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:02:06] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 0/469 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 472 constraints, problems are : Problem set: 0 solved, 266 unsolved in 20447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34503ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 34519ms
Starting structural reductions in LTL mode, iteration 1 : 202/343 places, 267/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34970 ms. Remains : 202/343 places, 267/404 transitions.
Support contains 24 out of 202 places after structural reductions.
[2025-06-06 23:02:21] [INFO ] Flatten gal took : 36 ms
[2025-06-06 23:02:21] [INFO ] Flatten gal took : 17 ms
[2025-06-06 23:02:21] [INFO ] Input system was already deterministic with 267 transitions.
Support contains 22 out of 202 places (down from 24) after GAL structural reductions.
RANDOM walk for 20311 steps (91 resets) in 440 ms. (46 steps per ms) remains 0/21 properties
Computed a total of 38 stabilizing places and 37 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' '!(X(((p0||X(X(X(p0)))) U p1)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 192 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 192 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 192 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 189 transition count 253
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 189 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 189 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 188 transition count 251
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 188 transition count 251
Applied a total of 30 rules in 17 ms. Remains 188 /202 variables (removed 14) and now considering 251/267 (removed 16) transitions.
// Phase 1: matrix 251 rows 188 cols
[2025-06-06 23:02:22] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:22] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-06 23:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:22] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2025-06-06 23:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/439 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 191 constraints, problems are : Problem set: 0 solved, 250 unsolved in 11682 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/439 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 250/441 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:02:38] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 0/439 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 442 constraints, problems are : Problem set: 0 solved, 250 unsolved in 18890 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30601ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 30602ms
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 251/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30761 ms. Remains : 188/202 places, 251/267 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-00
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA SmartHome-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-00 finished in 31170 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((G(p0)&&X(F(((!p1&&X(X(X(p2))))||G(p2)))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 191 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 191 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 191 transition count 255
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 187 transition count 251
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 187 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 187 transition count 250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 185 transition count 248
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 185 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 184 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 184 transition count 247
Applied a total of 38 rules in 21 ms. Remains 184 /202 variables (removed 18) and now considering 247/267 (removed 20) transitions.
// Phase 1: matrix 247 rows 184 cols
[2025-06-06 23:02:53] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 23:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:53] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2025-06-06 23:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/431 variables, 184/187 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 0/431 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 187 constraints, problems are : Problem set: 0 solved, 246 unsolved in 11457 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/431 variables, 184/187 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 246/433 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:03:09] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (OVERLAPS) 0/431 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 434 constraints, problems are : Problem set: 0 solved, 246 unsolved in 17162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28656ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 28657ms
Starting structural reductions in LTL mode, iteration 1 : 184/202 places, 247/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28899 ms. Remains : 184/202 places, 247/267 transitions.
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-03 finished in 29405 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)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Graph (trivial) has 210 edges and 202 vertex of which 123 / 202 are part of one of the 10 SCC in 3 ms
Free SCC test removed 113 places
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 88 transition count 87
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 61 transition count 85
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 60 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 59 place count 60 transition count 79
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 69 place count 55 transition count 79
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 52 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 52 transition count 76
Performed 24 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 123 place count 28 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 137 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 27 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 138 place count 27 transition count 35
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 140 place count 26 transition count 35
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 24 transition count 31
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 24 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 23 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 22 transition count 30
Applied a total of 146 rules in 30 ms. Remains 22 /202 variables (removed 180) and now considering 30/267 (removed 237) transitions.
[2025-06-06 23:03:22] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
// Phase 1: matrix 23 rows 22 cols
[2025-06-06 23:03:22] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 23:03:22] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2025-06-06 23:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:22] [INFO ] Implicit Places using invariants and state equation in 28 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 23:03:22] [INFO ] Redundant transitions in 27 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:03:22] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2025-06-06 23:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/40 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/45 variables, and 21 constraints, problems are : Problem set: 0 solved, 12 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/40 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/45 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 209 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/202 places, 30/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 470 ms. Remains : 22/202 places, 30/267 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-04 finished in 567 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((p0||X((X(p1) U (p0&&X(p1)))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 192 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 192 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 192 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 189 transition count 253
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 189 transition count 253
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 187 transition count 251
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 187 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 186 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 186 transition count 250
Applied a total of 33 rules in 24 ms. Remains 186 /202 variables (removed 16) and now considering 250/267 (removed 17) transitions.
// Phase 1: matrix 250 rows 186 cols
[2025-06-06 23:03:23] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:23] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 23:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:23] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-06 23:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/436 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 189 constraints, problems are : Problem set: 0 solved, 249 unsolved in 11533 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/436 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 249/438 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:03:39] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 439 constraints, problems are : Problem set: 0 solved, 249 unsolved in 19373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30924ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 30924ms
Starting structural reductions in LTL mode, iteration 1 : 186/202 places, 250/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31085 ms. Remains : 186/202 places, 250/267 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-05 finished in 31220 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))))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 195 transition count 260
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 195 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 190 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 190 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 190 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 186 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 186 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 186 transition count 249
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 184 transition count 247
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 184 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 183 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 183 transition count 246
Applied a total of 40 rules in 18 ms. Remains 183 /202 variables (removed 19) and now considering 246/267 (removed 21) transitions.
// Phase 1: matrix 246 rows 183 cols
[2025-06-06 23:03:54] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 23:03:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:54] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-06 23:03:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 186 constraints, problems are : Problem set: 0 solved, 245 unsolved in 11056 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 245/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:04:10] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 432 constraints, problems are : Problem set: 0 solved, 245 unsolved in 17993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29083ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 29084ms
Starting structural reductions in LTL mode, iteration 1 : 183/202 places, 246/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29244 ms. Remains : 183/202 places, 246/267 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-06 finished in 29384 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((X(X(p0))&&F(p1))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 192 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 192 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 192 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 189 transition count 253
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 189 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 189 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 188 transition count 251
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 188 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 187 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 187 transition count 250
Applied a total of 32 rules in 25 ms. Remains 187 /202 variables (removed 15) and now considering 250/267 (removed 17) transitions.
// Phase 1: matrix 250 rows 187 cols
[2025-06-06 23:04:23] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 23:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:23] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-06 23:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/437 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 190 constraints, problems are : Problem set: 0 solved, 249 unsolved in 11640 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/437 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 249/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:04:40] [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/437 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 440 constraints, problems are : Problem set: 0 solved, 249 unsolved in 18926 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30598ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 30599ms
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 250/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30766 ms. Remains : 187/202 places, 250/267 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 238 ms.
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Computed a total of 32 stabilizing places and 31 stable transitions
Computed a total of 32 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-16-LTLFireability-07 finished in 31374 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(p0)||G((p1||G(p2))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 192 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 192 transition count 257
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 188 transition count 253
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 188 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 188 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 186 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 186 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 185 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 185 transition count 249
Applied a total of 35 rules in 8 ms. Remains 185 /202 variables (removed 17) and now considering 249/267 (removed 18) transitions.
// Phase 1: matrix 249 rows 185 cols
[2025-06-06 23:04:55] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 23:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-06 23:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/434 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 188 constraints, problems are : Problem set: 0 solved, 248 unsolved in 11407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/434 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 248/436 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:05:11] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 437 constraints, problems are : Problem set: 0 solved, 248 unsolved in 18554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29993ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 29994ms
Starting structural reductions in LTL mode, iteration 1 : 185/202 places, 249/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30145 ms. Remains : 185/202 places, 249/267 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Product exploration explored 100000 steps with 33333 reset in 93 ms.
Computed a total of 31 stabilizing places and 30 stable transitions
Computed a total of 31 stabilizing places and 30 stable transitions
Detected a total of 31/185 stabilizing places and 30/249 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 19 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-16-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-16-LTLFireability-08 finished in 30642 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((p0||X(p1)))&&X(G(p2))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 192 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 192 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 192 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 189 transition count 253
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 189 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 189 transition count 252
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 187 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 187 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 186 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 186 transition count 249
Applied a total of 34 rules in 14 ms. Remains 186 /202 variables (removed 16) and now considering 249/267 (removed 18) transitions.
// Phase 1: matrix 249 rows 186 cols
[2025-06-06 23:05:25] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 23:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:25] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-06 23:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/435 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/435 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 189 constraints, problems are : Problem set: 0 solved, 248 unsolved in 11778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/435 variables, 186/189 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 248/437 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:05:42] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/435 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 0 solved, 248 unsolved in 18225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30020ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 30021ms
Starting structural reductions in LTL mode, iteration 1 : 186/202 places, 249/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30178 ms. Remains : 186/202 places, 249/267 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-09 finished in 30342 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 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Graph (trivial) has 208 edges and 202 vertex of which 115 / 202 are part of one of the 10 SCC in 0 ms
Free SCC test removed 105 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 96 transition count 95
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 66 transition count 92
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 65 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 64 transition count 91
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 67 place count 64 transition count 86
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 77 place count 59 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 58 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 58 transition count 85
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 135 place count 30 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 30 transition count 53
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 138 place count 28 transition count 48
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 28 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 152 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 153 place count 27 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 153 place count 27 transition count 35
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 155 place count 26 transition count 35
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 157 place count 24 transition count 31
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 24 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 23 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 161 place count 22 transition count 30
Applied a total of 161 rules in 12 ms. Remains 22 /202 variables (removed 180) and now considering 30/267 (removed 237) transitions.
[2025-06-06 23:05:56] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 22 cols
[2025-06-06 23:05:56] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-06 23:05:56] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-06 23:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:05:56] [INFO ] Redundant transitions in 18 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 23:05:56] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-06 23:05:56] [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) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/46 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/22 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) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/46 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 239 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 386ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 386ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/202 places, 30/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 22/202 places, 30/267 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-10 finished in 510 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 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Graph (trivial) has 210 edges and 202 vertex of which 113 / 202 are part of one of the 9 SCC in 1 ms
Free SCC test removed 104 places
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 97 transition count 95
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 65 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 64 transition count 92
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 69 place count 64 transition count 87
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 79 place count 59 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 56 transition count 84
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 56 transition count 84
Performed 28 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 141 place count 28 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 28 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 149 place count 28 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 150 place count 27 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 26 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 26 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 25 transition count 39
Applied a total of 153 rules in 12 ms. Remains 25 /202 variables (removed 177) and now considering 39/267 (removed 228) transitions.
[2025-06-06 23:05:56] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
// Phase 1: matrix 27 rows 25 cols
[2025-06-06 23:05:56] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 23:05:56] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2025-06-06 23:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:05:56] [INFO ] Redundant transitions in 27 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-06 23:05:56] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2025-06-06 23:05:56] [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, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 25/48 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/52 variables, and 26 constraints, problems are : Problem set: 0 solved, 21 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 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, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 25/48 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/49 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/52 variables, and 47 constraints, problems are : Problem set: 0 solved, 21 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 542ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/202 places, 39/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 644 ms. Remains : 25/202 places, 39/267 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-14 finished in 690 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 G(p1)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 267/267 transitions.
Graph (trivial) has 209 edges and 202 vertex of which 111 / 202 are part of one of the 9 SCC in 1 ms
Free SCC test removed 102 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 99 transition count 96
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 66 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 65 transition count 93
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 71 place count 65 transition count 89
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 79 place count 61 transition count 89
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 58 transition count 86
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 58 transition count 86
Performed 29 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 143 place count 29 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 29 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 28 transition count 48
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 28 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 159 place count 28 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 161 place count 26 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 161 place count 26 transition count 34
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 163 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 24 transition count 32
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 24 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 23 transition count 31
Applied a total of 166 rules in 19 ms. Remains 23 /202 variables (removed 179) and now considering 31/267 (removed 236) transitions.
[2025-06-06 23:05:57] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2025-06-06 23:05:57] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 23:05:57] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2025-06-06 23:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:05:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:05:57] [INFO ] Redundant transitions in 15 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 23:05:57] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2025-06-06 23:05:57] [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, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/45 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/48 variables, and 23 constraints, problems are : Problem set: 0 solved, 14 unsolved in 151 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 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/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 4/45 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (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/48 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 317ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/202 places, 31/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 23/202 places, 31/267 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : SmartHome-PT-16-LTLFireability-15
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-16-LTLFireability-15 finished in 510 ms.
All properties solved by simple procedures.
Total runtime 251794 ms.

BK_STOP 1749251157871

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

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