Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r204-oct2-155274856700258.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-155274856700258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.5K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.9K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 55K Mar 10 17:31 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 QuasiCertifProtocol-PT-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1554175331871

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
invariant :Cstart_0 + n8_0_0 + -1'Cstart_2 + n8_1_1 + -1'n8_0_1 + -1'n8_1_2 = 0
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X("(SstopAbort<=((s5_0+s5_1)+s5_2))")))
Formula 0 simplified : !X"(SstopAbort<=((s5_0+s5_1)+s5_2))"
invariant :n7_1_1 + -1'n7_1_2 + n8_1_1 + -1'n8_1_2 = 0
invariant :n9_0_0 + CstopOK_0 + -1'SstopOK_0 = 0
invariant :n9_1_1 + CstopOK_1 + -1'SstopOK_1 = 0
invariant :n9_2_2 + CstopOK_2 + -1'SstopOK_2 = 0
invariant :n7_1_0 + -1'n7_1_2 + n8_0_0 + n8_1_1 + -1'n8_0_1 + -1'n8_1_2 = 0
invariant :n7_0_0 + -1'n7_0_1 + n8_0_0 + -1'n8_0_1 = 0
invariant :s6_0 + s6_1 + s6_2 + SstopAbort + s5_0 + s5_1 + s5_2 + s4_0 + s4_2 + s4_1 + s3_1 + s3_0 + s2_0 + s3_2 + s2_2 + s2_1 + Sstart_1 + Sstart_0 + Sstart_2 + SstopOK_1 + SstopOK_0 + SstopOK_2 = 3
invariant :n9_2_0 + CstopOK_0 + -1'SstopOK_2 = 0
invariant :malicious_reservoir + CstopAbort + -1's6_0 + -1's6_1 + -1's6_2 + -1's5_0 + -1's5_1 + -1's5_2 + -1's4_0 + -1's4_2 + -1's4_1 + -1's3_1 + -1's3_0 + -1's2_0 + -1's3_2 + -1's2_2 + -1's2_1 + -1'Sstart_1 + -1'Sstart_0 + -1'Sstart_2 + -1'SstopOK_1 + -1'SstopOK_0 + -1'SstopOK_2 = -2
invariant :n5_0 + n6_0 + -1'n5_2 + -1'n6_2 = 0
invariant :n9_2_1 + CstopOK_1 + -1'SstopOK_2 = 0
invariant :n8_0_2 + n8_1_1 + -1'n8_0_1 + -1'n8_1_2 = 0
invariant :n4_1 + -1'n3_0 + n3_1 + -1'n4_0 = 0
invariant :Cstart_1 + -1'Cstart_2 + n8_1_1 + -1'n8_1_2 = 0
invariant :n7_2_1 + -1'n7_2_2 + n8_1_1 + -1'n8_1_2 = 0
invariant :c1_0 + c1_1 + c1_2 + CstopAbort + CstopOK_0 + CstopOK_1 + CstopOK_2 + -1'n8_0_0 + 3'Cstart_2 + -2'n8_1_1 + n8_0_1 + 2'n8_1_2 = 3
invariant :n9_1_0 + CstopOK_0 + -1'SstopOK_1 = 0
invariant :n7_2_0 + -1'n7_2_2 + n8_0_0 + n8_1_1 + -1'n8_0_1 + -1'n8_1_2 = 0
invariant :a5 + a3 + AstopAbort + a2 + a4 + a1 + AstopOK + Astart = 1
invariant :n8_1_0 + -1'n8_0_0 + -1'n8_1_1 + n8_0_1 = 0
invariant :n2_0 + -1'n2_1 + n1_0 + -1'n1_1 = 0
invariant :n4_2 + -1'n3_0 + n3_2 + -1'n4_0 = 0
invariant :n8_2_0 + -1'n8_0_0 + -1'n8_1_1 + n8_0_1 + n8_1_2 + -1'n8_2_2 = 0
invariant :n1_2 + -1'n2_1 + n2_2 + -1'n1_1 = 0
invariant :n9_0_1 + CstopOK_1 + -1'SstopOK_0 = 0
invariant :n5_1 + -1'n5_2 + -1'n6_2 + n6_1 = 0
invariant :n9_1_2 + CstopOK_2 + -1'SstopOK_1 = 0
invariant :n9_0_2 + CstopOK_2 + -1'SstopOK_0 = 0
invariant :n7_0_2 + -1'n7_0_1 + -1'n8_1_1 + n8_1_2 = 0
invariant :n8_2_1 + -1'n8_1_1 + n8_1_2 + -1'n8_2_2 = 0
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t45, t46, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/26/56
Computing Next relation with stutter on 47 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26 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.28131,29656,1,0,152,52341,138,69,2421,32310,148
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F(X("(((SstopOK_1+SstopOK_0)+SstopOK_2)<=((s4_0+s4_2)+s4_1))")))U("(a3<=((n3_0+n3_1)+n3_2))")))
Formula 1 simplified : !(FX"(((SstopOK_1+SstopOK_0)+SstopOK_2)<=((s4_0+s4_2)+s4_1))" U "(a3<=((n3_0+n3_1)+n3_2))")
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.282399,30040,1,0,152,52341,141,69,2426,32310,150
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F((X("(((s3_1+s3_0)+s3_2)<=a2)"))U(X("(CstopAbort>=1)")))))
Formula 2 simplified : !F(X"(((s3_1+s3_0)+s3_2)<=a2)" U X"(CstopAbort>=1)")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
19 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.469979,37352,1,0,312,83230,150,212,2428,77234,453
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((true))
Formula 3 simplified : 0
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.470121,37352,1,0,312,83230,150,212,2428,77234,453
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(F(("(((n5_0+n5_1)+n5_2)>=3)")U("(((s3_1+s3_0)+s3_2)>=2)")))))
Formula 4 simplified : !GF("(((n5_0+n5_1)+n5_2)>=3)" U "(((s3_1+s3_0)+s3_2)>=2)")
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
8 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.547328,40376,1,0,360,87635,159,354,2435,98265,795
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G("(((n6_0+n6_2)+n6_1)<=((((((((n9_1_0+n9_2_0)+n9_0_0)+n9_2_1)+n9_0_2)+n9_0_1)+n9_1_1)+n9_1_2)+n9_2_2))")))
Formula 5 simplified : !G"(((n6_0+n6_2)+n6_1)<=((((((((n9_1_0+n9_2_0)+n9_0_0)+n9_2_1)+n9_0_2)+n9_0_1)+n9_1_1)+n9_1_2)+n9_2_2))"
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.561846,40892,1,0,396,88772,165,431,2481,101272,940
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((X("(CstopAbort>=3)"))U("(((n4_1+n4_2)+n4_0)<=CstopAbort)")))
Formula 6 simplified : !(X"(CstopAbort>=3)" U "(((n4_1+n4_2)+n4_0)<=CstopAbort)")
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.56251,41152,1,0,396,88772,168,431,2487,101272,942
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(G(X(G("(((s3_1+s3_0)+s3_2)<=((n2_0+n2_1)+n2_2))"))))))
Formula 7 simplified : !GXG"(((s3_1+s3_0)+s3_2)<=((n2_0+n2_1)+n2_2))"
Computing Next relation with stutter on 47 deadlock states
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.572488,41152,1,0,427,89463,174,488,2528,103182,1057
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((F("(s4_0<=n9_2_2)"))U("(a2>=3)")))
Formula 8 simplified : !(F"(s4_0<=n9_2_2)" U "(a2>=3)")
Computing Next relation with stutter on 47 deadlock states
31 unique states visited
31 strongly connected components in search stack
31 transitions explored
31 items max in DFS search stack
7 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.641256,42988,1,0,440,92159,187,539,2536,120885,1344
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((("(n7_2_0<=Cstart_0)")U("(n8_1_0<=n7_1_0)"))U(G(G("(a5>=3)")))))
Formula 9 simplified : !(("(n7_2_0<=Cstart_0)" U "(n8_1_0<=n7_1_0)") U G"(a5>=3)")
Computing Next relation with stutter on 47 deadlock states
31 unique states visited
31 strongly connected components in search stack
31 transitions explored
31 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.685878,46812,1,0,460,95773,230,558,2577,125460,1773
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(F("(Cstart_0<=s6_0)"))))
Formula 10 simplified : !GF"(Cstart_0<=s6_0)"
Computing Next relation with stutter on 47 deadlock states
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 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.712696,48124,1,0,521,100521,239,603,2581,131235,1910
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("(malicious_reservoir<=AstopAbort)")))
Formula 11 simplified : !X"(malicious_reservoir<=AstopAbort)"
Computing Next relation with stutter on 47 deadlock states
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.71382,48124,1,0,522,100534,242,604,2585,131306,1920
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((true))
Formula 12 simplified : 0
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.713913,48124,1,0,522,100534,242,604,2585,131306,1920
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X("(a2<=AstopOK)")))
Formula 13 simplified : !X"(a2<=AstopOK)"
Computing Next relation with stutter on 47 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.714232,48388,1,0,522,100534,245,604,2589,131307,1922
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F("(n6_1<=Sstart_0)")))
Formula 14 simplified : !F"(n6_1<=Sstart_0)"
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.7145,48388,1,0,522,100534,254,604,2592,131307,1926
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((true))
Formula 15 simplified : 0
Computing Next relation with stutter on 47 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.714582,48388,1,0,522,100534,254,604,2592,131307,1926
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1554175334768

--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.application.Application start
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]
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 32 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Apr 02, 2019 3:22:13 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 46 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 18 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 86 places.
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 56 transitions.
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Apr 02, 2019 3:22:13 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 31 place invariants in 21 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 86 variables to be positive in 126 ms
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/56 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Apr 02, 2019 3:22:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Apr 02, 2019 3:22:14 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Apr 02, 2019 3:22:14 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Apr 02, 2019 3:22:14 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (>= (select s0 83) 1) (>= (select s0 84) 1)) (>= (select s0 81) 1)) (>= (select s0 23) 1)) (= (store (store (store (store (store s0 84 (- (select s0 84) 1)) 83 (- (select s0 83) 1)) 79 (+ (select s0 79) 1)) 81 (- (select s0 81) 1)) 23 (- (select s0 23) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (and (>= (select s0 83) 1) (>= (select s0 84) 1)) (>= (select s0 81) 1)) (>= (select s0 23) 1)) (= (store (store (store (store (store s0 84 (- (select s0 84) 1)) 83 (- (select s0 83) 1)) 79 (+ (select s0 79) 1)) 81 (- (select s0 81) 1)) 23 (- (select s0 23) 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:755)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Apr 02, 2019 3:22:14 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 940ms conformant to PINS in folder :/home/mcc/execution

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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
echo " Input is QuasiCertifProtocol-PT-02, 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 r204-oct2-155274856700258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; 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
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 ;