About the Execution of 2023-gold for SmartHome-PT-19
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1030.359 | 33296.00 | 63518.00 | 577.90 | FFFTFTFFFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r395-smll-171683824400303.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 gold2023
Input is SmartHome-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683824400303
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 03:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 03:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 181K 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-19-LTLFireability-00
FORMULA_NAME SmartHome-PT-19-LTLFireability-01
FORMULA_NAME SmartHome-PT-19-LTLFireability-02
FORMULA_NAME SmartHome-PT-19-LTLFireability-03
FORMULA_NAME SmartHome-PT-19-LTLFireability-04
FORMULA_NAME SmartHome-PT-19-LTLFireability-05
FORMULA_NAME SmartHome-PT-19-LTLFireability-06
FORMULA_NAME SmartHome-PT-19-LTLFireability-07
FORMULA_NAME SmartHome-PT-19-LTLFireability-08
FORMULA_NAME SmartHome-PT-19-LTLFireability-09
FORMULA_NAME SmartHome-PT-19-LTLFireability-10
FORMULA_NAME SmartHome-PT-19-LTLFireability-11
FORMULA_NAME SmartHome-PT-19-LTLFireability-12
FORMULA_NAME SmartHome-PT-19-LTLFireability-13
FORMULA_NAME SmartHome-PT-19-LTLFireability-14
FORMULA_NAME SmartHome-PT-19-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716979597825
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-19
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 10:46:41] [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-29 10:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:46:41] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-29 10:46:41] [INFO ] Transformed 741 places.
[2024-05-29 10:46:41] [INFO ] Transformed 809 transitions.
[2024-05-29 10:46:41] [INFO ] Found NUPN structural information;
[2024-05-29 10:46:41] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 227 places in 15 ms
Reduce places removed 227 places and 198 transitions.
FORMULA SmartHome-PT-19-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 495 transition count 611
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 159 place count 355 transition count 471
Iterating global reduction 1 with 140 rules applied. Total rules applied 299 place count 355 transition count 471
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 312 place count 355 transition count 458
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 340 place count 327 transition count 430
Iterating global reduction 2 with 28 rules applied. Total rules applied 368 place count 327 transition count 430
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 394 place count 301 transition count 404
Iterating global reduction 2 with 26 rules applied. Total rules applied 420 place count 301 transition count 404
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 423 place count 301 transition count 401
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 431 place count 293 transition count 393
Iterating global reduction 3 with 8 rules applied. Total rules applied 439 place count 293 transition count 393
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 441 place count 291 transition count 391
Iterating global reduction 3 with 2 rules applied. Total rules applied 443 place count 291 transition count 391
Applied a total of 443 rules in 154 ms. Remains 291 /514 variables (removed 223) and now considering 391/611 (removed 220) transitions.
// Phase 1: matrix 391 rows 291 cols
[2024-05-29 10:46:42] [INFO ] Computed 3 invariants in 18 ms
[2024-05-29 10:46:42] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-29 10:46:42] [INFO ] Invariant cache hit.
[2024-05-29 10:46:42] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2024-05-29 10:46:42] [INFO ] Invariant cache hit.
[2024-05-29 10:46:43] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/514 places, 391/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 291/514 places, 391/611 transitions.
Support contains 35 out of 291 places after structural reductions.
[2024-05-29 10:46:43] [INFO ] Flatten gal took : 125 ms
[2024-05-29 10:46:43] [INFO ] Flatten gal took : 50 ms
[2024-05-29 10:46:43] [INFO ] Input system was already deterministic with 391 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 26) seen :25
Finished Best-First random walk after 1604 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=178 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 51 stabilizing places and 50 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 312 edges and 291 vertex of which 174 / 291 are part of one of the 16 SCC in 6 ms
Free SCC test removed 158 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 132 transition count 133
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 89 transition count 130
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 87 transition count 129
Reduce places removed 1 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 3 with 3 rules applied. Total rules applied 96 place count 86 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 85 transition count 127
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 97 place count 85 transition count 121
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 109 place count 79 transition count 121
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 116 place count 72 transition count 109
Iterating global reduction 5 with 7 rules applied. Total rules applied 123 place count 72 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 71 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 71 transition count 108
Performed 39 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 203 place count 32 transition count 64
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 30 transition count 56
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 30 transition count 56
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 223 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 29 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 224 place count 29 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 28 transition count 39
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 228 place count 26 transition count 35
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 26 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 25 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 24 transition count 34
Applied a total of 232 rules in 68 ms. Remains 24 /291 variables (removed 267) and now considering 34/391 (removed 357) transitions.
[2024-05-29 10:46:45] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
// Phase 1: matrix 26 rows 24 cols
[2024-05-29 10:46:45] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 10:46:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 10:46:45] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-05-29 10:46:45] [INFO ] Invariant cache hit.
[2024-05-29 10:46:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-29 10:46:45] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-29 10:46:45] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-05-29 10:46:45] [INFO ] Invariant cache hit.
[2024-05-29 10:46:45] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/291 places, 34/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 24/291 places, 34/391 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s8 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 4 ms.
FORMULA SmartHome-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-00 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 5 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 284 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 284 transition count 384
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 281 transition count 381
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 281 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 280 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 280 transition count 380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 279 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 279 transition count 379
Applied a total of 24 rules in 71 ms. Remains 279 /291 variables (removed 12) and now considering 379/391 (removed 12) transitions.
// Phase 1: matrix 379 rows 279 cols
[2024-05-29 10:46:45] [INFO ] Computed 3 invariants in 10 ms
[2024-05-29 10:46:45] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 10:46:45] [INFO ] Invariant cache hit.
[2024-05-29 10:46:46] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-29 10:46:46] [INFO ] Invariant cache hit.
[2024-05-29 10:46:46] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 279/291 places, 379/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 962 ms. Remains : 279/291 places, 379/391 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s176 1) (EQ s106 1)), p1:(AND (OR (EQ s2 0) (EQ s194 0)) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 932 reset in 587 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-19-LTLFireability-01 finished in 1824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 313 edges and 291 vertex of which 176 / 291 are part of one of the 16 SCC in 1 ms
Free SCC test removed 160 places
Ensure Unique test removed 217 transitions
Reduce isomorphic transitions removed 217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 130 transition count 129
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 86 transition count 126
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 84 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 83 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 96 place count 83 transition count 121
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 104 place count 79 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 110 place count 73 transition count 112
Iterating global reduction 4 with 6 rules applied. Total rules applied 116 place count 73 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 72 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 72 transition count 111
Performed 39 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 196 place count 33 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 33 transition count 68
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 201 place count 29 transition count 52
Iterating global reduction 5 with 4 rules applied. Total rules applied 205 place count 29 transition count 52
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 219 place count 29 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 221 place count 27 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 221 place count 27 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 26 transition count 37
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 225 place count 24 transition count 33
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 23 transition count 32
Applied a total of 228 rules in 46 ms. Remains 23 /291 variables (removed 268) and now considering 32/391 (removed 359) transitions.
[2024-05-29 10:46:47] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-29 10:46:47] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 10:46:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 10:46:47] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-29 10:46:47] [INFO ] Invariant cache hit.
[2024-05-29 10:46:47] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-29 10:46:47] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-29 10:46:47] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-29 10:46:47] [INFO ] Invariant cache hit.
[2024-05-29 10:46:47] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/291 places, 32/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 23/291 places, 32/391 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s5 1), p1:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-02 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 69 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-05-29 10:46:48] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:46:48] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 10:46:48] [INFO ] Invariant cache hit.
[2024-05-29 10:46:48] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-29 10:46:48] [INFO ] Invariant cache hit.
[2024-05-29 10:46:48] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 692 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s234 0), p1:(OR (EQ s203 0) (EQ s148 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 590 ms.
Product exploration explored 100000 steps with 50000 reset in 623 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 23 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-19-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLFireability-03 finished in 2087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))||F(p2)))))'
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 312 edges and 291 vertex of which 172 / 291 are part of one of the 15 SCC in 1 ms
Free SCC test removed 157 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 133 transition count 128
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 54 rules applied. Total rules applied 103 place count 85 transition count 122
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 111 place count 81 transition count 118
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 79 transition count 117
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 78 transition count 116
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 116 place count 78 transition count 112
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 124 place count 74 transition count 112
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 131 place count 67 transition count 100
Iterating global reduction 5 with 7 rules applied. Total rules applied 138 place count 67 transition count 100
Performed 32 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 202 place count 35 transition count 66
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 32 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 32 transition count 54
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 215 place count 32 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 31 transition count 47
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 30 transition count 44
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 30 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 29 transition count 43
Applied a total of 219 rules in 40 ms. Remains 29 /291 variables (removed 262) and now considering 43/391 (removed 348) transitions.
[2024-05-29 10:46:50] [INFO ] Flow matrix only has 31 transitions (discarded 12 similar events)
// Phase 1: matrix 31 rows 29 cols
[2024-05-29 10:46:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 10:46:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 10:46:50] [INFO ] Flow matrix only has 31 transitions (discarded 12 similar events)
[2024-05-29 10:46:50] [INFO ] Invariant cache hit.
[2024-05-29 10:46:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-29 10:46:50] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 10:46:50] [INFO ] Flow matrix only has 31 transitions (discarded 12 similar events)
[2024-05-29 10:46:50] [INFO ] Invariant cache hit.
[2024-05-29 10:46:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/291 places, 43/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 29/291 places, 43/391 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s4 1), p2:(OR (EQ s3 0) (EQ s15 0)), p1:(OR (EQ s7 0) (EQ s3 0) (EQ s15 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 111 steps with 3 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-04 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 37 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-05-29 10:46:50] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:46:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 10:46:50] [INFO ] Invariant cache hit.
[2024-05-29 10:46:50] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-29 10:46:50] [INFO ] Invariant cache hit.
[2024-05-29 10:46:51] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 874 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s30 1), p0:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLFireability-05 finished in 1734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F((p0||G(p1))))) U p2))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 313 edges and 291 vertex of which 192 / 291 are part of one of the 16 SCC in 1 ms
Free SCC test removed 176 places
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 114 transition count 118
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 80 transition count 118
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 69 place count 80 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 75 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 70 transition count 103
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 70 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 69 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 69 transition count 102
Performed 35 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 161 place count 34 transition count 65
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 31 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 31 transition count 53
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 181 place count 31 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 30 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 182 place count 30 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 29 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 186 place count 27 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 27 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 26 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 25 transition count 33
Applied a total of 190 rules in 24 ms. Remains 25 /291 variables (removed 266) and now considering 33/391 (removed 358) transitions.
[2024-05-29 10:46:52] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
// Phase 1: matrix 26 rows 25 cols
[2024-05-29 10:46:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 10:46:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 10:46:52] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 10:46:52] [INFO ] Invariant cache hit.
[2024-05-29 10:46:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 10:46:52] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-29 10:46:52] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-29 10:46:52] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 10:46:52] [INFO ] Invariant cache hit.
[2024-05-29 10:46:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/291 places, 33/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 25/291 places, 33/391 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s3 1), p0:(EQ s9 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-07 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(G(!p2))))'
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 29 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-05-29 10:46:52] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:46:52] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 10:46:52] [INFO ] Invariant cache hit.
[2024-05-29 10:46:52] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-29 10:46:52] [INFO ] Invariant cache hit.
[2024-05-29 10:46:53] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 826 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s170 1), p0:(EQ s49 1), p2:(AND (EQ s49 1) (EQ s76 1) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 40031 reset in 519 ms.
Product exploration explored 100000 steps with 40045 reset in 428 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 321 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 10:46:55] [INFO ] Invariant cache hit.
[2024-05-29 10:46:55] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p1) p2)), (F p2), (F p1), (F (AND (NOT p0) p1 (NOT p2))), (F p0)]
Knowledge based reduction with 18 factoid took 1159 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-05-29 10:46:57] [INFO ] Invariant cache hit.
[2024-05-29 10:46:57] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 10:46:57] [INFO ] Invariant cache hit.
[2024-05-29 10:46:58] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-29 10:46:58] [INFO ] Invariant cache hit.
[2024-05-29 10:46:58] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 803 ms. Remains : 271/271 places, 371/371 transitions.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Finished random walk after 4527 steps, including 12 resets, run visited all 5 properties in 143 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p1) p2)), (F p2), (F p1)]
Knowledge based reduction with 8 factoid took 419 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33341 reset in 424 ms.
Product exploration explored 100000 steps with 33086 reset in 438 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Graph (trivial) has 290 edges and 271 vertex of which 166 / 271 are part of one of the 15 SCC in 1 ms
Free SCC test removed 151 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 120 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 39 place count 120 transition count 165
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 120 transition count 165
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 63 place count 98 transition count 139
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 85 place count 98 transition count 139
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 125 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 98 transition count 132
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 158 place count 69 transition count 94
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 187 place count 69 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 66 transition count 91
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 66 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 66 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 62 transition count 87
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 62 transition count 87
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 210 place count 62 transition count 80
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 209 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 60 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 58 transition count 75
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 58 transition count 75
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 216 rules in 54 ms. Remains 58 /271 variables (removed 213) and now considering 75/371 (removed 296) transitions.
[2024-05-29 10:47:01] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-29 10:47:01] [INFO ] Flow matrix only has 62 transitions (discarded 13 similar events)
// Phase 1: matrix 62 rows 58 cols
[2024-05-29 10:47:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 10:47:01] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/271 places, 75/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 58/271 places, 75/371 transitions.
Built C files in :
/tmp/ltsmin1578970709162941337
[2024-05-29 10:47:01] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1578970709162941337
Running compilation step : cd /tmp/ltsmin1578970709162941337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1322 ms.
Running link step : cd /tmp/ltsmin1578970709162941337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin1578970709162941337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10975016811168731041.hoa' '--buchi-type=spotba'
LTSmin run took 2478 ms.
FORMULA SmartHome-PT-19-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-19-LTLFireability-08 finished in 13213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 6 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 283 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 283 transition count 383
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 279 transition count 379
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 279 transition count 379
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 276 transition count 376
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 276 transition count 376
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 273 transition count 373
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 273 transition count 373
Applied a total of 36 rules in 31 ms. Remains 273 /291 variables (removed 18) and now considering 373/391 (removed 18) transitions.
// Phase 1: matrix 373 rows 273 cols
[2024-05-29 10:47:05] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 10:47:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 10:47:05] [INFO ] Invariant cache hit.
[2024-05-29 10:47:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-29 10:47:06] [INFO ] Invariant cache hit.
[2024-05-29 10:47:06] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/291 places, 373/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 273/291 places, 373/391 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s9 1) (NOT (AND (EQ s188 1) (EQ s252 1) (EQ s64 1)))), p1:(AND (EQ s188 1) (EQ s252 1) (EQ s64 1)), p0:(OR (EQ s243 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-11 finished in 886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (p1||F(p2))))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 284 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 284 transition count 384
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 280 transition count 380
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 280 transition count 380
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 277 transition count 377
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Applied a total of 34 rules in 63 ms. Remains 274 /291 variables (removed 17) and now considering 374/391 (removed 17) transitions.
// Phase 1: matrix 374 rows 274 cols
[2024-05-29 10:47:06] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:47:06] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 10:47:06] [INFO ] Invariant cache hit.
[2024-05-29 10:47:07] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-29 10:47:07] [INFO ] Invariant cache hit.
[2024-05-29 10:47:07] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/291 places, 374/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 822 ms. Remains : 274/291 places, 374/391 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s213 1), p2:(EQ s169 1), p0:(NEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 296 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-12 finished in 995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 41 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-05-29 10:47:07] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 10:47:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 10:47:07] [INFO ] Invariant cache hit.
[2024-05-29 10:47:07] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-29 10:47:07] [INFO ] Invariant cache hit.
[2024-05-29 10:47:08] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s86 1) (AND (EQ s158 1) (EQ s262 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 729 reset in 294 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-19-LTLFireability-13 finished in 1049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U p2)))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 29 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
[2024-05-29 10:47:08] [INFO ] Invariant cache hit.
[2024-05-29 10:47:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 10:47:08] [INFO ] Invariant cache hit.
[2024-05-29 10:47:09] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-29 10:47:09] [INFO ] Invariant cache hit.
[2024-05-29 10:47:09] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s7 0), p2:(EQ s92 1), p1:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Product exploration explored 100000 steps with 50000 reset in 331 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Detected a total of 37/271 stabilizing places and 36/371 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLFireability-15 finished in 1607 ms.
All properties solved by simple procedures.
Total runtime 29017 ms.
BK_STOP 1716979631121
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is SmartHome-PT-19, 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 r395-smll-171683824400303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-19.tgz
mv SmartHome-PT-19 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;