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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.0K May 14 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.7K May 13 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 31K 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-03-00
FORMULA_NAME SmartHome-PT-03-01
FORMULA_NAME SmartHome-PT-03-02
FORMULA_NAME SmartHome-PT-03-03
FORMULA_NAME SmartHome-PT-03-04
FORMULA_NAME SmartHome-PT-03-05
FORMULA_NAME SmartHome-PT-03-06
FORMULA_NAME SmartHome-PT-03-07
FORMULA_NAME SmartHome-PT-03-08
FORMULA_NAME SmartHome-PT-03-09
FORMULA_NAME SmartHome-PT-03-10
FORMULA_NAME SmartHome-PT-03-11
FORMULA_NAME SmartHome-PT-03-12
FORMULA_NAME SmartHome-PT-03-13
FORMULA_NAME SmartHome-PT-03-14
FORMULA_NAME SmartHome-PT-03-15

=== Now, execution of the tool begins

BK_START 1590483638618

[2020-05-26 09:00:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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): 40 ms
[2020-05-26 09:00:41] [INFO ] Transformed 45 places.
[2020-05-26 09:00:41] [INFO ] Transformed 145 transitions.
[2020-05-26 09:00:41] [INFO ] Found NUPN structural information;
[2020-05-26 09:00:41] [INFO ] Parsed PT model containing 45 places and 145 transitions in 78 ms.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 173 ms. (steps per millisecond=578 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-26 09:00:41] [INFO ] Flow matrix only has 40 transitions (discarded 28 similar events)
// Phase 1: matrix 40 rows 45 cols
[2020-05-26 09:00:41] [INFO ] Computed 19 place invariants in 3 ms
[2020-05-26 09:00:41] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2020-05-26 09:00:41] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-05-26 09:00:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned unsat
[2020-05-26 09:00:41] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2020-05-26 09:00:41] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-26 09:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-26 09:00:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned unsat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive place invariants in 108 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 26 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-05-26 09:00:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned unsat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-26 09:00:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned unsat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive place invariants in 36 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-26 09:00:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 78 ms returned unsat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 13 ms returned sat
[2020-05-26 09:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:43] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-05-26 09:00:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:43] [INFO ] [Nat]Absence check using state equation in 26 ms returned unsat
[2020-05-26 09:00:43] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:43] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-26 09:00:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 36 ms returned unsat
[2020-05-26 09:00:43] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:43] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-26 09:00:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 64 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-05-26 09:00:43] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-26 09:00:43] [INFO ] Flatten gal took : 48 ms
FORMULA SmartHome-PT-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:00:43] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:00:43] [INFO ] Applying decomposition
[2020-05-26 09:00:43] [INFO ] Flatten gal took : 33 ms
[2020-05-26 09:00:43] [INFO ] Input system was already deterministic with 68 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/graph9881508631775727566.txt, -o, /tmp/graph9881508631775727566.bin, -w, /tmp/graph9881508631775727566.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/graph9881508631775727566.bin, -l, -1, -v, -w, /tmp/graph9881508631775727566.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 40 out of 68 initially.
// Phase 1: matrix 40 rows 45 cols
[2020-05-26 09:00:43] [INFO ] Computed 19 place invariants in 1 ms
inv : p0 + p31 = 1
inv : p0 + p26 + p27 + p28 = 1
inv : p0 + p5 = 1
inv : p0 + p1 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p15 = 1
inv : p0 + p9 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p2 + p3 + p4 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p18 = 1
inv : p0 + p23 + p24 + p25 = 1
inv : p0 + p6 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p12 = 1
inv : p0 + p16 + p17 = 1
inv : p41 + p42 - p43 - p44 = 0
Total of 19 invariants.
[2020-05-26 09:00:43] [INFO ] Computed 19 place invariants in 2 ms
[2020-05-26 09:00:43] [INFO ] Decomposing Gal with order
[2020-05-26 09:00:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:00:43] [INFO ] Removed a total of 26 redundant transitions.
[2020-05-26 09:00:43] [INFO ] Flatten gal took : 38 ms
[2020-05-26 09:00:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2020-05-26 09:00:43] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-26 09:00:43] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 7 LTL properties
Checking formula 0 : !((X((!(F(!(F(X(G("((i4.u7.p22==0)||(i2.u3.p11==1))")))))))&&("((i4.u7.p22==0)||(i2.u3.p11==1))"))))
Formula 0 simplified : !X("((i4.u7.p22==0)||(i2.u3.p11==1))" & !F!FXG"((i4.u7.p22==0)||(i2.u3.p11==1))")
built 22 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t101, t105, i8.u14.t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/64/3/67
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.04741,17752,1,0,2620,140,726,2861,194,270,7276
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(!(X(G((F("((i8.u13.p37==0)||(i2.u3.p10==1))"))&&("((i9.u9.p28==0)||(i7.u5.p16==1))")))))))
Formula 1 simplified : !G!XG("((i9.u9.p28==0)||(i7.u5.p16==1))" & F"((i8.u13.p37==0)||(i2.u3.p10==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.051111,18264,1,0,2920,140,772,3373,196,275,8215
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(!(F("((i6.u10.p29==0)||(i9.u16.p43==1))"))))&&(X(F(("((i7.u5.p17==0)||(i4.u15.p40==1))")U("((i7.u5.p17!=0)&&(i4.u15.p40!=1))"))))))
Formula 2 simplified : !(F!F"((i6.u10.p29==0)||(i9.u16.p43==1))" & XF("((i7.u5.p17==0)||(i4.u15.p40==1))" U "((i7.u5.p17!=0)&&(i4.u15.p40!=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.078835,20196,1,0,8495,140,797,7853,196,278,14856
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(("((i6.u10.p29==0)||(i7.u12.p36==1))")U(!(F("((((((i8.u13.p37!=0)&&(i8.u13.p39!=1))||(u1.p3==0))||(i6.u11.p32==1))||(i6.u10.p29==0))||(i7.u12.p36==1))")))))))
Formula 3 simplified : !GX("((i6.u10.p29==0)||(i7.u12.p36==1))" U !F"((((((i8.u13.p37!=0)&&(i8.u13.p39!=1))||(u1.p3==0))||(i6.u11.p32==1))||(i6.u10.p29==0))||(i7.u12.p36==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.082545,20820,1,0,8770,141,868,8126,201,285,15480
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((F((!(G("((u0.p15==0)||(i6.u11.p34==1))")))||(!(X("((u0.p15==0)||(i6.u11.p34==1))")))))||((X("(u8.p25==1)"))&&("((u0.p15==0)||(i6.u11.p34==1))")))))
Formula 4 simplified : !X(F(!G"((u0.p15==0)||(i6.u11.p34==1))" | !X"((u0.p15==0)||(i6.u11.p34==1))") | ("((u0.p15==0)||(i6.u11.p34==1))" & X"(u8.p25==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.0829,20820,1,0,8770,141,874,8126,202,285,15494
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SmartHome-PT-03-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X((F("((i4.u15.p42!=0)&&(i9.u9.p27!=1))"))||(X("((u0.p0==0)||(i2.u3.p10==1))"))))))
Formula 5 simplified : !GX(F"((i4.u15.p42!=0)&&(i9.u9.p27!=1))" | X"((u0.p0==0)||(i2.u3.p10==1))")
4 unique states visited
0 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.083849,20820,1,0,8811,141,891,8174,204,285,15675
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA SmartHome-PT-03-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(X(G("((i9.u16.p44==0)||(i4.u7.p21==1))"))))))
Formula 6 simplified : !GXXG"((i9.u16.p44==0)||(i4.u7.p21==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.086539,20820,1,0,9192,141,915,8569,204,286,16854
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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:44] [INFO ] Built C files in 428ms 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 1590483644404

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-03"
export BK_EXAMINATION="LTLCardinality"
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-03, examination is LTLCardinality"
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-159033546000017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-03.tgz
mv SmartHome-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;