Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 05:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 05:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 05:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 05:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:23 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-11-LTLCardinality-00
FORMULA_NAME SmartHome-PT-11-LTLCardinality-01
FORMULA_NAME SmartHome-PT-11-LTLCardinality-02
FORMULA_NAME SmartHome-PT-11-LTLCardinality-03
FORMULA_NAME SmartHome-PT-11-LTLCardinality-04
FORMULA_NAME SmartHome-PT-11-LTLCardinality-05
FORMULA_NAME SmartHome-PT-11-LTLCardinality-06
FORMULA_NAME SmartHome-PT-11-LTLCardinality-07
FORMULA_NAME SmartHome-PT-11-LTLCardinality-08
FORMULA_NAME SmartHome-PT-11-LTLCardinality-09
FORMULA_NAME SmartHome-PT-11-LTLCardinality-10
FORMULA_NAME SmartHome-PT-11-LTLCardinality-11
FORMULA_NAME SmartHome-PT-11-LTLCardinality-12
FORMULA_NAME SmartHome-PT-11-LTLCardinality-13
FORMULA_NAME SmartHome-PT-11-LTLCardinality-14
FORMULA_NAME SmartHome-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679246722874

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 17:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 17:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:25:25] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-19 17:25:25] [INFO ] Transformed 290 places.
[2023-03-19 17:25:25] [INFO ] Transformed 315 transitions.
[2023-03-19 17:25:25] [INFO ] Found NUPN structural information;
[2023-03-19 17:25:26] [INFO ] Parsed PT model containing 290 places and 315 transitions and 722 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 66 places in 6 ms
Reduce places removed 66 places and 55 transitions.
FORMULA SmartHome-PT-11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 260/260 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 215 transition count 260
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 61 place count 163 transition count 208
Iterating global reduction 1 with 52 rules applied. Total rules applied 113 place count 163 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 119 place count 163 transition count 202
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 130 place count 152 transition count 191
Iterating global reduction 2 with 11 rules applied. Total rules applied 141 place count 152 transition count 191
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 152 place count 141 transition count 180
Iterating global reduction 2 with 11 rules applied. Total rules applied 163 place count 141 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 141 transition count 179
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 135 transition count 173
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 135 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 134 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 134 transition count 172
Applied a total of 178 rules in 152 ms. Remains 134 /224 variables (removed 90) and now considering 172/260 (removed 88) transitions.
// Phase 1: matrix 172 rows 134 cols
[2023-03-19 17:25:26] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-19 17:25:26] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-19 17:25:26] [INFO ] Invariant cache hit.
[2023-03-19 17:25:27] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-19 17:25:27] [INFO ] Invariant cache hit.
[2023-03-19 17:25:27] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/224 places, 172/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 134/224 places, 172/260 transitions.
Support contains 16 out of 134 places after structural reductions.
[2023-03-19 17:25:27] [INFO ] Flatten gal took : 56 ms
[2023-03-19 17:25:27] [INFO ] Flatten gal took : 23 ms
[2023-03-19 17:25:27] [INFO ] Input system was already deterministic with 172 transitions.
Support contains 14 out of 134 places (down from 16) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:25:28] [INFO ] Invariant cache hit.
[2023-03-19 17:25:28] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:25:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:25:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:25:28] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:25:28] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-19 17:25:28] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 172/172 transitions.
Graph (trivial) has 129 edges and 134 vertex of which 72 / 134 are part of one of the 6 SCC in 4 ms
Free SCC test removed 66 places
Drop transitions removed 98 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 102 transitions.
Graph (complete) has 107 edges and 68 vertex of which 63 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 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 28 rules applied. Total rules applied 30 place count 63 transition count 40
Reduce places removed 21 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 1 with 23 rules applied. Total rules applied 53 place count 42 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 41 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 54 place count 41 transition count 35
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 38 transition count 35
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 36 transition count 33
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 36 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 36 transition count 32
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 66 place count 35 transition count 32
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 20 transition count 17
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 32 edges and 20 vertex of which 14 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 6 rules applied. Total rules applied 102 place count 14 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 13 transition count 8
Reduce places removed 4 places and 0 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 5 with 6 rules applied. Total rules applied 111 place count 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 113 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 113 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 115 place count 6 transition count 5
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 116 place count 5 transition count 4
Iterating global reduction 7 with 1 rules applied. Total rules applied 117 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 118 place count 4 transition count 3
Applied a total of 118 rules in 38 ms. Remains 4 /134 variables (removed 130) and now considering 3/172 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 4/134 places, 3/172 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
FORMULA SmartHome-PT-11-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 33 stabilizing places and 32 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G((p1 U p2)))) U p3))'
Support contains 6 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 172/172 transitions.
Graph (trivial) has 117 edges and 134 vertex of which 50 / 134 are part of one of the 5 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 88 transition count 84
Reduce places removed 25 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 29 rules applied. Total rules applied 55 place count 63 transition count 80
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 61 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 59 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 61 place count 59 transition count 72
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 73 place count 53 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 51 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 51 transition count 70
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 113 place count 33 transition count 50
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 32 transition count 49
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 32 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 31 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 31 transition count 48
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 126 place count 31 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 129 place count 28 transition count 38
Applied a total of 129 rules in 27 ms. Remains 28 /134 variables (removed 106) and now considering 38/172 (removed 134) transitions.
[2023-03-19 17:25:29] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
// Phase 1: matrix 34 rows 28 cols
[2023-03-19 17:25:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 17:25:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 17:25:29] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2023-03-19 17:25:29] [INFO ] Invariant cache hit.
[2023-03-19 17:25:29] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-19 17:25:29] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 17:25:29] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2023-03-19 17:25:29] [INFO ] Invariant cache hit.
[2023-03-19 17:25:29] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/134 places, 38/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 28/134 places, 38/172 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p3), true, (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s15 1), p0:(OR (EQ s8 0) (EQ s10 1)), p2:(EQ s4 1), p1:(OR (EQ s2 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-11-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-05 finished in 779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 172/172 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 128 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 128 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 125 transition count 163
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 125 transition count 163
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 122 transition count 160
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 122 transition count 160
Applied a total of 24 rules in 21 ms. Remains 122 /134 variables (removed 12) and now considering 160/172 (removed 12) transitions.
// Phase 1: matrix 160 rows 122 cols
[2023-03-19 17:25:29] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-19 17:25:29] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-19 17:25:29] [INFO ] Invariant cache hit.
[2023-03-19 17:25:30] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-19 17:25:30] [INFO ] Invariant cache hit.
[2023-03-19 17:25:30] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/134 places, 160/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 122/134 places, 160/172 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s55 0) (EQ s103 1)), p0:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 0 ms.
FORMULA SmartHome-PT-11-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-06 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 172/172 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 127 transition count 165
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 127 transition count 165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 125 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 125 transition count 163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 123 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 123 transition count 161
Applied a total of 22 rules in 18 ms. Remains 123 /134 variables (removed 11) and now considering 161/172 (removed 11) transitions.
// Phase 1: matrix 161 rows 123 cols
[2023-03-19 17:25:30] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 17:25:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-19 17:25:30] [INFO ] Invariant cache hit.
[2023-03-19 17:25:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-19 17:25:30] [INFO ] Invariant cache hit.
[2023-03-19 17:25:30] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/134 places, 161/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 123/134 places, 161/172 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 678 reset in 350 ms.
Product exploration explored 100000 steps with 703 reset in 274 ms.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Detected a total of 29/123 stabilizing places and 28/161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2278607 steps, run timeout after 3001 ms. (steps per millisecond=759 ) properties seen :{}
Probabilistic random walk after 2278607 steps, saw 374450 distinct states, run finished after 3002 ms. (steps per millisecond=759 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:25:35] [INFO ] Invariant cache hit.
[2023-03-19 17:25:35] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:25:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:25:35] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:25:35] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:25:35] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 17:25:35] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 161/161 transitions.
Graph (trivial) has 119 edges and 123 vertex of which 70 / 123 are part of one of the 6 SCC in 1 ms
Free SCC test removed 64 places
Drop transitions removed 96 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 101 transitions.
Graph (complete) has 93 edges and 59 vertex of which 48 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 48 transition count 29
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 46 place count 31 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 46 place count 31 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 30 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 29 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 29 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 29 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 28 transition count 26
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 2 with 26 rules applied. Total rules applied 78 place count 15 transition count 13
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 23 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 13 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 12 transition count 7
Reduce places removed 4 places and 0 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 3 with 6 rules applied. Total rules applied 91 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 93 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 93 place count 6 transition count 4
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 95 place count 5 transition count 4
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 4 transition count 3
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 4 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 3 transition count 2
Applied a total of 98 rules in 16 ms. Remains 3 /123 variables (removed 120) and now considering 2/161 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 3/123 places, 2/161 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 161/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-19 17:25:35] [INFO ] Invariant cache hit.
[2023-03-19 17:25:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 17:25:35] [INFO ] Invariant cache hit.
[2023-03-19 17:25:36] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-19 17:25:36] [INFO ] Invariant cache hit.
[2023-03-19 17:25:36] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 123/123 places, 161/161 transitions.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Detected a total of 29/123 stabilizing places and 28/161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 393 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2487980 steps, run timeout after 3001 ms. (steps per millisecond=829 ) properties seen :{}
Probabilistic random walk after 2487980 steps, saw 403354 distinct states, run finished after 3002 ms. (steps per millisecond=828 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:25:39] [INFO ] Invariant cache hit.
[2023-03-19 17:25:40] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:25:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:25:40] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:25:40] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:25:40] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 17:25:40] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 161/161 transitions.
Graph (trivial) has 119 edges and 123 vertex of which 70 / 123 are part of one of the 6 SCC in 1 ms
Free SCC test removed 64 places
Drop transitions removed 96 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 101 transitions.
Graph (complete) has 93 edges and 59 vertex of which 48 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 48 transition count 29
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 46 place count 31 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 46 place count 31 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 30 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 29 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 29 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 29 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 28 transition count 26
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 2 with 26 rules applied. Total rules applied 78 place count 15 transition count 13
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 23 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 13 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 12 transition count 7
Reduce places removed 4 places and 0 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 3 with 6 rules applied. Total rules applied 91 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 93 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 93 place count 6 transition count 4
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 95 place count 5 transition count 4
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 4 transition count 3
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 4 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 3 transition count 2
Applied a total of 98 rules in 26 ms. Remains 3 /123 variables (removed 120) and now considering 2/161 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 3/123 places, 2/161 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 60403 steps with 426 reset in 82 ms.
FORMULA SmartHome-PT-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-07 finished in 10420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((!p0&&X(p0))||G(p0))))))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 172/172 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 128 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 128 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 125 transition count 163
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 125 transition count 163
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 122 transition count 160
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 122 transition count 160
Applied a total of 24 rules in 12 ms. Remains 122 /134 variables (removed 12) and now considering 160/172 (removed 12) transitions.
// Phase 1: matrix 160 rows 122 cols
[2023-03-19 17:25:40] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 17:25:41] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-19 17:25:41] [INFO ] Invariant cache hit.
[2023-03-19 17:25:41] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-19 17:25:41] [INFO ] Invariant cache hit.
[2023-03-19 17:25:41] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/134 places, 160/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 122/134 places, 160/172 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s35 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][false, false, false, false]]
Product exploration explored 100000 steps with 792 reset in 167 ms.
Stack based approach found an accepted trace after 1004 steps with 6 reset with depth 95 and stack size 90 in 2 ms.
FORMULA SmartHome-PT-11-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-10 finished in 980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 172/172 transitions.
Graph (trivial) has 130 edges and 134 vertex of which 72 / 134 are part of one of the 6 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 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 22 place count 67 transition count 60
Reduce places removed 21 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 1 with 23 rules applied. Total rules applied 45 place count 46 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 45 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 45 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 42 transition count 55
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 40 transition count 53
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 40 transition count 53
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 86 place count 25 transition count 38
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 96 place count 25 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 23 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 98 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 4 with 2 rules applied. Total rules applied 100 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 21 transition count 26
Applied a total of 101 rules in 19 ms. Remains 21 /134 variables (removed 113) and now considering 26/172 (removed 146) transitions.
[2023-03-19 17:25:41] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2023-03-19 17:25:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 17:25:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 17:25:41] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2023-03-19 17:25:41] [INFO ] Invariant cache hit.
[2023-03-19 17:25:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-19 17:25:42] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 17:25:42] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2023-03-19 17:25:42] [INFO ] Invariant cache hit.
[2023-03-19 17:25:42] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/134 places, 26/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 21/134 places, 26/172 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 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 2828 steps with 273 reset in 15 ms.
FORMULA SmartHome-PT-11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-11 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 172/172 transitions.
Graph (trivial) has 130 edges and 134 vertex of which 72 / 134 are part of one of the 6 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 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 22 place count 67 transition count 60
Reduce places removed 21 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 1 with 23 rules applied. Total rules applied 45 place count 46 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 45 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 45 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 42 transition count 55
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 41 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 41 transition count 54
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 86 place count 25 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 24 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 24 transition count 37
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 98 place count 24 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 22 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 22 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 20 transition count 25
Applied a total of 103 rules in 23 ms. Remains 20 /134 variables (removed 114) and now considering 25/172 (removed 147) transitions.
[2023-03-19 17:25:42] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2023-03-19 17:25:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 17:25:42] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 17:25:42] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2023-03-19 17:25:42] [INFO ] Invariant cache hit.
[2023-03-19 17:25:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-19 17:25:42] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 17:25:42] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2023-03-19 17:25:42] [INFO ] Invariant cache hit.
[2023-03-19 17:25:42] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/134 places, 25/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 20/134 places, 25/172 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-13 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:(NEQ s4 1)], 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 7 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-13 finished in 331 ms.
All properties solved by simple procedures.
Total runtime 16826 ms.

BK_STOP 1679246743467

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-11"
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-5348"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-11, 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 r453-smll-167912645200235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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