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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
952.880 202037.00 231484.00 822.80 FTTFFTTFFFTTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241600266.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241600266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:36 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:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K 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-10-CTLFireability-00
FORMULA_NAME SmartHome-PT-10-CTLFireability-01
FORMULA_NAME SmartHome-PT-10-CTLFireability-02
FORMULA_NAME SmartHome-PT-10-CTLFireability-03
FORMULA_NAME SmartHome-PT-10-CTLFireability-04
FORMULA_NAME SmartHome-PT-10-CTLFireability-05
FORMULA_NAME SmartHome-PT-10-CTLFireability-06
FORMULA_NAME SmartHome-PT-10-CTLFireability-07
FORMULA_NAME SmartHome-PT-10-CTLFireability-08
FORMULA_NAME SmartHome-PT-10-CTLFireability-09
FORMULA_NAME SmartHome-PT-10-CTLFireability-10
FORMULA_NAME SmartHome-PT-10-CTLFireability-11
FORMULA_NAME SmartHome-PT-10-CTLFireability-12
FORMULA_NAME SmartHome-PT-10-CTLFireability-13
FORMULA_NAME SmartHome-PT-10-CTLFireability-14
FORMULA_NAME SmartHome-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1653107941788

Running Version 202205111006
[2022-05-21 04:39:04] [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:39:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:39:04] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2022-05-21 04:39:04] [INFO ] Transformed 273 places.
[2022-05-21 04:39:04] [INFO ] Transformed 308 transitions.
[2022-05-21 04:39:04] [INFO ] Found NUPN structural information;
[2022-05-21 04:39:04] [INFO ] Parsed PT model containing 273 places and 308 transitions in 436 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 45 transitions.
Support contains 77 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 198 transition count 228
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 198 transition count 228
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 194 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 194 transition count 224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 192 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 192 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 191 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 191 transition count 221
Applied a total of 84 rules in 115 ms. Remains 191 /233 variables (removed 42) and now considering 221/263 (removed 42) transitions.
// Phase 1: matrix 221 rows 191 cols
[2022-05-21 04:39:05] [INFO ] Computed 12 place invariants in 18 ms
[2022-05-21 04:39:05] [INFO ] Implicit Places using invariants in 521 ms returned []
// Phase 1: matrix 221 rows 191 cols
[2022-05-21 04:39:05] [INFO ] Computed 12 place invariants in 12 ms
[2022-05-21 04:39:05] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 191 cols
[2022-05-21 04:39:05] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-21 04:39:06] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/233 places, 221/263 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/233 places, 221/263 transitions.
Support contains 77 out of 191 places after structural reductions.
[2022-05-21 04:39:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-21 04:39:06] [INFO ] Flatten gal took : 107 ms
FORMULA SmartHome-PT-10-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:39:06] [INFO ] Flatten gal took : 40 ms
[2022-05-21 04:39:06] [INFO ] Input system was already deterministic with 221 transitions.
Support contains 72 out of 191 places (down from 77) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 881 ms. (steps per millisecond=11 ) properties (out of 58) seen :49
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 221 rows 191 cols
[2022-05-21 04:39:08] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-21 04:39:08] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-21 04:39:08] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:39:08] [INFO ] After 233ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:1
[2022-05-21 04:39:08] [INFO ] After 351ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :3 real:1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-21 04:39:09] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :2 real:2
[2022-05-21 04:39:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-21 04:39:09] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:39:09] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-05-21 04:39:09] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-21 04:39:09] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 8 out of 191 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 191/191 places, 221/221 transitions.
Graph (trivial) has 161 edges and 191 vertex of which 39 / 191 are part of one of the 4 SCC in 5 ms
Free SCC test removed 35 places
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 156 transition count 118
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 71 rules applied. Total rules applied 126 place count 102 transition count 101
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 140 place count 92 transition count 97
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 144 place count 90 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 146 place count 88 transition count 95
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 146 place count 88 transition count 90
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 156 place count 83 transition count 90
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 171 place count 68 transition count 75
Iterating global reduction 5 with 15 rules applied. Total rules applied 186 place count 68 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 191 place count 68 transition count 70
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 193 place count 67 transition count 69
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 233 place count 47 transition count 47
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 146 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 8 rules applied. Total rules applied 241 place count 45 transition count 40
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 246 place count 45 transition count 35
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 251 place count 40 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 252 place count 39 transition count 34
Reduce places removed 3 places and 0 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 9 with 6 rules applied. Total rules applied 258 place count 36 transition count 31
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 4 rules applied. Total rules applied 262 place count 33 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 263 place count 32 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 263 place count 32 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 267 place count 30 transition count 28
Applied a total of 267 rules in 60 ms. Remains 30 /191 variables (removed 161) and now considering 28/221 (removed 193) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/191 places, 28/221 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 28 rows 30 cols
[2022-05-21 04:39:10] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 04:39:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-21 04:39:10] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-21 04:39:10] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-21 04:39:10] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-21 04:39:10] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-21 04:39:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-21 04:39:10] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-21 04:39:10] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-21 04:39:10] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-21 04:39:10] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 6 ms.
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 28/28 transitions.
Graph (trivial) has 12 edges and 30 vertex of which 6 / 30 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 26 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 24 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 24 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 22 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 20 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 20 transition count 14
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 24 place count 16 transition count 10
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 28 place count 12 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 28 place count 12 transition count 6
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 38 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 38 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 5 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 3 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 44 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 46 place count 2 transition count 2
Applied a total of 46 rules in 6 ms. Remains 2 /30 variables (removed 28) and now considering 2/28 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/30 places, 2/28 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2022-05-21 04:39:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-21 04:39:10] [INFO ] Flatten gal took : 21 ms
FORMULA SmartHome-PT-10-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:39:10] [INFO ] Flatten gal took : 21 ms
[2022-05-21 04:39:10] [INFO ] Input system was already deterministic with 221 transitions.
Support contains 63 out of 191 places (down from 64) after GAL structural reductions.
Computed a total of 24 stabilizing places and 24 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Graph (trivial) has 147 edges and 191 vertex of which 35 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 158 transition count 128
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 116 place count 107 transition count 115
Reduce places removed 8 places and 0 transitions.
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 2 with 11 rules applied. Total rules applied 127 place count 99 transition count 112
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 132 place count 98 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 136 place count 94 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 136 place count 94 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 150 place count 87 transition count 101
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 166 place count 71 transition count 85
Iterating global reduction 5 with 16 rules applied. Total rules applied 182 place count 71 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 189 place count 71 transition count 78
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 191 place count 70 transition count 77
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 225 place count 53 transition count 60
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 7 with 2 rules applied. Total rules applied 227 place count 53 transition count 58
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 229 place count 52 transition count 57
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 232 place count 52 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 233 place count 51 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 234 place count 51 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 235 place count 50 transition count 53
Applied a total of 235 rules in 47 ms. Remains 50 /191 variables (removed 141) and now considering 53/221 (removed 168) transitions.
[2022-05-21 04:39:10] [INFO ] Flow matrix only has 51 transitions (discarded 2 similar events)
// Phase 1: matrix 51 rows 50 cols
[2022-05-21 04:39:10] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-21 04:39:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-21 04:39:10] [INFO ] Flow matrix only has 51 transitions (discarded 2 similar events)
// Phase 1: matrix 51 rows 50 cols
[2022-05-21 04:39:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 04:39:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-21 04:39:11] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-21 04:39:11] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-21 04:39:11] [INFO ] Flow matrix only has 51 transitions (discarded 2 similar events)
// Phase 1: matrix 51 rows 50 cols
[2022-05-21 04:39:11] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-21 04:39:11] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/191 places, 53/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/191 places, 53/221 transitions.
[2022-05-21 04:39:11] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:39:11] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:39:11] [INFO ] Input system was already deterministic with 53 transitions.
[2022-05-21 04:39:11] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:39:11] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:39:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8756440156032794065.gal : 2 ms
[2022-05-21 04:39:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14839058225772526214.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/CTLFireability8756440156032794065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14839058225772526214.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,213841,0.036043,4608,2,427,5,1959,6,0,252,1525,0


Converting to forward existential form...Done !
original formula: (E(!(EF(!(((EG((p114==1)) * (p2==1)) * (p230==1))))) U ((EG((p68==1)) + (p114==1)) + (p262==1))) + AG((((p114==1)||(p110!=1)) * (AF(((p19...206
=> equivalent forward existential formula: ([(FwdU((Init * !(E(!(E(TRUE U !(((EG((p114==1)) * (p2==1)) * (p230==1))))) U ((EG((p68==1)) + (p114==1)) + (p26...418
Reverse transition relation is NOT exact ! Due to transitions t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.271947,11332,1,0,110,35913,156,62,1695,27105,199
FORMULA SmartHome-PT-10-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Graph (trivial) has 176 edges and 191 vertex of which 82 / 191 are part of one of the 6 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 114 transition count 90
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 75 place count 80 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 77 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 78 place count 77 transition count 80
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 86 place count 73 transition count 80
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 99 place count 60 transition count 67
Iterating global reduction 3 with 13 rules applied. Total rules applied 112 place count 60 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 3 with 5 rules applied. Total rules applied 117 place count 60 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 59 transition count 62
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 152 place count 42 transition count 45
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 158 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 160 place count 40 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 162 place count 38 transition count 37
Applied a total of 162 rules in 31 ms. Remains 38 /191 variables (removed 153) and now considering 37/221 (removed 184) transitions.
[2022-05-21 04:39:11] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2022-05-21 04:39:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:39:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-21 04:39:11] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2022-05-21 04:39:11] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:39:11] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-05-21 04:39:11] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 04:39:11] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2022-05-21 04:39:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:39:11] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/191 places, 37/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/191 places, 37/221 transitions.
[2022-05-21 04:39:11] [INFO ] Flatten gal took : 4 ms
[2022-05-21 04:39:11] [INFO ] Flatten gal took : 4 ms
[2022-05-21 04:39:11] [INFO ] Input system was already deterministic with 37 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA SmartHome-PT-10-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 164 transition count 194
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 164 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 164 transition count 191
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 155 transition count 182
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 155 transition count 182
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 149 transition count 176
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 149 transition count 176
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 146 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 146 transition count 173
Applied a total of 93 rules in 25 ms. Remains 146 /191 variables (removed 45) and now considering 173/221 (removed 48) transitions.
// Phase 1: matrix 173 rows 146 cols
[2022-05-21 04:39:11] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:39:11] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 173 rows 146 cols
[2022-05-21 04:39:11] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-21 04:39:12] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 146 cols
[2022-05-21 04:39:12] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-21 04:39:12] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/191 places, 173/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/191 places, 173/221 transitions.
[2022-05-21 04:39:12] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:39:12] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:39:12] [INFO ] Input system was already deterministic with 173 transitions.
[2022-05-21 04:39:12] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:39:12] [INFO ] Flatten gal took : 13 ms
[2022-05-21 04:39:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2140837656847608519.gal : 7 ms
[2022-05-21 04:39:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14985065163858306170.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/CTLFireability2140837656847608519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14985065163858306170.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,8.83273e+09,0.54186,16308,2,3866,5,57754,6,0,759,44291,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p190==0)&&(p237==0))) + AX((p142==0))) + ((p209==1)||(p258==1))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((p209==1)||(p258==1)))) * !(E(TRUE U ((p190==0)&&(p237==0)))))) * !((p142==0)))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t16, t65, t100, t146, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,1,2.78722,69628,1,0,215,275843,369,147,4282,205268,360
FORMULA SmartHome-PT-10-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 164 transition count 194
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 164 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 164 transition count 192
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 155 transition count 183
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 155 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 150 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 150 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 148 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 148 transition count 176
Applied a total of 88 rules in 15 ms. Remains 148 /191 variables (removed 43) and now considering 176/221 (removed 45) transitions.
// Phase 1: matrix 176 rows 148 cols
[2022-05-21 04:39:15] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:39:15] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 176 rows 148 cols
[2022-05-21 04:39:15] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:39:15] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 148 cols
[2022-05-21 04:39:15] [INFO ] Computed 12 place invariants in 10 ms
[2022-05-21 04:39:15] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/191 places, 176/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 148/191 places, 176/221 transitions.
[2022-05-21 04:39:15] [INFO ] Flatten gal took : 16 ms
[2022-05-21 04:39:15] [INFO ] Flatten gal took : 16 ms
[2022-05-21 04:39:15] [INFO ] Input system was already deterministic with 176 transitions.
[2022-05-21 04:39:15] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:39:15] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:39:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6216533115706653857.gal : 4 ms
[2022-05-21 04:39:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12665626595050958713.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/CTLFireability6216533115706653857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12665626595050958713.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.0239e+10,0.76326,20048,2,5665,5,77186,6,0,770,56747,0


Converting to forward existential form...Done !
original formula: AX(AG((((p4==0)||(p198==0))||((p247==0)||(((p230==1)&&(p269==1))&&(p107==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((p4==0)||(p198==0))||((p247==0)||(((p230==1)&&(p269==1))&&(p107==1))))))] = FALSE
(forward)formula 0,0,1.09832,22336,1,0,10,82688,10,2,1517,60993,4
FORMULA SmartHome-PT-10-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Graph (trivial) has 168 edges and 191 vertex of which 87 / 191 are part of one of the 6 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 109 transition count 94
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 85 transition count 92
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 84 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 83 transition count 91
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 54 place count 83 transition count 85
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 66 place count 77 transition count 85
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 74 place count 69 transition count 77
Iterating global reduction 4 with 8 rules applied. Total rules applied 82 place count 69 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 85 place count 69 transition count 74
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 117 place count 53 transition count 58
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 121 place count 53 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 122 place count 52 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 52 transition count 54
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 52 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 50 transition count 51
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 19 edges and 49 vertex of which 2 / 49 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 128 place count 48 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 130 place count 48 transition count 49
Applied a total of 130 rules in 26 ms. Remains 48 /191 variables (removed 143) and now considering 49/221 (removed 172) transitions.
[2022-05-21 04:39:16] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 48 cols
[2022-05-21 04:39:16] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:39:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-21 04:39:16] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 48 cols
[2022-05-21 04:39:16] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:39:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-21 04:39:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-05-21 04:39:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 04:39:17] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 48 cols
[2022-05-21 04:39:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:39:17] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/191 places, 49/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/191 places, 49/221 transitions.
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:39:17] [INFO ] Input system was already deterministic with 49 transitions.
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 3 ms
[2022-05-21 04:39:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9793874593481834310.gal : 1 ms
[2022-05-21 04:39:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1040514714353560104.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/CTLFireability9793874593481834310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1040514714353560104.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...274
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,51888,0.024315,5092,2,563,5,3078,6,0,236,2623,0


Converting to forward existential form...Done !
original formula: AG(EF(((E((p109==1) U (p93==1)) + (p233==1)) + ((p122==1)||((p210==1)&&(p129==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((E((p109==1) U (p93==1)) + (p233==1)) + ((p122==1)||((p210==1)&&(p129==1)))))))]...163
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,0,0.207478,11016,1,0,88,35365,119,49,1394,27124,115
FORMULA SmartHome-PT-10-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 165 transition count 195
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 165 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 165 transition count 193
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 155 transition count 183
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 155 transition count 183
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 149 transition count 177
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 149 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 146 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 146 transition count 174
Applied a total of 92 rules in 15 ms. Remains 146 /191 variables (removed 45) and now considering 174/221 (removed 47) transitions.
// Phase 1: matrix 174 rows 146 cols
[2022-05-21 04:39:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:39:17] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 174 rows 146 cols
[2022-05-21 04:39:17] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:39:17] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 174 rows 146 cols
[2022-05-21 04:39:17] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:39:17] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/191 places, 174/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/191 places, 174/221 transitions.
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:39:17] [INFO ] Input system was already deterministic with 174 transitions.
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:39:17] [INFO ] Flatten gal took : 14 ms
[2022-05-21 04:39:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15037034389236017106.gal : 2 ms
[2022-05-21 04:39:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7128482128945552857.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/CTLFireability15037034389236017106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7128482128945552857.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,8.31288e+09,0.17663,7936,2,1022,5,12458,6,0,760,14344,0


Converting to forward existential form...Done !
original formula: EG(AX(EG(((A((p39==1) U (p56==1)) + A((p43==1) U (p240==1))) + ((p8==0)||(p38==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(((!((E(!((p56==1)) U (!((p39==1)) * !((p56==1)))) + EG(!((p56==1))))) + !((E(!((p240==1)) U...245
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t118, t145, t146, t150, Intersection with reachable at each step enabled...205
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2022-05-21 04:39:48] [INFO ] Flatten gal took : 10 ms
[2022-05-21 04:39:48] [INFO ] Applying decomposition
[2022-05-21 04:39:48] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12000145248177007220.txt' '-o' '/tmp/graph12000145248177007220.bin' '-w' '/tmp/graph12000145248177007220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12000145248177007220.bin' '-l' '-1' '-v' '-w' '/tmp/graph12000145248177007220.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:39:48] [INFO ] Decomposing Gal with order
[2022-05-21 04:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:39:48] [INFO ] Removed a total of 43 redundant transitions.
[2022-05-21 04:39:48] [INFO ] Flatten gal took : 69 ms
[2022-05-21 04:39:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-21 04:39:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8684206467737958617.gal : 6 ms
[2022-05-21 04:39:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3114745735238475096.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/CTLFireability8684206467737958617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3114745735238475096.ctl'

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...253
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,8.31288e+09,0.085805,7392,279,69,5018,963,438,6261,86,2218,0


Converting to forward existential form...Done !
original formula: EG(AX(EG(((A((i1.i0.u7.p39==1) U (i1.i1.u12.p56==1)) + A((i2.u9.p43==1) U (i0.i0.u43.p240==1))) + ((i0.i0.u1.p8==0)||(i1.i0.u7.p38==0))))...157
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(((!((E(!((i1.i1.u12.p56==1)) U (!((i1.i0.u7.p39==1)) * !((i1.i1.u12.p56==1)))) + EG(!((i1.i...338
Reverse transition relation is NOT exact ! Due to transitions t15, t97, t150, i0.i0.u1.t145, i0.i0.u1.t146, i0.i0.u42.t13, i0.i0.u43.t12, i1.i1.u12.t118, ...253
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,15.3009,256932,1,0,546434,2652,2776,719946,507,10996,427962
FORMULA SmartHome-PT-10-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Graph (trivial) has 177 edges and 191 vertex of which 87 / 191 are part of one of the 6 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 109 transition count 88
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 79 transition count 82
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 76 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 75 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 72 place count 75 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 80 place count 71 transition count 77
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 92 place count 59 transition count 65
Iterating global reduction 4 with 12 rules applied. Total rules applied 104 place count 59 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 107 place count 59 transition count 62
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 141 place count 42 transition count 45
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 147 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 40 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 38 transition count 37
Applied a total of 151 rules in 22 ms. Remains 38 /191 variables (removed 153) and now considering 37/221 (removed 184) transitions.
[2022-05-21 04:40:03] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2022-05-21 04:40:03] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:40:03] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-21 04:40:03] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2022-05-21 04:40:03] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:40:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-21 04:40:03] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 04:40:03] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2022-05-21 04:40:03] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:40:03] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/191 places, 37/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/191 places, 37/221 transitions.
[2022-05-21 04:40:03] [INFO ] Flatten gal took : 5 ms
[2022-05-21 04:40:03] [INFO ] Flatten gal took : 4 ms
[2022-05-21 04:40:03] [INFO ] Input system was already deterministic with 37 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA SmartHome-PT-10-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 163 transition count 193
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 163 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 163 transition count 190
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 67 place count 155 transition count 182
Iterating global reduction 1 with 8 rules applied. Total rules applied 75 place count 155 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 152 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 152 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 151 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 151 transition count 178
Applied a total of 83 rules in 25 ms. Remains 151 /191 variables (removed 40) and now considering 178/221 (removed 43) transitions.
// Phase 1: matrix 178 rows 151 cols
[2022-05-21 04:40:03] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:40:04] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 178 rows 151 cols
[2022-05-21 04:40:04] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:40:04] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 151 cols
[2022-05-21 04:40:04] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-21 04:40:04] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/191 places, 178/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/191 places, 178/221 transitions.
[2022-05-21 04:40:04] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:40:04] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:40:04] [INFO ] Input system was already deterministic with 178 transitions.
[2022-05-21 04:40:04] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:40:04] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:40:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9163291065805320597.gal : 2 ms
[2022-05-21 04:40:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8525815489449060671.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/CTLFireability9163291065805320597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8525815489449060671.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...274
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,6.22848e+09,0.621017,21968,2,6128,5,82691,6,0,784,59454,0


Converting to forward existential form...Done !
original formula: (AG((EG(AF(((p2==0)||(p151==0)))) * EX((AG(((p151==0)||(p268==0))) * EX((p51==0)))))) + AF((((AF((p152==0)) + EG(!(E((p177==1) U (p39==1)...204
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !((EG(!(EG(!(((p2==0)||(p151==0)))))) * EX((!(E(TRUE U !(((p151==0)||(p268==0))))) * ...294
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t37, t68, t105, t151, Intersection with reachable at each step enabled. (dest...198
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2022-05-21 04:40:34] [INFO ] Flatten gal took : 12 ms
[2022-05-21 04:40:34] [INFO ] Applying decomposition
[2022-05-21 04:40:34] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6106268123388477122.txt' '-o' '/tmp/graph6106268123388477122.bin' '-w' '/tmp/graph6106268123388477122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6106268123388477122.bin' '-l' '-1' '-v' '-w' '/tmp/graph6106268123388477122.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:40:34] [INFO ] Decomposing Gal with order
[2022-05-21 04:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:40:34] [INFO ] Removed a total of 28 redundant transitions.
[2022-05-21 04:40:34] [INFO ] Flatten gal took : 22 ms
[2022-05-21 04:40:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 04:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1499003194633926441.gal : 4 ms
[2022-05-21 04:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15581989344134453300.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/CTLFireability1499003194633926441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15581989344134453300.ctl'

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...254
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,6.22848e+09,0.072852,6624,308,73,4012,784,405,4064,85,1637,0


Converting to forward existential form...Done !
original formula: (AG((EG(AF(((i9.u1.p2==0)||(i5.i0.u19.p151==0)))) * EX((AG(((i5.i0.u19.p151==0)||(i10.u47.p268==0))) * EX((i2.u10.p51==0)))))) + AF((((AF...295
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !((EG(!(EG(!(((i9.u1.p2==0)||(i5.i0.u19.p151==0)))))) * EX((!(E(TRUE U !(((i5.i0.u19....385
Reverse transition relation is NOT exact ! Due to transitions t15, t68, t105, i7.t37, i9.u1.t151, i9.u41.t13, i9.u42.t12, Intersection with reachable at e...221
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,9.8261,195824,1,0,396959,2556,2693,599739,544,9816,401297
FORMULA SmartHome-PT-10-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 163 transition count 193
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 163 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 163 transition count 191
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 154 transition count 182
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 154 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 149 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 149 transition count 177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 148 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 148 transition count 176
Applied a total of 88 rules in 10 ms. Remains 148 /191 variables (removed 43) and now considering 176/221 (removed 45) transitions.
// Phase 1: matrix 176 rows 148 cols
[2022-05-21 04:40:44] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:40:44] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 176 rows 148 cols
[2022-05-21 04:40:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:40:44] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 148 cols
[2022-05-21 04:40:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:40:44] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/191 places, 176/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 148/191 places, 176/221 transitions.
[2022-05-21 04:40:44] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:40:44] [INFO ] Flatten gal took : 11 ms
[2022-05-21 04:40:44] [INFO ] Input system was already deterministic with 176 transitions.
[2022-05-21 04:40:44] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:40:45] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:40:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17128498400420813819.gal : 1 ms
[2022-05-21 04:40:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15062443959970284149.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/CTLFireability17128498400420813819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15062443959970284149.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,9.49649e+09,0.583016,20032,2,5010,5,77091,6,0,770,58936,0


Converting to forward existential form...Done !
original formula: E(EF((AF((p110==1)) + (p5==1))) U AX((!(((A((p40==1) U (p139==1)) * EG(((p198==1)&&(p243==1)))) * ((p258==1)&&(p82==1)))) * AF((p11==1)))...157
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!(EG(!((p110==1)))) + (p5==1)))) * !(EX(!((!(((!((E(!((p139==1)) U (!((p40==1)) * !((p139=...274
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t63, t86, t101, t147, t148, Intersection with reachable at each step enabled....204
Detected timeout of ITS tools.
[2022-05-21 04:41:15] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:41:15] [INFO ] Applying decomposition
[2022-05-21 04:41:15] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2742782317611381195.txt' '-o' '/tmp/graph2742782317611381195.bin' '-w' '/tmp/graph2742782317611381195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2742782317611381195.bin' '-l' '-1' '-v' '-w' '/tmp/graph2742782317611381195.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:41:15] [INFO ] Decomposing Gal with order
[2022-05-21 04:41:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:41:15] [INFO ] Removed a total of 38 redundant transitions.
[2022-05-21 04:41:15] [INFO ] Flatten gal took : 17 ms
[2022-05-21 04:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2022-05-21 04:41:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10856382467059876762.gal : 4 ms
[2022-05-21 04:41:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8876700392346739752.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/CTLFireability10856382467059876762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8876700392346739752.ctl'

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...254
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,9.49649e+09,0.099512,7188,355,75,5703,1051,455,6665,83,2261,0


Converting to forward existential form...Done !
original formula: E(EF((AF((i5.u21.p110==1)) + (i1.u1.p5==1))) U AX((!(((A((i2.i0.u9.p40==1) U (i6.i1.u26.p139==1)) * EG(((i7.i1.u29.p198==1)&&(i2.i0.u47.p...229
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!(EG(!((i5.u21.p110==1)))) + (i1.u1.p5==1)))) * !(EX(!((!(((!((E(!((i6.i1.u26.p139==1)) U ...366
Reverse transition relation is NOT exact ! Due to transitions t15, t101, i0.u44.t13, i0.u45.t12, i1.u1.t147, i1.u1.t148, i5.u19.t86, i6.i0.u23.t63, Inters...247
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,10.7158,180020,1,0,370840,2169,2798,497934,449,9660,314909
FORMULA SmartHome-PT-10-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 166 transition count 196
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 166 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 166 transition count 193
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 62 place count 157 transition count 184
Iterating global reduction 1 with 9 rules applied. Total rules applied 71 place count 157 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 152 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 152 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 149 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 149 transition count 176
Applied a total of 87 rules in 10 ms. Remains 149 /191 variables (removed 42) and now considering 176/221 (removed 45) transitions.
// Phase 1: matrix 176 rows 149 cols
[2022-05-21 04:41:25] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:41:25] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 176 rows 149 cols
[2022-05-21 04:41:25] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:41:26] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 149 cols
[2022-05-21 04:41:26] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:41:26] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/191 places, 176/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/191 places, 176/221 transitions.
[2022-05-21 04:41:26] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:41:26] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:41:26] [INFO ] Input system was already deterministic with 176 transitions.
[2022-05-21 04:41:26] [INFO ] Flatten gal took : 15 ms
[2022-05-21 04:41:26] [INFO ] Flatten gal took : 10 ms
[2022-05-21 04:41:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7196211182735707872.gal : 3 ms
[2022-05-21 04:41:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14344493248832960093.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/CTLFireability7196211182735707872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14344493248832960093.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,6.70916e+09,0.697003,17216,2,4639,5,61773,6,0,774,47316,0


Converting to forward existential form...Done !
original formula: EF(((EF(EG(((EF((p106==1)) + (p128==1)) + (p137==1)))) * (p46==1)) * !(A(((((p151==1)&&(p268==1))||(p60==1)) * EX(((p2==1)&&(p89==1)))) U...173
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,TRUE) * (E(TRUE U EG(((E(TRUE U (p106==1)) + (p128==1)) + (p137==1)))) * (p46==1))),!(!...426
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t100, t122, t149, Intersection with reachable at each step enabled. (destroye...194
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.9431,138956,1,0,275,746442,389,186,5061,512953,436
FORMULA SmartHome-PT-10-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 164 transition count 194
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 164 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 164 transition count 191
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 155 transition count 182
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 155 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 151 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 151 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 150 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 150 transition count 177
Applied a total of 85 rules in 11 ms. Remains 150 /191 variables (removed 41) and now considering 177/221 (removed 44) transitions.
// Phase 1: matrix 177 rows 150 cols
[2022-05-21 04:41:32] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:41:32] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 177 rows 150 cols
[2022-05-21 04:41:32] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:41:32] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 177 rows 150 cols
[2022-05-21 04:41:32] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:41:32] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/191 places, 177/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 150/191 places, 177/221 transitions.
[2022-05-21 04:41:32] [INFO ] Flatten gal took : 5 ms
[2022-05-21 04:41:32] [INFO ] Flatten gal took : 17 ms
[2022-05-21 04:41:32] [INFO ] Input system was already deterministic with 177 transitions.
[2022-05-21 04:41:32] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:41:32] [INFO ] Flatten gal took : 18 ms
[2022-05-21 04:41:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16411513669385681275.gal : 1 ms
[2022-05-21 04:41:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1554919450091008287.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/CTLFireability16411513669385681275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1554919450091008287.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.89795e+09,0.607501,17252,2,4416,5,60243,6,0,779,46043,0


Converting to forward existential form...Done !
original formula: AG(!(A((E((p229==1) U (p230==1)) + EG(((p70==1)||(p177==1)))) U AX((p152==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(EX(!((p152==1)))))))) * !(E(!(!(EX(!((p152==1))))) U (!((E((p229==1) U (p230==1)) ...222
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t13, t15, t17, t38, t69, t104, t150, Intersection with reachable at each step enabl...207
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.90798,116404,1,0,318,601946,389,208,4621,458089,479
FORMULA SmartHome-PT-10-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 162 transition count 192
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 162 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 162 transition count 189
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 152 transition count 179
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 152 transition count 179
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 146 transition count 173
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 146 transition count 173
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 143 transition count 170
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 143 transition count 170
Applied a total of 99 rules in 8 ms. Remains 143 /191 variables (removed 48) and now considering 170/221 (removed 51) transitions.
// Phase 1: matrix 170 rows 143 cols
[2022-05-21 04:41:37] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-21 04:41:37] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 170 rows 143 cols
[2022-05-21 04:41:37] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-21 04:41:38] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 143 cols
[2022-05-21 04:41:38] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:41:38] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/191 places, 170/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/191 places, 170/221 transitions.
[2022-05-21 04:41:38] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:41:38] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:41:38] [INFO ] Input system was already deterministic with 170 transitions.
[2022-05-21 04:41:38] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:41:38] [INFO ] Flatten gal took : 7 ms
[2022-05-21 04:41:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13335255272249464350.gal : 2 ms
[2022-05-21 04:41:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6643344106478312902.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/CTLFireability13335255272249464350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6643344106478312902.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.20668e+09,0.576381,15532,2,3776,5,53880,6,0,744,41024,0


Converting to forward existential form...Done !
original formula: EF(AX(AF(AG((p191==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!(!(E(TRUE U !((p191==0)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t143, Intersection with reachable at each step enabled. (destroyed/rever...187
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.61875,86028,1,0,215,398881,370,148,4648,276489,363
FORMULA SmartHome-PT-10-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 163 transition count 193
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 163 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 163 transition count 190
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 154 transition count 181
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 154 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 149 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 149 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 147 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 147 transition count 174
Applied a total of 91 rules in 13 ms. Remains 147 /191 variables (removed 44) and now considering 174/221 (removed 47) transitions.
// Phase 1: matrix 174 rows 147 cols
[2022-05-21 04:41:41] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:41:42] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 174 rows 147 cols
[2022-05-21 04:41:42] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:41:42] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 174 rows 147 cols
[2022-05-21 04:41:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:41:42] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/191 places, 174/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/191 places, 174/221 transitions.
[2022-05-21 04:41:42] [INFO ] Flatten gal took : 5 ms
[2022-05-21 04:41:42] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:41:42] [INFO ] Input system was already deterministic with 174 transitions.
[2022-05-21 04:41:42] [INFO ] Flatten gal took : 9 ms
[2022-05-21 04:41:42] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:41:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7766581036394477138.gal : 2 ms
[2022-05-21 04:41:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8782883575079990689.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/CTLFireability7766581036394477138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8782883575079990689.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...274
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,6.26196e+09,0.529029,15524,2,4016,5,54026,6,0,764,41612,0


Converting to forward existential form...Done !
original formula: EX(E((EF(AG((p192==1))) + EG((((p172==1)&&(p120==1))||(!((p198==1)&&(p246==1)))))) U (p139==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),(E(TRUE U !(E(TRUE U !((p192==1))))) + EG((((p172==1)&&(p120==1))||(!((p198==1)&&(p246==1)))))))...178
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t64, t101, t147, Intersection with reachable at each step enabled. (destroyed...193
(forward)formula 0,1,20.6109,506084,1,0,928,2.6296e+06,382,547,4543,3.25266e+06,1136
FORMULA SmartHome-PT-10-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 221/221 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 165 transition count 195
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 165 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 165 transition count 192
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 156 transition count 183
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 156 transition count 183
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 150 transition count 177
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 150 transition count 177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 149 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 149 transition count 176
Applied a total of 87 rules in 9 ms. Remains 149 /191 variables (removed 42) and now considering 176/221 (removed 45) transitions.
// Phase 1: matrix 176 rows 149 cols
[2022-05-21 04:42:03] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:42:03] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 176 rows 149 cols
[2022-05-21 04:42:03] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-21 04:42:03] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 149 cols
[2022-05-21 04:42:03] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:42:03] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/191 places, 176/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/191 places, 176/221 transitions.
[2022-05-21 04:42:03] [INFO ] Flatten gal took : 5 ms
[2022-05-21 04:42:03] [INFO ] Flatten gal took : 5 ms
[2022-05-21 04:42:03] [INFO ] Input system was already deterministic with 176 transitions.
[2022-05-21 04:42:03] [INFO ] Flatten gal took : 5 ms
[2022-05-21 04:42:03] [INFO ] Flatten gal took : 6 ms
[2022-05-21 04:42:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4651867498970762332.gal : 1 ms
[2022-05-21 04:42:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1846224627214660037.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/CTLFireability4651867498970762332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1846224627214660037.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...274
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,7.15254e+09,0.559443,17716,2,4767,5,63284,6,0,774,50746,0


Converting to forward existential form...Done !
original formula: (AX((EG((p120==1)) + AG((((p57==0)||(p249==0))&&(p140==0))))) * E(((!(EX(AF((p81==1)))) + (p122==1)) * ((((p57==1)&&(p271==1))&&(p262==1)...212
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !(EG((p120==1)))),TRUE) * !((((p57==0)||(p249==0))&&(p140==0))))] = FALSE * [(Init * !(E(((!...297
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t13, t15, t63, t87, t102, t104, t149, Intersection with reachable at each step enab...208
(forward)formula 0,0,19.9982,488740,1,0,714,3.05447e+06,382,410,4360,2.8963e+06,867
FORMULA SmartHome-PT-10-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2022-05-21 04:42:23] [INFO ] Flatten gal took : 8 ms
[2022-05-21 04:42:23] [INFO ] Flatten gal took : 7 ms
Total runtime 199536 ms.

BK_STOP 1653108143825

--------------------
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-10"
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-10, 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-165303241600266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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