Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546100074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 2.7K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 68K May 12 20:42 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-00
FORMULA_NAME SmartHome-PT-10-01
FORMULA_NAME SmartHome-PT-10-02
FORMULA_NAME SmartHome-PT-10-03
FORMULA_NAME SmartHome-PT-10-04
FORMULA_NAME SmartHome-PT-10-05
FORMULA_NAME SmartHome-PT-10-06
FORMULA_NAME SmartHome-PT-10-07
FORMULA_NAME SmartHome-PT-10-08
FORMULA_NAME SmartHome-PT-10-09
FORMULA_NAME SmartHome-PT-10-10
FORMULA_NAME SmartHome-PT-10-11
FORMULA_NAME SmartHome-PT-10-12
FORMULA_NAME SmartHome-PT-10-13
FORMULA_NAME SmartHome-PT-10-14
FORMULA_NAME SmartHome-PT-10-15

=== Now, execution of the tool begins

BK_START 1590483726698

[2020-05-26 09:02:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-26 09:02:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:02:09] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-05-26 09:02:09] [INFO ] Transformed 273 places.
[2020-05-26 09:02:09] [INFO ] Transformed 308 transitions.
[2020-05-26 09:02:09] [INFO ] Found NUPN structural information;
[2020-05-26 09:02:09] [INFO ] Parsed PT model containing 273 places and 308 transitions in 104 ms.
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 45 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 662 resets, run finished after 180 ms. (steps per millisecond=555 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 263 rows 233 cols
[2020-05-26 09:02:09] [INFO ] Computed 12 place invariants in 22 ms
[2020-05-26 09:02:09] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2020-05-26 09:02:09] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 13 ms returned sat
[2020-05-26 09:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:10] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2020-05-26 09:02:10] [INFO ] Deduced a trap composed of 50 places in 539 ms
[2020-05-26 09:02:13] [INFO ] Deduced a trap composed of 56 places in 2559 ms
[2020-05-26 09:02:13] [INFO ] Deduced a trap composed of 52 places in 70 ms
[2020-05-26 09:02:13] [INFO ] Deduced a trap composed of 27 places in 39 ms
[2020-05-26 09:02:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3318 ms
[2020-05-26 09:02:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 825 ms returned sat
[2020-05-26 09:02:14] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2020-05-26 09:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:14] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2020-05-26 09:02:15] [INFO ] Deduced a trap composed of 50 places in 1035 ms
[2020-05-26 09:02:15] [INFO ] Deduced a trap composed of 56 places in 230 ms
[2020-05-26 09:02:16] [INFO ] Deduced a trap composed of 52 places in 689 ms
[2020-05-26 09:02:17] [INFO ] Deduced a trap composed of 27 places in 1035 ms
[2020-05-26 09:02:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3079 ms
[2020-05-26 09:02:17] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 37 ms.
[2020-05-26 09:02:19] [INFO ] Added : 261 causal constraints over 53 iterations in 1628 ms. Result :sat
[2020-05-26 09:02:19] [INFO ] Deduced a trap composed of 34 places in 559 ms
[2020-05-26 09:02:20] [INFO ] Deduced a trap composed of 34 places in 92 ms
[2020-05-26 09:02:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 720 ms
[2020-05-26 09:02:20] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-26 09:02:20] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 5 ms returned sat
[2020-05-26 09:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:20] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-05-26 09:02:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 621 ms returned sat
[2020-05-26 09:02:21] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:21] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2020-05-26 09:02:21] [INFO ] Deduced a trap composed of 32 places in 43 ms
[2020-05-26 09:02:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2020-05-26 09:02:21] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 13 ms.
[2020-05-26 09:02:22] [INFO ] Added : 261 causal constraints over 53 iterations in 1253 ms. Result :sat
[2020-05-26 09:02:22] [INFO ] Deduced a trap composed of 28 places in 65 ms
[2020-05-26 09:02:23] [INFO ] Deduced a trap composed of 34 places in 409 ms
[2020-05-26 09:02:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2020-05-26 09:02:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-26 09:02:23] [INFO ] Flatten gal took : 103 ms
FORMULA SmartHome-PT-10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:02:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:02:23] [INFO ] Flatten gal took : 17 ms
[2020-05-26 09:02:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-10-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:02:23] [INFO ] Applying decomposition
[2020-05-26 09:02:23] [INFO ] Flatten gal took : 13 ms
[2020-05-26 09:02:23] [INFO ] Input system was already deterministic with 263 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12700832351691828840.txt, -o, /tmp/graph12700832351691828840.bin, -w, /tmp/graph12700832351691828840.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12700832351691828840.bin, -l, -1, -v, -w, /tmp/graph12700832351691828840.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 263 rows 233 cols
[2020-05-26 09:02:23] [INFO ] Computed 12 place invariants in 5 ms
inv : p0 + p1 + p9 + p10 + p11 + p12 + p93 + p94 + p95 + p96 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 = 1
inv : p0 + p1 + p9 + p10 + p155 + p156 + p157 + p158 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p197 + p198 + p199 + p200 + p201 + p202 = 1
inv : p0 + p1 + p9 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p229 + p230 + p231 + p232 + p233 = 1
inv : p0 + p234 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p269 + p270 + p271 + p272 = 1
inv : p0 + p1 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 = 1
inv : p0 + p234 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p255 + p256 + p257 + p269 + p270 + p271 + p272 = 1
inv : p0 + p234 + p235 + p236 + p237 + p238 = 1
inv : p0 + p234 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p252 + p253 + p254 + p269 + p270 + p271 + p272 = 1
inv : p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 - p269 - p270 - p271 - p272 = 0
inv : p0 + p1 + p9 + p10 + p11 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p150 + p151 + p152 + p153 + p154 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 = 1
inv : p0 + p1 + p9 + p10 + p11 + p12 + p13 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p88 + p89 + p90 + p91 + p92 = 1
Total of 12 invariants.
[2020-05-26 09:02:23] [INFO ] Computed 12 place invariants in 7 ms
[2020-05-26 09:02:23] [INFO ] Decomposing Gal with order
[2020-05-26 09:02:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:02:24] [INFO ] Removed a total of 42 redundant transitions.
[2020-05-26 09:02:24] [INFO ] Flatten gal took : 95 ms
[2020-05-26 09:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2020-05-26 09:02:24] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-26 09:02:24] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((G((G("(i7.i1.u44.p143==1)"))||(X("(i7.i1.u44.p143==1)")))))
Formula 0 simplified : !G(G"(i7.i1.u44.p143==1)" | X"(i7.i1.u44.p143==1)")
built 26 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-26 09:02:24] [INFO ] Proved 233 variables to be positive in 481 ms
[2020-05-26 09:02:24] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2020-05-26 09:02:24] [INFO ] Computation of disable matrix completed :0/263 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:24] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:24] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2020-05-26 09:02:24] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t22, t114, t186, u1.t273, u1.t274, u1.t275, u1.t276, u1.t277, u1.t278, i0.t5, i0.u73.t14, i0.u73.t15, i0.u73.t16, i0.u74.t13, i2.t222, i2.i0.t227, i2.i0.u15.t223, i2.i0.u15.t224, i2.i0.u15.t270, i2.i0.u81.t1, i2.i0.u81.t2, i4.i0.t211, i4.i0.t213, i4.i0.u26.t187, i4.i0.u26.t215, i6.t150, i6.i1.t154, i6.i1.u29.t151, i6.i1.u29.t179, i7.i0.t139, i7.i0.t141, i7.i0.u47.t115, i7.i0.u47.t143, i9.t59, i9.i1.t64, i9.i1.u60.t60, i9.i1.u60.t107, i10.i0.t47, i10.i0.t49, i10.i0.u62.t23, i10.i0.u62.t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/216/41/257
Computing Next relation with stutter on 60 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
91 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.944126,46444,1,0,62451,3332,3446,104507,543,12579,176213
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-10-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(X(G("((u1.p2==1)&&(i4.i0.u26.p89==1))"))))&&((!(X("(i1.i2.u13.p48==1)")))||(!(F("((u1.p2==1)&&(i4.i0.u26.p89==1))"))))))
Formula 1 simplified : !(!XG"((u1.p2==1)&&(i4.i0.u26.p89==1))" & (!X"(i1.i2.u13.p48==1)" | !F"((u1.p2==1)&&(i4.i0.u26.p89==1))"))
Computing Next relation with stutter on 60 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.946739,47632,1,0,62451,3332,3484,104507,546,12579,176283
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SmartHome-PT-10-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G(!(X((G("(i8.i0.u55.p182==1)"))&&("(i5.i2.u48.p152==1)")))))))
Formula 2 simplified : G!X("(i5.i2.u48.p152==1)" & G"(i8.i0.u55.p182==1)")
Computing Next relation with stutter on 60 deadlock states
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.05687,50540,1,0,68876,3337,3541,115068,546,12663,192314
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-10-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((!(X(G(("((i9.i0.u61.p199!=1)||(i5.i0.u2.p11!=1))")U("(i1.i0.u4.p29==1)")))))&&("(i5.i0.u2.p11!=1)"))))
Formula 3 simplified : !G("(i5.i0.u2.p11!=1)" & !XG("((i9.i0.u61.p199!=1)||(i5.i0.u2.p11!=1))" U "(i1.i0.u4.p29==1)"))
Computing Next relation with stutter on 60 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
41 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.47381,69356,1,0,112032,3383,3606,167994,548,13002,274680
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-10-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((!(X(G("(i1.i0.u6.p41==1)"))))&&((F(G("(i1.i0.u6.p41==1)")))||("(i7.i0.u41.p133==1)")))))
Formula 4 simplified : !F(!XG"(i1.i0.u6.p41==1)" & ("(i7.i0.u41.p133==1)" | FG"(i1.i0.u6.p41==1)"))
Computing Next relation with stutter on 60 deadlock states
[2020-05-26 09:02:26] [INFO ] Computing symmetric co enabling matrix : 263 transitions.
[2020-05-26 09:02:27] [INFO ] Computation of co-enabling matrix(17/263) took 844 ms. Total solver calls (SAT/UNSAT): 743(42/701)
[2020-05-26 09:02:30] [INFO ] Computation of co-enabling matrix(102/263) took 3856 ms. Total solver calls (SAT/UNSAT): 3355(90/3265)
[2020-05-26 09:02:33] [INFO ] Computation of co-enabling matrix(153/263) took 6878 ms. Total solver calls (SAT/UNSAT): 4402(120/4282)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
837 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.83954,279636,1,0,594983,3608,3643,712106,548,14692,717317
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-10-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(X((!(X(X(("(i7.i1.u42.p137==1)")U("(i8.i2.u56.p189==1)")))))&&(!(G("((i7.i0.u47.p151==1)&&(i0.u73.p235==1))")))))))
Formula 5 simplified : X(!XX("(i7.i1.u42.p137==1)" U "(i8.i2.u56.p189==1)") & !G"((i7.i0.u47.p151==1)&&(i0.u73.p235==1))")
Computing Next relation with stutter on 60 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.84448,279980,1,0,595126,3608,3668,712305,548,14692,718015
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-10-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(F("(i6.i0.u30.p106==1)")))))
Formula 6 simplified : XF"(i6.i0.u30.p106==1)"
Computing Next relation with stutter on 60 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.91779,282880,1,0,602232,3641,3689,723213,548,14868,731218
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-10-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(X(G((G("((i5.i0.u3.p13==1)||(i5.i0.u3.p12==1))"))||(G("((i9.i1.u60.p198==1)&&(i9.i1.u60.p246==1))"))))))||(G("(i7.i0.u47.p126!=1)"))))
Formula 7 simplified : !(XXG(G"((i5.i0.u3.p13==1)||(i5.i0.u3.p12==1))" | G"((i9.i1.u60.p198==1)&&(i9.i1.u60.p246==1))") | G"(i7.i0.u47.p126!=1)")
Computing Next relation with stutter on 60 deadlock states
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0136,286536,1,0,609546,3649,3810,733266,556,14922,746544
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-10-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X((F("(i6.i1.u35.p117==1)"))||("(i5.i1.u28.p92==1)")))U("(i5.i1.u28.p92==1)"))))
Formula 8 simplified : !X(X("(i5.i1.u28.p92==1)" | F"(i6.i1.u35.p117==1)") U "(i5.i1.u28.p92==1)")
Computing Next relation with stutter on 60 deadlock states
28 unique states visited
28 strongly connected components in search stack
28 transitions explored
28 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0502,288120,1,0,613144,3649,3820,737215,556,14922,754264
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-10-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F("(((i2.i0.u15.p57==1)&&(i2.i0.u15.p260==1))||(i7.i0.u41.p135==1))"))))
Formula 9 simplified : !XF"(((i2.i0.u15.p57==1)&&(i2.i0.u15.p260==1))||(i7.i0.u41.p135==1))"
Computing Next relation with stutter on 60 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.244,296568,1,0,633996,3654,3864,759250,559,14974,787831
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-10-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((!(G(F("(i7.i0.u40.p132==1)"))))U(G("(i1.i0.u11.p43==1)")))))
Formula 10 simplified : !G(!GF"(i7.i0.u40.p132==1)" U G"(i1.i0.u11.p43==1)")
Computing Next relation with stutter on 60 deadlock states
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.4058,302560,1,0,647723,3695,3907,774675,559,15089,816669
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SmartHome-PT-10-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("(i5.i1.u28.p92==1)")U(F((G("(i9.i1.u59.p195==1)"))U("(i5.i1.u28.p92==1)")))))
Formula 11 simplified : !("(i5.i1.u28.p92==1)" U F(G"(i9.i1.u59.p195==1)" U "(i5.i1.u28.p92==1)"))
Computing Next relation with stutter on 60 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.4098,302824,1,0,648097,3695,3911,774996,559,15089,817583
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SmartHome-PT-10-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-26 09:02:36] [INFO ] Built C files in 12952ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590483757047

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-oct2-159033546100074"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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