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.r378-smll-171683811300372.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 itstools
Input is SmartHome-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811300372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 12 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 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 54K 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-05-LTLFireability-00
FORMULA_NAME SmartHome-PT-05-LTLFireability-01
FORMULA_NAME SmartHome-PT-05-LTLFireability-02
FORMULA_NAME SmartHome-PT-05-LTLFireability-03
FORMULA_NAME SmartHome-PT-05-LTLFireability-04
FORMULA_NAME SmartHome-PT-05-LTLFireability-05
FORMULA_NAME SmartHome-PT-05-LTLFireability-06
FORMULA_NAME SmartHome-PT-05-LTLFireability-07
FORMULA_NAME SmartHome-PT-05-LTLFireability-08
FORMULA_NAME SmartHome-PT-05-LTLFireability-09
FORMULA_NAME SmartHome-PT-05-LTLFireability-10
FORMULA_NAME SmartHome-PT-05-LTLFireability-11
FORMULA_NAME SmartHome-PT-05-LTLFireability-12
FORMULA_NAME SmartHome-PT-05-LTLFireability-13
FORMULA_NAME SmartHome-PT-05-LTLFireability-14
FORMULA_NAME SmartHome-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717030242205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 00:50:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 00:50:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:50:45] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-30 00:50:45] [INFO ] Transformed 213 places.
[2024-05-30 00:50:45] [INFO ] Transformed 245 transitions.
[2024-05-30 00:50:45] [INFO ] Found NUPN structural information;
[2024-05-30 00:50:45] [INFO ] Parsed PT model containing 213 places and 245 transitions and 557 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 227/227 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 150 transition count 181
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 150 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 97 place count 150 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 144 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 144 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 115 place count 138 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 121 place count 138 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 138 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 137 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 137 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 136 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 136 transition count 161
Applied a total of 126 rules in 164 ms. Remains 136 /196 variables (removed 60) and now considering 161/227 (removed 66) transitions.
// Phase 1: matrix 161 rows 136 cols
[2024-05-30 00:50:45] [INFO ] Computed 10 invariants in 22 ms
[2024-05-30 00:50:46] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-30 00:50:46] [INFO ] Invariant cache hit.
[2024-05-30 00:50:46] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 00:50:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 00:50:49] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 33 ms to minimize.
[2024-05-30 00:50:49] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-05-30 00:50:49] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-30 00:50:49] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 3 ms to minimize.
[2024-05-30 00:50:49] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-30 00:50:50] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/297 variables, 136/152 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 152 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8867 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/297 variables, 136/152 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 160/312 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 00:50:58] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-30 00:50:58] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 5 ms to minimize.
[2024-05-30 00:50:59] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 00:51:02] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/297 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 316 constraints, problems are : Problem set: 0 solved, 160 unsolved in 15215 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 10/10 constraints]
After SMT, in 24234ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 24265ms
Starting structural reductions in LTL mode, iteration 1 : 136/196 places, 161/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25241 ms. Remains : 136/196 places, 161/227 transitions.
Support contains 25 out of 136 places after structural reductions.
[2024-05-30 00:51:10] [INFO ] Flatten gal took : 50 ms
[2024-05-30 00:51:10] [INFO ] Flatten gal took : 23 ms
[2024-05-30 00:51:11] [INFO ] Input system was already deterministic with 161 transitions.
RANDOM walk for 40000 steps (327 resets) in 1213 ms. (32 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40004 steps (61 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (57 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
[2024-05-30 00:51:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 74/136 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 161/297 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 00:51:11] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 00:51:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 00:51:11] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 161/297 variables, 136/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 471 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 161/161 transitions.
Graph (trivial) has 127 edges and 136 vertex of which 58 / 136 are part of one of the 5 SCC in 3 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 74 transitions.
Graph (complete) has 159 edges and 83 vertex of which 80 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 80 transition count 58
Reduce places removed 23 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 27 rules applied. Total rules applied 56 place count 57 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 55 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 58 place count 55 transition count 49
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 68 place count 50 transition count 49
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 47 transition count 46
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 47 transition count 46
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 110 place count 29 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 84 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 115 place count 28 transition count 22
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 121 place count 28 transition count 16
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 127 place count 22 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 7 rules applied. Total rules applied 135 place count 18 transition count 11
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 139 place count 14 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 139 place count 14 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 145 place count 11 transition count 8
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 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 148 place count 9 transition count 7
Applied a total of 148 rules in 39 ms. Remains 9 /136 variables (removed 127) and now considering 7/161 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 9/136 places, 7/161 transitions.
RANDOM walk for 67 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/2 properties
Computed a total of 13 stabilizing places and 13 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' '!((G(F(p0))||G(p1)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Graph (trivial) has 122 edges and 136 vertex of which 52 / 136 are part of one of the 4 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 87 transition count 74
Reduce places removed 24 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 29 rules applied. Total rules applied 54 place count 63 transition count 69
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 59 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 59 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 61 place count 59 transition count 61
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 71 place count 54 transition count 61
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 51 transition count 58
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 51 transition count 58
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 115 place count 32 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 123 place count 32 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 30 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 28 transition count 27
Applied a total of 127 rules in 26 ms. Remains 28 /136 variables (removed 108) and now considering 27/161 (removed 134) transitions.
[2024-05-30 00:51:12] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 28 cols
[2024-05-30 00:51:12] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:51:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 00:51:13] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
[2024-05-30 00:51:13] [INFO ] Invariant cache hit.
[2024-05-30 00:51:13] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-30 00:51:13] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-30 00:51:13] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
[2024-05-30 00:51:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 3/28 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-30 00:51:13] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 23/51 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 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/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 3/28 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 23/51 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/52 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 630ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/136 places, 27/161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 759 ms. Remains : 28/136 places, 27/161 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-00 finished in 1175 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((p0||G(p1))))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 125 transition count 150
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 125 transition count 150
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 119 transition count 144
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 119 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 114 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 114 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 112 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 112 transition count 137
Applied a total of 48 rules in 18 ms. Remains 112 /136 variables (removed 24) and now considering 137/161 (removed 24) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-30 00:51:14] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:51:14] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-30 00:51:14] [INFO ] Invariant cache hit.
[2024-05-30 00:51:14] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-30 00:51:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 00:51:15] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 3 ms to minimize.
[2024-05-30 00:51:15] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-30 00:51:15] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-30 00:51:15] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 3 ms to minimize.
[2024-05-30 00:51:15] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-30 00:51:16] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 00:51:16] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6414 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5692 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 12150ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12156ms
Starting structural reductions in LTL mode, iteration 1 : 112/136 places, 137/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12436 ms. Remains : 112/136 places, 137/161 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 725 steps with 6 reset in 24 ms.
FORMULA SmartHome-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-02 finished in 12698 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)&&F(G(p1)))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Graph (trivial) has 127 edges and 136 vertex of which 63 / 136 are part of one of the 5 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 77 transition count 67
Reduce places removed 19 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 21 rules applied. Total rules applied 41 place count 58 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 57 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 42 place count 57 transition count 60
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 52 place count 52 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 48 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 48 transition count 56
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 98 place count 29 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 106 place count 29 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 27 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 25 transition count 25
Applied a total of 110 rules in 23 ms. Remains 25 /136 variables (removed 111) and now considering 25/161 (removed 136) transitions.
[2024-05-30 00:51:26] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 25 cols
[2024-05-30 00:51:26] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:51:26] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 00:51:26] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:51:26] [INFO ] Invariant cache hit.
[2024-05-30 00:51:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-30 00:51:26] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 00:51:26] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:51:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/45 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/45 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 45 constraints, problems are : Problem set: 0 solved, 12 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 503ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/136 places, 25/161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 ms. Remains : 25/136 places, 25/161 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-03 finished in 865 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(G(p0))&&F(p1)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 151
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 121 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 121 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 117 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 117 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 116 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 116 transition count 141
Applied a total of 40 rules in 20 ms. Remains 116 /136 variables (removed 20) and now considering 141/161 (removed 20) transitions.
// Phase 1: matrix 141 rows 116 cols
[2024-05-30 00:51:27] [INFO ] Computed 10 invariants in 6 ms
[2024-05-30 00:51:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-30 00:51:27] [INFO ] Invariant cache hit.
[2024-05-30 00:51:27] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-30 00:51:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-30 00:51:29] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 4 ms to minimize.
[2024-05-30 00:51:29] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/257 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/257 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 128 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6699 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/257 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 140/268 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-30 00:51:36] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-30 00:51:36] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 270 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7315 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 4/4 constraints]
After SMT, in 14057ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 14062ms
Starting structural reductions in LTL mode, iteration 1 : 116/136 places, 141/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14357 ms. Remains : 116/136 places, 141/161 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-04 finished in 14560 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||X(p1)))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 151
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 121 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 121 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 117 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 117 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 115 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 115 transition count 140
Applied a total of 42 rules in 18 ms. Remains 115 /136 variables (removed 21) and now considering 140/161 (removed 21) transitions.
// Phase 1: matrix 140 rows 115 cols
[2024-05-30 00:51:42] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:51:42] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-30 00:51:42] [INFO ] Invariant cache hit.
[2024-05-30 00:51:42] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-30 00:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-30 00:51:43] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 3 ms to minimize.
[2024-05-30 00:51:43] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/255 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 127 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6244 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/255 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 139/266 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-30 00:51:51] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-30 00:51:51] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/255 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 268 constraints, problems are : Problem set: 0 solved, 139 unsolved in 7100 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 4/4 constraints]
After SMT, in 13378ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 13382ms
Starting structural reductions in LTL mode, iteration 1 : 115/136 places, 140/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13660 ms. Remains : 115/136 places, 140/161 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-05
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-05 finished in 13802 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)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Graph (trivial) has 124 edges and 136 vertex of which 54 / 136 are part of one of the 4 SCC in 0 ms
Free SCC test removed 50 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 85 transition count 72
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 26 rules applied. Total rules applied 50 place count 62 transition count 69
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 59 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 55 place count 59 transition count 63
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 55 transition count 63
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 68 place count 50 transition count 58
Iterating global reduction 4 with 5 rules applied. Total rules applied 73 place count 50 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 50 transition count 56
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 49 transition count 55
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 49 transition count 55
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 115 place count 30 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 123 place count 30 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 125 place count 28 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 127 place count 26 transition count 24
Applied a total of 127 rules in 23 ms. Remains 26 /136 variables (removed 110) and now considering 24/161 (removed 137) transitions.
[2024-05-30 00:51:56] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 26 cols
[2024-05-30 00:51:56] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:51:56] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 00:51:56] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2024-05-30 00:51:56] [INFO ] Invariant cache hit.
[2024-05-30 00:51:56] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-30 00:51:56] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 00:51:56] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2024-05-30 00:51:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 3/26 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 20/46 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 34 constraints, problems are : Problem set: 0 solved, 14 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 3/26 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 20/46 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/136 places, 24/161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 26/136 places, 24/161 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-06 finished in 799 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)))&&(G(p1)||G(p2))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 151
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 151
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 120 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 120 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 115 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 115 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 113 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 113 transition count 138
Applied a total of 46 rules in 7 ms. Remains 113 /136 variables (removed 23) and now considering 138/161 (removed 23) transitions.
// Phase 1: matrix 138 rows 113 cols
[2024-05-30 00:51:56] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:51:56] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 00:51:56] [INFO ] Invariant cache hit.
[2024-05-30 00:51:57] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-30 00:51:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-30 00:51:58] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-30 00:51:58] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 4 ms to minimize.
[2024-05-30 00:51:58] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 3 ms to minimize.
[2024-05-30 00:51:58] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 3 ms to minimize.
[2024-05-30 00:51:58] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-30 00:51:58] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-30 00:51:58] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-30 00:51:59] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-30 00:51:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/251 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 132 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 137/269 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 269 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5518 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 9/9 constraints]
After SMT, in 10870ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 10873ms
Starting structural reductions in LTL mode, iteration 1 : 113/136 places, 138/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11152 ms. Remains : 113/136 places, 138/161 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-07
Entered a terminal (fully accepting) state of product in 21 steps with 1 reset in 2 ms.
FORMULA SmartHome-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-07 finished in 11519 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((G(p1)||p0))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 151
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 121 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 121 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 117 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 117 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 115 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 115 transition count 140
Applied a total of 42 rules in 8 ms. Remains 115 /136 variables (removed 21) and now considering 140/161 (removed 21) transitions.
// Phase 1: matrix 140 rows 115 cols
[2024-05-30 00:52:08] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:52:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-30 00:52:08] [INFO ] Invariant cache hit.
[2024-05-30 00:52:08] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-30 00:52:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-30 00:52:10] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-30 00:52:10] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 3 ms to minimize.
[2024-05-30 00:52:10] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/255 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 128 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6787 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/255 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 139/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 267 constraints, problems are : Problem set: 0 solved, 139 unsolved in 5251 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 3/3 constraints]
After SMT, in 12071ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 12074ms
Starting structural reductions in LTL mode, iteration 1 : 115/136 places, 140/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12366 ms. Remains : 115/136 places, 140/161 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-05-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-05-LTLFireability-08 finished in 13032 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&&G(F((!p0 U (p1||G(!p0))))))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Graph (trivial) has 127 edges and 136 vertex of which 65 / 136 are part of one of the 5 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 75 transition count 64
Reduce places removed 18 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 20 rules applied. Total rules applied 39 place count 57 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 56 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 40 place count 56 transition count 57
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 50 place count 51 transition count 57
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 48 transition count 54
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 48 transition count 54
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 92 place count 30 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 30 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 100 place count 30 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 29 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 27 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 104 place count 26 transition count 25
Applied a total of 104 rules in 22 ms. Remains 26 /136 variables (removed 110) and now considering 25/161 (removed 136) transitions.
[2024-05-30 00:52:21] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 26 cols
[2024-05-30 00:52:21] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 00:52:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 00:52:21] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:52:21] [INFO ] Invariant cache hit.
[2024-05-30 00:52:21] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-30 00:52:21] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 00:52:21] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-30 00:52:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 20/46 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 20/46 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 48 constraints, problems are : Problem set: 0 solved, 13 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/136 places, 25/161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 26/136 places, 25/161 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-09 finished in 989 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)&&X(G(p1))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 125 transition count 150
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 125 transition count 150
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 119 transition count 144
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 119 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 114 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 114 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 112 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 112 transition count 137
Applied a total of 48 rules in 14 ms. Remains 112 /136 variables (removed 24) and now considering 137/161 (removed 24) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-30 00:52:22] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:52:22] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 00:52:22] [INFO ] Invariant cache hit.
[2024-05-30 00:52:22] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-30 00:52:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 00:52:24] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-30 00:52:24] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-30 00:52:24] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-30 00:52:24] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 3 ms to minimize.
[2024-05-30 00:52:24] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-30 00:52:24] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-30 00:52:24] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6744 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5320 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 12096ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12098ms
Starting structural reductions in LTL mode, iteration 1 : 112/136 places, 137/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12377 ms. Remains : 112/136 places, 137/161 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-10 finished in 12572 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)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Graph (trivial) has 126 edges and 136 vertex of which 48 / 136 are part of one of the 5 SCC in 0 ms
Free SCC test removed 43 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 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 92 transition count 76
Reduce places removed 27 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 32 rules applied. Total rules applied 60 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 64 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 65 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 65 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 75 place count 56 transition count 65
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 80 place count 51 transition count 60
Iterating global reduction 4 with 5 rules applied. Total rules applied 85 place count 51 transition count 60
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 4 with 2 rules applied. Total rules applied 87 place count 51 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 50 transition count 58
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 126 place count 31 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 134 place count 31 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 136 place count 29 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 138 place count 27 transition count 27
Applied a total of 138 rules in 22 ms. Remains 27 /136 variables (removed 109) and now considering 27/161 (removed 134) transitions.
[2024-05-30 00:52:34] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 27 cols
[2024-05-30 00:52:34] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:52:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 00:52:34] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-30 00:52:34] [INFO ] Invariant cache hit.
[2024-05-30 00:52:35] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-30 00:52:35] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 00:52:35] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-30 00:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/50 variables, and 49 constraints, problems are : Problem set: 0 solved, 14 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/136 places, 27/161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 27/136 places, 27/161 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 88 steps with 8 reset in 1 ms.
FORMULA SmartHome-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-12 finished in 799 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)||(X(p1)&&F((p2&&X(p2))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 161/161 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 151
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 121 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 121 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 117 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 117 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 115 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 115 transition count 140
Applied a total of 42 rules in 9 ms. Remains 115 /136 variables (removed 21) and now considering 140/161 (removed 21) transitions.
// Phase 1: matrix 140 rows 115 cols
[2024-05-30 00:52:35] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:52:35] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-30 00:52:35] [INFO ] Invariant cache hit.
[2024-05-30 00:52:35] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-30 00:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 3 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/255 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 128 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6707 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/255 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 139/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-30 00:52:46] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/255 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/255 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 268 constraints, problems are : Problem set: 0 solved, 139 unsolved in 9535 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 4/4 constraints]
After SMT, in 16275ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 16281ms
Starting structural reductions in LTL mode, iteration 1 : 115/136 places, 140/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16542 ms. Remains : 115/136 places, 140/161 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLFireability-13
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLFireability-13 finished in 16789 ms.
All properties solved by simple procedures.
Total runtime 127845 ms.

BK_STOP 1717030372552

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-05, 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 r378-smll-171683811300372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-05.tgz
mv SmartHome-PT-05 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;