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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 7.0K Apr 29 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 63K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653107074686

Running Version 202205111006
[2022-05-21 04:24:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:24:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:24:36] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2022-05-21 04:24:36] [INFO ] Transformed 251 places.
[2022-05-21 04:24:36] [INFO ] Transformed 290 transitions.
[2022-05-21 04:24:36] [INFO ] Found NUPN structural information;
[2022-05-21 04:24:36] [INFO ] Parsed PT model containing 251 places and 290 transitions in 332 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-07-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 260
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 47 place count 175 transition count 220
Iterating global reduction 1 with 40 rules applied. Total rules applied 87 place count 175 transition count 220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 169 transition count 214
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 169 transition count 214
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 103 place count 165 transition count 210
Iterating global reduction 1 with 4 rules applied. Total rules applied 107 place count 165 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 164 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 164 transition count 209
Applied a total of 109 rules in 72 ms. Remains 164 /222 variables (removed 58) and now considering 209/260 (removed 51) transitions.
// Phase 1: matrix 209 rows 164 cols
[2022-05-21 04:24:37] [INFO ] Computed 3 place invariants in 23 ms
[2022-05-21 04:24:37] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 209 rows 164 cols
[2022-05-21 04:24:37] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 04:24:37] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
// Phase 1: matrix 209 rows 164 cols
[2022-05-21 04:24:37] [INFO ] Computed 3 place invariants in 11 ms
[2022-05-21 04:24:38] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/222 places, 209/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/222 places, 209/260 transitions.
Support contains 70 out of 164 places after structural reductions.
[2022-05-21 04:24:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2022-05-21 04:24:38] [INFO ] Flatten gal took : 99 ms
[2022-05-21 04:24:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-07-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:24:38] [INFO ] Flatten gal took : 40 ms
[2022-05-21 04:24:38] [INFO ] Input system was already deterministic with 209 transitions.
Support contains 61 out of 164 places (down from 70) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 872 ms. (steps per millisecond=11 ) properties (out of 50) seen :40
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 209 rows 164 cols
[2022-05-21 04:24:40] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 04:24:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-21 04:24:40] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:24:40] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-21 04:24:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-21 04:24:40] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-21 04:24:40] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-05-21 04:24:41] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 117 ms.
[2022-05-21 04:24:41] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 209/209 transitions.
Graph (trivial) has 149 edges and 164 vertex of which 55 / 164 are part of one of the 4 SCC in 17 ms
Free SCC test removed 51 places
Drop transitions removed 73 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 113 transition count 95
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 47 rules applied. Total rules applied 87 place count 74 transition count 87
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 98 place count 69 transition count 81
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 106 place count 65 transition count 77
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 106 place count 65 transition count 71
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 118 place count 59 transition count 71
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 131 place count 46 transition count 58
Iterating global reduction 4 with 13 rules applied. Total rules applied 144 place count 46 transition count 58
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 150 place count 46 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 45 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 45 transition count 51
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 182 place count 30 transition count 35
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 189 place count 30 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 191 place count 30 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 192 place count 29 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 28 transition count 25
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 197 place count 24 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 197 place count 24 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 203 place count 21 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 204 place count 21 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 205 place count 20 transition count 21
Applied a total of 205 rules in 92 ms. Remains 20 /164 variables (removed 144) and now considering 21/209 (removed 188) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/164 places, 21/209 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 21 rows 20 cols
[2022-05-21 04:24:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-21 04:24:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-21 04:24:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-21 04:24:42] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-21 04:24:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-21 04:24:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:24:42] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-21 04:24:42] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-21 04:24:42] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 21/21 transitions.
Graph (trivial) has 3 edges and 20 vertex of which 2 / 20 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 18 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 17
Applied a total of 4 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 17/21 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 17/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 17 cols
[2022-05-21 04:24:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:24:42] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 04:24:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-21 04:24:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-21 04:24:42] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 04:24:42] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-21 04:24:42] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17/17 places, 17/17 transitions.
Graph (trivial) has 7 edges and 17 vertex of which 4 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 13 transition count 6
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 6 transition count 5
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 2 with 2 rules applied. Total rules applied 19 place count 5 transition count 4
Graph (complete) has 7 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 4 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 4 transition count 3
Applied a total of 21 rules in 7 ms. Remains 4 /17 variables (removed 13) and now considering 3/17 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/17 places, 3/17 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2022-05-21 04:24:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-21 04:24:42] [INFO ] Flatten gal took : 16 ms
FORMULA SmartHome-PT-07-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:24:42] [INFO ] Flatten gal took : 17 ms
[2022-05-21 04:24:43] [INFO ] Input system was already deterministic with 209 transitions.
Support contains 57 out of 164 places (down from 59) after GAL structural reductions.
Computed a total of 46 stabilizing places and 45 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Graph (trivial) has 146 edges and 164 vertex of which 53 / 164 are part of one of the 4 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 114 transition count 107
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 43 rules applied. Total rules applied 82 place count 76 transition count 102
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 85 place count 74 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 73 transition count 101
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 86 place count 73 transition count 96
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 96 place count 68 transition count 96
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 109 place count 55 transition count 83
Iterating global reduction 4 with 13 rules applied. Total rules applied 122 place count 55 transition count 83
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 127 place count 55 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 54 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 54 transition count 77
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 161 place count 38 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 3 rules applied. Total rules applied 164 place count 38 transition count 57
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 167 place count 37 transition count 55
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 169 place count 36 transition count 54
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 8 with 2 rules applied. Total rules applied 171 place count 35 transition count 53
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 182 place count 35 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 183 place count 34 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 183 place count 34 transition count 41
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 185 place count 33 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 186 place count 32 transition count 40
Applied a total of 186 rules in 41 ms. Remains 32 /164 variables (removed 132) and now considering 40/209 (removed 169) transitions.
[2022-05-21 04:24:43] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
// Phase 1: matrix 37 rows 32 cols
[2022-05-21 04:24:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:24:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-21 04:24:43] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
// Phase 1: matrix 37 rows 32 cols
[2022-05-21 04:24:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:24:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-21 04:24:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-21 04:24:43] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-21 04:24:43] [INFO ] Flow matrix only has 37 transitions (discarded 3 similar events)
// Phase 1: matrix 37 rows 32 cols
[2022-05-21 04:24:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:24:43] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/164 places, 40/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/164 places, 40/209 transitions.
[2022-05-21 04:24:43] [INFO ] Flatten gal took : 4 ms
[2022-05-21 04:24:43] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:24:43] [INFO ] Input system was already deterministic with 40 transitions.
[2022-05-21 04:24:43] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:24:43] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:24:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17778422127993414208.gal : 2 ms
[2022-05-21 04:24:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12771991390024836147.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17778422127993414208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12771991390024836147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,23184,0.019283,4596,2,107,5,591,6,0,158,501,0


Converting to forward existential form...Done !
original formula: EF(((A(!((((((p6==1)||(p93==1)) * AG((p48==1))) + (p182!=1)) + (p62!=1))) U !(((p98==1)&&(p217==1)))) * (p107==1)) * (p238==1)))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p238==1)) * (p107==1)) * !(EG(!(!(((p98==1)&&(p217==1))))))) * !(E(!(!(((p98==1)&&(p217=...290
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t13, t17, t20, t21, t23, t31, Intersection with reachable at each step enabled. ...201
(forward)formula 0,1,0.058444,6672,1,0,109,8891,110,63,931,9542,128
FORMULA SmartHome-PT-07-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 146 transition count 191
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 146 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 146 transition count 187
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 142 transition count 183
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 142 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 141 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 141 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 140 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 140 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 139 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 139 transition count 180
Applied a total of 54 rules in 18 ms. Remains 139 /164 variables (removed 25) and now considering 180/209 (removed 29) transitions.
// Phase 1: matrix 180 rows 139 cols
[2022-05-21 04:24:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:24:43] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 180 rows 139 cols
[2022-05-21 04:24:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:24:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 139 cols
[2022-05-21 04:24:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:24:43] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/164 places, 180/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 139/164 places, 180/209 transitions.
[2022-05-21 04:24:43] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:24:43] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:24:44] [INFO ] Input system was already deterministic with 180 transitions.
[2022-05-21 04:24:44] [INFO ] Flatten gal took : 11 ms
[2022-05-21 04:24:44] [INFO ] Flatten gal took : 11 ms
[2022-05-21 04:24:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4888742502160074796.gal : 5 ms
[2022-05-21 04:24:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16967278423751912791.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4888742502160074796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16967278423751912791.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.96002e+09,0.210106,10356,2,1535,5,25204,6,0,732,26965,0


Converting to forward existential form...Done !
original formula: E(EG(((AX((p31==1)) * EX((p155==1))) * ((p95==1)&&(p18==1)))) U ((AF(AX((p225==1))) + (((EG((p77!=1)) * AG((p183==1))) * ((p153==1)&&(p76...326
=> equivalent forward existential formula: (([(FwdU(Init,EG(((!(EX(!((p31==1)))) * EX((p155==1))) * ((p95==1)&&(p18==1))))) * !(EG(!(!(EX(!((p225==1)))))))...832
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t9, t12, t30, t33, t35, t66, t69, t86, t92, t111, t118, t130, t133, t151, t154, t155,...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.14717,191316,1,0,617,1.13586e+06,417,364,4765,1.24707e+06,794
FORMULA SmartHome-PT-07-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 139 transition count 184
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 139 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 139 transition count 178
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 130 transition count 169
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 130 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 130 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 127 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 127 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 125 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 125 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 124 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 124 transition count 162
Applied a total of 87 rules in 23 ms. Remains 124 /164 variables (removed 40) and now considering 162/209 (removed 47) transitions.
// Phase 1: matrix 162 rows 124 cols
[2022-05-21 04:24:51] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:24:51] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 162 rows 124 cols
[2022-05-21 04:24:51] [INFO ] Computed 3 place invariants in 9 ms
[2022-05-21 04:24:51] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 124 cols
[2022-05-21 04:24:51] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-21 04:24:51] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/164 places, 162/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/164 places, 162/209 transitions.
[2022-05-21 04:24:51] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:24:51] [INFO ] Flatten gal took : 10 ms
[2022-05-21 04:24:51] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-21 04:24:51] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:24:51] [INFO ] Flatten gal took : 11 ms
[2022-05-21 04:24:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2835696252604621069.gal : 2 ms
[2022-05-21 04:24:51] [INFO ] Time to serialize properties into /tmp/CTLFireability573010248127204483.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2835696252604621069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability573010248127204483.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34059e+09,0.151431,8804,2,1213,5,18195,6,0,654,20507,0


Converting to forward existential form...Done !
original formula: AX(((p190==0) * !(E(AG(((p153==1)&&(p138==1))) U EF(((p202==1)&&(p171==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !((p190==0)))] = FALSE * [(FwdU(FwdU(EY(Init),!(E(TRUE U !(((p153==1)&&(p138==1)))))),TRUE) * ((p2...184
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t29, t32, t62, t65, t82, t85, t102, t105, t117, t136, t139, t145, Intersection with...237
(forward)formula 0,0,1.14727,33068,1,0,206,135736,352,141,3963,134931,341
FORMULA SmartHome-PT-07-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 138 transition count 183
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 138 transition count 183
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 138 transition count 177
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 129 transition count 168
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 129 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 129 transition count 167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 126 transition count 164
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 126 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 124 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 124 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 123 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 123 transition count 161
Applied a total of 89 rules in 19 ms. Remains 123 /164 variables (removed 41) and now considering 161/209 (removed 48) transitions.
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:24:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:24:53] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:24:53] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:24:53] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 123 cols
[2022-05-21 04:24:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:24:53] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/164 places, 161/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/164 places, 161/209 transitions.
[2022-05-21 04:24:53] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:24:53] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:24:53] [INFO ] Input system was already deterministic with 161 transitions.
[2022-05-21 04:24:53] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:24:53] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17827779238265182395.gal : 7 ms
[2022-05-21 04:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18328613870511438372.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17827779238265182395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18328613870511438372.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22346e+09,0.159595,9604,2,1263,5,20635,6,0,649,23777,0


Converting to forward existential form...Done !
original formula: AG((EX(((p166==0)||(p200==1))) + (EG(((p76==1)&&(p236==1))) * (p73==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((EG(((p76==1)&&(p236==1))) * (p73==0)))) * !(EX(((p166==0)||(p200==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t105, t116, t135, t138, t144, Intersection...242
(forward)formula 0,0,1.1064,30748,1,0,230,125988,346,153,3609,134048,362
FORMULA SmartHome-PT-07-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 140 transition count 185
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 140 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 140 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 130 transition count 170
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 130 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 127 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 127 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 125 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 124 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 124 transition count 163
Applied a total of 86 rules in 25 ms. Remains 124 /164 variables (removed 40) and now considering 163/209 (removed 46) transitions.
// Phase 1: matrix 163 rows 124 cols
[2022-05-21 04:24:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:24:54] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 163 rows 124 cols
[2022-05-21 04:24:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:24:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 124 cols
[2022-05-21 04:24:54] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:24:54] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/164 places, 163/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/164 places, 163/209 transitions.
[2022-05-21 04:24:54] [INFO ] Flatten gal took : 13 ms
[2022-05-21 04:24:54] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:24:54] [INFO ] Input system was already deterministic with 163 transitions.
[2022-05-21 04:24:54] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:24:54] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:24:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16497832085210693853.gal : 2 ms
[2022-05-21 04:24:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8586212325815170812.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16497832085210693853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8586212325815170812.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.86522e+09,0.207568,8636,2,1084,5,16109,6,0,655,18125,0


Converting to forward existential form...Done !
original formula: AG(AF(E((((p225!=1)||(p76==1))||((p10!=1)||((p2==1)&&(p185==1)))) U ((p28!=1) * AX((p84==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E((((p225!=1)||(p76==1))||((p10!=1)||((p2==1)&&(p185==1)))) U ((p28!=1) * !(EX(!((p84==1...172
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t63, t80, t83, t101, t104, t116, t135, t138, t139, t145, Interse...247
(forward)formula 0,0,5.33147,144524,1,0,511,797534,354,297,3669,1.01905e+06,645
FORMULA SmartHome-PT-07-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 137 transition count 182
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 137 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 137 transition count 176
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 127 transition count 166
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 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 81 place count 127 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 124 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 124 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 122 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 121 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 121 transition count 159
Applied a total of 93 rules in 11 ms. Remains 121 /164 variables (removed 43) and now considering 159/209 (removed 50) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:00] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:00] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:00] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/164 places, 159/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/164 places, 159/209 transitions.
[2022-05-21 04:25:00] [INFO ] Flatten gal took : 10 ms
[2022-05-21 04:25:00] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:25:00] [INFO ] Input system was already deterministic with 159 transitions.
[2022-05-21 04:25:00] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:25:00] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:25:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16591737193480250361.gal : 2 ms
[2022-05-21 04:25:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13932193290522304018.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16591737193480250361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13932193290522304018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20321e+09,0.250941,9552,2,1274,5,21208,6,0,639,23126,0


Converting to forward existential form...Done !
original formula: EF(EX(!(E(EF((p102==1)) U (((p2==1)&&(p185==1))||((p138==1)&&(p222==1)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(E(TRUE U (p102==1)) U (((p2==1)&&(p185==1))||((p138==1)&&(p222==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t114, t133, t136, t142, Intersection with ...236
(forward)formula 0,1,2.36831,62616,1,0,275,344331,343,188,3737,358045,404
FORMULA SmartHome-PT-07-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 140 transition count 185
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 140 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 140 transition count 181
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 130 transition count 171
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 130 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 130 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 127 transition count 167
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 127 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 125 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 125 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 124 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 124 transition count 164
Applied a total of 85 rules in 14 ms. Remains 124 /164 variables (removed 40) and now considering 164/209 (removed 45) transitions.
// Phase 1: matrix 164 rows 124 cols
[2022-05-21 04:25:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:03] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 164 rows 124 cols
[2022-05-21 04:25:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:03] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 124 cols
[2022-05-21 04:25:03] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:25:03] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/164 places, 164/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/164 places, 164/209 transitions.
[2022-05-21 04:25:03] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:25:03] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:25:03] [INFO ] Input system was already deterministic with 164 transitions.
[2022-05-21 04:25:03] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:25:03] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:25:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10180523788688140955.gal : 1 ms
[2022-05-21 04:25:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18315401255648255631.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10180523788688140955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18315401255648255631.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.4368e+09,0.147287,9236,2,1102,5,18671,6,0,656,20011,0


Converting to forward existential form...Done !
original formula: (EF(((p3==1) * EX(EF((p199==1))))) * (AF(EX(EG((p75==0)))) + AF(EX((((((p2==1)&&(p107==1))||(p45==1))||((p99==1)||(p153==1)))||(p12==1)))...158
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((p3==1) * EX(E(TRUE U (p199==1)))))))] = FALSE * [FwdG((Init * !(!(EG(!(EX(EG((p75==0)))))...246
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t104, t115, t134, t137, t138, t139, t145, ...254
Using saturation style SCC detection
(forward)formula 0,1,4.04966,121836,1,0,548,701426,368,316,4077,790273,705
FORMULA SmartHome-PT-07-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 137 transition count 182
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 137 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 137 transition count 176
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 127 transition count 166
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 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 81 place count 127 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 124 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 124 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 122 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 121 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 121 transition count 159
Applied a total of 93 rules in 7 ms. Remains 121 /164 variables (removed 43) and now considering 159/209 (removed 50) transitions.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:07] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:07] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 121 cols
[2022-05-21 04:25:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:07] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/164 places, 159/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/164 places, 159/209 transitions.
[2022-05-21 04:25:07] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:25:07] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:25:07] [INFO ] Input system was already deterministic with 159 transitions.
[2022-05-21 04:25:07] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:25:07] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5628160186981111485.gal : 7 ms
[2022-05-21 04:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability544473497449826590.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5628160186981111485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability544473497449826590.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20321e+09,0.212085,9588,2,1274,5,21208,6,0,639,23126,0


Converting to forward existential form...Done !
original formula: AF(EX(A(((p98==1)||((p13==1)&&(p40==1))) U (((p40==1) + AG((p185==1))) + AF((p45==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(!((((p40==1) + !(E(TRUE U !((p185==1))))) + !(EG(!((p45==1)))))) U (!(((p98==1)||((p13==1)&...321
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t114, t133, t136, t142, Intersection with ...236
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,15.342,390580,1,0,871,1.91277e+06,361,585,3939,2.99293e+06,979
FORMULA SmartHome-PT-07-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 140 transition count 185
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 140 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 140 transition count 179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 132 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 132 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 132 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 130 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 130 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 129 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 129 transition count 167
Applied a total of 77 rules in 6 ms. Remains 129 /164 variables (removed 35) and now considering 167/209 (removed 42) transitions.
// Phase 1: matrix 167 rows 129 cols
[2022-05-21 04:25:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 04:25:23] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 167 rows 129 cols
[2022-05-21 04:25:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:25:23] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 129 cols
[2022-05-21 04:25:23] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:25:23] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/164 places, 167/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/164 places, 167/209 transitions.
[2022-05-21 04:25:23] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:25:23] [INFO ] Flatten gal took : 10 ms
[2022-05-21 04:25:23] [INFO ] Input system was already deterministic with 167 transitions.
[2022-05-21 04:25:23] [INFO ] Flatten gal took : 10 ms
[2022-05-21 04:25:23] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:25:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13182566729288122553.gal : 2 ms
[2022-05-21 04:25:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7522737948868373955.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13182566729288122553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7522737948868373955.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3716e+09,0.369347,11136,2,1693,5,28031,6,0,679,30024,0


Converting to forward existential form...Done !
original formula: (AF(EG((p38==0))) + A(((EG((EX((p159==1)) + (p186==1))) + EG((p176!=1))) + (p167!=1)) U !((AG(!(((p206==1)&&(p170==1)))) + (p200==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(!((!(E(TRUE U !(!(((p206==1)&&(p170==1)))))) + (p200==1)))) U (!(((EG((EX((p159==1)) + (p...359
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t29, t37, t67, t70, t87, t90, t107, t110, t122, t141, t144, t150, Intersection with...237
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.7192,412376,1,0,1155,2.61576e+06,384,682,4164,2.94406e+06,1307
FORMULA SmartHome-PT-07-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 209/209 transitions.
Graph (trivial) has 154 edges and 164 vertex of which 62 / 164 are part of one of the 5 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 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 34 place count 106 transition count 101
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 40 rules applied. Total rules applied 74 place count 73 transition count 94
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 70 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 83 place count 67 transition count 91
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 83 place count 67 transition count 86
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 93 place count 62 transition count 86
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 107 place count 48 transition count 72
Iterating global reduction 4 with 14 rules applied. Total rules applied 121 place count 48 transition count 72
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 126 place count 48 transition count 67
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 158 place count 32 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 162 place count 32 transition count 46
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 165 place count 30 transition count 45
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 174 place count 30 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 175 place count 29 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 175 place count 29 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 177 place count 28 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 178 place count 27 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 179 place count 26 transition count 34
Applied a total of 179 rules in 23 ms. Remains 26 /164 variables (removed 138) and now considering 34/209 (removed 175) transitions.
[2022-05-21 04:25:39] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 26 cols
[2022-05-21 04:25:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:25:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-05-21 04:25:39] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 26 cols
[2022-05-21 04:25:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:25:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-21 04:25:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-21 04:25:39] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-21 04:25:39] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 26 cols
[2022-05-21 04:25:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:25:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/164 places, 34/209 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/164 places, 34/209 transitions.
[2022-05-21 04:25:39] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:25:39] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:25:39] [INFO ] Input system was already deterministic with 34 transitions.
[2022-05-21 04:25:39] [INFO ] Flatten gal took : 2 ms
[2022-05-21 04:25:39] [INFO ] Flatten gal took : 1 ms
[2022-05-21 04:25:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13421538801627260992.gal : 1 ms
[2022-05-21 04:25:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11978848074111408582.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13421538801627260992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11978848074111408582.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5120,0.007188,4504,2,69,5,387,6,0,125,325,0


Converting to forward existential form...Done !
original formula: ((EF(((p212==1) + EF((p97==1)))) + AG(!(E((p186==1) U (p201==1))))) + EG((p217==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(((Init * !(EG((p217==1)))) * !(E(TRUE U ((p212==1) + E(TRUE U (p97==1)))))),TRUE),(p186==1)) * (p201...169
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t24, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
(forward)formula 0,1,0.030186,5796,1,0,79,5595,99,44,740,5507,99
FORMULA SmartHome-PT-07-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2022-05-21 04:25:39] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:25:39] [INFO ] Flatten gal took : 7 ms
Total runtime 63229 ms.

BK_STOP 1653107139890

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-07, examination is CTLFireability"
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-165303241500242"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;