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.r129-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 itstools
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 r129-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 1553957586802

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903171603/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.201903171603/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 16 LTL properties
Checking formula 0 : !((X("(SstopAbort<=((s5_0+s5_1)+s5_2))")))
Formula 0 simplified : !X"(SstopAbort<=((s5_0+s5_1)+s5_2))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
invariant :Cstart_0 + n8_0_0 + -1'Cstart_2 + n8_1_1 + -1'n8_0_1 + -1'n8_1_2 = 0
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 malS6_1, malS6_0, malS5_0, malS6_2, malC1_0, malC1_2, malC1_1, malS3_1, malS3_2, malS4_2, malS3_0, malS4_0, malS4_1, malS5_1, malS5_2, malA5, malA3, malS1_1, malS1_2, malS2_2, malS1_0, malS2_0, malS2_1, malA1, malA2, malA4, 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
27 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.298246,30804,1,0,152,55784,138,69,2474,37586,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.299363,31148,1,0,152,55784,141,69,2479,37586,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
13 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.427177,35808,1,0,312,79363,150,212,2481,73301,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.42736,35808,1,0,312,79363,150,212,2481,73301,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.508142,37776,1,0,360,82308,159,354,2488,89627,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.519578,38028,1,0,396,83199,165,431,2534,92035,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
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.520161,38288,1,0,396,83199,168,431,2540,92035,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
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.526498,38548,1,0,427,83754,174,488,2568,93190,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
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.589464,39860,1,0,440,85799,187,539,2576,108388,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.62526,42892,1,0,460,88819,230,558,2617,112389,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
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.639503,43412,1,0,521,90956,239,603,2622,115671,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
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.641247,43676,1,0,522,91009,242,604,2626,115844,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.641383,43676,1,0,522,91009,242,604,2626,115844,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.641793,43940,1,0,522,91009,245,604,2630,115845,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.642104,43940,1,0,522,91009,254,604,2634,115846,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.642213,43940,1,0,522,91009,254,604,2634,115846,1926
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
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 1553957589461

--------------------
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/ -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 30, 2019 2:53:08 PM 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/, -smt]
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 31 ms
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Mar 30, 2019 2:53:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 43 ms
Mar 30, 2019 2:53:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
Mar 30, 2019 2:53:08 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 31 place invariants in 15 ms
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 86 variables to be positive in 146 ms
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 30, 2019 2:53:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Mar 30, 2019 2:53:08 PM 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)
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:766)
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)
Mar 30, 2019 2:53:09 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 701ms 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="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-3954"
echo " Executing tool itstools"
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 r129-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 ;