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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.3K May 14 03:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 03:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 21:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 21:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.2K May 13 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 10:15 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 25K 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-01-00
FORMULA_NAME SmartHome-PT-01-01
FORMULA_NAME SmartHome-PT-01-02
FORMULA_NAME SmartHome-PT-01-03
FORMULA_NAME SmartHome-PT-01-04
FORMULA_NAME SmartHome-PT-01-05
FORMULA_NAME SmartHome-PT-01-06
FORMULA_NAME SmartHome-PT-01-07
FORMULA_NAME SmartHome-PT-01-08
FORMULA_NAME SmartHome-PT-01-09
FORMULA_NAME SmartHome-PT-01-10
FORMULA_NAME SmartHome-PT-01-11
FORMULA_NAME SmartHome-PT-01-12
FORMULA_NAME SmartHome-PT-01-13
FORMULA_NAME SmartHome-PT-01-14
FORMULA_NAME SmartHome-PT-01-15

=== Now, execution of the tool begins

BK_START 1590483639334

[2020-05-26 09:00:41] [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:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:00:41] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-05-26 09:00:41] [INFO ] Transformed 38 places.
[2020-05-26 09:00:41] [INFO ] Transformed 113 transitions.
[2020-05-26 09:00:41] [INFO ] Found NUPN structural information;
[2020-05-26 09:00:41] [INFO ] Parsed PT model containing 38 places and 113 transitions in 81 ms.
Ensure Unique test removed 58 transitions
Reduce redundant transitions removed 58 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 150 steps, including 0 resets, run visited all 32 properties in 4 ms. (steps per millisecond=37 )
[2020-05-26 09:00:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:00:41] [INFO ] Flatten gal took : 49 ms
FORMULA SmartHome-PT-01-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:00:41] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
[2020-05-26 09:00:41] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-26 09:00:41] [INFO ] Flatten gal took : 16 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/graph18081180534299228492.txt, -o, /tmp/graph18081180534299228492.bin, -w, /tmp/graph18081180534299228492.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/graph18081180534299228492.bin, -l, -1, -v, -w, /tmp/graph18081180534299228492.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:00:42] [INFO ] Input system was already deterministic with 55 transitions.
[2020-05-26 09:00:42] [INFO ] Decomposing Gal with order
[2020-05-26 09:00:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:00:42] [INFO ] Removed a total of 22 redundant transitions.
[2020-05-26 09:00:42] [INFO ] Flatten gal took : 34 ms
[2020-05-26 09:00:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2020-05-26 09:00:42] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2020-05-26 09:00:42] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
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]
Normalized transition count is 34 out of 55 initially.
// Phase 1: matrix 34 rows 38 cols
[2020-05-26 09:00:42] [INFO ] Computed 15 place invariants in 3 ms
inv : p0 + p3 + p4 = 1
inv : p0 + p19 + p20 + p21 = 1
inv : p0 + p5 = 1
inv : p0 + p1 = 1
inv : p34 + p35 - p36 - p37 = 0
inv : p0 + p11 = 1
inv : p0 + p16 + p17 + p18 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p24 = 1
inv : p0 + p2 = 1
inv : p0 + p8 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p6 + p7 = 1
Total of 15 invariants.
[2020-05-26 09:00:42] [INFO ] Computed 15 place invariants in 5 ms

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 15 LTL properties
Checking formula 0 : !((X(X((F("((i7.u8.p21==1)&&(i3.u10.p27==1))"))||(G("(u0.p5!=1)"))))))
Formula 0 simplified : !XX(F"((i7.u8.p21==1)&&(i3.u10.p27==1))" | G"(u0.p5!=1)")
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t77, t81, i5.u4.t75, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/51/3/54
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,0.037391,17180,1,0,1246,115,653,1396,155,220,3456
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-01-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(G((X("(i1.u2.p7==1)"))U("(i5.u5.p13!=1)"))))||(G("(i1.u2.p7==1)"))))
Formula 1 simplified : !(!G(X"(i1.u2.p7==1)" U "(i5.u5.p13!=1)") | G"(i1.u2.p7==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.0466,17804,1,0,2608,118,752,2890,155,233,6686
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-01-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(X(X(G(("((i5.u4.p11==1)&&(i4.u11.p29==1))")U("(i4.u3.p10==1)"))))))))
Formula 2 simplified : !FXXXG("((i5.u4.p11==1)&&(i4.u11.p29==1))" U "(i4.u3.p10==1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.050268,18664,1,0,2857,127,811,3159,156,260,7576
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-01-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((X((G(F("(u0.p0!=1)")))&&("(i3.u9.p23==1)")))||(G("((i1.u2.p1==1)&&(i1.u1.p4==1))")))||(F("((i1.u2.p1==1)&&(i1.u1.p4==1))"))))
Formula 3 simplified : !(X("(i3.u9.p23==1)" & GF"(u0.p0!=1)") | G"((i1.u2.p1==1)&&(i1.u1.p4==1))" | F"((i1.u2.p1==1)&&(i1.u1.p4==1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.051932,18988,1,0,2857,127,836,3159,157,260,7622
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA SmartHome-PT-01-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((!(G(F("(i6.u6.p15==1)"))))||(F(X(F("(((u0.p2==1)&&(i1.u2.p1==1))&&(i1.u1.p4==1))")))))))
Formula 4 simplified : !F(!GF"(i6.u6.p15==1)" | FXF"(((u0.p2==1)&&(i1.u2.p1==1))&&(i1.u1.p4==1))")
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.052727,19160,1,0,2857,127,874,3159,158,260,7651
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SmartHome-PT-01-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(((G("((u7.p18==1)&&(u0.p24==1))"))U("(i4.u3.p10==1)"))&&(X((X(X(!(X("(u7.p16==1)")))))&&(F("(i5.u5.p13==1)")))))))
Formula 5 simplified : !X((G"((u7.p18==1)&&(u0.p24==1))" U "(i4.u3.p10==1)") & X(XX!X"(u7.p16==1)" & F"(i5.u5.p13==1)"))
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.057053,19824,1,0,3065,127,899,3431,159,262,8331
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-01-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(F("((i5.u5.p13==1)||(i7.u8.p21==1))")))))
Formula 6 simplified : !GXF"((i5.u5.p13==1)||(i7.u8.p21==1))"
4 unique states visited
4 strongly connected components in search stack
5 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,0.058083,20016,1,0,3089,127,917,3472,159,264,8545
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-01-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X((G("(i3.u9.p23==1)"))||("(i3.u9.p23==1)")))))
Formula 7 simplified : !XX("(i3.u9.p23==1)" | G"(i3.u9.p23==1)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.058606,20016,1,0,3122,127,918,3485,159,264,8693
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-01-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F((((F("(i5.u5.p13==1)"))U(X(F("(i6.u6.p15!=1)"))))U("(i7.u8.p19==1)"))U("(i1.u2.p7==1)")))))
Formula 8 simplified : F(((F"(i5.u5.p13==1)" U XF"(i6.u6.p15!=1)") U "(i7.u8.p19==1)") U "(i1.u2.p7==1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.063843,20320,1,0,3123,127,939,3488,159,264,8756
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-01-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((((F("((i1.u2.p1!=1)||(i6.u6.p15!=1))"))U("((i3.u9.p23==1)&&(i3.u10.p25==1))"))&&(X("((i6.u6.p15==1)&&(i6.u13.p34==1))")))&&("(u7.p17==1)"))))
Formula 9 simplified : !F("(u7.p17==1)" & (F"((i1.u2.p1!=1)||(i6.u6.p15!=1))" U "((i3.u9.p23==1)&&(i3.u10.p25==1))") & X"((i6.u6.p15==1)&&(i6.u13.p34==1))")
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,0.066547,20320,1,0,3266,130,1004,3648,160,284,9247
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-01-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(!(F((("(u0.p2==1)")U("(i7.u8.p20==1)"))||(F(!(X("((i6.u6.p15==1)&&(u0.p24==1))")))))))))
Formula 10 simplified : !G!F(("(u0.p2==1)" U "(i7.u8.p20==1)") | F!X"((i6.u6.p15==1)&&(u0.p24==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.071973,20320,1,0,3562,130,1053,3984,160,284,10133
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SmartHome-PT-01-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F((G("((i7.u8.p21==1)&&(i7.u14.p36==1))"))||("(i4.u3.p10==1)")))||(X("((((i7.u8.p21==1)&&(i7.u14.p36==1))||(i4.u3.p10==1))||(u0.p2==1))"))))
Formula 11 simplified : !(F("(i4.u3.p10==1)" | G"((i7.u8.p21==1)&&(i7.u14.p36==1))") | X"((((i7.u8.p21==1)&&(i7.u14.p36==1))||(i4.u3.p10==1))||(u0.p2==1))")
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.072803,20320,1,0,3562,130,1064,3984,160,284,10153
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA SmartHome-PT-01-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(F(G((F((X("(u0.p2==1)"))&&("(u0.p2==1)")))&&(X(X(G("((i1.u2.p1==1)&&(i1.u1.p4==1))")))))))))
Formula 12 simplified : FG(F("(u0.p2==1)" & X"(u0.p2==1)") & XXG"((i1.u2.p1==1)&&(i1.u1.p4==1))")
4 unique states visited
4 strongly connected components in search stack
5 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,0.075056,20320,1,0,3670,130,1105,4084,160,284,10542
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SmartHome-PT-01-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X((G("((i1.u2.p1==1)&&(i3.u9.p23==1))"))&&("(i1.u1.p4==1)")))||(F((X("(i5.u5.p13==1)"))||("(u0.p5==1)")))))
Formula 13 simplified : !(X("(i1.u1.p4==1)" & G"((i1.u2.p1==1)&&(i3.u9.p23==1))") | F("(u0.p5==1)" | X"(i5.u5.p13==1)"))
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.075828,20320,1,0,3670,130,1138,4084,160,284,10565
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA SmartHome-PT-01-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(!(G((!(X(("(i1.u1.p4==1)")U("((((i5.u5.p13==1)&&(u0.p24==1))&&(i5.u4.p11==1))&&(i5.u4.p31==1))"))))||("(i7.u8.p21!=1)"))))))
Formula 14 simplified : !F!G("(i7.u8.p21!=1)" | !X("(i1.u1.p4==1)" U "((((i5.u5.p13==1)&&(u0.p24==1))&&(i5.u4.p11==1))&&(i5.u4.p31==1))"))
[2020-05-26 09:00:42] [INFO ] Proved 38 variables to be positive in 165 ms
[2020-05-26 09:00:42] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2020-05-26 09:00:42] [INFO ] Computation of disable matrix completed :0/55 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:00:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:00:42] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2020-05-26 09:00:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.091736,21076,1,0,5771,130,1202,6104,162,290,14970
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SmartHome-PT-01-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-26 09:00:42] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-26 09:00:42] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-26 09:00:42] [WARNING] Script execution failed on command (assert (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store s0 23 (+ (select s0 23) 1)) 10 (+ (select s0 10) 1)) 8 (+ (select s0 8) 1)) 18 (+ (select s0 18) 1)) 21 (+ (select s0 21) 1)) 1 (+ (select s0 1) 1)) 4 (+ (select s0 4) 1)) 2 (+ (select s0 2) 1)) 25 (+ (select s0 25) 1)) 13 (+ (select s0 13) 1)) 5 (+ (select s0 5) 1)) 15 (+ (select s0 15) 1)) 24 (+ (select s0 24) 1)) 11 (+ (select s0 11) 1)) 7 (+ (select s0 7) 1)) 0 (- (select s0 0) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store s0 23 (+ (select s0 23) 1)) 10 (+ (select s0 10) 1)) 8 (+ (select s0 8) 1)) 18 (+ (select s0 18) 1)) 21 (+ (select s0 21) 1)) 1 (+ (select s0 1) 1)) 4 (+ (select s0 4) 1)) 2 (+ (select s0 2) 1)) 25 (+ (select s0 25) 1)) 13 (+ (select s0 13) 1)) 5 (+ (select s0 5) 1)) 15 (+ (select s0 15) 1)) 24 (+ (select s0 24) 1)) 11 (+ (select s0 11) 1)) 7 (+ (select s0 7) 1)) 0 (- (select s0 0) 1)) s1))")
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.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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:00:42] [INFO ] Built C files in 305ms 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 1590483642506

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

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