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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.2K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 22K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.5K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 15K 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 90K 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-12-00
FORMULA_NAME SmartHome-PT-12-01
FORMULA_NAME SmartHome-PT-12-02
FORMULA_NAME SmartHome-PT-12-03
FORMULA_NAME SmartHome-PT-12-04
FORMULA_NAME SmartHome-PT-12-05
FORMULA_NAME SmartHome-PT-12-06
FORMULA_NAME SmartHome-PT-12-07
FORMULA_NAME SmartHome-PT-12-08
FORMULA_NAME SmartHome-PT-12-09
FORMULA_NAME SmartHome-PT-12-10
FORMULA_NAME SmartHome-PT-12-11
FORMULA_NAME SmartHome-PT-12-12
FORMULA_NAME SmartHome-PT-12-13
FORMULA_NAME SmartHome-PT-12-14
FORMULA_NAME SmartHome-PT-12-15

=== Now, execution of the tool begins

BK_START 1590483767431

[2020-05-26 09:02:49] [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:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:02:49] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-26 09:02:49] [INFO ] Transformed 376 places.
[2020-05-26 09:02:49] [INFO ] Transformed 399 transitions.
[2020-05-26 09:02:49] [INFO ] Found NUPN structural information;
[2020-05-26 09:02:49] [INFO ] Parsed PT model containing 376 places and 399 transitions in 89 ms.
Deduced a syphon composed of 104 places in 3 ms
Reduce places removed 104 places and 80 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 473 resets, run finished after 196 ms. (steps per millisecond=510 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 319 rows 272 cols
[2020-05-26 09:02:49] [INFO ] Computed 13 place invariants in 12 ms
[2020-05-26 09:02:49] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2020-05-26 09:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:49] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2020-05-26 09:02:49] [INFO ] Computed and/alt/rep : 318/933/318 causal constraints in 23 ms.
[2020-05-26 09:02:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 57 ms returned sat
[2020-05-26 09:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:50] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2020-05-26 09:02:50] [INFO ] Computed and/alt/rep : 318/933/318 causal constraints in 14 ms.
[2020-05-26 09:02:51] [INFO ] Added : 288 causal constraints over 58 iterations in 1511 ms. Result :sat
[2020-05-26 09:02:51] [INFO ] Deduced a trap composed of 54 places in 72 ms
[2020-05-26 09:02:51] [INFO ] Deduced a trap composed of 50 places in 45 ms
[2020-05-26 09:02:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2020-05-26 09:02:51] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2020-05-26 09:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:52] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-05-26 09:02:52] [INFO ] Deduced a trap composed of 32 places in 33 ms
[2020-05-26 09:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-05-26 09:02:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 49 ms returned sat
[2020-05-26 09:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:52] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-05-26 09:02:52] [INFO ] Deduced a trap composed of 32 places in 31 ms
[2020-05-26 09:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-05-26 09:02:52] [INFO ] Computed and/alt/rep : 318/933/318 causal constraints in 14 ms.
[2020-05-26 09:02:54] [INFO ] Added : 309 causal constraints over 62 iterations in 1468 ms. Result :sat
[2020-05-26 09:02:54] [INFO ] Deduced a trap composed of 45 places in 36 ms
[2020-05-26 09:02:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2020-05-26 09:02:54] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-26 09:02:54] [INFO ] Flatten gal took : 97 ms
FORMULA SmartHome-PT-12-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:02:54] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:02:54] [INFO ] Applying decomposition
[2020-05-26 09:02:54] [INFO ] Flatten gal took : 18 ms
[2020-05-26 09:02:54] [INFO ] Input system was already deterministic with 319 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/graph2936444961312037481.txt, -o, /tmp/graph2936444961312037481.bin, -w, /tmp/graph2936444961312037481.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/graph2936444961312037481.bin, -l, -1, -v, -w, /tmp/graph2936444961312037481.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:02:54] [INFO ] Decomposing Gal with order
[2020-05-26 09:02:54] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 319 rows 272 cols
[2020-05-26 09:02:54] [INFO ] Computed 13 place invariants in 2 ms
inv : p0 + p290 + p307 + p328 + p329 + p330 + p331 + p358 + p363 + p364 + p365 + p366 = 1
inv : p0 + p1 + p33 + p34 + p35 + p36 + p132 + p133 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p158 + p159 + p160 + p161 + p162 = 1
inv : p0 + p1 + p33 + p259 + p260 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p285 + p286 + p287 + p288 + p289 = 1
inv : p0 + p290 + p307 + p328 + p329 + p330 + p331 + p367 + p368 + p369 + p370 + p374 + p375 = 1
inv : p0 + p290 + p307 + p328 + p329 + p330 + p331 + p358 + p359 + p361 + p362 = 1
inv : p0 + p290 + p307 + p328 + p329 + p330 + p331 + p367 + p368 + p369 + p370 + p371 + p372 + p373 = 1
inv : p0 + p1 + p33 + p34 + p211 + p212 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 = 1
inv : p0 + p1 + p33 + p34 + p35 + p36 + p37 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p127 + p128 + p129 + p130 + p131 = 1
inv : p0 + p290 + p291 + p301 + p302 + p303 + p304 + p305 + p306 = 1
inv : p0 + p1 + p33 + p34 + p35 + p36 + p37 + p38 + p70 + p71 + p73 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 = 1
inv : p0 + p1 + p2 + p13 + p14 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 = 1
inv : p0 + p1 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p65 + p66 + p67 + p68 + p69 = 1
inv : p0 + p1 + p33 + p34 + p35 + p163 + p164 + 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 + p200 + p204 + p205 + p206 + p207 + p208 + p209 + p210 = 1
Total of 13 invariants.
[2020-05-26 09:02:54] [INFO ] Computed 13 place invariants in 4 ms
[2020-05-26 09:02:54] [INFO ] Removed a total of 66 redundant transitions.
[2020-05-26 09:02:54] [INFO ] Flatten gal took : 162 ms
[2020-05-26 09:02:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 16 ms.
[2020-05-26 09:02:54] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-26 09:02:54] [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 10 LTL properties
Checking formula 0 : !((X(X((G(X(X(X("(i13.i0.u81.p212==1)")))))U(X(!(X("((i13.i0.u81.p254==1)&&(i12.u94.p291==1))"))))))))
Formula 0 simplified : !XX(GXXX"(i13.i0.u81.p212==1)" U X!X"((i13.i0.u81.p254==1)&&(i12.u94.p291==1))")
built 28 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 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 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
[2020-05-26 09:02:55] [INFO ] Proved 272 variables to be positive in 781 ms
[2020-05-26 09:02:55] [INFO ] Computing symmetric may disable matrix : 319 transitions.
[2020-05-26 09:02:55] [INFO ] Computation of disable matrix completed :0/319 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:55] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:55] [INFO ] Computing symmetric may enable matrix : 319 transitions.
[2020-05-26 09:02:55] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:56] [INFO ] Computing symmetric co enabling matrix : 319 transitions.
Reverse transition relation is NOT exact ! Due to transitions t44, t81, u2.t331, u2.t332, u2.t333, u2.t334, u2.t335, u2.t336, u2.t337, u2.t338, u2.t339, u2.t340, u2.t349, u2.t350, i0.t137, i0.i0.t177, i0.i0.t181, i0.i0.t183, i0.i0.u61.t138, i0.i0.u61.t139, i1.t299, i1.i0.t324, i1.i0.t326, i1.i0.u13.t300, i3.t264, i3.i0.t268, i3.i0.u16.t265, i4.t228, i4.i0.t253, i4.i0.t255, i4.i0.u25.t229, i5.t192, i5.i1.t217, i5.i1.t219, i5.i1.u37.t193, i11.i0.t69, i11.i0.t71, i11.i0.u91.t45, i12.t12, i12.u94.t24, i12.u94.t25, i12.u94.t26, i12.u94.t27, i12.u94.t28, i12.u94.t29, i13.i0.t86, i13.i0.t121, i13.i0.t125, i13.i0.t127, i13.i0.u81.t82, i13.i0.u81.t83, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/257/51/308
Computing Next relation with stutter on 75 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
297 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,3.00604,100948,1,0,164096,2744,3069,258567,552,21256,500713
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SmartHome-PT-12-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(!((G(F("(u2.p26==1)")))U("(i0.i0.u61.p206==1)"))))||(G(("(i12.u92.p288==1)")U("(i4.i0.u27.p109==1)")))))
Formula 1 simplified : !(X!(GF"(u2.p26==1)" U "(i0.i0.u61.p206==1)") | G("(i12.u92.p288==1)" U "(i4.i0.u27.p109==1)"))
Computing Next relation with stutter on 75 deadlock states
[2020-05-26 09:02:58] [INFO ] Computation of co-enabling matrix(86/319) took 2150 ms. Total solver calls (SAT/UNSAT): 3593(33/3560)
[2020-05-26 09:03:01] [INFO ] Computation of co-enabling matrix(224/319) took 5158 ms. Total solver calls (SAT/UNSAT): 7125(113/7012)
[2020-05-26 09:03:04] [INFO ] Computation of Finished co-enabling matrix. took 7631 ms. Total solver calls (SAT/UNSAT): 8335(289/8046)
[2020-05-26 09:03:04] [INFO ] Computing Do-Not-Accords matrix : 319 transitions.
[2020-05-26 09:03:04] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:03:04] [INFO ] Built C files in 9714ms 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]
Compilation finished in 2895 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 103 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X(!( ([](<>((LTLAP2==true))))U((LTLAP3==true))) )) || ( [](((LTLAP4==true))U((LTLAP5==true)))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X(!( ([](<>((LTLAP2==true))))U((LTLAP3==true))) )) || ( [](((LTLAP4==true))U((LTLAP5==true)))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X(!( ([](<>((LTLAP2==true))))U((LTLAP3==true))) )) || ( [](((LTLAP4==true))U((LTLAP5==true)))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
37 unique states visited
37 strongly connected components in search stack
38 transitions explored
37 items max in DFS search stack
19119 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,194.198,2702956,1,0,3.92975e+06,3897,1090,7.68775e+06,291,43047,1855268
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-12-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X((!(G("(i4.i2.u34.p130==1)")))||(!(G(F("(i8.i0.u51.p192==1)"))))))))
Formula 2 simplified : !FX(!G"(i4.i2.u34.p130==1)" | !GF"(i8.i0.u51.p192==1)")
Computing Next relation with stutter on 75 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
13 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,194.331,2702956,1,0,3.92975e+06,3897,1417,7.68775e+06,326,43047,1884363
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SmartHome-PT-12-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((F(G("(i9.i0.u72.p235==1)")))&&(G("(i2.i0.u4.p37==1)")))))
Formula 3 simplified : !X(FG"(i9.i0.u72.p235==1)" & G"(i2.i0.u4.p37==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
39 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,194.713,2702956,1,0,3.92975e+06,3897,2026,7.68775e+06,366,43047,1977533
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-12-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((X(G(X(F(!(X(X(X("((u2.p2==1)&&(i5.i1.u37.p159==1))")))))))))&&("((u2.p2!=1)||(i5.i1.u37.p159!=1))"))))
Formula 4 simplified : !G("((u2.p2!=1)||(i5.i1.u37.p159!=1))" & XGXF!XXX"((u2.p2==1)&&(i5.i1.u37.p159==1))")
Computing Next relation with stutter on 75 deadlock states
37 unique states visited
37 strongly connected components in search stack
38 transitions explored
37 items max in DFS search stack
123 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,195.95,2703212,1,0,3.92975e+06,3897,2060,7.68775e+06,367,43047,2218645
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-12-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((("(i5.i0.u46.p161!=1)")U(F("(i3.i0.u16.p96==1)"))))
Formula 5 simplified : !("(i5.i0.u46.p161!=1)" U F"(i3.i0.u16.p96==1)")
Computing Next relation with stutter on 75 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
68 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,196.63,2703212,1,0,3.92975e+06,3897,2099,7.68775e+06,369,43047,2367551
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-12-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(G(F(!(X(F("(i3.i1.u21.p90==1)")))))))))
Formula 6 simplified : !XFGF!XF"(i3.i1.u21.p90==1)"
Computing Next relation with stutter on 75 deadlock states
36 unique states visited
36 strongly connected components in search stack
37 transitions explored
36 items max in DFS search stack
126 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,197.886,2703212,1,0,3.92975e+06,3897,2121,7.68775e+06,369,43047,2580241
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-12-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(G("(i5.i1.u37.p159==1)")))))
Formula 7 simplified : !G!G"(i5.i1.u37.p159==1)"
Computing Next relation with stutter on 75 deadlock states
36 unique states visited
36 strongly connected components in search stack
37 transitions explored
36 items max in DFS search stack
167 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,199.558,2703212,1,0,3.92975e+06,3897,2146,7.68775e+06,369,43047,2724064
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-12-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(!(X("(i11.i0.u84.p266==1)"))))U((X("(i2.i0.u4.p38==1)"))&&("(i2.i0.u4.p38==1)"))))
Formula 8 simplified : !(G!X"(i11.i0.u84.p266==1)" U ("(i2.i0.u4.p38==1)" & X"(i2.i0.u4.p38==1)"))
Computing Next relation with stutter on 75 deadlock states
24 unique states visited
24 strongly connected components in search stack
24 transitions explored
24 items max in DFS search stack
52 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,200.083,2703212,1,0,3.92975e+06,3897,2205,7.68775e+06,369,43047,2822014
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-12-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((F("(i1.i1.u12.p59==1)"))U("(i1.i0.u8.p51==1)"))&&((F("(i1.i0.u6.p43==1)"))U((X(X("(i8.i0.u60.p199==1)")))&&("(i1.i1.u12.p59==1)")))))
Formula 9 simplified : !((F"(i1.i1.u12.p59==1)" U "(i1.i0.u8.p51==1)") & (F"(i1.i0.u6.p43==1)" U ("(i1.i1.u12.p59==1)" & XX"(i8.i0.u60.p199==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
626 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,206.346,2703212,1,0,3.92975e+06,3897,2273,7.68775e+06,369,43047,3437801
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-12-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590483987353

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

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