About the Execution of GreatSPN+red for SmartHome-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 426.548 | 115664.00 | 156218.00 | 516.20 | FFTFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r377-smll-171683810300396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is SmartHome-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683810300396
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 03:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-08-LTLFireability-00
FORMULA_NAME SmartHome-PT-08-LTLFireability-01
FORMULA_NAME SmartHome-PT-08-LTLFireability-02
FORMULA_NAME SmartHome-PT-08-LTLFireability-03
FORMULA_NAME SmartHome-PT-08-LTLFireability-04
FORMULA_NAME SmartHome-PT-08-LTLFireability-05
FORMULA_NAME SmartHome-PT-08-LTLFireability-06
FORMULA_NAME SmartHome-PT-08-LTLFireability-07
FORMULA_NAME SmartHome-PT-08-LTLFireability-08
FORMULA_NAME SmartHome-PT-08-LTLFireability-09
FORMULA_NAME SmartHome-PT-08-LTLFireability-10
FORMULA_NAME SmartHome-PT-08-LTLFireability-11
FORMULA_NAME SmartHome-PT-08-LTLFireability-12
FORMULA_NAME SmartHome-PT-08-LTLFireability-13
FORMULA_NAME SmartHome-PT-08-LTLFireability-14
FORMULA_NAME SmartHome-PT-08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717002367098
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:06:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 17:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:06:09] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-29 17:06:09] [INFO ] Transformed 252 places.
[2024-05-29 17:06:09] [INFO ] Transformed 291 transitions.
[2024-05-29 17:06:09] [INFO ] Found NUPN structural information;
[2024-05-29 17:06:09] [INFO ] Parsed PT model containing 252 places and 291 transitions and 664 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 21 transitions.
FORMULA SmartHome-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 270/270 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 173 transition count 211
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 173 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 123 place count 173 transition count 206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 132 place count 164 transition count 197
Iterating global reduction 1 with 9 rules applied. Total rules applied 141 place count 164 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 149 place count 156 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 157 place count 156 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 158 place count 156 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 154 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 154 transition count 186
Applied a total of 162 rules in 113 ms. Remains 154 /232 variables (removed 78) and now considering 186/270 (removed 84) transitions.
// Phase 1: matrix 186 rows 154 cols
[2024-05-29 17:06:09] [INFO ] Computed 11 invariants in 24 ms
[2024-05-29 17:06:10] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 17:06:10] [INFO ] Invariant cache hit.
[2024-05-29 17:06:10] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-29 17:06:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 17:06:12] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 30 ms to minimize.
[2024-05-29 17:06:12] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 3 ms to minimize.
[2024-05-29 17:06:12] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-29 17:06:13] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-29 17:06:13] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/340 variables, 154/170 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 170 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8177 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/340 variables, 154/170 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 185/355 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 17:06:20] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:06:21] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 2 ms to minimize.
[2024-05-29 17:06:21] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:06:22] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 359 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8571 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 9/9 constraints]
After SMT, in 16863ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 16892ms
Starting structural reductions in LTL mode, iteration 1 : 154/232 places, 186/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17725 ms. Remains : 154/232 places, 186/270 transitions.
Support contains 28 out of 154 places after structural reductions.
[2024-05-29 17:06:27] [INFO ] Flatten gal took : 65 ms
[2024-05-29 17:06:27] [INFO ] Flatten gal took : 26 ms
[2024-05-29 17:06:27] [INFO ] Input system was already deterministic with 186 transitions.
RANDOM walk for 40000 steps (262 resets) in 1554 ms. (25 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40004 steps (42 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
[2024-05-29 17:06:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 104/154 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 17:06:28] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-29 17:06:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 186/340 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 104/154 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 186/340 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 17:06:28] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 171 constraints, problems are : Problem set: 0 solved, 3 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1010 ms.
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 186/186 transitions.
Graph (trivial) has 142 edges and 154 vertex of which 62 / 154 are part of one of the 5 SCC in 3 ms
Free SCC test removed 57 places
Drop transitions (Empty/Sink Transition effects.) removed 79 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 97 transition count 74
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 66 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 64 transition count 70
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 65
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 65
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 54 transition count 59
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 54 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 54 transition count 58
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 124 place count 37 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 129 place count 37 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 36 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 132 place count 36 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 36 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 134 place count 35 transition count 32
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 139 place count 35 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 144 place count 30 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 145 place count 29 transition count 26
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 13 rules applied. Total rules applied 158 place count 24 transition count 18
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 163 place count 19 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 5 Pre rules applied. Total rules applied 163 place count 19 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 175 place count 12 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 175 place count 12 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 177 place count 11 transition count 12
Applied a total of 177 rules in 52 ms. Remains 11 /154 variables (removed 143) and now considering 12/186 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 11/154 places, 12/186 transitions.
RANDOM walk for 16758 steps (4 resets) in 97 ms. (171 steps per ms) remains 0/3 properties
Computed a total of 19 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 146 transition count 177
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 141 transition count 172
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 141 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 137 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 137 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 136 transition count 167
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 136 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 135 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 135 transition count 166
Applied a total of 39 rules in 19 ms. Remains 135 /154 variables (removed 19) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 135 cols
[2024-05-29 17:06:30] [INFO ] Computed 11 invariants in 3 ms
[2024-05-29 17:06:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 17:06:30] [INFO ] Invariant cache hit.
[2024-05-29 17:06:30] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-29 17:06:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 3 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 17:06:35] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-29 17:06:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-29 17:06:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 166/301 variables, 135/157 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 157 constraints, problems are : Problem set: 0 solved, 165 unsolved in 8538 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/301 variables, 135/157 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 165/322 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 322 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4859 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 11/11 constraints]
After SMT, in 13439ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 13447ms
Starting structural reductions in LTL mode, iteration 1 : 135/154 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13679 ms. Remains : 135/154 places, 166/186 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-00
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 4 ms.
FORMULA SmartHome-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-00 finished in 14042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Graph (trivial) has 147 edges and 154 vertex of which 72 / 154 are part of one of the 6 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 87 transition count 71
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 62 transition count 69
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 55 place count 61 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 60 transition count 68
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 56 place count 60 transition count 63
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 66 place count 55 transition count 63
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 70 place count 51 transition count 59
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 51 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 51 transition count 58
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 109 place count 34 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 119 place count 34 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 121 place count 32 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 123 place count 30 transition count 28
Applied a total of 123 rules in 22 ms. Remains 30 /154 variables (removed 124) and now considering 28/186 (removed 158) transitions.
[2024-05-29 17:06:44] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 30 cols
[2024-05-29 17:06:44] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 17:06:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 17:06:44] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2024-05-29 17:06:44] [INFO ] Invariant cache hit.
[2024-05-29 17:06:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 17:06:44] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-29 17:06:44] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-29 17:06:44] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2024-05-29 17:06:44] [INFO ] Invariant cache hit.
[2024-05-29 17:06:44] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 3/30 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-29 17:06:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 22/52 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 3/30 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 22/52 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 61 constraints, problems are : Problem set: 0 solved, 16 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 558ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/154 places, 28/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 692 ms. Remains : 30/154 places, 28/186 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-03 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Graph (trivial) has 146 edges and 154 vertex of which 71 / 154 are part of one of the 6 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 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 71
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 61 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 60 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 58 place count 60 transition count 65
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 66 place count 56 transition count 65
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 71 place count 51 transition count 60
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 51 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 51 transition count 59
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 111 place count 34 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 121 place count 34 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 32 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 30 transition count 29
Applied a total of 125 rules in 17 ms. Remains 30 /154 variables (removed 124) and now considering 29/186 (removed 157) transitions.
[2024-05-29 17:06:45] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 30 cols
[2024-05-29 17:06:45] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 17:06:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 17:06:45] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-29 17:06:45] [INFO ] Invariant cache hit.
[2024-05-29 17:06:45] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 17:06:45] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-29 17:06:45] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-29 17:06:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/53 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/54 variables, and 39 constraints, problems are : Problem set: 0 solved, 15 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/53 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/54 variables, and 54 constraints, problems are : Problem set: 0 solved, 15 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/154 places, 29/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 659 ms. Remains : 30/154 places, 29/186 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-04 finished in 836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Graph (trivial) has 147 edges and 154 vertex of which 72 / 154 are part of one of the 6 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 87 transition count 71
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 62 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 61 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 54 place count 61 transition count 63
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 66 place count 55 transition count 63
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 70 place count 51 transition count 59
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 51 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 51 transition count 58
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 109 place count 34 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 119 place count 34 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 32 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 30 transition count 28
Applied a total of 123 rules in 17 ms. Remains 30 /154 variables (removed 124) and now considering 28/186 (removed 158) transitions.
[2024-05-29 17:06:46] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 30 cols
[2024-05-29 17:06:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 17:06:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 17:06:46] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2024-05-29 17:06:46] [INFO ] Invariant cache hit.
[2024-05-29 17:06:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 17:06:46] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 17:06:46] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-29 17:06:46] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2024-05-29 17:06:46] [INFO ] Invariant cache hit.
[2024-05-29 17:06:46] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 3/30 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 22/52 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 16 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 3/30 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 22/52 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-29 17:06:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/52 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 61 constraints, problems are : Problem set: 0 solved, 16 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 676ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/154 places, 28/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 30/154 places, 28/186 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-05 finished in 961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Graph (trivial) has 146 edges and 154 vertex of which 64 / 154 are part of one of the 6 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 95 transition count 76
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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 66 place count 65 transition count 71
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 62 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 61 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 71 place count 61 transition count 65
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 81 place count 56 transition count 65
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 85 place count 52 transition count 61
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 52 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 52 transition count 60
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 124 place count 35 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 133 place count 35 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 134 place count 34 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 136 place count 32 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 137 place count 31 transition count 31
Applied a total of 137 rules in 21 ms. Remains 31 /154 variables (removed 123) and now considering 31/186 (removed 155) transitions.
[2024-05-29 17:06:47] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 31 cols
[2024-05-29 17:06:47] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 17:06:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 17:06:47] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2024-05-29 17:06:47] [INFO ] Invariant cache hit.
[2024-05-29 17:06:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-29 17:06:47] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-29 17:06:47] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2024-05-29 17:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 25/56 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/57 variables, and 40 constraints, problems are : Problem set: 0 solved, 16 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 25/56 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/57 variables, and 56 constraints, problems are : Problem set: 0 solved, 16 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/154 places, 31/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 31/154 places, 31/186 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-06
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-06 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(((X(G(p1)) U (p2 U X(p3))) U p1)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 146 transition count 177
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 141 transition count 172
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 141 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 137 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 137 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 136 transition count 167
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 136 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 135 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 135 transition count 166
Applied a total of 39 rules in 13 ms. Remains 135 /154 variables (removed 19) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 135 cols
[2024-05-29 17:06:47] [INFO ] Computed 11 invariants in 4 ms
[2024-05-29 17:06:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 17:06:47] [INFO ] Invariant cache hit.
[2024-05-29 17:06:48] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-29 17:06:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 17:06:49] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-29 17:06:49] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 3 ms to minimize.
[2024-05-29 17:06:49] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-29 17:06:49] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-05-29 17:06:49] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-29 17:06:49] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-29 17:06:49] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/301 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 153 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6156 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/301 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 165/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 318 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 7/7 constraints]
After SMT, in 11319ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 11322ms
Starting structural reductions in LTL mode, iteration 1 : 135/154 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11541 ms. Remains : 135/154 places, 166/186 transitions.
Stuttering acceptance computed with spot in 797 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND p2 (NOT p3) (NOT p1) (NOT p0)), true, (NOT p1), (AND p1 (NOT p3)), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 19 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-07 finished in 12378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F((p0&&F(p1))) U p2)&&X((!p1 U (p3||G(!p1))))))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 145 transition count 177
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 145 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 145 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 139 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 139 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 135 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 135 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 134 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 134 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 133 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 133 transition count 164
Applied a total of 43 rules in 22 ms. Remains 133 /154 variables (removed 21) and now considering 164/186 (removed 22) transitions.
// Phase 1: matrix 164 rows 133 cols
[2024-05-29 17:07:00] [INFO ] Computed 11 invariants in 2 ms
[2024-05-29 17:07:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 17:07:00] [INFO ] Invariant cache hit.
[2024-05-29 17:07:00] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-29 17:07:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 4 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-29 17:07:02] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-29 17:07:02] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:07:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:07:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/297 variables, 133/152 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 152 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6644 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-29 17:07:08] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/297 variables, 133/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 163/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/297 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 316 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5649 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 9/9 constraints]
After SMT, in 12319ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 12321ms
Starting structural reductions in LTL mode, iteration 1 : 133/154 places, 164/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12541 ms. Remains : 133/154 places, 164/186 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p2) (AND p1 (NOT p3))), (OR (NOT p2) (AND p1 (NOT p3))), (OR (NOT p2) (AND p1 (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p2), (AND p1 (NOT p3)), (NOT p1), true]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-10
Stuttering criterion allowed to conclude after 227 steps with 2 reset in 2 ms.
FORMULA SmartHome-PT-08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-10 finished in 12902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)&&p0)))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 145 transition count 177
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 145 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 145 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 139 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 139 transition count 170
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 134 transition count 165
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 134 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 133 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 133 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 132 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 132 transition count 163
Applied a total of 45 rules in 8 ms. Remains 132 /154 variables (removed 22) and now considering 163/186 (removed 23) transitions.
// Phase 1: matrix 163 rows 132 cols
[2024-05-29 17:07:13] [INFO ] Computed 11 invariants in 1 ms
[2024-05-29 17:07:13] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 17:07:13] [INFO ] Invariant cache hit.
[2024-05-29 17:07:13] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-29 17:07:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-29 17:07:14] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-29 17:07:14] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:07:14] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-29 17:07:14] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-29 17:07:14] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 2 ms to minimize.
[2024-05-29 17:07:15] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-29 17:07:15] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-29 17:07:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5962 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 162/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 313 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4736 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 10725ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 10727ms
Starting structural reductions in LTL mode, iteration 1 : 132/154 places, 163/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10963 ms. Remains : 132/154 places, 163/186 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-11 finished in 11163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1&&(p1 U p2)))))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 146 transition count 177
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 141 transition count 172
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 141 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 137 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 137 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 136 transition count 167
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 136 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 135 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 135 transition count 166
Applied a total of 39 rules in 8 ms. Remains 135 /154 variables (removed 19) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 135 cols
[2024-05-29 17:07:24] [INFO ] Computed 11 invariants in 1 ms
[2024-05-29 17:07:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 17:07:24] [INFO ] Invariant cache hit.
[2024-05-29 17:07:24] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-29 17:07:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 17:07:25] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-29 17:07:25] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/301 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 148 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5762 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/301 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 165/313 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-29 17:07:32] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 2 ms to minimize.
[2024-05-29 17:07:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 315 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6592 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 4/4 constraints]
After SMT, in 12383ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 12385ms
Starting structural reductions in LTL mode, iteration 1 : 135/154 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12610 ms. Remains : 135/154 places, 166/186 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-12
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-12 finished in 12834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 145 transition count 177
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 145 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 145 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 139 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 139 transition count 170
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 134 transition count 165
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 134 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 133 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 133 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 132 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 132 transition count 163
Applied a total of 45 rules in 6 ms. Remains 132 /154 variables (removed 22) and now considering 163/186 (removed 23) transitions.
// Phase 1: matrix 163 rows 132 cols
[2024-05-29 17:07:37] [INFO ] Computed 11 invariants in 1 ms
[2024-05-29 17:07:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 17:07:37] [INFO ] Invariant cache hit.
[2024-05-29 17:07:37] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-29 17:07:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-29 17:07:38] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-29 17:07:38] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:07:38] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 3 ms to minimize.
[2024-05-29 17:07:38] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-05-29 17:07:38] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 2 ms to minimize.
[2024-05-29 17:07:39] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-29 17:07:39] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-29 17:07:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5761 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 162/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 313 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 10737ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 10739ms
Starting structural reductions in LTL mode, iteration 1 : 132/154 places, 163/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10956 ms. Remains : 132/154 places, 163/186 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-13
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 3 ms.
FORMULA SmartHome-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-13 finished in 11054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&F(p2)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Graph (trivial) has 142 edges and 154 vertex of which 62 / 154 are part of one of the 5 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 79
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 66 transition count 75
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 64 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 63 transition count 74
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 69 place count 63 transition count 68
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 81 place count 57 transition count 68
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 86 place count 52 transition count 62
Iterating global reduction 4 with 5 rules applied. Total rules applied 91 place count 52 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 52 transition count 61
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 122 place count 37 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 123 place count 37 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 125 place count 36 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 126 place count 36 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 131 place count 36 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 132 place count 35 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 133 place count 34 transition count 36
Applied a total of 133 rules in 28 ms. Remains 34 /154 variables (removed 120) and now considering 36/186 (removed 150) transitions.
[2024-05-29 17:07:48] [INFO ] Flow matrix only has 29 transitions (discarded 7 similar events)
// Phase 1: matrix 29 rows 34 cols
[2024-05-29 17:07:48] [INFO ] Computed 10 invariants in 0 ms
[2024-05-29 17:07:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 17:07:48] [INFO ] Flow matrix only has 29 transitions (discarded 7 similar events)
[2024-05-29 17:07:48] [INFO ] Invariant cache hit.
[2024-05-29 17:07:48] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 17:07:48] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-29 17:07:48] [INFO ] Flow matrix only has 29 transitions (discarded 7 similar events)
[2024-05-29 17:07:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/62 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/63 variables, and 44 constraints, problems are : Problem set: 0 solved, 24 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/62 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/63 variables, and 68 constraints, problems are : Problem set: 0 solved, 24 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 785ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 785ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/154 places, 36/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 34/154 places, 36/186 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-14 finished in 1022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||(p1&&G(p2))))))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 186/186 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 148 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 148 transition count 180
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 143 transition count 175
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 143 transition count 175
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 139 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 139 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 138 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 138 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 137 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 137 transition count 169
Applied a total of 34 rules in 6 ms. Remains 137 /154 variables (removed 17) and now considering 169/186 (removed 17) transitions.
// Phase 1: matrix 169 rows 137 cols
[2024-05-29 17:07:49] [INFO ] Computed 11 invariants in 1 ms
[2024-05-29 17:07:49] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 17:07:49] [INFO ] Invariant cache hit.
[2024-05-29 17:07:49] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-29 17:07:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 17:07:50] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:07:50] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:07:50] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/306 variables, 137/156 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 17:07:53] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 157 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7094 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/306 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 168/326 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 326 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5924 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 10/10 constraints]
After SMT, in 13038ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 13040ms
Starting structural reductions in LTL mode, iteration 1 : 137/154 places, 169/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13260 ms. Remains : 137/154 places, 169/186 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SmartHome-PT-08-LTLFireability-15
Entered a terminal (fully accepting) state of product in 295 steps with 2 reset in 3 ms.
FORMULA SmartHome-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLFireability-15 finished in 13500 ms.
All properties solved by simple procedures.
Total runtime 113834 ms.
ITS solved all properties within timeout
BK_STOP 1717002482762
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is SmartHome-PT-08, 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 r377-smll-171683810300396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-08.tgz
mv SmartHome-PT-08 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '
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 ;