fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r240-smll-165303241500243
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SmartHome-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
221.079 10866.00 25868.00 168.20 FTFFTTFFFFTTFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241500243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241500243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 7.0K Apr 29 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 63K May 10 09:34 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-07-LTLCardinality-00
FORMULA_NAME SmartHome-PT-07-LTLCardinality-01
FORMULA_NAME SmartHome-PT-07-LTLCardinality-02
FORMULA_NAME SmartHome-PT-07-LTLCardinality-03
FORMULA_NAME SmartHome-PT-07-LTLCardinality-04
FORMULA_NAME SmartHome-PT-07-LTLCardinality-05
FORMULA_NAME SmartHome-PT-07-LTLCardinality-06
FORMULA_NAME SmartHome-PT-07-LTLCardinality-07
FORMULA_NAME SmartHome-PT-07-LTLCardinality-08
FORMULA_NAME SmartHome-PT-07-LTLCardinality-09
FORMULA_NAME SmartHome-PT-07-LTLCardinality-10
FORMULA_NAME SmartHome-PT-07-LTLCardinality-11
FORMULA_NAME SmartHome-PT-07-LTLCardinality-12
FORMULA_NAME SmartHome-PT-07-LTLCardinality-13
FORMULA_NAME SmartHome-PT-07-LTLCardinality-14
FORMULA_NAME SmartHome-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653107152729

Running Version 202205111006
[2022-05-21 04:25:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 04:25:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:25:55] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2022-05-21 04:25:55] [INFO ] Transformed 251 places.
[2022-05-21 04:25:55] [INFO ] Transformed 290 transitions.
[2022-05-21 04:25:55] [INFO ] Found NUPN structural information;
[2022-05-21 04:25:55] [INFO ] Parsed PT model containing 251 places and 290 transitions in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 29 places in 19 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SmartHome-PT-07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 216 transition count 260
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 60 place count 162 transition count 206
Iterating global reduction 1 with 54 rules applied. Total rules applied 114 place count 162 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 118 place count 162 transition count 202
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 129 place count 151 transition count 191
Iterating global reduction 2 with 11 rules applied. Total rules applied 140 place count 151 transition count 191
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 150 place count 141 transition count 181
Iterating global reduction 2 with 10 rules applied. Total rules applied 160 place count 141 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 137 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 137 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 136 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 136 transition count 176
Applied a total of 170 rules in 122 ms. Remains 136 /222 variables (removed 86) and now considering 176/260 (removed 84) transitions.
// Phase 1: matrix 176 rows 136 cols
[2022-05-21 04:25:56] [INFO ] Computed 4 place invariants in 17 ms
[2022-05-21 04:25:56] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 176 rows 136 cols
[2022-05-21 04:25:56] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-21 04:25:56] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 136 cols
[2022-05-21 04:25:56] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-21 04:25:57] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/222 places, 176/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/222 places, 176/260 transitions.
Support contains 17 out of 136 places after structural reductions.
[2022-05-21 04:25:57] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 04:25:57] [INFO ] Flatten gal took : 98 ms
FORMULA SmartHome-PT-07-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:25:57] [INFO ] Flatten gal took : 40 ms
[2022-05-21 04:25:57] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 15 out of 136 places (down from 17) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 738 ms. (steps per millisecond=13 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 176 rows 136 cols
[2022-05-21 04:25:58] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-21 04:25:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-21 04:25:58] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-21 04:25:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-21 04:25:58] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-21 04:25:58] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-21 04:25:58] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (trivial) has 134 edges and 136 vertex of which 70 / 136 are part of one of the 6 SCC in 11 ms
Free SCC test removed 64 places
Drop transitions removed 96 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 100 transitions.
Graph (complete) has 114 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 69 transition count 47
Reduce places removed 22 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 1 with 26 rules applied. Total rules applied 55 place count 47 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 45 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 57 place count 45 transition count 39
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 41 transition count 39
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 69 place count 37 transition count 35
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 37 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 74 place count 37 transition count 34
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 100 place count 24 transition count 21
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 105 place count 24 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 23 transition count 15
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 12 rules applied. Total rules applied 118 place count 17 transition count 9
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 124 place count 11 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 124 place count 11 transition count 6
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 131 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 131 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 133 place count 6 transition count 5
Applied a total of 133 rules in 74 ms. Remains 6 /136 variables (removed 130) and now considering 5/176 (removed 171) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/136 places, 5/176 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA SmartHome-PT-07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 32 stable transitions
Graph (complete) has 227 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 127 transition count 168
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 127 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 127 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 123 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 123 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 122 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 121 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 121 transition count 159
Applied a total of 32 rules in 18 ms. Remains 121 /136 variables (removed 15) and now considering 159/176 (removed 17) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:25:59] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:25:59] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:25:59] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/136 places, 159/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/136 places, 159/176 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s104 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]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 5 ms.
FORMULA SmartHome-PT-07-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-02 finished in 805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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, 176/176 transitions.
Graph (trivial) has 133 edges and 136 vertex of which 50 / 136 are part of one of the 5 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Graph (complete) has 163 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 89 transition count 80
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 72 place count 57 transition count 74
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 77 place count 54 transition count 72
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 53 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 52 transition count 71
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 80 place count 52 transition count 66
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 90 place count 47 transition count 66
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 96 place count 41 transition count 60
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 41 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 104 place count 41 transition count 58
Performed 15 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 134 place count 26 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 135 place count 26 transition count 39
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 145 place count 26 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 147 place count 24 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 147 place count 24 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 149 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 150 place count 22 transition count 27
Applied a total of 150 rules in 35 ms. Remains 22 /136 variables (removed 114) and now considering 27/176 (removed 149) transitions.
[2022-05-21 04:26:00] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 22 cols
[2022-05-21 04:26:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:26:00] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-21 04:26:00] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 22 cols
[2022-05-21 04:26:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:26:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-21 04:26:00] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-21 04:26:00] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-21 04:26:00] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 22 cols
[2022-05-21 04:26:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:26:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/136 places, 27/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/136 places, 27/176 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-03 finished in 249 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 128 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 128 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 128 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 124 transition count 163
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 124 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 124 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 123 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 122 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 122 transition count 160
Applied a total of 30 rules in 26 ms. Remains 122 /136 variables (removed 14) and now considering 160/176 (removed 16) transitions.
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:26:00] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:26:00] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:26:00] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:26:00] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:26:00] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:26:00] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/136 places, 160/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/136 places, 160/176 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s102 0)], 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 50000 reset in 448 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Computed a total of 27 stabilizing places and 26 stable transitions
Computed a total of 27 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-07-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-07-LTLCardinality-05 finished in 1383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (trivial) has 133 edges and 136 vertex of which 70 / 136 are part of one of the 6 SCC in 2 ms
Free SCC test removed 64 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 137 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 70 transition count 66
Reduce places removed 21 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 1 with 25 rules applied. Total rules applied 48 place count 49 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 47 transition count 62
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 50 place count 47 transition count 58
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 43 transition count 58
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 62 place count 39 transition count 54
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 39 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 39 transition count 53
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 93 place count 26 transition count 40
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 103 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 25 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 104 place count 25 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 24 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 23 transition count 28
Applied a total of 107 rules in 48 ms. Remains 23 /136 variables (removed 113) and now considering 28/176 (removed 148) transitions.
[2022-05-21 04:26:01] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 04:26:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:26:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-21 04:26:01] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 04:26:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:26:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-21 04:26:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-21 04:26:01] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-21 04:26:01] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 04:26:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:26:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/136 places, 28/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/136 places, 28/176 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1 0) (NEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-06 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))&&X(F(X(p1)))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 129 transition count 169
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 125 transition count 164
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 125 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 24 place count 125 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 124 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 124 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 123 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 161
Applied a total of 28 rules in 16 ms. Remains 123 /136 variables (removed 13) and now considering 161/176 (removed 15) transitions.
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:26:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 04:26:02] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:26:02] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-21 04:26:02] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:26:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 04:26:02] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/136 places, 161/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/136 places, 161/176 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s16 1), p1:(OR (EQ s104 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 176 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-07 finished in 737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (trivial) has 133 edges and 136 vertex of which 63 / 136 are part of one of the 6 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 146 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 26 place count 77 transition count 72
Reduce places removed 24 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 1 with 28 rules applied. Total rules applied 54 place count 53 transition count 68
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 57 place count 51 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 50 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 58 place count 50 transition count 63
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 66 place count 46 transition count 63
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 73 place count 39 transition count 56
Iterating global reduction 4 with 7 rules applied. Total rules applied 80 place count 39 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 39 transition count 54
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 110 place count 25 transition count 39
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 120 place count 25 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 122 place count 23 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 122 place count 23 transition count 28
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 124 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 21 transition count 27
Applied a total of 125 rules in 21 ms. Remains 21 /136 variables (removed 115) and now considering 27/176 (removed 149) transitions.
[2022-05-21 04:26:02] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-21 04:26:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:26:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-21 04:26:02] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-21 04:26:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:26:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-21 04:26:02] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-21 04:26:02] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-21 04:26:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:26:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/136 places, 27/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/136 places, 27/176 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-08 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:(EQ s0 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 28 steps with 1 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-08 finished in 266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&!p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (trivial) has 134 edges and 136 vertex of which 70 / 136 are part of one of the 6 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 137 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 70 transition count 67
Reduce places removed 20 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 1 with 24 rules applied. Total rules applied 46 place count 50 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 48 transition count 63
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 48 place count 48 transition count 58
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 58 place count 43 transition count 58
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 38 transition count 53
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 38 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 38 transition count 51
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 96 place count 25 transition count 38
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 25 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 23 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 108 place count 23 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 21 transition count 26
Applied a total of 111 rules in 17 ms. Remains 21 /136 variables (removed 115) and now considering 26/176 (removed 150) transitions.
[2022-05-21 04:26:02] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2022-05-21 04:26:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:26:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-21 04:26:02] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2022-05-21 04:26:02] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-21 04:26:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-21 04:26:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-21 04:26:03] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-21 04:26:03] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2022-05-21 04:26:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:26:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/136 places, 26/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/136 places, 26/176 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-12 finished in 235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (trivial) has 130 edges and 136 vertex of which 62 / 136 are part of one of the 6 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 149 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 25 place count 78 transition count 76
Reduce places removed 23 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 1 with 27 rules applied. Total rules applied 52 place count 55 transition count 72
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 55 place count 53 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 52 transition count 71
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 56 place count 52 transition count 65
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 68 place count 46 transition count 65
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 73 place count 41 transition count 60
Iterating global reduction 4 with 5 rules applied. Total rules applied 78 place count 41 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 41 transition count 59
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 107 place count 27 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 108 place count 27 transition count 43
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 118 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 119 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 119 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 121 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 122 place count 24 transition count 31
Applied a total of 122 rules in 17 ms. Remains 24 /136 variables (removed 112) and now considering 31/176 (removed 145) transitions.
[2022-05-21 04:26:03] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 24 cols
[2022-05-21 04:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:26:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-21 04:26:03] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 24 cols
[2022-05-21 04:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:26:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-21 04:26:03] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-21 04:26:03] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 24 cols
[2022-05-21 04:26:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:26:03] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/136 places, 31/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/136 places, 31/176 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(NEQ s7 0), p0:(OR (EQ s5 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 119 steps with 8 reset in 1 ms.
FORMULA SmartHome-PT-07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-15 finished in 313 ms.
All properties solved by simple procedures.
Total runtime 8282 ms.

BK_STOP 1653107163595

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-07"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-smll-165303241500243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-07.tgz
mv SmartHome-PT-07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;