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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K May 14 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 21:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 21:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 10:20 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 35K 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-04-00
FORMULA_NAME SmartHome-PT-04-01
FORMULA_NAME SmartHome-PT-04-02
FORMULA_NAME SmartHome-PT-04-03
FORMULA_NAME SmartHome-PT-04-04
FORMULA_NAME SmartHome-PT-04-05
FORMULA_NAME SmartHome-PT-04-06
FORMULA_NAME SmartHome-PT-04-07
FORMULA_NAME SmartHome-PT-04-08
FORMULA_NAME SmartHome-PT-04-09
FORMULA_NAME SmartHome-PT-04-10
FORMULA_NAME SmartHome-PT-04-11
FORMULA_NAME SmartHome-PT-04-12
FORMULA_NAME SmartHome-PT-04-13
FORMULA_NAME SmartHome-PT-04-14
FORMULA_NAME SmartHome-PT-04-15

=== Now, execution of the tool begins

BK_START 1590483657389

[2020-05-26 09:00:59] [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:00:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:00:59] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2020-05-26 09:00:59] [INFO ] Transformed 139 places.
[2020-05-26 09:00:59] [INFO ] Transformed 159 transitions.
[2020-05-26 09:00:59] [INFO ] Found NUPN structural information;
[2020-05-26 09:00:59] [INFO ] Parsed PT model containing 139 places and 159 transitions in 81 ms.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 19 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 28055 steps, including 314 resets, run visited all 35 properties in 52 ms. (steps per millisecond=539 )
[2020-05-26 09:00:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-26 09:00:59] [INFO ] Flatten gal took : 42 ms
FORMULA SmartHome-PT-04-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:00:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:00:59] [INFO ] Flatten gal took : 11 ms
[2020-05-26 09:00:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-04-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:00:59] [INFO ] Applying decomposition
[2020-05-26 09:00:59] [INFO ] Flatten gal took : 8 ms
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/graph9067809028111313196.txt, -o, /tmp/graph9067809028111313196.bin, -w, /tmp/graph9067809028111313196.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/graph9067809028111313196.bin, -l, -1, -v, -w, /tmp/graph9067809028111313196.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:01:00] [INFO ] Decomposing Gal with order
[2020-05-26 09:01:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:01:00] [INFO ] Input system was already deterministic with 140 transitions.
[2020-05-26 09:01:00] [INFO ] Removed a total of 23 redundant transitions.
[2020-05-26 09:01:00] [INFO ] Flatten gal took : 29 ms
[2020-05-26 09:01:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2020-05-26 09:01:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-26 09:01:00] [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 13 LTL properties
Checking formula 0 : !((!(X(X((!((F("(i0.u0.p1==1)"))U("((i3.u19.p55==1)||(i0.u0.p1==1))")))||(!(G("(i2.u7.p26==1)"))))))))
Formula 0 simplified : XX(!(F"(i0.u0.p1==1)" U "((i3.u19.p55==1)||(i0.u0.p1==1))") | !G"(i2.u7.p26==1)")
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 140 rows 122 cols
[2020-05-26 09:01:00] [INFO ] Computed 7 place invariants in 26 ms
inv : p0 + p119 + p120 + p121 + p122 + p123 = 1
inv : p0 + p119 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p137 + p138 = 1
inv : p0 + p1 + p7 + p8 + p40 + p41 + p42 + p43 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 = 1
inv : p0 + p1 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p35 + p36 + p37 + p38 + p39 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 = 1
inv : p0 + p119 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 = 1
inv : p0 + p1 + p7 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p114 + p115 + p116 + p117 + p118 = 1
Total of 7 invariants.
[2020-05-26 09:01:00] [INFO ] Computed 7 place invariants in 27 ms
Reverse transition relation is NOT exact ! Due to transitions t4, t16, t53, t107, u36.t8, u36.t9, u36.t10, i0.u2.t139, i0.u2.t140, i0.u2.t141, i0.u2.t142, i0.u37.t7, i1.t134, i1.i1.u10.t108, i1.i1.u10.t136, i6.t41, i6.i0.u26.t17, i6.i0.u26.t45, i10.i0.t58, i10.i0.u13.t54, i10.i0.u13.t55, i10.i0.u13.t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/113/22/135
Computing Next relation with stutter on 8 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
22 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.246606,26676,1,0,18067,1258,1904,34045,380,4869,58281
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-04-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(X(G("((i7.u31.p102==1)||(i1.i0.u3.p14==1))"))))||((!(G(X(F("(i7.u32.p106==1)")))))&&(!(F("(i7.u32.p106==1)"))))))
Formula 1 simplified : !(!XG"((i7.u31.p102==1)||(i1.i0.u3.p14==1))" | (!GXF"(i7.u32.p106==1)" & !F"(i7.u32.p106==1)"))
Computing Next relation with stutter on 8 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.248556,27284,1,0,18067,1258,1932,34045,380,4869,58319
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SmartHome-PT-04-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X((!(G(X((F(X(X("(i1.i0.u3.p14==1)"))))&&("(i1.i0.u3.p14==1)")))))||("((i10.i0.u13.p83==1)&&(u36.p120==1))")))))
Formula 2 simplified : !GX("((i10.i0.u13.p83==1)&&(u36.p120==1))" | !GX("(i1.i0.u3.p14==1)" & FXX"(i1.i0.u3.p14==1)"))
Computing Next relation with stutter on 8 deadlock states
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 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,0.2826,28992,1,0,21639,1293,1979,41565,382,5350,67257
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-04-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G((!(G(F(!(G((F("(i7.u31.p101==1)"))U("(i6.i0.u26.p114==1)")))))))||("(i7.u31.p101!=1)")))))
Formula 3 simplified : G("(i7.u31.p101!=1)" | !GF!G(F"(i7.u31.p101==1)" U "(i6.i0.u26.p114==1)"))
Computing Next relation with stutter on 8 deadlock states
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 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.287304,29672,1,0,21830,1293,2014,41885,386,5350,68056
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-04-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(((!(("(i2.u6.p22==1)")U("(i8.i0.u1.p7==1)")))||(G(F(G("(i8.i0.u1.p7==1)")))))||(G("(i6.i0.u26.p115==1)")))))
Formula 4 simplified : !X(!("(i2.u6.p22==1)" U "(i8.i0.u1.p7==1)") | GFG"(i8.i0.u1.p7==1)" | G"(i6.i0.u26.p115==1)")
Computing Next relation with stutter on 8 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.289407,29872,1,0,21830,1293,2061,41885,387,5350,68119
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SmartHome-PT-04-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(((G("((i6.i0.u26.p115==1)||(i10.i0.u13.p41==1))"))||(F(("(i5.u25.p87!=1)")U("(i5.u25.p87==1)"))))U(G("(i2.u7.p25!=1)")))))
Formula 5 simplified : !F((G"((i6.i0.u26.p115==1)||(i10.i0.u13.p41==1))" | F("(i5.u25.p87!=1)" U "(i5.u25.p87==1)")) U G"(i2.u7.p25!=1)")
Computing Next relation with stutter on 8 deadlock states
[2020-05-26 09:01:00] [INFO ] Proved 122 variables to be positive in 261 ms
[2020-05-26 09:01:00] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2020-05-26 09:01:00] [INFO ] Computation of disable matrix completed :0/140 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:00] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2020-05-26 09:01:00] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
58 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.867362,55336,1,0,73907,1354,2103,145036,387,6755,167300
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-04-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(("(i10.i0.u13.p83!=1)")U((((X("(i10.i0.u13.p83==1)"))&&("(i10.i0.u13.p83==1)"))&&("(i7.u31.p101==1)"))U(!(("(i7.u31.p101==1)")U("(i10.i0.u13.p83==1)")))))))
Formula 6 simplified : !G("(i10.i0.u13.p83!=1)" U (("(i7.u31.p101==1)" & "(i10.i0.u13.p83==1)" & X"(i10.i0.u13.p83==1)") U !("(i7.u31.p101==1)" U "(i10.i0.u13.p83==1)")))
Computing Next relation with stutter on 8 deadlock states
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 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,0.973208,59736,1,0,81790,1357,2150,163273,389,6988,184699
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-04-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(!(X(X(!(G(((X("(i5.u24.p85==1)"))||("((i10.i0.u13.p83==1)&&(i10.i0.u13.p128==1))"))&&("(i8.i0.u1.p8==1)"))))))))))
Formula 7 simplified : !XG!XX!G("(i8.i0.u1.p8==1)" & ("((i10.i0.u13.p83==1)&&(i10.i0.u13.p128==1))" | X"(i5.u24.p85==1)"))
Computing Next relation with stutter on 8 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
2 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.983088,60000,1,0,82327,1357,2226,163913,394,6989,186514
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-04-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F(X(F(X(F(X("(i10.i1.u40.p136==1)")))))))))
Formula 8 simplified : !XFXFXFX"(i10.i1.u40.p136==1)"
Computing Next relation with stutter on 8 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,0.996689,60528,1,0,83408,1357,2245,165363,394,6992,188957
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-04-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(F((!(X("((i10.i0.u13.p83==1)&&(u36.p120==1))")))U(("((i0.u2.p2==1)&&(i1.i1.u10.p36==1))")U("((i10.i0.u13.p83==1)&&(u36.p120==1))"))))))
Formula 9 simplified : !F(!X"((i10.i0.u13.p83==1)&&(u36.p120==1))" U ("((i0.u2.p2==1)&&(i1.i1.u10.p36==1))" U "((i10.i0.u13.p83==1)&&(u36.p120==1))"))
Computing Next relation with stutter on 8 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 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.06289,63168,1,0,88871,1358,2268,174415,394,7034,200504
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-04-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((!(F(!(G(!(F("(i6.i0.u26.p114==1)")))))))||(X("(i6.i0.u26.p90==1)")))))
Formula 10 simplified : !X(!F!G!F"(i6.i0.u26.p114==1)" | X"(i6.i0.u26.p90==1)")
Computing Next relation with stutter on 8 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
2 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.08352,63960,1,0,90547,1359,2303,176452,398,7047,204490
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SmartHome-PT-04-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G(("(i6.i1.u27.p95==1)")U(G("(i6.i1.u27.p95==1)"))))))
Formula 11 simplified : !FG("(i6.i1.u27.p95==1)" U G"(i6.i1.u27.p95==1)")
Computing Next relation with stutter on 8 deadlock states
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
2 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.09617,64488,1,0,91312,1376,2320,177657,400,7183,206739
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SmartHome-PT-04-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(((X("(i6.i1.u28.p96==1)"))U("(i1.i1.u9.p31==1)"))U(X("(i10.i0.u38.p127==1)")))))
Formula 12 simplified : !X((X"(i6.i1.u28.p96==1)" U "(i1.i1.u9.p31==1)") U X"(i10.i0.u38.p127==1)")
Computing Next relation with stutter on 8 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.11401,65276,1,0,92302,1376,2352,180221,400,7189,209340
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SmartHome-PT-04-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:01:01] [INFO ] Built C files in 1477ms 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 1590483661740

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

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