fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r453-smll-167912645100203
Last Updated
May 14, 2023

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
355.388 16296.00 31719.00 471.20 FTFTFFFTFTFFFFFF normal

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-167912645100203.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-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645100203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.8K Feb 26 05:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 05:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 05:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 05:45 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.4K 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.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 05:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 05:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:47 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 63K 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-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 1679244934939

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-07
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 16:55:37] [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 16:55:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:55:38] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-19 16:55:38] [INFO ] Transformed 251 places.
[2023-03-19 16:55:38] [INFO ] Transformed 290 transitions.
[2023-03-19 16:55:38] [INFO ] Found NUPN structural information;
[2023-03-19 16:55:38] [INFO ] Parsed PT model containing 251 places and 290 transitions and 658 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 30 transitions.
FORMULA SmartHome-PT-07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 52 place count 170 transition count 214
Iterating global reduction 1 with 46 rules applied. Total rules applied 98 place count 170 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 101 place count 170 transition count 211
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 106 place count 165 transition count 206
Iterating global reduction 2 with 5 rules applied. Total rules applied 111 place count 165 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 161 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 161 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 159 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 159 transition count 200
Applied a total of 123 rules in 121 ms. Remains 159 /222 variables (removed 63) and now considering 200/260 (removed 60) transitions.
// Phase 1: matrix 200 rows 159 cols
[2023-03-19 16:55:38] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-19 16:55:39] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-19 16:55:39] [INFO ] Invariant cache hit.
[2023-03-19 16:55:39] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-03-19 16:55:39] [INFO ] Invariant cache hit.
[2023-03-19 16:55:39] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/222 places, 200/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 159/222 places, 200/260 transitions.
Support contains 34 out of 159 places after structural reductions.
[2023-03-19 16:55:40] [INFO ] Flatten gal took : 73 ms
[2023-03-19 16:55:40] [INFO ] Flatten gal took : 26 ms
[2023-03-19 16:55:40] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 33 out of 159 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 20) seen :18
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:55:40] [INFO ] Invariant cache hit.
[2023-03-19 16:55:40] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:55:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 16:55:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 16:55:41] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 16:55:41] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-19 16:55:41] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 200/200 transitions.
Graph (trivial) has 154 edges and 159 vertex of which 76 / 159 are part of one of the 6 SCC in 11 ms
Free SCC test removed 70 places
Drop transitions removed 101 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 102 transitions.
Graph (complete) has 141 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 88 transition count 69
Reduce places removed 28 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 34 rules applied. Total rules applied 65 place count 60 transition count 63
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 57 transition count 61
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 74 place count 55 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 74 place count 55 transition count 53
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 86 place count 49 transition count 53
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 92 place count 43 transition count 47
Iterating global reduction 4 with 6 rules applied. Total rules applied 98 place count 43 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 43 transition count 45
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 134 place count 26 transition count 27
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 43 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 10 rules applied. Total rules applied 144 place count 25 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 25 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 24 transition count 17
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 151 place count 19 transition count 17
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 151 place count 19 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 159 place count 15 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 160 place count 15 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 161 place count 14 transition count 12
Applied a total of 161 rules in 39 ms. Remains 14 /159 variables (removed 145) and now considering 12/200 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 14/159 places, 12/200 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 44 stabilizing places and 43 stable transitions
Graph (complete) has 251 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 140 transition count 182
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 140 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 140 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 49 place count 131 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 58 place count 131 transition count 170
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 124 transition count 163
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 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 73 place count 124 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 122 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 121 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 121 transition count 159
Applied a total of 79 rules in 28 ms. Remains 121 /159 variables (removed 38) and now considering 159/200 (removed 41) transitions.
// Phase 1: matrix 159 rows 121 cols
[2023-03-19 16:55:41] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 16:55:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-19 16:55:41] [INFO ] Invariant cache hit.
[2023-03-19 16:55:41] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-19 16:55:41] [INFO ] Invariant cache hit.
[2023-03-19 16:55:42] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/159 places, 159/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 121/159 places, 159/200 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-00 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:(NEQ s68 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 4 ms.
FORMULA SmartHome-PT-07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-00 finished in 919 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(F((p0&&F(p1)))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 200
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 141 transition count 183
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 141 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 141 transition count 180
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 46 place count 133 transition count 172
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 133 transition count 172
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 127 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 127 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 126 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 126 transition count 164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 125 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 125 transition count 163
Applied a total of 71 rules in 24 ms. Remains 125 /159 variables (removed 34) and now considering 163/200 (removed 37) transitions.
// Phase 1: matrix 163 rows 125 cols
[2023-03-19 16:55:42] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 16:55:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 16:55:42] [INFO ] Invariant cache hit.
[2023-03-19 16:55:42] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-19 16:55:42] [INFO ] Invariant cache hit.
[2023-03-19 16:55:42] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/159 places, 163/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 125/159 places, 163/200 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s119 0) (EQ s112 1)), p0:(OR (EQ s94 0) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Computed a total of 28 stabilizing places and 27 stable transitions
Computed a total of 28 stabilizing places and 27 stable transitions
Detected a total of 28/125 stabilizing places and 27/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-07-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-07-LTLCardinality-01 finished in 1746 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)))&&F(p1)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 200
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 141 transition count 183
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 141 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 141 transition count 180
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 46 place count 133 transition count 172
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 133 transition count 172
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 128 transition count 167
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 128 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 128 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 127 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 126 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 126 transition count 164
Applied a total of 69 rules in 40 ms. Remains 126 /159 variables (removed 33) and now considering 164/200 (removed 36) transitions.
// Phase 1: matrix 164 rows 126 cols
[2023-03-19 16:55:44] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-19 16:55:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 16:55:44] [INFO ] Invariant cache hit.
[2023-03-19 16:55:44] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-19 16:55:44] [INFO ] Invariant cache hit.
[2023-03-19 16:55:44] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/159 places, 164/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 126/159 places, 164/200 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s32 0) (EQ s68 1)), p0:(OR (EQ s103 0) (EQ s20 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Computed a total of 32 stabilizing places and 31 stable transitions
Computed a total of 32 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-07-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-07-LTLCardinality-03 finished in 1333 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(p0))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Graph (trivial) has 157 edges and 159 vertex of which 69 / 159 are part of one of the 6 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (complete) has 168 edges and 96 vertex of which 95 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 94 transition count 80
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 48 rules applied. Total rules applied 87 place count 57 transition count 69
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 52 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 92 place count 52 transition count 65
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 100 place count 48 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 107 place count 41 transition count 58
Iterating global reduction 3 with 7 rules applied. Total rules applied 114 place count 41 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 41 transition count 57
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 145 place count 26 transition count 41
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 155 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 25 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 156 place count 25 transition count 30
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 158 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 23 transition count 29
Applied a total of 159 rules in 34 ms. Remains 23 /159 variables (removed 136) and now considering 29/200 (removed 171) transitions.
[2023-03-19 16:55:45] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 23 cols
[2023-03-19 16:55:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 16:55:45] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 16:55:45] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2023-03-19 16:55:45] [INFO ] Invariant cache hit.
[2023-03-19 16:55:45] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-19 16:55:45] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-19 16:55:45] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2023-03-19 16:55:45] [INFO ] Invariant cache hit.
[2023-03-19 16:55:45] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/159 places, 29/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 23/159 places, 29/200 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s7 0) (NEQ s1 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-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-04 finished in 329 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((F(G(p0)) U p1))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 200
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 144 transition count 186
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 144 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 144 transition count 183
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 138 transition count 177
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 138 transition count 177
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 133 transition count 172
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 133 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 132 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 132 transition count 171
Applied a total of 56 rules in 27 ms. Remains 132 /159 variables (removed 27) and now considering 171/200 (removed 29) transitions.
// Phase 1: matrix 171 rows 132 cols
[2023-03-19 16:55:45] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 16:55:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 16:55:46] [INFO ] Invariant cache hit.
[2023-03-19 16:55:46] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-19 16:55:46] [INFO ] Invariant cache hit.
[2023-03-19 16:55:46] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/159 places, 171/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 132/159 places, 171/200 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s66 0) (EQ s26 1)), p0:(OR (EQ s77 0) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 713 reset in 329 ms.
Stack based approach found an accepted trace after 8287 steps with 58 reset with depth 199 and stack size 195 in 32 ms.
FORMULA SmartHome-PT-07-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-05 finished in 1054 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' '!((p0 U (G(p1)&&F(p0))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Graph (trivial) has 157 edges and 159 vertex of which 75 / 159 are part of one of the 6 SCC in 1 ms
Free SCC test removed 69 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Graph (complete) has 161 edges and 90 vertex of which 89 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 88 transition count 77
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 42 rules applied. Total rules applied 77 place count 55 transition count 68
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 51 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 81 place count 51 transition count 64
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 89 place count 47 transition count 64
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 96 place count 40 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 103 place count 40 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 40 transition count 56
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 130 place count 27 transition count 42
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 140 place count 27 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 26 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 141 place count 26 transition count 31
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 143 place count 25 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 24 transition count 30
Applied a total of 144 rules in 24 ms. Remains 24 /159 variables (removed 135) and now considering 30/200 (removed 170) transitions.
[2023-03-19 16:55:46] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 24 cols
[2023-03-19 16:55:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 16:55:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 16:55:47] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2023-03-19 16:55:47] [INFO ] Invariant cache hit.
[2023-03-19 16:55:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-19 16:55:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-19 16:55:47] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-19 16:55:47] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2023-03-19 16:55:47] [INFO ] Invariant cache hit.
[2023-03-19 16:55:47] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/159 places, 30/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 24/159 places, 30/200 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s4 1)), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-08 finished in 480 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(X(G(p0)))))'
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 141 transition count 182
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 141 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 141 transition count 179
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 132 transition count 170
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 132 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 125 transition count 163
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 125 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 125 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 123 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 123 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 122 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 122 transition count 159
Applied a total of 78 rules in 21 ms. Remains 122 /159 variables (removed 37) and now considering 159/200 (removed 41) transitions.
// Phase 1: matrix 159 rows 122 cols
[2023-03-19 16:55:47] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 16:55:47] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 16:55:47] [INFO ] Invariant cache hit.
[2023-03-19 16:55:47] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-19 16:55:47] [INFO ] Invariant cache hit.
[2023-03-19 16:55:47] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/159 places, 159/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 122/159 places, 159/200 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s87 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-11 finished in 640 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 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 200
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 142 transition count 184
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 142 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 142 transition count 181
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 44 place count 134 transition count 173
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 134 transition count 173
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 127 transition count 166
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 127 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 127 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 125 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 125 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 124 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 124 transition count 162
Applied a total of 73 rules in 26 ms. Remains 124 /159 variables (removed 35) and now considering 162/200 (removed 38) transitions.
// Phase 1: matrix 162 rows 124 cols
[2023-03-19 16:55:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 16:55:48] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-19 16:55:48] [INFO ] Invariant cache hit.
[2023-03-19 16:55:48] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-19 16:55:48] [INFO ] Invariant cache hit.
[2023-03-19 16:55:48] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/159 places, 162/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 124/159 places, 162/200 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-12 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:(AND (EQ s52 1) (OR (EQ s10 0) (EQ s18 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-12 finished in 583 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||X(p1)))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 140 transition count 182
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 140 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 140 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 49 place count 131 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 58 place count 131 transition count 170
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 124 transition count 163
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 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 73 place count 124 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 122 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 121 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 121 transition count 159
Applied a total of 79 rules in 8 ms. Remains 121 /159 variables (removed 38) and now considering 159/200 (removed 41) transitions.
// Phase 1: matrix 159 rows 121 cols
[2023-03-19 16:55:48] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 16:55:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 16:55:48] [INFO ] Invariant cache hit.
[2023-03-19 16:55:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-19 16:55:48] [INFO ] Invariant cache hit.
[2023-03-19 16:55:49] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/159 places, 159/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 121/159 places, 159/200 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s20 0) (EQ s120 1)), p1:(AND (EQ s59 0) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 361 steps with 0 reset in 5 ms.
FORMULA SmartHome-PT-07-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-13 finished in 566 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(F((!p0 U (G(!p0)||(!p0&&F(G(!p1))&&G(!p2)))))))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 200
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 144 transition count 186
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 144 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 144 transition count 183
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 138 transition count 177
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 138 transition count 177
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 135 transition count 174
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 135 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 134 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 134 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 133 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 133 transition count 172
Applied a total of 54 rules in 13 ms. Remains 133 /159 variables (removed 26) and now considering 172/200 (removed 28) transitions.
// Phase 1: matrix 172 rows 133 cols
[2023-03-19 16:55:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 16:55:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 16:55:49] [INFO ] Invariant cache hit.
[2023-03-19 16:55:49] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-19 16:55:49] [INFO ] Invariant cache hit.
[2023-03-19 16:55:49] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/159 places, 172/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 133/159 places, 172/200 transitions.
Stuttering acceptance computed with spot in 211 ms :[p0, p0, (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s108 0) (EQ s23 1)), p0:(OR (EQ s70 0) (EQ s17 1)), p1:(OR (EQ s37 0) (EQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-14 finished in 678 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((p0||X(F((p0&&F(p1)))))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 200/200 transitions.
Graph (trivial) has 157 edges and 159 vertex of which 73 / 159 are part of one of the 6 SCC in 2 ms
Free SCC test removed 67 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 163 edges and 92 vertex of which 91 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 90 transition count 78
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 79 place count 56 transition count 69
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 83 place count 52 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 83 place count 52 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 91 place count 48 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 98 place count 41 transition count 58
Iterating global reduction 3 with 7 rules applied. Total rules applied 105 place count 41 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 41 transition count 56
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 4 with 30 rules applied. Total rules applied 137 place count 26 transition count 41
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 147 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 25 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 22 transition count 29
Applied a total of 151 rules in 23 ms. Remains 22 /159 variables (removed 137) and now considering 29/200 (removed 171) transitions.
[2023-03-19 16:55:49] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2023-03-19 16:55:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:55:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 16:55:49] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2023-03-19 16:55:49] [INFO ] Invariant cache hit.
[2023-03-19 16:55:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-19 16:55:50] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-19 16:55:50] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2023-03-19 16:55:50] [INFO ] Invariant cache hit.
[2023-03-19 16:55:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/159 places, 29/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 22/159 places, 29/200 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-07-LTLCardinality-15 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}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-07-LTLCardinality-15 finished in 343 ms.
All properties solved by simple procedures.
Total runtime 12347 ms.

BK_STOP 1679244951235

--------------------
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-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-5348"
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 r453-smll-167912645100203"
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 ;