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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 4.1K 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 2.5K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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.8K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 34K 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-COL-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553953041709

13:37:47.626 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
13:37:47.656 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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_0<=((s5_0+s5_1)+s5_2))")))
Formula 0 simplified : !X"(SstopAbort_0<=((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 :n9_5 + -1'SstopOK_1 + CstopOK_2 = 0
invariant :n6_1 + -1'n6_2 + n5_1 + -1'n5_2 = 0
invariant :n4_1 + -1'n4_2 + n3_1 + -1'n3_2 = 0
invariant :n8_1 + -1'n8_2 + Cstart_1 + -1'Cstart_2 = 0
invariant :n6_0 + -1'n6_2 + n5_0 + -1'n5_2 = 0
invariant :n7_6 + -1'n7_8 + -1'Cstart_0 + Cstart_2 = 0
invariant :n7_4 + -1'n7_5 + -1'Cstart_1 + Cstart_2 = 0
invariant :n9_0 + -1'SstopOK_0 + CstopOK_0 = 0
invariant :n7_3 + -1'n7_5 + -1'Cstart_0 + Cstart_2 = 0
invariant :n9_2 + -1'SstopOK_0 + CstopOK_2 = 0
invariant :n8_0 + -1'n8_2 + Cstart_0 + -1'Cstart_2 = 0
invariant :n8_4 + -1'n8_5 + Cstart_1 + -1'Cstart_2 = 0
invariant :CstopAbort_0 + c1_0 + c1_1 + c1_2 + Cstart_0 + Cstart_1 + Cstart_2 + CstopOK_0 + CstopOK_1 + CstopOK_2 = 3
invariant :n9_6 + -1'SstopOK_2 + CstopOK_0 = 0
invariant :AstopAbort_0 + a5_0 + a4_0 + a3_0 + a2_0 + a1_0 + Astart_0 + AstopOK_0 = 1
invariant :n9_3 + -1'SstopOK_1 + CstopOK_0 = 0
invariant :n9_1 + -1'SstopOK_0 + CstopOK_1 = 0
invariant :n8_7 + -1'n8_8 + Cstart_1 + -1'Cstart_2 = 0
invariant :n4_0 + -1'n4_2 + n3_0 + -1'n3_2 = 0
invariant :n8_3 + -1'n8_5 + Cstart_0 + -1'Cstart_2 = 0
invariant :malicious_reservoir_0 + -1'c1_0 + -1'c1_1 + -1'c1_2 + -1'Cstart_0 + -1'Cstart_1 + -1'Cstart_2 + -1'Sstart_0 + -1'Sstart_1 + -1'Sstart_2 + -1's2_0 + -1's2_1 + -1's2_2 + -1's3_0 + -1's3_1 + -1's3_2 + -1's4_0 + -1's4_1 + -1's4_2 + -1's5_0 + -1's5_1 + -1's5_2 + -1's6_0 + -1's6_1 + -1's6_2 + -1'SstopOK_0 + -1'SstopOK_1 + -1'SstopOK_2 + -1'CstopOK_0 + -1'CstopOK_1 + -1'CstopOK_2 = -5
invariant :n9_7 + -1'SstopOK_2 + CstopOK_1 = 0
invariant :n7_1 + -1'n7_2 + -1'Cstart_1 + Cstart_2 = 0
invariant :n2_0 + -1'n2_2 + n1_0 + -1'n1_2 = 0
invariant :n9_8 + -1'SstopOK_2 + CstopOK_2 = 0
invariant :SstopAbort_0 + Sstart_0 + Sstart_1 + Sstart_2 + s2_0 + s2_1 + s2_2 + s3_0 + s3_1 + s3_2 + s4_0 + s4_1 + s4_2 + s5_0 + s5_1 + s5_2 + s6_0 + s6_1 + s6_2 + SstopOK_0 + SstopOK_1 + SstopOK_2 = 3
invariant :n9_4 + -1'SstopOK_1 + CstopOK_1 = 0
invariant :n8_6 + -1'n8_8 + Cstart_0 + -1'Cstart_2 = 0
invariant :n7_0 + -1'n7_2 + -1'Cstart_0 + Cstart_2 = 0
invariant :n2_1 + -1'n2_2 + n1_1 + -1'n1_2 = 0
invariant :n7_7 + -1'n7_8 + -1'Cstart_1 + Cstart_2 = 0
Reverse transition relation is NOT exact ! Due to transitions malC1, malS6, malS5, malS4, malS3, malS2, malS1, malA5, malA3, malA4, malA2, malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/12/42
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.278198,28000,1,0,110,47931,110,55,2494,39458,120
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(X("(((SstopOK_0+SstopOK_1)+SstopOK_2)<=((s4_0+s4_1)+s4_2))")))U("(a3_0<=((n3_0+n3_1)+n3_2))")))
Formula 1 simplified : !(FX"(((SstopOK_0+SstopOK_1)+SstopOK_2)<=((s4_0+s4_1)+s4_2))" U "(a3_0<=((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.279869,28332,1,0,110,47931,113,55,2500,39458,122
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((X("(((s3_0+s3_1)+s3_2)<=a2_0)"))U(X("(CstopAbort_0>=1)")))))
Formula 2 simplified : !F(X"(((s3_0+s3_1)+s3_2)<=a2_0)" U X"(CstopAbort_0>=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
16 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.438455,34064,1,0,270,75107,122,198,2502,76022,425
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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.438679,34064,1,0,270,75107,122,198,2502,76022,425
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(("(((n5_0+n5_1)+n5_2)>=3)")U("(((s3_0+s3_1)+s3_2)>=2)")))))
Formula 4 simplified : !GF("(((n5_0+n5_1)+n5_2)>=3)" U "(((s3_0+s3_1)+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
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.519758,36824,1,0,318,81661,131,340,2509,91233,767
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("(((n6_0+n6_1)+n6_2)<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8))")))
Formula 5 simplified : !G"(((n6_0+n6_1)+n6_2)<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8))"
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
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.556811,37604,1,0,354,85557,137,417,2537,99676,912
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X("(CstopAbort_0>=3)"))U("(((n4_0+n4_1)+n4_2)<=CstopAbort_0)")))
Formula 6 simplified : !(X"(CstopAbort_0>=3)" U "(((n4_0+n4_1)+n4_2)<=CstopAbort_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.557543,37864,1,0,354,85557,140,417,2543,99676,914
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(G(X(G("(((s3_0+s3_1)+s3_2)<=((n2_0+n2_1)+n2_2))"))))))
Formula 7 simplified : !GXG"(((s3_0+s3_1)+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
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.585243,38388,1,0,385,87750,146,474,2571,104261,1029
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(F(G("(((s3_0+s3_1)+s3_2)<=((n1_0+n1_1)+n1_2))"))))))
Formula 8 simplified : !GFG"(((s3_0+s3_1)+s3_2)<=((n1_0+n1_1)+n1_2))"
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22 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.807899,42832,1,0,538,108783,159,661,2613,138851,1470
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((("(((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8)<=a5_0)")U("(a2_0<=((s6_0+s6_1)+s6_2))"))U(X(X("(((s4_0+s4_1)+s4_2)<=SstopAbort_0)")))))
Formula 9 simplified : !(("(((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8)<=a5_0)" U "(a2_0<=((s6_0+s6_1)+s6_2))") U XX"(((s4_0+s4_1)+s4_2)<=SstopAbort_0)")
Computing Next relation with stutter on 47 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.813923,44584,1,0,538,108783,193,661,2670,138859,1489
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(("(((s4_0+s4_1)+s4_2)>=2)")U(G("(CstopAbort_0>=1)")))))
Formula 10 simplified : !F("(((s4_0+s4_1)+s4_2)>=2)" U G"(CstopAbort_0>=1)")
Computing Next relation with stutter on 47 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.861316,45624,1,0,597,113424,203,794,2670,152679,1841
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((X("(malicious_reservoir_0>=2)"))U(X("(((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)>=1)")))))
Formula 11 simplified : !F(X"(malicious_reservoir_0>=2)" U X"(((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)>=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
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.88028,46416,1,0,651,117421,212,838,2695,157035,1975
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X("(malicious_reservoir_0<=((n6_0+n6_1)+n6_2))")))
Formula 12 simplified : !X"(malicious_reservoir_0<=((n6_0+n6_1)+n6_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.883101,46416,1,0,652,117573,215,839,2701,157269,1985
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((F(F("(a4_0<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8))")))U(F(X("(((n3_0+n3_1)+n3_2)>=2)")))))
Formula 13 simplified : !(F"(a4_0<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8))" U FX"(((n3_0+n3_1)+n3_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.893115,46680,1,0,668,119714,224,856,2707,159719,2043
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((G(F("(CstopAbort_0<=((s5_0+s5_1)+s5_2))")))U(X(G("(((s5_0+s5_1)+s5_2)<=malicious_reservoir_0)")))))
Formula 14 simplified : !(GF"(CstopAbort_0<=((s5_0+s5_1)+s5_2))" U XG"(((s5_0+s5_1)+s5_2)<=malicious_reservoir_0)")
Computing Next relation with stutter on 47 deadlock states
10 unique states visited
7 strongly connected components in search stack
10 transitions explored
7 items max in DFS search stack
5 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.939773,48660,1,0,718,124839,245,912,2749,168484,2217
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G("(((n3_0+n3_1)+n3_2)<=((n1_0+n1_1)+n1_2))")))
Formula 15 simplified : !G"(((n3_0+n3_1)+n3_2)<=((n1_0+n1_1)+n1_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.948776,48924,1,0,723,125604,251,923,2759,169879,2259
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1553953069912

--------------------
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 1:37:23 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 1:37:23 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 30, 2019 1:37:23 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24729 ms
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 30 places.
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 26 transitions.
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 30, 2019 1:37:48 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 35 ms
Mar 30, 2019 1:37:48 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
Mar 30, 2019 1:37:48 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 63 deterministic transitions.
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 3 ms.
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 31 place invariants in 15 ms
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 86 variables to be positive in 158 ms
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Mar 30, 2019 1:37:48 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 1:37:48 PM 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)
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Mar 30, 2019 1:37:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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)
Mar 30, 2019 1:37:49 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1217ms 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-COL-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-COL-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-155274856600195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-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 ;