fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r227-oct2-159033546100082
Last Updated
Jun 28, 2020

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.630 40753.00 102175.00 127.90 FFFTFFFTFFTFFFFF normal

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-159033546100082.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-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.0K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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.3K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 71K 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-11-00
FORMULA_NAME SmartHome-PT-11-01
FORMULA_NAME SmartHome-PT-11-02
FORMULA_NAME SmartHome-PT-11-03
FORMULA_NAME SmartHome-PT-11-04
FORMULA_NAME SmartHome-PT-11-05
FORMULA_NAME SmartHome-PT-11-06
FORMULA_NAME SmartHome-PT-11-07
FORMULA_NAME SmartHome-PT-11-08
FORMULA_NAME SmartHome-PT-11-09
FORMULA_NAME SmartHome-PT-11-10
FORMULA_NAME SmartHome-PT-11-11
FORMULA_NAME SmartHome-PT-11-12
FORMULA_NAME SmartHome-PT-11-13
FORMULA_NAME SmartHome-PT-11-14
FORMULA_NAME SmartHome-PT-11-15

=== Now, execution of the tool begins

BK_START 1590483743264

[2020-05-26 09:02:25] [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:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:02:25] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-05-26 09:02:25] [INFO ] Transformed 290 places.
[2020-05-26 09:02:25] [INFO ] Transformed 315 transitions.
[2020-05-26 09:02:25] [INFO ] Found NUPN structural information;
[2020-05-26 09:02:25] [INFO ] Parsed PT model containing 290 places and 315 transitions in 126 ms.
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 55 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 563 resets, run finished after 190 ms. (steps per millisecond=526 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 260 rows 224 cols
[2020-05-26 09:02:26] [INFO ] Computed 12 place invariants in 11 ms
[2020-05-26 09:02:26] [INFO ] [Real]Absence check using 12 positive place invariants in 33 ms returned unsat
[2020-05-26 09:02:26] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2020-05-26 09:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:27] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2020-05-26 09:02:27] [INFO ] Deduced a trap composed of 45 places in 143 ms
[2020-05-26 09:02:28] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2020-05-26 09:02:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2020-05-26 09:02:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 133 ms returned sat
[2020-05-26 09:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:28] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2020-05-26 09:02:28] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2020-05-26 09:02:29] [INFO ] Deduced a trap composed of 32 places in 57 ms
[2020-05-26 09:02:29] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2020-05-26 09:02:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2020-05-26 09:02:29] [INFO ] Computed and/alt/rep : 259/747/259 causal constraints in 32 ms.
[2020-05-26 09:02:30] [INFO ] Added : 252 causal constraints over 51 iterations in 1268 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-26 09:02:30] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-26 09:02:30] [INFO ] Flatten gal took : 85 ms
FORMULA SmartHome-PT-11-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:02:30] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:02:30] [INFO ] Applying decomposition
[2020-05-26 09:02:30] [INFO ] Flatten gal took : 9 ms
[2020-05-26 09:02:31] [INFO ] Input system was already deterministic with 260 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/graph7798021810808909593.txt, -o, /tmp/graph7798021810808909593.bin, -w, /tmp/graph7798021810808909593.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/graph7798021810808909593.bin, -l, -1, -v, -w, /tmp/graph7798021810808909593.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:02:31] [INFO ] Decomposing Gal with order
[2020-05-26 09:02:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:02:31] [INFO ] Removed a total of 53 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 260 rows 224 cols
[2020-05-26 09:02:31] [INFO ] Computed 12 place invariants in 41 ms
inv : p0 + p231 + p243 + p255 + p256 + p257 + p258 + p281 + p282 + p283 + p284 + p285 + p286 + p287 = 1
inv : p0 + p1 + p23 + p24 + p25 + p26 + p90 + p91 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p116 + p117 + p118 + p119 + p120 = 1
inv : p0 + p231 + p243 + p255 + p256 + p257 + p258 + p272 + p277 + p278 + p279 + p280 = 1
inv : p0 + p1 + p23 + p24 + p25 + p26 + p27 + p59 + p60 + p62 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 = 1
inv : p0 + p1 + p23 + p24 + p152 + p153 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 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 + p196 + p197 + p198 + p199 = 1
inv : p0 + p1 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p231 + p232 + p238 + p239 + p240 + p241 + p242 = 1
inv : p0 + p231 + p243 + p255 + p256 + p257 + p258 + p272 + p273 + p275 + p276 = 1
inv : p0 + p1 + p2 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 = 1
inv : p0 + p1 + p23 + p200 + p201 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p226 + p227 + p228 + p229 + p230 = 1
inv : p0 + p231 + p243 + p255 + p256 + p257 + p258 + p281 + p282 + p283 + p284 + p288 + p289 = 1
inv : p0 + p1 + p23 + p24 + p25 + p121 + p122 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p147 + p148 + p149 + p150 + p151 = 1
Total of 12 invariants.
[2020-05-26 09:02:31] [INFO ] Computed 12 place invariants in 42 ms
[2020-05-26 09:02:31] [INFO ] Flatten gal took : 574 ms
[2020-05-26 09:02:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2020-05-26 09:02:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 32 ms
[2020-05-26 09:02:31] [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 8 LTL properties
Checking formula 0 : !((((!(X(F(X("(i6.i0.u36.p127==1)")))))&&(F("(i6.i0.u36.p127==1)")))&&(F("(i5.i0.u26.p98==1)"))))
Formula 0 simplified : !(!XFX"(i6.i0.u36.p127==1)" & F"(i6.i0.u36.p127==1)" & F"(i5.i0.u26.p98==1)")
built 25 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-26 09:02:32] [INFO ] Proved 224 variables to be positive in 1675 ms
[2020-05-26 09:02:32] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2020-05-26 09:02:32] [INFO ] Computation of disable matrix completed :0/260 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:32] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:32] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2020-05-26 09:02:32] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t32, t69, t124, t160, t231, u2.t263, u2.t264, u2.t265, u2.t266, u2.t267, u2.t268, u2.t269, u2.t270, u2.t271, u2.t272, i0.i0.t8, i0.i0.u76.t17, i0.i0.u76.t18, i0.i0.u76.t19, i0.i0.u76.t20, i0.i0.u76.t21, i2.i0.t256, i2.i0.t258, i2.i0.u12.t232, i4.t196, i4.i0.t200, i4.i0.u15.t197, i5.i0.t185, i5.i0.t187, i5.i0.u33.t161, i6.i0.t149, i6.i0.t151, i6.i0.u43.t125, i9.t115, i9.t113, i9.t109, i9.t74, i9.u61.t70, i9.u61.t71, i11.i0.t57, i11.i0.t59, i11.i0.u65.t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/211/42/253
Computing Next relation with stutter on 75 deadlock states
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
181 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.88608,77796,1,0,124444,2289,2994,227159,490,13978,375239
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-11-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(X(G("(i6.i0.u35.p129==1)"))))&&(("(i2.i0.u5.p36==1)")U(G(("(i9.u46.p157!=1)")U("(i2.i0.u5.p36==1)"))))))
Formula 1 simplified : !(FXG"(i6.i0.u35.p129==1)" & ("(i2.i0.u5.p36==1)" U G("(i9.u46.p157!=1)" U "(i2.i0.u5.p36==1)")))
Computing Next relation with stutter on 75 deadlock states
[2020-05-26 09:02:35] [INFO ] Computing symmetric co enabling matrix : 260 transitions.
[2020-05-26 09:02:36] [INFO ] Computation of co-enabling matrix(11/260) took 1047 ms. Total solver calls (SAT/UNSAT): 386(0/386)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
281 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,4.70647,187416,1,0,349303,2344,3055,602187,492,15353,753292
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-11-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(("(i10.i0.u45.p151==1)")U(!(G(!(F(X(!(F("(i9.u60.p190==1)"))))))))))))
Formula 2 simplified : !FG("(i10.i0.u45.p151==1)" U !G!FX!F"(i9.u60.p190==1)")
Computing Next relation with stutter on 75 deadlock states
[2020-05-26 09:02:39] [INFO ] Computation of co-enabling matrix(46/260) took 4284 ms. Total solver calls (SAT/UNSAT): 1661(18/1643)
[2020-05-26 09:02:43] [INFO ] Computation of co-enabling matrix(50/260) took 8068 ms. Total solver calls (SAT/UNSAT): 1903(18/1885)
[2020-05-26 09:02:47] [INFO ] Computation of co-enabling matrix(59/260) took 12070 ms. Total solver calls (SAT/UNSAT): 2389(30/2359)
[2020-05-26 09:02:50] [INFO ] Computation of co-enabling matrix(85/260) took 15107 ms. Total solver calls (SAT/UNSAT): 3338(33/3305)
[2020-05-26 09:02:53] [INFO ] Computation of co-enabling matrix(109/260) took 18637 ms. Total solver calls (SAT/UNSAT): 3957(62/3895)
[2020-05-26 09:02:56] [INFO ] Computation of co-enabling matrix(132/260) took 21676 ms. Total solver calls (SAT/UNSAT): 4302(73/4229)
31 unique states visited
31 strongly connected components in search stack
32 transitions explored
31 items max in DFS search stack
2120 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,25.9117,772576,1,0,1.34109e+06,2364,3082,2.67077e+06,492,15859,1969099
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-11-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X(X(((X(F(X("(i10.i0.u1.p25==1)"))))&&("(i10.i0.u1.p25==1)"))&&("(i8.i1.u55.p169==1)")))))))
Formula 3 simplified : !FGXX("(i8.i1.u55.p169==1)" & "(i10.i0.u1.p25==1)" & XFX"(i10.i0.u1.p25==1)")
Computing Next relation with stutter on 75 deadlock states
31 unique states visited
31 strongly connected components in search stack
32 transitions explored
31 items max in DFS search stack
1 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,25.9167,773140,1,0,1.34124e+06,2364,3114,2.67109e+06,492,15880,1969518
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-11-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(F("(i12.i0.u77.p256==1)")))))
Formula 4 simplified : !XXF"(i12.i0.u77.p256==1)"
Computing Next relation with stutter on 75 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,25.9229,773140,1,0,1.34172e+06,2369,3148,2.67156e+06,493,15911,1970932
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-11-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X((G("((i10.i1.u62.p196==1)&&(i4.i0.u20.p71==1))"))U(G("(i9.u61.p153!=1)"))))U("(i5.i0.u33.p117==1)")))
Formula 5 simplified : !(X(G"((i10.i1.u62.p196==1)&&(i4.i0.u20.p71==1))" U G"(i9.u61.p153!=1)") U "(i5.i0.u33.p117==1)")
Computing Next relation with stutter on 75 deadlock states
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
12 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,26.0543,776440,1,0,1.3482e+06,2373,3225,2.68065e+06,495,16009,1983356
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-11-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("((u2.p2==1)&&(i11.i0.u65.p227==1))")U((G(X((!(F("((u2.p2==1)&&(i11.i0.u65.p227==1))")))&&("(i8.i0.u52.p173==1)"))))||(X(X(X("(i4.i0.u21.p82==1)")))))))
Formula 6 simplified : !("((u2.p2==1)&&(i11.i0.u65.p227==1))" U (GX("(i8.i0.u52.p173==1)" & !F"((u2.p2==1)&&(i11.i0.u65.p227==1))") | XXX"(i4.i0.u21.p82==1)"))
Computing Next relation with stutter on 75 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,26.064,776876,1,0,1.34829e+06,2373,3255,2.68073e+06,496,16009,1983854
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-11-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F("((i2.i1.u8.p45==1)||(i2.i1.u7.p43==1))"))))
Formula 7 simplified : !XF"((i2.i1.u8.p45==1)||(i2.i1.u7.p43==1))"
Computing Next relation with stutter on 75 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
61 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,26.6625,800288,1,0,1.40156e+06,2373,3284,2.75179e+06,496,16050,2089366
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-11-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-26 09:03:00] [INFO ] Computation of co-enabling matrix(150/260) took 25057 ms. Total solver calls (SAT/UNSAT): 4843(81/4762)
[2020-05-26 09:03:03] [INFO ] Computation of co-enabling matrix(171/260) took 28083 ms. Total solver calls (SAT/UNSAT): 5200(91/5109)
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
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:03:03] [INFO ] Built C files in 32340ms 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 1590483784017

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-11, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-oct2-159033546100082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-11.tgz
mv SmartHome-PT-11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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