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

--------------------
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 1590483636578

[2020-05-26 09:00:38] [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:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:00:39] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2020-05-26 09:00:39] [INFO ] Transformed 38 places.
[2020-05-26 09:00:39] [INFO ] Transformed 113 transitions.
[2020-05-26 09:00:39] [INFO ] Found NUPN structural information;
[2020-05-26 09:00:39] [INFO ] Parsed PT model containing 38 places and 113 transitions in 95 ms.
Ensure Unique test removed 58 transitions
Reduce redundant transitions removed 58 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 268 ms. (steps per millisecond=373 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-05-26 09:00:39] [INFO ] Flow matrix only has 34 transitions (discarded 21 similar events)
// Phase 1: matrix 34 rows 38 cols
[2020-05-26 09:00:39] [INFO ] Computed 15 place invariants in 3 ms
[2020-05-26 09:00:39] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-26 09:00:39] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-26 09:00:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 59 ms returned sat
[2020-05-26 09:00:39] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:39] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-05-26 09:00:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2020-05-26 09:00:39] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2020-05-26 09:00:39] [INFO ] Computed and/alt/rep : 54/133/33 causal constraints in 7 ms.
[2020-05-26 09:00:40] [INFO ] Added : 32 causal constraints over 7 iterations in 139 ms. Result :sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Nat]Added 21 Read/Feed constraints in 10 ms returned sat
[2020-05-26 09:00:40] [INFO ] Computed and/alt/rep : 54/133/33 causal constraints in 4 ms.
[2020-05-26 09:00:40] [INFO ] Added : 32 causal constraints over 7 iterations in 35 ms. Result :sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-26 09:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned unsat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:41] [INFO ] [Real]Absence check using state equation in 103 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 14 positive place invariants in 57 ms returned sat
[2020-05-26 09:00:41] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-26 09:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:00:41] [INFO ] [Nat]Absence check using state equation in 38 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
[2020-05-26 09:00:41] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-26 09:00:41] [INFO ] Flatten gal took : 23 ms
FORMULA SmartHome-PT-01-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:00:41] [INFO ] Flatten gal took : 5 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 : 4 ms
[2020-05-26 09:00:41] [INFO ] Input system was already deterministic with 55 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 34 out of 55 initially.
// Phase 1: matrix 34 rows 38 cols
[2020-05-26 09:00:41] [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:41] [INFO ] Computed 15 place invariants in 3 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/graph2444298161658999527.txt, -o, /tmp/graph2444298161658999527.bin, -w, /tmp/graph2444298161658999527.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/graph2444298161658999527.bin, -l, -1, -v, -w, /tmp/graph2444298161658999527.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:00:41] [INFO ] Decomposing Gal with order
[2020-05-26 09:00:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:00:41] [INFO ] Removed a total of 22 redundant transitions.
[2020-05-26 09:00:41] [INFO ] Proved 38 variables to be positive in 110 ms
[2020-05-26 09:00:41] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2020-05-26 09:00:41] [INFO ] Computation of disable matrix completed :0/55 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:00:41] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:00:41] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2020-05-26 09:00:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:00:41] [INFO ] Flatten gal took : 107 ms
[2020-05-26 09:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2020-05-26 09:00:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 32 ms
[2020-05-26 09:00:41] [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 10 LTL properties
Checking formula 0 : !((G((((F("((i5.u4.p31==0)||(i0.u2.p6==1))"))&&("(i5.u4.p31!=0)"))&&("(i0.u2.p6!=1)"))U((X("((i5.u4.p31==0)||(i0.u2.p6==1))"))&&("((((i5.u4.p11==0)||(i4.u10.p27==1))||(i7.u8.p19==0))||(i1.u3.p10==1))")))))
Formula 0 simplified : !G(("(i0.u2.p6!=1)" & "(i5.u4.p31!=0)" & F"((i5.u4.p31==0)||(i0.u2.p6==1))") U ("((((i5.u4.p11==0)||(i4.u10.p27==1))||(i7.u8.p19==0))||(i1.u3.p10==1))" & X"((i5.u4.p31==0)||(i0.u2.p6==1))"))
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 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
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 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.085826,19664,1,0,3388,111,718,3885,160,230,7491
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 : !((X(G(X("(((i4.u10.p26!=1)&&(i6.u13.p33!=0))&&(i7.u14.p37!=1))")))))
Formula 1 simplified : !XGX"(((i4.u10.p26!=1)&&(i6.u13.p33!=0))&&(i7.u14.p37!=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.089605,19664,1,0,3434,111,754,3973,163,230,7924
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 : !((G(F((F("((i1.u11.p29==0)||(i4.u10.p27==1))"))U("((i1.u11.p29==0)||(i4.u10.p27==1))")))))
Formula 2 simplified : !GF(F"((i1.u11.p29==0)||(i4.u10.p27==1))" U "((i1.u11.p29==0)||(i4.u10.p27==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.090932,19664,1,0,3502,112,788,4039,163,237,8314
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(!(F(!(G(F(X("((i5.u5.p13==0)||(i5.u12.p32==1))")))))))))
Formula 3 simplified : !X!F!GFX"((i5.u5.p13==0)||(i5.u12.p32==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.092105,19984,1,0,3591,112,816,4144,163,237,8552
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-01-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!((!(G("((i0.u2.p7==0)||(i5.u5.p13==1))")))U(!(F(("((i0.u1.p1!=0)&&(i0.u1.p4!=1))")U("(((i5.u4.p11==0)||(u0.p0==1))&&((i0.u1.p1==0)||(i0.u1.p4==1)))")))))))
Formula 4 simplified : !G"((i0.u2.p7==0)||(i5.u5.p13==1))" U !F("((i0.u1.p1!=0)&&(i0.u1.p4!=1))" U "(((i5.u4.p11==0)||(u0.p0==1))&&((i0.u1.p1==0)||(i0.u1.p4==1)))")
5 unique states visited
5 strongly connected components in search stack
6 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.100447,20432,1,0,4899,112,897,5388,164,239,11413
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-01-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("((i1.u3.p10==0)||(i6.u13.p35==1))")))
Formula 5 simplified : !G"((i1.u3.p10==0)||(i6.u13.p35==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.1012,20432,1,0,4899,112,926,5390,164,239,11476
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-01-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(X(X("((i4.u10.p25==0)||(u7.p17==1))"))))U(F("(i0.u1.p3==1)"))))
Formula 6 simplified : !(XXX"((i4.u10.p25==0)||(u7.p17==1))" U F"(i0.u1.p3==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.120854,20432,1,0,5505,112,955,6099,165,246,12892
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-01-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(X("((i0.u2.p6==0)||(u0.p0==1))")))||(G("((i4.u9.p23==0)||(i5.u5.p13==1))"))))
Formula 7 simplified : !(!X"((i0.u2.p6==0)||(u0.p0==1))" | G"((i4.u9.p23==0)||(i5.u5.p13==1))")
5 unique states visited
5 strongly connected components in search stack
6 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.12832,20952,1,0,6056,112,987,6585,165,246,14371
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-01-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G("((i6.u13.p33==0)||(i6.u13.p34==1))"))))
Formula 8 simplified : !XG"((i6.u13.p33==0)||(i6.u13.p34==1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.129795,21216,1,0,6150,112,1012,6658,167,247,14866
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-01-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(!(G(X(X((G("(i5.u4.p31==1)"))&&("(i5.u4.p31==1)"))))))))
Formula 9 simplified : !F!GXX("(i5.u4.p31==1)" & G"(i5.u4.p31==1)")
3 unique states visited
0 strongly connected components in search stack
2 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.130136,21216,1,0,6150,112,1027,6658,167,247,14883
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SmartHome-PT-01-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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 612ms 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 1590483642525

--------------------
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-01"
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-01, 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-159033546000001"
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 [ "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 ;