Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.2K Apr 29 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 15:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 71K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-11-LTLFireability-00
FORMULA_NAME SmartHome-PT-11-LTLFireability-01
FORMULA_NAME SmartHome-PT-11-LTLFireability-02
FORMULA_NAME SmartHome-PT-11-LTLFireability-03
FORMULA_NAME SmartHome-PT-11-LTLFireability-04
FORMULA_NAME SmartHome-PT-11-LTLFireability-05
FORMULA_NAME SmartHome-PT-11-LTLFireability-06
FORMULA_NAME SmartHome-PT-11-LTLFireability-07
FORMULA_NAME SmartHome-PT-11-LTLFireability-08
FORMULA_NAME SmartHome-PT-11-LTLFireability-09
FORMULA_NAME SmartHome-PT-11-LTLFireability-10
FORMULA_NAME SmartHome-PT-11-LTLFireability-11
FORMULA_NAME SmartHome-PT-11-LTLFireability-12
FORMULA_NAME SmartHome-PT-11-LTLFireability-13
FORMULA_NAME SmartHome-PT-11-LTLFireability-14
FORMULA_NAME SmartHome-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653108471535

Running Version 202205111006
[2022-05-21 04:47:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 04:47:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:47:53] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-05-21 04:47:53] [INFO ] Transformed 290 places.
[2022-05-21 04:47:53] [INFO ] Transformed 315 transitions.
[2022-05-21 04:47:53] [INFO ] Found NUPN structural information;
[2022-05-21 04:47:53] [INFO ] Parsed PT model containing 290 places and 315 transitions in 343 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 55 transitions.
FORMULA SmartHome-PT-11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 62 place count 162 transition count 207
Iterating global reduction 1 with 53 rules applied. Total rules applied 115 place count 162 transition count 207
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 120 place count 162 transition count 202
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 131 place count 151 transition count 191
Iterating global reduction 2 with 11 rules applied. Total rules applied 142 place count 151 transition count 191
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 141 transition count 181
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 141 transition count 181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 139 transition count 179
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 139 transition count 179
Applied a total of 166 rules in 84 ms. Remains 139 /224 variables (removed 85) and now considering 179/260 (removed 81) transitions.
// Phase 1: matrix 179 rows 139 cols
[2022-05-21 04:47:54] [INFO ] Computed 3 place invariants in 19 ms
[2022-05-21 04:47:54] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 179 rows 139 cols
[2022-05-21 04:47:54] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-21 04:47:54] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
// Phase 1: matrix 179 rows 139 cols
[2022-05-21 04:47:54] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 04:47:54] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/224 places, 179/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 139/224 places, 179/260 transitions.
Support contains 26 out of 139 places after structural reductions.
[2022-05-21 04:47:55] [INFO ] Flatten gal took : 65 ms
[2022-05-21 04:47:55] [INFO ] Flatten gal took : 30 ms
[2022-05-21 04:47:55] [INFO ] Input system was already deterministic with 179 transitions.
Support contains 24 out of 139 places (down from 26) after GAL structural reductions.
Finished random walk after 1565 steps, including 9 resets, run visited all 26 properties in 160 ms. (steps per millisecond=9 )
FORMULA SmartHome-PT-11-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35 stabilizing places and 34 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(F((G((!p0 U F(p1)))||p2)) U p0))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 131 transition count 171
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 131 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 131 transition count 170
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 126 transition count 165
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 126 transition count 165
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 123 transition count 162
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 123 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 122 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 122 transition count 160
Applied a total of 36 rules in 21 ms. Remains 122 /139 variables (removed 17) and now considering 160/179 (removed 19) transitions.
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:47:56] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:47:56] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:47:56] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-21 04:47:56] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 122 cols
[2022-05-21 04:47:56] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:47:56] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/139 places, 160/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/139 places, 160/179 transitions.
Stuttering acceptance computed with spot in 707 ms :[p0, p0, p0, true, (OR (AND p0 p2) (AND p0 p1)), p1, (OR p1 p2)]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s57 1), p0:(AND (EQ s85 1) (EQ s106 1)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17230 steps with 120 reset in 201 ms.
FORMULA SmartHome-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-00 finished in 1518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(F((G(X((X(p1)||p0)))&&p2))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 130 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 125 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 125 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 122 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 122 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 121 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 121 transition count 159
Applied a total of 38 rules in 28 ms. Remains 121 /139 variables (removed 18) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:57] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:47:57] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:47:57] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:47:57] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:47:57] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/139 places, 159/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/139 places, 159/179 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s94 0), p0:(OR (EQ s84 0) (EQ s115 0)), p1:(AND (EQ s94 0) (OR (EQ s2 0) (EQ s60 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 701 reset in 239 ms.
Product exploration explored 100000 steps with 704 reset in 396 ms.
Computed a total of 27 stabilizing places and 26 stable transitions
Computed a total of 27 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X p2), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 822 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 75 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:00] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-21 04:48:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-21 04:48:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:48:01] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-21 04:48:01] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-21 04:48:01] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 50 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 12 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X p2), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 942 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 159/159 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:02] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:02] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:48:02] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:03] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:48:03] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 159/159 transitions.
Computed a total of 27 stabilizing places and 26 stable transitions
Computed a total of 27 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X p2), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 669 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:04] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:48:04] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-21 04:48:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-21 04:48:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:48:04] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-21 04:48:04] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-21 04:48:04] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 121/121 places, 159/159 transitions.
Graph (trivial) has 113 edges and 121 vertex of which 43 / 121 are part of one of the 5 SCC in 6 ms
Free SCC test removed 38 places
Drop transitions removed 61 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 131 edges and 83 vertex of which 76 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 76 transition count 62
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 49 transition count 59
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 47 transition count 57
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 46 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 44 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 70 place count 44 transition count 52
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 76 place count 41 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 40 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 40 transition count 51
Performed 20 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 118 place count 20 transition count 26
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 36 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 10 rules applied. Total rules applied 128 place count 18 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 130 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 132 place count 16 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 134 place count 15 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 135 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 136 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 136 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 138 place count 12 transition count 12
Applied a total of 138 rules in 41 ms. Remains 12 /121 variables (removed 109) and now considering 12/159 (removed 147) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/121 places, 12/159 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Finished probabilistic random walk after 57 steps, run visited all 2 properties in 11 ms. (steps per millisecond=5 )
Probabilistic random walk after 57 steps, saw 27 distinct states, run finished after 12 ms. (steps per millisecond=4 ) properties seen :2
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X p2), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 927 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 700 reset in 273 ms.
Product exploration explored 100000 steps with 700 reset in 236 ms.
Built C files in :
/tmp/ltsmin10145619563543342202
[2022-05-21 04:48:07] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10145619563543342202
Running compilation step : cd /tmp/ltsmin10145619563543342202;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin10145619563543342202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10145619563543342202;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11240661322544858225.hoa' '--buchi-type=spotba'
LTSmin run took 636 ms.
FORMULA SmartHome-PT-11-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-11-LTLFireability-01 finished in 11321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 130 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 169
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 126 transition count 165
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 126 transition count 165
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 124 transition count 163
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 124 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 32 place count 124 transition count 162
Applied a total of 32 rules in 19 ms. Remains 124 /139 variables (removed 15) and now considering 162/179 (removed 17) transitions.
// Phase 1: matrix 162 rows 124 cols
[2022-05-21 04:48:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:08] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 162 rows 124 cols
[2022-05-21 04:48:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:09] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 124 cols
[2022-05-21 04:48:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:48:09] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 162/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/139 places, 162/179 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-02 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 s56 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]]
Entered a terminal (fully accepting) state of product in 518 steps with 3 reset in 2 ms.
FORMULA SmartHome-PT-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-02 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(G(p1))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 132 transition count 172
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 132 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 128 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 128 transition count 167
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 126 transition count 165
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 126 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 126 transition count 164
Applied a total of 28 rules in 16 ms. Remains 126 /139 variables (removed 13) and now considering 164/179 (removed 15) transitions.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:48:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:09] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:48:09] [INFO ] Computed 3 place invariants in 9 ms
[2022-05-21 04:48:09] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:48:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 04:48:09] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/139 places, 164/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/139 places, 164/179 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s57 0), p1:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-04 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(X(p0)))))&&G(X(p1))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 130 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 125 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 125 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 122 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 122 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 121 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 121 transition count 159
Applied a total of 38 rules in 8 ms. Remains 121 /139 variables (removed 18) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:09] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:09] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:10] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/139 places, 159/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/139 places, 159/179 transitions.
Stuttering acceptance computed with spot in 393 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(EQ s80 1), p0:(EQ s76 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, null][false, false, 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-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-06 finished in 786 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||F(p1)||p0)))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 132 transition count 172
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 132 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 171
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 129 transition count 168
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 127 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 127 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 126 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 126 transition count 164
Applied a total of 28 rules in 10 ms. Remains 126 /139 variables (removed 13) and now considering 164/179 (removed 15) transitions.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:48:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:10] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:48:10] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:48:10] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:48:10] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:48:10] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/139 places, 164/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/139 places, 164/179 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(EQ s74 1), p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 442 steps with 2 reset in 1 ms.
FORMULA SmartHome-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-07 finished in 597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(G(F(p0)))||p1))||G(p2)))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Graph (trivial) has 130 edges and 139 vertex of which 63 / 139 are part of one of the 6 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 78
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 58 transition count 74
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 56 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 55 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 55 place count 55 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 52 transition count 70
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 66 place count 47 transition count 65
Iterating global reduction 4 with 5 rules applied. Total rules applied 71 place count 47 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 47 transition count 64
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 110 place count 28 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 28 transition count 42
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 27 transition count 41
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 27 transition count 41
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 123 place count 27 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 124 place count 26 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 124 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 7 with 2 rules applied. Total rules applied 126 place count 25 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 127 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 128 place count 23 transition count 30
Applied a total of 128 rules in 44 ms. Remains 23 /139 variables (removed 116) and now considering 30/179 (removed 149) transitions.
[2022-05-21 04:48:11] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:48:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:48:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-21 04:48:11] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:48:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:48:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-21 04:48:11] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-21 04:48:11] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-21 04:48:11] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:48:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:48:11] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/139 places, 30/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/139 places, 30/179 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s1 0), p1:(EQ s5 0), p0:(EQ s6 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 15 steps with 1 reset in 0 ms.
FORMULA SmartHome-PT-11-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-09 finished in 459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!F(p0)) U X(!p0))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 130 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 125 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 125 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 122 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 122 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 121 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 121 transition count 159
Applied a total of 38 rules in 13 ms. Remains 121 /139 variables (removed 18) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:11] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:11] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:48:11] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:48:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:12] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/139 places, 159/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/139 places, 159/179 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Computed a total of 27 stabilizing places and 26 stable transitions
Computed a total of 27 stabilizing places and 26 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-11-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-11-LTLFireability-10 finished in 1326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Graph (trivial) has 134 edges and 139 vertex of which 51 / 139 are part of one of the 5 SCC in 0 ms
Free SCC test removed 46 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 92 transition count 83
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 39 rules applied. Total rules applied 72 place count 60 transition count 76
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 56 transition count 74
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 55 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 54 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 81 place count 54 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 89 place count 50 transition count 69
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 96 place count 43 transition count 62
Iterating global reduction 5 with 7 rules applied. Total rules applied 103 place count 43 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 105 place count 43 transition count 60
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 42 transition count 58
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 42 transition count 58
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 143 place count 24 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 144 place count 24 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 146 place count 23 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 147 place count 23 transition count 36
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 157 place count 23 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 159 place count 21 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 159 place count 21 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 161 place count 20 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 162 place count 19 transition count 24
Applied a total of 162 rules in 41 ms. Remains 19 /139 variables (removed 120) and now considering 24/179 (removed 155) transitions.
[2022-05-21 04:48:13] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 19 cols
[2022-05-21 04:48:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:48:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-21 04:48:13] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 19 cols
[2022-05-21 04:48:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:48:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-21 04:48:13] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-21 04:48:13] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 19 cols
[2022-05-21 04:48:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:48:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/139 places, 24/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/139 places, 24/179 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-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 s5 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 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-11 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!(p0 U p1)||X(p2)))&&F(G(X(F(p3)))))))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 132 transition count 172
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 132 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 127 transition count 167
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 127 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 124 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 124 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 123 transition count 162
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 123 transition count 162
Applied a total of 33 rules in 46 ms. Remains 123 /139 variables (removed 16) and now considering 162/179 (removed 17) transitions.
// Phase 1: matrix 162 rows 123 cols
[2022-05-21 04:48:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:13] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 162 rows 123 cols
[2022-05-21 04:48:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:13] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 123 cols
[2022-05-21 04:48:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:13] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 162/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/139 places, 162/179 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p3) (AND p1 (NOT p2))), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 p2 (NOT p3))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s103 0), p1:(EQ s61 1), p0:(EQ s4 1), p2:(EQ s4 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2245 reset in 231 ms.
Stack based approach found an accepted trace after 333 steps with 6 reset with depth 85 and stack size 85 in 1 ms.
FORMULA SmartHome-PT-11-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-11-LTLFireability-13 finished in 912 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(!p0)))) U ((X(p1) U p1)||p2)))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 179/179 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 131 transition count 171
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 131 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 131 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 127 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 127 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 125 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 124 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 124 transition count 163
Applied a total of 31 rules in 19 ms. Remains 124 /139 variables (removed 15) and now considering 163/179 (removed 16) transitions.
// Phase 1: matrix 163 rows 124 cols
[2022-05-21 04:48:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:14] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 163 rows 124 cols
[2022-05-21 04:48:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:14] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 124 cols
[2022-05-21 04:48:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:48:14] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 163/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/139 places, 163/179 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), p0, p0, true]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s6 1), p2:(EQ s65 1), p0:(AND (EQ s2 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-14 finished in 535 ms.
All properties solved by simple procedures.
Total runtime 21274 ms.

BK_STOP 1653108494813

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-11, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-smll-165303241600276"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;