fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r254-tall-162106745700266
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2720.331 326110.00 335564.00 1356.20 TFFTFTTTFTFFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745700266.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745700266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 19:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 102K May 5 16:52 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-15-CTLFireability-00
FORMULA_NAME SmartHome-PT-15-CTLFireability-01
FORMULA_NAME SmartHome-PT-15-CTLFireability-02
FORMULA_NAME SmartHome-PT-15-CTLFireability-03
FORMULA_NAME SmartHome-PT-15-CTLFireability-04
FORMULA_NAME SmartHome-PT-15-CTLFireability-05
FORMULA_NAME SmartHome-PT-15-CTLFireability-06
FORMULA_NAME SmartHome-PT-15-CTLFireability-07
FORMULA_NAME SmartHome-PT-15-CTLFireability-08
FORMULA_NAME SmartHome-PT-15-CTLFireability-09
FORMULA_NAME SmartHome-PT-15-CTLFireability-10
FORMULA_NAME SmartHome-PT-15-CTLFireability-11
FORMULA_NAME SmartHome-PT-15-CTLFireability-12
FORMULA_NAME SmartHome-PT-15-CTLFireability-13
FORMULA_NAME SmartHome-PT-15-CTLFireability-14
FORMULA_NAME SmartHome-PT-15-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621168545071

Running Version 0
[2021-05-16 12:35:47] [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]
[2021-05-16 12:35:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 12:35:47] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-16 12:35:47] [INFO ] Transformed 427 places.
[2021-05-16 12:35:47] [INFO ] Transformed 451 transitions.
[2021-05-16 12:35:47] [INFO ] Found NUPN structural information;
[2021-05-16 12:35:47] [INFO ] Parsed PT model containing 427 places and 451 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
[2021-05-16 12:35:47] [INFO ] Reduced 1 identical enabling conditions.
Deduced a syphon composed of 134 places in 13 ms
Reduce places removed 134 places and 107 transitions.
Support contains 190 out of 293 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 282 transition count 344
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 31 place count 262 transition count 324
Iterating global reduction 1 with 20 rules applied. Total rules applied 51 place count 262 transition count 324
Applied a total of 51 rules in 28 ms. Remains 262 /293 variables (removed 31) and now considering 324/344 (removed 20) transitions.
// Phase 1: matrix 324 rows 262 cols
[2021-05-16 12:35:47] [INFO ] Computed 3 place invariants in 19 ms
[2021-05-16 12:35:47] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 324 rows 262 cols
[2021-05-16 12:35:47] [INFO ] Computed 3 place invariants in 10 ms
[2021-05-16 12:35:47] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
// Phase 1: matrix 324 rows 262 cols
[2021-05-16 12:35:47] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-16 12:35:48] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Finished structural reductions, in 1 iterations. Remains : 262/293 places, 324/344 transitions.
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 78 ms
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 25 ms
[2021-05-16 12:35:48] [INFO ] Input system was already deterministic with 324 transitions.
Finished random walk after 7017 steps, including 29 resets, run visited all 72 properties in 57 ms. (steps per millisecond=123 )
Graph (trivial) has 265 edges and 262 vertex of which 115 / 262 are part of one of the 8 SCC in 5 ms
Free SCC test removed 107 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 154 transition count 123
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 82 rules applied. Total rules applied 151 place count 86 transition count 109
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 158 place count 80 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 79 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 159 place count 79 transition count 105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 165 place count 76 transition count 105
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 191 place count 50 transition count 79
Iterating global reduction 4 with 26 rules applied. Total rules applied 217 place count 50 transition count 79
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 225 place count 50 transition count 71
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 269 place count 28 transition count 48
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 270 place count 27 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 271 place count 27 transition count 47
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 284 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 286 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 286 place count 25 transition count 33
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 23 transition count 32
Applied a total of 289 rules in 38 ms. Remains 23 /262 variables (removed 239) and now considering 32/324 (removed 292) transitions.
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 1 ms
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 2 ms
[2021-05-16 12:35:48] [INFO ] Input system was already deterministic with 32 transitions.
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 2 ms
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 1 ms
[2021-05-16 12:35:48] [INFO ] Time to serialize gal into /tmp/CTLFireability5667290465835042413.gal : 1 ms
[2021-05-16 12:35:48] [INFO ] Time to serialize properties into /tmp/CTLFireability4162902519768273371.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5667290465835042413.gal, -t, CGAL, -ctl, /tmp/CTLFireability4162902519768273371.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5667290465835042413.gal -t CGAL -ctl /tmp/CTLFireability4162902519768273371.ctl --gen-order FOLLOW
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,52992,0.009622,4264,2,60,5,316,6,0,104,278,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((p213==1)||(p153==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((p213==1)||(p153==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t12, t23, t24, t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/27/5/32
(forward)formula 0,1,0.039196,5772,1,0,108,8591,83,64,596,11658,132
FORMULA SmartHome-PT-15-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Graph (trivial) has 167 edges and 262 vertex of which 19 / 262 are part of one of the 4 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 246 transition count 242
Reduce places removed 62 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 68 rules applied. Total rules applied 131 place count 184 transition count 236
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 154 place count 181 transition count 216
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 24 rules applied. Total rules applied 178 place count 162 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 180 place count 160 transition count 211
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 180 place count 160 transition count 200
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 202 place count 149 transition count 200
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 228 place count 123 transition count 174
Iterating global reduction 5 with 26 rules applied. Total rules applied 254 place count 123 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 11 rules applied. Total rules applied 265 place count 123 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 267 place count 121 transition count 163
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 309 place count 100 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 311 place count 100 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 313 place count 99 transition count 140
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 320 place count 99 transition count 133
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 323 place count 99 transition count 133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 324 place count 99 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 325 place count 98 transition count 131
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 328 place count 97 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 329 place count 96 transition count 128
Applied a total of 329 rules in 78 ms. Remains 96 /262 variables (removed 166) and now considering 128/324 (removed 196) transitions.
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 20 ms
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 5 ms
[2021-05-16 12:35:48] [INFO ] Input system was already deterministic with 128 transitions.
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 6 ms
[2021-05-16 12:35:48] [INFO ] Flatten gal took : 6 ms
[2021-05-16 12:35:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11939507291614606428.gal : 2 ms
[2021-05-16 12:35:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3051367728877759664.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11939507291614606428.gal, -t, CGAL, -ctl, /tmp/CTLFireability3051367728877759664.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11939507291614606428.gal -t CGAL -ctl /tmp/CTLFireability3051367728877759664.ctl --gen-order FOLLOW
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.01618e+10,0.035397,5436,2,781,5,5430,6,0,498,4415,0


Converting to forward existential form...Done !
original formula: AG((EG(!(E((((((p178==1)||(p263==1))||(p288==1))||(p223==1))||(p143==1)) U A((((p118==1)||(p132==1))||(p201==1)) U (((((((p160==1)&&(p414==1))||(p307==1))||(p122==1))||(p219==1))||(p152==1))||(p124==1)))))) + A(EF(((((p262==1)||(p310==1))||(p88==1)) + A(((((((p68==1)||(p306==1))||(p103==1))||((p286==1)&&(p369==1)))||(p60==1))||(p283==1)) U ((((((p131==1)||(p295==1))||(p229==1))||(p70==1))||(p58==1))||(p126==1))))) U AF((((((((p146==1)||(p66==1))||(p192==1))||(p319==1))||(p236==1))&&((((((((p67==1)||(p177==1))||(p183==1))||(p270==1))||(p254==1))||(p26==1))||(p77==1))||(p221==1)))&&((p133==1)||(p286==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((E(!(!(EG(!((((((((p146==1)||(p66==1))||(p192==1))||(p319==1))||(p236==1))&&((((((((p67==1)||(p177==1))||(p183==1))||(p270==1))||(p254==1))||(p26==1))||(p77==1))||(p221==1)))&&((p133==1)||(p286==1))))))) U (!(E(TRUE U ((((p262==1)||(p310==1))||(p88==1)) + !((E(!(((((((p131==1)||(p295==1))||(p229==1))||(p70==1))||(p58==1))||(p126==1))) U (!(((((((p68==1)||(p306==1))||(p103==1))||((p286==1)&&(p369==1)))||(p60==1))||(p283==1))) * !(((((((p131==1)||(p295==1))||(p229==1))||(p70==1))||(p58==1))||(p126==1))))) + EG(!(((((((p131==1)||(p295==1))||(p229==1))||(p70==1))||(p58==1))||(p126==1))))))))) * !(!(EG(!((((((((p146==1)||(p66==1))||(p192==1))||(p319==1))||(p236==1))&&((((((((p67==1)||(p177==1))||(p183==1))||(p270==1))||(p254==1))||(p26==1))||(p77==1))||(p221==1)))&&((p133==1)||(p286==1))))))))) + EG(!(!(EG(!((((((((p146==1)||(p66==1))||(p192==1))||(p319==1))||(p236==1))&&((((((((p67==1)||(p177==1))||(p183==1))||(p270==1))||(p254==1))||(p26==1))||(p77==1))||(p221==1)))&&((p133==1)||(p286==1)))))))))))) * !(EG(!(E((((((p178==1)||(p263==1))||(p288==1))||(p223==1))||(p143==1)) U !((E(!((((((((p160==1)&&(p414==1))||(p307==1))||(p122==1))||(p219==1))||(p152==1))||(p124==1))) U (!((((p118==1)||(p132==1))||(p201==1))) * !((((((((p160==1)&&(p414==1))||(p307==1))||(p122==1))||(p219==1))||(p152==1))||(p124==1))))) + EG(!((((((((p160==1)&&(p414==1))||(p307==1))||(p122==1))||(p219==1))||(p152==1))||(p124==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t11, t17, t27, t29, t36, t42, t51, t58, t68, t70, t73, t74, t76, t80, t82, t87, t106, t107, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/108/20/128
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,27.1901,786156,1,0,1392,4.15809e+06,314,843,3154,7.04473e+06,1525
FORMULA SmartHome-PT-15-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 215 edges and 262 vertex of which 55 / 262 are part of one of the 6 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 212 transition count 182
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 96 rules applied. Total rules applied 177 place count 132 transition count 166
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 187 place count 124 transition count 164
Reduce places removed 1 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 3 with 15 rules applied. Total rules applied 202 place count 123 transition count 150
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 18 rules applied. Total rules applied 220 place count 109 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 221 place count 108 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 221 place count 108 transition count 138
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 237 place count 100 transition count 138
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 263 place count 74 transition count 112
Iterating global reduction 6 with 26 rules applied. Total rules applied 289 place count 74 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 6 with 10 rules applied. Total rules applied 299 place count 74 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 300 place count 73 transition count 102
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 330 place count 58 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 331 place count 58 transition count 86
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 336 place count 58 transition count 81
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 337 place count 58 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 338 place count 57 transition count 80
Applied a total of 338 rules in 30 ms. Remains 57 /262 variables (removed 205) and now considering 80/324 (removed 244) transitions.
[2021-05-16 12:36:16] [INFO ] Flatten gal took : 6 ms
[2021-05-16 12:36:16] [INFO ] Flatten gal took : 4 ms
[2021-05-16 12:36:16] [INFO ] Input system was already deterministic with 80 transitions.
[2021-05-16 12:36:16] [INFO ] Flatten gal took : 4 ms
[2021-05-16 12:36:16] [INFO ] Flatten gal took : 4 ms
[2021-05-16 12:36:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17073994669360467404.gal : 1 ms
[2021-05-16 12:36:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16125797287810305334.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17073994669360467404.gal, -t, CGAL, -ctl, /tmp/CTLFireability16125797287810305334.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17073994669360467404.gal -t CGAL -ctl /tmp/CTLFireability16125797287810305334.ctl --gen-order FOLLOW
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.36634e+08,0.040295,5968,2,930,5,7165,6,0,295,6728,0


Converting to forward existential form...Done !
original formula: EG(((((p172==0)&&((p286==0)||(p425==0)))||((((((p39==1)||(p301==1))||(p60==1))||(p267==1))||(p409==1))&&((p334==1)||((p2==1)&&(p286==1))))) + (!(EG((((((((((p182==1)||(p306==1))||((p129==1)&&(p413==1)))||(p80==1))||(p129==1))||(p230==1))||(p89==1))||(p252==1))||(p202==1)))) * !(AF((((p133==1)||(p25==1))||(p124==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((((p172==0)&&((p286==0)||(p425==0)))||((((((p39==1)||(p301==1))||(p60==1))||(p267==1))||(p409==1))&&((p334==1)||((p2==1)&&(p286==1))))) + (!(EG((((((((((p182==1)||(p306==1))||((p129==1)&&(p413==1)))||(p80==1))||(p129==1))||(p230==1))||(p89==1))||(p252==1))||(p202==1)))) * !(!(EG(!((((p133==1)||(p25==1))||(p124==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t11, t15, t18, t21, t24, t28, t32, t34, t38, t39, t41, t52, t65, t66, t77, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/63/17/80
(forward)formula 0,1,7.96443,250404,1,0,522,1.00978e+06,187,295,1776,2.19e+06,522
FORMULA SmartHome-PT-15-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 267 edges and 262 vertex of which 125 / 262 are part of one of the 8 SCC in 1 ms
Free SCC test removed 117 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 144 transition count 115
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 75 rules applied. Total rules applied 139 place count 81 transition count 103
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 76 transition count 103
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 144 place count 76 transition count 100
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 73 transition count 100
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 174 place count 49 transition count 76
Iterating global reduction 3 with 24 rules applied. Total rules applied 198 place count 49 transition count 76
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 205 place count 49 transition count 69
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 249 place count 27 transition count 46
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 26 transition count 45
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 26 transition count 45
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 263 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 265 place count 24 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 266 place count 23 transition count 31
Applied a total of 266 rules in 24 ms. Remains 23 /262 variables (removed 239) and now considering 31/324 (removed 293) transitions.
[2021-05-16 12:36:24] [INFO ] Flatten gal took : 1 ms
[2021-05-16 12:36:24] [INFO ] Flatten gal took : 1 ms
[2021-05-16 12:36:24] [INFO ] Input system was already deterministic with 31 transitions.
[2021-05-16 12:36:24] [INFO ] Flatten gal took : 1 ms
[2021-05-16 12:36:24] [INFO ] Flatten gal took : 2 ms
[2021-05-16 12:36:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16751380374476759124.gal : 1 ms
[2021-05-16 12:36:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9606621299832722064.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16751380374476759124.gal, -t, CGAL, -ctl, /tmp/CTLFireability9606621299832722064.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16751380374476759124.gal -t CGAL -ctl /tmp/CTLFireability9606621299832722064.ctl --gen-order FOLLOW
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,52992,0.004443,4412,2,61,5,323,6,0,102,305,0


Converting to forward existential form...Done !
original formula: !(EF(EG(((p66==0)&&(p25==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p66==0)&&(p25==0)))] = FALSE
Hit Full ! (commute/partial/dont) 27/4/4
(forward)formula 0,0,0.010028,4852,1,0,8,1619,19,3,528,1321,8
FORMULA SmartHome-PT-15-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-16 12:36:24] [INFO ] Flatten gal took : 15 ms
[2021-05-16 12:36:24] [INFO ] Flatten gal took : 18 ms
[2021-05-16 12:36:24] [INFO ] Applying decomposition
[2021-05-16 12:36:24] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9093909538386890011.txt, -o, /tmp/graph9093909538386890011.bin, -w, /tmp/graph9093909538386890011.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9093909538386890011.bin, -l, -1, -v, -w, /tmp/graph9093909538386890011.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 12:36:24] [INFO ] Decomposing Gal with order
[2021-05-16 12:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 12:36:24] [INFO ] Removed a total of 60 redundant transitions.
[2021-05-16 12:36:24] [INFO ] Flatten gal took : 74 ms
[2021-05-16 12:36:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 23 ms.
[2021-05-16 12:36:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16320053511794232604.gal : 6 ms
[2021-05-16 12:36:24] [INFO ] Time to serialize properties into /tmp/CTLFireability2481979346293044723.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16320053511794232604.gal, -t, CGAL, -ctl, /tmp/CTLFireability2481979346293044723.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16320053511794232604.gal -t CGAL -ctl /tmp/CTLFireability2481979346293044723.ctl
No direction supplied, using forward translation only.
Parsed 12 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.8853e+14,0.453838,19440,1253,147,25759,1629,587,55918,113,7857,0


Converting to forward existential form...Done !
original formula: (E((((i2.i0.u11.p40==1)||(u1.p25==1)) * AX(EF(((((i11.i1.u87.p305==1)||(i5.i0.u31.p138==1))||(u1.p27==1))||(i10.i0.u73.p267==1))))) U AG((((((i9.i0.u68.p258==1)||(i6.i0.u39.p170==1))||(i5.i0.u31.p140==1))||(i7.i1.u57.p221==1))||(((i3.i1.u17.p84==0)&&(i2.i0.u6.p62==0))&&(i4.i1.u27.p125==0))))) + EF(AG(A(((((((i11.i1.u87.p305==1)||(i2.i0.u6.p52==1))||(i7.i1.u60.p230==1))||(i6.i0.u44.p184==1))||(i3.i0.u13.p77==1))||(i7.i0.u47.p238==1)) U (((((((i6.i0.u39.p170==1)||(i4.i0.u26.p122==1))||(i2.i1.u8.p57==1))||(i3.i0.u14.p75==1))||(i6.i0.u45.p190==1))||(i7.i0.u49.p206==1))||(i11.i0.u83.p299==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,(((i2.i0.u11.p40==1)||(u1.p25==1)) * !(EX(!(E(TRUE U ((((i11.i1.u87.p305==1)||(i5.i0.u31.p138==1))||(u1.p27==1))||(i10.i0.u73.p267==1)))))))) * !(E(TRUE U !((((((i9.i0.u68.p258==1)||(i6.i0.u39.p170==1))||(i5.i0.u31.p140==1))||(i7.i1.u57.p221==1))||(((i3.i1.u17.p84==0)&&(i2.i0.u6.p62==0))&&(i4.i1.u27.p125==0)))))))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!((((((((i6.i0.u39.p170==1)||(i4.i0.u26.p122==1))||(i2.i1.u8.p57==1))||(i3.i0.u14.p75==1))||(i6.i0.u45.p190==1))||(i7.i0.u49.p206==1))||(i11.i0.u83.p299==1))) U (!(((((((i11.i1.u87.p305==1)||(i2.i0.u6.p52==1))||(i7.i1.u60.p230==1))||(i6.i0.u44.p184==1))||(i3.i0.u13.p77==1))||(i7.i0.u47.p238==1))) * !((((((((i6.i0.u39.p170==1)||(i4.i0.u26.p122==1))||(i2.i1.u8.p57==1))||(i3.i0.u14.p75==1))||(i6.i0.u45.p190==1))||(i7.i0.u49.p206==1))||(i11.i0.u83.p299==1))))) + EG(!((((((((i6.i0.u39.p170==1)||(i4.i0.u26.p122==1))||(i2.i1.u8.p57==1))||(i3.i0.u14.p75==1))||(i6.i0.u45.p190==1))||(i7.i0.u49.p206==1))||(i11.i0.u83.p299==1))))))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t48, t101, u1.t281, u1.t282, u1.t283, u1.t284, u1.t285, u1.t286, u1.t287, u1.t288, u1.t289, u1.t290, i2.i0.t262, i2.i0.u5.t263, i2.i0.u5.t278, i3.t233, i3.i0.t253, i3.i0.t255, i3.i0.u21.t234, i3.i0.u21.t256, i4.i1.t208, i4.i1.t212, i4.i1.t295, i4.i1.u23.t209, i4.i1.u23.t226, i5.t201, i5.t199, i5.i1.t178, i5.i1.u36.t202, i6.t149, i6.i0.u39.t169, i6.i0.u39.t170, i6.i0.u45.t150, i6.i0.u45.t172, i7.i0.t136, i7.i0.t140, i7.i0.t141, i7.i0.u47.t102, i7.i0.u47.t103, i7.i0.u47.t142, i8.t3, i8.u93.t8, i8.u93.t9, i8.u93.t10, i11.t16, i11.i0.t38, i11.i0.t40, i11.i0.u82.t17, i11.i0.u82.t41, i12.i0.t52, i12.i0.t90, i12.i0.t91, i12.i0.t92, i12.i0.u65.t86, i12.i0.u80.t49, i12.i0.u80.t50, i12.i0.u80.t93, i12.i0.u80.t299, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/260/58/318
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 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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,8.14621,259064,1,0,453133,2372,4221,821160,534,13089,592712
FORMULA SmartHome-PT-15-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A(EF((((i3.i0.u21.p97==1)||((i12.i0.u97.p423==1)&&(i12.i0.u98.p426==1)))||(i12.i0.u64.p248==1))) U EX(AF((EG(((((((i11.i1.u88.p308==1)||(i3.i0.u21.p98==1))||(i8.u81.p289==1))||(i11.i0.u85.p301==1))||(i3.i1.u20.p91==1))||(i7.i1.u57.p221==1))) * EX((((((((((i10.i0.u71.p262==1)||((i7.i0.u47.p238==1)&&(i8.u93.p323==1)))||(i8.u63.p290==1))||((i12.i0.u80.p286==1)&&(i8.u0.p369==1)))||(i7.i0.u49.p202==1))||((i6.i0.u45.p191==1)&&(i12.i1.u96.p422==1)))||((i3.i0.u21.p98==1)&&(i8.u93.p323==1)))||(i12.i1.u94.p367==1))||(i4.i1.u27.p127==1))))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!(EG(!((EG(((((((i11.i1.u88.p308==1)||(i3.i0.u21.p98==1))||(i8.u81.p289==1))||(i11.i0.u85.p301==1))||(i3.i1.u20.p91==1))||(i7.i1.u57.p221==1))) * EX((((((((((i10.i0.u71.p262==1)||((i7.i0.u47.p238==1)&&(i8.u93.p323==1)))||(i8.u63.p290==1))||((i12.i0.u80.p286==1)&&(i8.u0.p369==1)))||(i7.i0.u49.p202==1))||((i6.i0.u45.p191==1)&&(i12.i1.u96.p422==1)))||((i3.i0.u21.p98==1)&&(i8.u93.p323==1)))||(i12.i1.u94.p367==1))||(i4.i1.u27.p127==1)))))))))) * !(E(TRUE U (((i3.i0.u21.p97==1)||((i12.i0.u97.p423==1)&&(i12.i0.u98.p426==1)))||(i12.i0.u64.p248==1))))) * !(EX(!(EG(!((EG(((((((i11.i1.u88.p308==1)||(i3.i0.u21.p98==1))||(i8.u81.p289==1))||(i11.i0.u85.p301==1))||(i3.i1.u20.p91==1))||(i7.i1.u57.p221==1))) * EX((((((((((i10.i0.u71.p262==1)||((i7.i0.u47.p238==1)&&(i8.u93.p323==1)))||(i8.u63.p290==1))||((i12.i0.u80.p286==1)&&(i8.u0.p369==1)))||(i7.i0.u49.p202==1))||((i6.i0.u45.p191==1)&&(i12.i1.u96.p422==1)))||((i3.i0.u21.p98==1)&&(i8.u93.p323==1)))||(i12.i1.u94.p367==1))||(i4.i1.u27.p127==1))))))))))] != FALSE + [FwdG(Init,!(EX(!(EG(!((EG(((((((i11.i1.u88.p308==1)||(i3.i0.u21.p98==1))||(i8.u81.p289==1))||(i11.i0.u85.p301==1))||(i3.i1.u20.p91==1))||(i7.i1.u57.p221==1))) * EX((((((((((i10.i0.u71.p262==1)||((i7.i0.u47.p238==1)&&(i8.u93.p323==1)))||(i8.u63.p290==1))||((i12.i0.u80.p286==1)&&(i8.u0.p369==1)))||(i7.i0.u49.p202==1))||((i6.i0.u45.p191==1)&&(i12.i1.u96.p422==1)))||((i3.i0.u21.p98==1)&&(i8.u93.p323==1)))||(i12.i1.u94.p367==1))||(i4.i1.u27.p127==1))))))))))] != FALSE)
Using saturation style SCC detection
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 1,1,227.449,2228216,1,0,3.33075e+06,2708,1141,6.18604e+06,248,15424,3169287
FORMULA SmartHome-PT-15-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(!(A((!(EX(((((((i3.i0.u21.p97==1)||(i3.i1.u17.p84==1))||(i10.i1.u74.p269==1))||(i12.i0.u80.p285==1))||(i2.i0.u6.p62==1))||(i11.i0.u83.p299==1)))) * EG((((((((i12.i0.u97.p423==1)&&(i12.i0.u98.p426==1))||(i4.i1.u29.p132==1))||(i9.i0.u68.p258==1))||(i1.i0.u4.p38==1))||(i11.i0.u85.p300==1))||(i7.i1.u57.p222==1)))) U EX(((i6.i1.u41.p177==1)||(i11.i0.u84.p296==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX(((i6.i1.u41.p177==1)||(i11.i0.u84.p296==1))))))) * !(E(!(EX(((i6.i1.u41.p177==1)||(i11.i0.u84.p296==1)))) U (!((!(EX(((((((i3.i0.u21.p97==1)||(i3.i1.u17.p84==1))||(i10.i1.u74.p269==1))||(i12.i0.u80.p285==1))||(i2.i0.u6.p62==1))||(i11.i0.u83.p299==1)))) * EG((((((((i12.i0.u97.p423==1)&&(i12.i0.u98.p426==1))||(i4.i1.u29.p132==1))||(i9.i0.u68.p258==1))||(i1.i0.u4.p38==1))||(i11.i0.u85.p300==1))||(i7.i1.u57.p222==1))))) * !(EX(((i6.i1.u41.p177==1)||(i11.i0.u84.p296==1))))))))] = FALSE
Using saturation style SCC detection
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 2,0,245.811,2446788,1,0,3.67934e+06,2708,1647,6.84289e+06,299,15424,3551558
FORMULA SmartHome-PT-15-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX((((((((((E(EX((((((i6.i2.u46.p192==1)||(i6.i1.u43.p182==1))||(i11.i2.u92.p291==1))||(i8.u93.p338==1))||(i11.i0.u82.p318==1))) U (A((((i7.i0.u51.p209==1)||((i5.i1.u36.p160==1)&&(i4.i1.u95.p414==1)))||(i4.i0.u26.p121==1)) U (i9.i1.u76.p274==1)) * EF(((((((((i7.i3.u58.p226==1)||(i3.i0.u21.p98==1))||((i4.i1.u23.p129==1)&&(i4.i1.u23.p416==1)))||(i4.i0.u24.p117==1))||(i12.i0.u66.p253==1))||(i7.i0.u47.p238==1))||(i11.i1.u90.p312==1))||(i11.i0.u83.p299==1))))) * !(AG(((i2.i1.u9.p58==1)||(i6.i0.u40.p173==1))))) * (i1.i0.u4.p37==0)) * (i6.i2.u38.p164==0)) * (i7.i2.u56.p219==0)) * (i12.i0.u65.p252==0)) * (i11.i0.u85.p300==0)) * (i5.i0.u31.p139==0)) * (i12.i1.u94.p367==0)) * (i3.i0.u14.p79==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((((((((E(EX((((((i6.i2.u46.p192==1)||(i6.i1.u43.p182==1))||(i11.i2.u92.p291==1))||(i8.u93.p338==1))||(i11.i0.u82.p318==1))) U (!((E(!((i9.i1.u76.p274==1)) U (!((((i7.i0.u51.p209==1)||((i5.i1.u36.p160==1)&&(i4.i1.u95.p414==1)))||(i4.i0.u26.p121==1))) * !((i9.i1.u76.p274==1)))) + EG(!((i9.i1.u76.p274==1))))) * E(TRUE U ((((((((i7.i3.u58.p226==1)||(i3.i0.u21.p98==1))||((i4.i1.u23.p129==1)&&(i4.i1.u23.p416==1)))||(i4.i0.u24.p117==1))||(i12.i0.u66.p253==1))||(i7.i0.u47.p238==1))||(i11.i1.u90.p312==1))||(i11.i0.u83.p299==1))))) * !(!(E(TRUE U !(((i2.i1.u9.p58==1)||(i6.i0.u40.p173==1))))))) * (i1.i0.u4.p37==0)) * (i6.i2.u38.p164==0)) * (i7.i2.u56.p219==0)) * (i12.i0.u65.p252==0)) * (i11.i0.u85.p300==0)) * (i5.i0.u31.p139==0)) * (i12.i1.u94.p367==0)) * (i3.i0.u14.p79==0))))))] != FALSE
(forward)formula 3,1,260.038,2457348,1,0,3.69838e+06,2708,1908,6.88809e+06,295,15424,102792
FORMULA SmartHome-PT-15-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF((AX(((((((((u1.p2==1)&&(i11.i0.u82.p318==1))||(i7.i3.u59.p229==1))||(i7.i2.u56.p219==1))||(i6.i0.u39.p170==1))||((i11.i0.u82.p318==1)&&(i8.u0.p340==1)))||((i12.i0.u80.p286==1)&&(i12.i0.u98.p421==1)))||(u1.p29==1))) + AF(EX((((i3.i2.u22.p99==1)||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1)))&&(i7.i3.u53.p211==1)))))) + (((E((EX((((((i8.u63.p290==1)||(i2.i0.u11.p70==1))||(i6.i0.u44.p186==1))||(i7.i2.u55.p216==1))||(i10.i0.u73.p266==1))) + EF(((((((((i9.i1.u77.p277==1)||(i1.i0.u4.p37==1))||(i5.i0.u31.p139==1))||(i5.i0.u30.p137==1))||(i6.i0.u45.p191==1))||(i2.i1.u10.p60==1))||(i11.i0.u83.p299==1))||(i7.i1.u57.p220==1)))) U (((EG((((i1.i1.u61.p240==1)||(i2.i0.u11.p40==1))||(i5.i0.u31.p140==1))) * !(AF((i9.i1.u77.p277==1)))) * !(AG(((((((((i7.i1.u60.p230==1)||(i12.i0.u67.p257==1))||(i9.i1.u76.p274==1))||(i5.i1.u36.p155==1))||(i6.i0.u39.p171==1))||(i3.i0.u14.p79==1))||(u1.p30==1))||(i3.i0.u13.p78==1))))) + !(EX(((i6.i2.u46.p193==1)&&((((i9.i0.u68.p258==1)||(i12.i1.u94.p367==1))||((i11.i0.u82.p318==1)&&(i8.u93.p323==1)))||(i1.i1.u61.p239==1))))))) * EG((((((i5.i1.u33.p146==1)||((i5.i1.u36.p160==1)&&(i4.i1.u95.p414==1)))||((i12.i0.u80.p286==1)&&(i12.i0.u80.p368==1)))||(i2.i1.u8.p56==1))||(i10.i0.u72.p264==1)))) * AF((((((i4.i0.u24.p115==1)||(i12.i0.u80.p286==1))||(i12.i0.u97.p424==1)) * EX(((((((((i5.i1.u33.p146==1)||(i6.i2.u46.p193==1))||(i5.i1.u36.p134==1))||(i6.i1.u42.p181==1))||(i12.i0.u80.p284==1))||(i11.i0.u82.p318==1))||(i6.i0.u40.p174==1))||(i6.i0.u39.p172==1)))) * !(E((((((((i8.u2.p1==1)||(i5.i1.u36.p160==1))||(i12.i0.u66.p253==1))||(i12.i0.u66.p254==1))||(i4.i1.u27.p126==1))||(i10.i0.u73.p266==1))||(i4.i1.u28.p124==1)) U ((((i9.i0.u78.p279==1)||(i3.i0.u15.p82==1))||(i4.i0.u25.p119==1))||(i10.i1.u70.p270==1))))))) * (EF((((((((i3.i2.u12.p71==1)||(i11.i2.u92.p291==1))||(i5.i1.u35.p154==1))||(i7.i1.u57.p222==1))||(u1.p31==1))&&(((((i5.i1.u33.p146==1)||(i8.u2.p1==1))||(i2.i1.u7.p54==1))||(i12.i1.u94.p367==1))||(i11.i0.u84.p296==1))) + AG((((((((i7.i1.u52.p224==1)||((i12.i0.u80.p286==1)&&(i8.u93.p323==1)))||((i3.i0.u21.p98==1)&&(i8.u93.p323==1)))||(i12.i0.u66.p254==1))||(i5.i1.u35.p153==1))||(i3.i1.u19.p90==1))||(i7.i0.u50.p204==1))))) + EX(E((((((u1.p23==1)||(i5.i1.u35.p152==1))||(i7.i0.u48.p200==1))||(i4.i1.u27.p127==1))||((i6.i0.u45.p191==1)&&(i8.u93.p323==1))) U ((i7.i0.u47.p238==1)&&(i8.u93.p323==1)))))))
=> equivalent forward existential formula: ((([((Init * !(E(TRUE U (!(EX(!(((((((((u1.p2==1)&&(i11.i0.u82.p318==1))||(i7.i3.u59.p229==1))||(i7.i2.u56.p219==1))||(i6.i0.u39.p170==1))||((i11.i0.u82.p318==1)&&(i8.u0.p340==1)))||((i12.i0.u80.p286==1)&&(i12.i0.u98.p421==1)))||(u1.p29==1))))) + !(EG(!(EX((((i3.i2.u22.p99==1)||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1)))&&(i7.i3.u53.p211==1)))))))))) * !(E((EX((((((i8.u63.p290==1)||(i2.i0.u11.p70==1))||(i6.i0.u44.p186==1))||(i7.i2.u55.p216==1))||(i10.i0.u73.p266==1))) + E(TRUE U ((((((((i9.i1.u77.p277==1)||(i1.i0.u4.p37==1))||(i5.i0.u31.p139==1))||(i5.i0.u30.p137==1))||(i6.i0.u45.p191==1))||(i2.i1.u10.p60==1))||(i11.i0.u83.p299==1))||(i7.i1.u57.p220==1)))) U (((EG((((i1.i1.u61.p240==1)||(i2.i0.u11.p40==1))||(i5.i0.u31.p140==1))) * !(!(EG(!((i9.i1.u77.p277==1)))))) * !(!(E(TRUE U !(((((((((i7.i1.u60.p230==1)||(i12.i0.u67.p257==1))||(i9.i1.u76.p274==1))||(i5.i1.u36.p155==1))||(i6.i0.u39.p171==1))||(i3.i0.u14.p79==1))||(u1.p30==1))||(i3.i0.u13.p78==1))))))) + !(EX(((i6.i2.u46.p193==1)&&((((i9.i0.u68.p258==1)||(i12.i1.u94.p367==1))||((i11.i0.u82.p318==1)&&(i8.u93.p323==1)))||(i1.i1.u61.p239==1)))))))))] = FALSE * [((Init * !(E(TRUE U (!(EX(!(((((((((u1.p2==1)&&(i11.i0.u82.p318==1))||(i7.i3.u59.p229==1))||(i7.i2.u56.p219==1))||(i6.i0.u39.p170==1))||((i11.i0.u82.p318==1)&&(i8.u0.p340==1)))||((i12.i0.u80.p286==1)&&(i12.i0.u98.p421==1)))||(u1.p29==1))))) + !(EG(!(EX((((i3.i2.u22.p99==1)||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1)))&&(i7.i3.u53.p211==1)))))))))) * !(EG((((((i5.i1.u33.p146==1)||((i5.i1.u36.p160==1)&&(i4.i1.u95.p414==1)))||((i12.i0.u80.p286==1)&&(i12.i0.u80.p368==1)))||(i2.i1.u8.p56==1))||(i10.i0.u72.p264==1)))))] = FALSE) * [FwdG((Init * !(E(TRUE U (!(EX(!(((((((((u1.p2==1)&&(i11.i0.u82.p318==1))||(i7.i3.u59.p229==1))||(i7.i2.u56.p219==1))||(i6.i0.u39.p170==1))||((i11.i0.u82.p318==1)&&(i8.u0.p340==1)))||((i12.i0.u80.p286==1)&&(i12.i0.u98.p421==1)))||(u1.p29==1))))) + !(EG(!(EX((((i3.i2.u22.p99==1)||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1)))&&(i7.i3.u53.p211==1)))))))))),!((((((i4.i0.u24.p115==1)||(i12.i0.u80.p286==1))||(i12.i0.u97.p424==1)) * EX(((((((((i5.i1.u33.p146==1)||(i6.i2.u46.p193==1))||(i5.i1.u36.p134==1))||(i6.i1.u42.p181==1))||(i12.i0.u80.p284==1))||(i11.i0.u82.p318==1))||(i6.i0.u40.p174==1))||(i6.i0.u39.p172==1)))) * !(E((((((((i8.u2.p1==1)||(i5.i1.u36.p160==1))||(i12.i0.u66.p253==1))||(i12.i0.u66.p254==1))||(i4.i1.u27.p126==1))||(i10.i0.u73.p266==1))||(i4.i1.u28.p124==1)) U ((((i9.i0.u78.p279==1)||(i3.i0.u15.p82==1))||(i4.i0.u25.p119==1))||(i10.i1.u70.p270==1)))))))] = FALSE) * [(((Init * !(E(TRUE U (!(EX(!(((((((((u1.p2==1)&&(i11.i0.u82.p318==1))||(i7.i3.u59.p229==1))||(i7.i2.u56.p219==1))||(i6.i0.u39.p170==1))||((i11.i0.u82.p318==1)&&(i8.u0.p340==1)))||((i12.i0.u80.p286==1)&&(i12.i0.u98.p421==1)))||(u1.p29==1))))) + !(EG(!(EX((((i3.i2.u22.p99==1)||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1)))&&(i7.i3.u53.p211==1)))))))))) * !(EX(E((((((u1.p23==1)||(i5.i1.u35.p152==1))||(i7.i0.u48.p200==1))||(i4.i1.u27.p127==1))||((i6.i0.u45.p191==1)&&(i8.u93.p323==1))) U ((i7.i0.u47.p238==1)&&(i8.u93.p323==1)))))) * !(E(TRUE U (((((((i3.i2.u12.p71==1)||(i11.i2.u92.p291==1))||(i5.i1.u35.p154==1))||(i7.i1.u57.p222==1))||(u1.p31==1))&&(((((i5.i1.u33.p146==1)||(i8.u2.p1==1))||(i2.i1.u7.p54==1))||(i12.i1.u94.p367==1))||(i11.i0.u84.p296==1))) + !(E(TRUE U !((((((((i7.i1.u52.p224==1)||((i12.i0.u80.p286==1)&&(i8.u93.p323==1)))||((i3.i0.u21.p98==1)&&(i8.u93.p323==1)))||(i12.i0.u66.p254==1))||(i5.i1.u35.p153==1))||(i3.i1.u19.p90==1))||(i7.i0.u50.p204==1)))))))))] = FALSE)
Using saturation style SCC detection
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 4,1,277.043,2457348,1,0,3.69838e+06,2708,2457,6.88809e+06,322,15424,1067193
FORMULA SmartHome-PT-15-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((i6.i0.u39.p172==1) * ((((EX(!(E((((((i10.i0.u71.p263==1)||(i7.i2.u54.p213==1))||(i7.i0.u48.p201==1))||(i4.i1.u28.p124==1))||(u1.p31==1)) U (i9.i0.u78.p278==1)))) + (i3.i0.u16.p83==1)) + (i9.i0.u78.p279==1)) + (i12.i0.u79.p282==1)) + ((((i6.i1.u41.p179==0)&&(i2.i0.u5.p67==0))&&(i7.i2.u55.p217==0))&&((i12.i0.u80.p286==0)||(i12.i0.u98.p421==0))))))
=> equivalent forward existential formula: (((([(EY((FwdU(Init,TRUE) * (i6.i0.u39.p172==1))) * !(E((((((i10.i0.u71.p263==1)||(i7.i2.u54.p213==1))||(i7.i0.u48.p201==1))||(i4.i1.u28.p124==1))||(u1.p31==1)) U (i9.i0.u78.p278==1))))] != FALSE + [((FwdU(Init,TRUE) * (i6.i0.u39.p172==1)) * (i3.i0.u16.p83==1))] != FALSE) + [((FwdU(Init,TRUE) * (i6.i0.u39.p172==1)) * (i9.i0.u78.p279==1))] != FALSE) + [((FwdU(Init,TRUE) * (i6.i0.u39.p172==1)) * (i12.i0.u79.p282==1))] != FALSE) + [((FwdU(Init,TRUE) * (i6.i0.u39.p172==1)) * ((((i6.i1.u41.p179==0)&&(i2.i0.u5.p67==0))&&(i7.i2.u55.p217==0))&&((i12.i0.u80.p286==0)||(i12.i0.u98.p421==0))))] != FALSE)
(forward)formula 5,1,277.5,2457348,1,0,3.69838e+06,2708,2692,6.88809e+06,332,15424,1123977
FORMULA SmartHome-PT-15-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EF((AG(((((i12.i0.u97.p423==1)&&(i12.i0.u98.p426==1))||(i6.i0.u39.p172==1))||(i4.i1.u27.p125==1))) * (i3.i1.u17.p84==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(E(TRUE U !(((((i12.i0.u97.p423==1)&&(i12.i0.u98.p426==1))||(i6.i0.u39.p172==1))||(i4.i1.u27.p125==1))))) * (i3.i1.u17.p84==1)))))] = FALSE
(forward)formula 6,0,277.547,2457348,1,0,3.69838e+06,2708,2710,6.88809e+06,332,15424,1130728
FORMULA SmartHome-PT-15-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (A(A(EG((((((((((((((i9.i0.u78.p278==0)&&(i1.i0.u3.p36==0))&&((u1.p2==0)||(i12.i0.u80.p286==0)))&&(i3.i1.u18.p87==0))&&(i11.i0.u82.p317==0))&&(i5.i1.u35.p152==0))&&(i10.i0.u73.p267==0))&&(i3.i0.u16.p83==0))&&(i5.i1.u36.p160==0))&&(i9.i1.u76.p274==0))&&(i1.i0.u4.p39==0))&&((i12.i0.u80.p286==0)||(i8.u93.p323==0)))&&(i7.i0.u49.p206==0))) U EF(AX((i11.i0.u86.p303==1)))) U ((((((((((i11.i0.u83.p295==1)||(i11.i1.u89.p310==1))||(i1.i0.u3.p36==1))||(i11.i2.u92.p291==1))||(i11.i0.u85.p300==1))||(i12.i0.u65.p252==1))||(i12.i0.u80.p286==1))||(i7.i1.u52.p223==1))||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1))) + AG(((i11.i0.u83.p295==1)||(i8.u63.p290==1))))) + AF(((((i7.i0.u47.p238==1)&&(i8.u93.p323==1))||(i12.i0.u64.p248==1))||(i7.i0.u50.p205==1))))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(((((((((((i11.i0.u83.p295==1)||(i11.i1.u89.p310==1))||(i1.i0.u3.p36==1))||(i11.i2.u92.p291==1))||(i11.i0.u85.p300==1))||(i12.i0.u65.p252==1))||(i12.i0.u80.p286==1))||(i7.i1.u52.p223==1))||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1))) + !(E(TRUE U !(((i11.i0.u83.p295==1)||(i8.u63.p290==1))))))) U (!(!((E(!(E(TRUE U !(EX(!((i11.i0.u86.p303==1)))))) U (!(EG((((((((((((((i9.i0.u78.p278==0)&&(i1.i0.u3.p36==0))&&((u1.p2==0)||(i12.i0.u80.p286==0)))&&(i3.i1.u18.p87==0))&&(i11.i0.u82.p317==0))&&(i5.i1.u35.p152==0))&&(i10.i0.u73.p267==0))&&(i3.i0.u16.p83==0))&&(i5.i1.u36.p160==0))&&(i9.i1.u76.p274==0))&&(i1.i0.u4.p39==0))&&((i12.i0.u80.p286==0)||(i8.u93.p323==0)))&&(i7.i0.u49.p206==0)))) * !(E(TRUE U !(EX(!((i11.i0.u86.p303==1)))))))) + EG(!(E(TRUE U !(EX(!((i11.i0.u86.p303==1)))))))))) * !(((((((((((i11.i0.u83.p295==1)||(i11.i1.u89.p310==1))||(i1.i0.u3.p36==1))||(i11.i2.u92.p291==1))||(i11.i0.u85.p300==1))||(i12.i0.u65.p252==1))||(i12.i0.u80.p286==1))||(i7.i1.u52.p223==1))||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1))) + !(E(TRUE U !(((i11.i0.u83.p295==1)||(i8.u63.p290==1))))))))) + EG(!(((((((((((i11.i0.u83.p295==1)||(i11.i1.u89.p310==1))||(i1.i0.u3.p36==1))||(i11.i2.u92.p291==1))||(i11.i0.u85.p300==1))||(i12.i0.u65.p252==1))||(i12.i0.u80.p286==1))||(i7.i1.u52.p223==1))||((i12.i0.u80.p286==1)&&(i12.i1.u96.p425==1))) + !(E(TRUE U !(((i11.i0.u83.p295==1)||(i8.u63.p290==1)))))))))))),!(((((i7.i0.u47.p238==1)&&(i8.u93.p323==1))||(i12.i0.u64.p248==1))||(i7.i0.u50.p205==1))))] = FALSE
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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 7,1,279.6,2457348,1,0,3.69838e+06,2708,2946,6.88809e+06,345,15424,1296034
FORMULA SmartHome-PT-15-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((EG((((((i6.i2.u46.p193==1)||(i3.i0.u21.p98==1))||(i2.i0.u5.p41==1))||(i9.i0.u68.p280==1))||(u1.p13==1))) * (((!(AF(((i4.i0.u25.p119==1)||(i1.i1.u61.p239==1)))) + !(EF(((((((((i10.i0.u71.p261==1)||(i12.i1.u94.p367==1))||(i7.i2.u55.p216==1))||(i9.i0.u68.p280==1))||(u1.p30==1))||(i7.i1.u57.p221==1))||(i11.i0.u83.p299==1))||((i6.i0.u45.p191==1)&&(i8.u93.p323==1)))))) + !(EG((i7.i1.u52.p223==0)))) + AX(((i9.i1.u77.p277==1) * AF((((i7.i2.u54.p214==1)||(i7.i2.u56.p219==1))||(i7.i0.u49.p206==1))))))))
=> equivalent forward existential formula: ((([FwdG((EY(Init) * EG((((((i6.i2.u46.p193==1)||(i3.i0.u21.p98==1))||(i2.i0.u5.p41==1))||(i9.i0.u68.p280==1))||(u1.p13==1)))),!(((i4.i0.u25.p119==1)||(i1.i1.u61.p239==1))))] != FALSE + [((EY(Init) * EG((((((i6.i2.u46.p193==1)||(i3.i0.u21.p98==1))||(i2.i0.u5.p41==1))||(i9.i0.u68.p280==1))||(u1.p13==1)))) * !(E(TRUE U ((((((((i10.i0.u71.p261==1)||(i12.i1.u94.p367==1))||(i7.i2.u55.p216==1))||(i9.i0.u68.p280==1))||(u1.p30==1))||(i7.i1.u57.p221==1))||(i11.i0.u83.p299==1))||((i6.i0.u45.p191==1)&&(i8.u93.p323==1))))))] != FALSE) + [((EY(Init) * EG((((((i6.i2.u46.p193==1)||(i3.i0.u21.p98==1))||(i2.i0.u5.p41==1))||(i9.i0.u68.p280==1))||(u1.p13==1)))) * !(EG((i7.i1.u52.p223==0))))] != FALSE) + [((EY(Init) * EG((((((i6.i2.u46.p193==1)||(i3.i0.u21.p98==1))||(i2.i0.u5.p41==1))||(i9.i0.u68.p280==1))||(u1.p13==1)))) * !(EX(!(((i9.i1.u77.p277==1) * !(EG(!((((i7.i2.u54.p214==1)||(i7.i2.u56.p219==1))||(i7.i0.u49.p206==1))))))))))] != FALSE)
(forward)formula 8,0,281.227,2457348,1,0,3.69838e+06,2708,3073,6.88809e+06,349,15424,1457318
FORMULA SmartHome-PT-15-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EX((EG(((((i1.i0.u3.p36==1)||(i5.i1.u33.p148==1))||(i7.i0.u49.p202==1))||(i11.i2.u91.p319==1))) * ((i5.i1.u33.p147==1)||(i9.i1.u69.p259==1)))) U ((((((i1.i0.u4.p37==1)||(u1.p23==1))||(i12.i0.u80.p286==1))||(u1.p26==1))||(u1.p29==1))||(i11.i0.u83.p299==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((((((i1.i0.u4.p37==1)||(u1.p23==1))||(i12.i0.u80.p286==1))||(u1.p26==1))||(u1.p29==1))||(i11.i0.u83.p299==1)))))) * !(E(!(((((((i1.i0.u4.p37==1)||(u1.p23==1))||(i12.i0.u80.p286==1))||(u1.p26==1))||(u1.p29==1))||(i11.i0.u83.p299==1))) U (!(EX((EG(((((i1.i0.u3.p36==1)||(i5.i1.u33.p148==1))||(i7.i0.u49.p202==1))||(i11.i2.u91.p319==1))) * ((i5.i1.u33.p147==1)||(i9.i1.u69.p259==1))))) * !(((((((i1.i0.u4.p37==1)||(u1.p23==1))||(i12.i0.u80.p286==1))||(u1.p26==1))||(u1.p29==1))||(i11.i0.u83.p299==1)))))))] != FALSE
(forward)formula 9,0,281.918,2457348,1,0,3.69838e+06,2870,3142,6.88809e+06,351,16589,1532269
FORMULA SmartHome-PT-15-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(!(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(!(!(EX(!(FALSE))))))] = FALSE
(forward)formula 10,1,281.918,2457348,1,0,3.69838e+06,2870,3145,6.88809e+06,351,16589,1532269
FORMULA SmartHome-PT-15-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((!(AX((AG(((((((i10.i1.u70.p260==1)||(u1.p25==1))||(i3.i0.u14.p75==1))||(u1.p28==1))||(i11.i0.u86.p313==1))||(i10.i0.u73.p267==1))) + EX((i7.i3.u58.p227==1))))) * (((((((i2.i0.u5.p67==0)&&(i4.i1.u23.p128==0))&&(i3.i0.u21.p98==0))&&(i12.i0.u66.p254==0))&&(i7.i0.u47.p237==0))&&(i2.i0.u6.p62==0)) + (EX(((((((((i4.i1.u23.p129==1)||(i10.i0.u71.p263==1))||(i6.i0.u45.p165==1))||(i2.i0.u5.p41==1))||(i5.i0.u31.p139==1))||(i5.i0.u30.p141==1))||(i4.i1.u95.p409==1))||(i4.i1.u27.p125==1))) * (E(((((i12.i1.u94.p366==1)||(i8.u93.p334==1))||(i11.i0.u86.p313==1))||(i6.i0.u39.p172==1)) U ((((i6.i2.u46.p193==1)||((i4.i1.u23.p129==1)&&(i4.i1.u95.p417==1)))||(i7.i1.u57.p222==1))||(i7.i0.u47.p238==1))) + ((((((((i12.i0.u67.p257==1)||(i11.i1.u87.p305==1))||(i8.u93.p338==1))||(i6.i0.u44.p186==1))||(i5.i1.u35.p153==1))||(i11.i0.u82.p318==1))||(i11.i0.u84.p298==1))&&(((((i12.i0.u80.p244==1)||(i9.i0.u78.p278==1))||(i2.i0.u6.p52==1))||(i12.i0.u79.p282==1))||(i4.i1.u95.p409==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(!(EX(!((!(E(TRUE U !(((((((i10.i1.u70.p260==1)||(u1.p25==1))||(i3.i0.u14.p75==1))||(u1.p28==1))||(i11.i0.u86.p313==1))||(i10.i0.u73.p267==1))))) + EX((i7.i3.u58.p227==1))))))) * (((((((i2.i0.u5.p67==0)&&(i4.i1.u23.p128==0))&&(i3.i0.u21.p98==0))&&(i12.i0.u66.p254==0))&&(i7.i0.u47.p237==0))&&(i2.i0.u6.p62==0)) + (EX(((((((((i4.i1.u23.p129==1)||(i10.i0.u71.p263==1))||(i6.i0.u45.p165==1))||(i2.i0.u5.p41==1))||(i5.i0.u31.p139==1))||(i5.i0.u30.p141==1))||(i4.i1.u95.p409==1))||(i4.i1.u27.p125==1))) * (E(((((i12.i1.u94.p366==1)||(i8.u93.p334==1))||(i11.i0.u86.p313==1))||(i6.i0.u39.p172==1)) U ((((i6.i2.u46.p193==1)||((i4.i1.u23.p129==1)&&(i4.i1.u95.p417==1)))||(i7.i1.u57.p222==1))||(i7.i0.u47.p238==1))) + ((((((((i12.i0.u67.p257==1)||(i11.i1.u87.p305==1))||(i8.u93.p338==1))||(i6.i0.u44.p186==1))||(i5.i1.u35.p153==1))||(i11.i0.u82.p318==1))||(i11.i0.u84.p298==1))&&(((((i12.i0.u80.p244==1)||(i9.i0.u78.p278==1))||(i2.i0.u6.p52==1))||(i12.i0.u79.p282==1))||(i4.i1.u95.p409==1)))))))))] = FALSE
(forward)formula 11,1,284.826,2457348,1,0,3.69838e+06,2997,3298,6.88809e+06,354,17643,1688662
FORMULA SmartHome-PT-15-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1621168871181

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-15"
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-15, 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 r254-tall-162106745700266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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