Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3254
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 r060-smll-149440927900194
=====================================================================

--------------------
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-0
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-1
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
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-2
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-3
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-4
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-5
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-6
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-7
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-8
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496378667765


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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 : !((G(F("((s6[0]+s6[1])+s6[2])<=a5[0]"))))
Formula 0 simplified : !GF"((s6[0]+s6[1])+s6[2])<=a5[0]"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 86 cols
invariant : -1'n6[0] + 1'n6[1] + -1'n5[0] + 1'n5[1]= 0
invariant : 1'CstopAbort[0] + -1'n9[0] + 2'n9[1] + -1'n9[2] + 2'n8[0] + -1'n8[1] + -1'n8[2] + 1'c1[0] + 1'c1[1] + 1'c1[2] + 3'Cstart[0] + 3'CstopOK[1]= 3
invariant : -1'n8[0] + 1'n8[2] + -1'n7[0] + 1'n7[2]= 0
invariant : -1'n2[0] + 1'n2[1] + -1'n1[0] + 1'n1[1]= 0
invariant : 1'malicious_reservoir[0] + 1'CstopAbort[0] + 1'SstopAbort[0]= 1
invariant : 1'n9[0] + -1'n9[1] + -1'n9[6] + 1'n9[7]= 0
invariant : -1'n2[0] + 1'n2[2] + -1'n1[0] + 1'n1[2]= 0
invariant : 1'CstopAbort[0] + 2'n9[0] + -1'n9[1] + -1'n9[2] + -3'n9[3] + 2'n8[0] + -1'n8[1] + -1'n8[2] + 1'c1[0] + 1'c1[1] + 1'c1[2] + 3'Cstart[0] + 3'SstopOK[1]= 3
invariant : 1'n9[0] + -1'n9[2] + -1'n9[6] + 1'n9[8]= 0
invariant : 1'n8[0] + -1'n8[2] + -1'n8[6] + 1'n8[8]= 0
invariant : -1'n8[0] + 1'n8[2] + -1'n7[3] + 1'n7[5]= 0
invariant : -1'n8[0] + 1'n8[1] + -1'n7[3] + 1'n7[4]= 0
invariant : 1'CstopAbort[0] + 2'n9[0] + -1'n9[1] + -1'n9[2] + 2'n8[0] + -1'n8[1] + -1'n8[2] + 1'c1[0] + 1'c1[1] + 1'c1[2] + 3'Cstart[0] + 3'CstopOK[0]= 3
invariant : 1'n9[0] + -1'n9[1] + -1'n9[3] + 1'n9[4]= 0
invariant : 1'n9[0] + -1'n9[2] + -1'n9[3] + 1'n9[5]= 0
invariant : -1'n8[0] + 1'n8[1] + -1'n7[6] + 1'n7[7]= 0
invariant : -1'n4[0] + 1'n4[2] + -1'n3[0] + 1'n3[2]= 0
invariant : -1'n4[0] + 1'n4[1] + -1'n3[0] + 1'n3[1]= 0
invariant : -1'n8[0] + 1'n8[2] + -1'n7[6] + 1'n7[8]= 0
invariant : 1'CstopAbort[0] + -1'n9[0] + -1'n9[1] + 2'n9[2] + 2'n8[0] + -1'n8[1] + -1'n8[2] + 1'c1[0] + 1'c1[1] + 1'c1[2] + 3'Cstart[0] + 3'CstopOK[2]= 3
invariant : 1'CstopAbort[0] + 2'n9[0] + -1'n9[1] + -1'n9[2] + -3'n9[6] + 2'n8[0] + -1'n8[1] + -1'n8[2] + 1'c1[0] + 1'c1[1] + 1'c1[2] + 3'Cstart[0] + 3'SstopOK[2]= 3
invariant : 1'n8[0] + -1'n8[2] + -1'n8[3] + 1'n8[5]= 0
invariant : -1'n8[0] + 1'n8[1] + -1'n7[0] + 1'n7[1]= 0
invariant : -1'n8[0] + 1'n8[2] + -1'Cstart[0] + 1'Cstart[2]= 0
invariant : 1'n8[0] + -1'n8[1] + -1'n8[6] + 1'n8[7]= 0
invariant : 1'CstopAbort[0] + -1'n9[0] + -1'n9[1] + -1'n9[2] + 2'n8[0] + -1'n8[1] + -1'n8[2] + 1'c1[0] + 1'c1[1] + 1'c1[2] + 3'Cstart[0] + 3'SstopOK[0]= 3
invariant : 1'n8[0] + -1'n8[1] + -1'n8[3] + 1'n8[4]= 0
invariant : -1'n8[0] + 1'n8[1] + -1'Cstart[0] + 1'Cstart[1]= 0
invariant : -1'n6[0] + 1'n6[2] + -1'n5[0] + 1'n5[2]= 0
37 unique states visited
0 strongly connected components in search stack
59 transitions explored
31 items max in DFS search stack
70 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.754422,39076,1,0,169,61826,114,142,2502,63920,381
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("AstopAbort[0]>=2"))
Formula 1 simplified : !"AstopAbort[0]>=2"
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.757347,39264,1,0,170,62146,119,143,2504,64136,391
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("a2[0]<=((Cstart[0]+Cstart[1])+Cstart[2])"))
Formula 2 simplified : !"a2[0]<=((Cstart[0]+Cstart[1])+Cstart[2])"
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.757874,39268,1,0,170,62146,122,143,2509,64136,393
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(("((((((((n7[0]+n7[1])+n7[2])+n7[3])+n7[4])+n7[5])+n7[6])+n7[7])+n7[8])>=1")U("((n1[0]+n1[1])+n1[2])>=3")))))
Formula 3 simplified : !XX("((((((((n7[0]+n7[1])+n7[2])+n7[3])+n7[4])+n7[5])+n7[6])+n7[7])+n7[8])>=1" U "((n1[0]+n1[1])+n1[2])>=3")
5 unique states visited
5 strongly connected components in search stack
5 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.764642,39696,1,0,174,62991,132,147,2535,64909,412
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(G("((c1[0]+c1[1])+c1[2])>=2")))U(("a3[0]<=a2[0]")U("((s3[0]+s3[1])+s3[2])>=2"))))
Formula 4 simplified : !(G"((c1[0]+c1[1])+c1[2])>=2" U ("a3[0]<=a2[0]" U "((s3[0]+s3[1])+s3[2])>=2"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.795617,41940,1,0,213,66583,158,214,2561,72339,548
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X(G("((CstopOK[0]+CstopOK[1])+CstopOK[2])<=((n5[0]+n5[1])+n5[2])"))))))
Formula 5 simplified : !XGXG"((CstopOK[0]+CstopOK[1])+CstopOK[2])<=((n5[0]+n5[1])+n5[2])"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.874211,44732,1,0,273,77436,164,293,2589,89899,704
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("((s5[0]+s5[1])+s5[2])>=2")))
Formula 6 simplified : !F"((s5[0]+s5[1])+s5[2])>=2"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.927819,46348,1,0,364,85385,173,382,2596,102699,901
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("a3[0]<=((CstopOK[0]+CstopOK[1])+CstopOK[2])"))
Formula 7 simplified : !"a3[0]<=((CstopOK[0]+CstopOK[1])+CstopOK[2])"
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.928457,46356,1,0,364,85385,176,382,2602,102699,903
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((s4[0]+s4[1])+s4[2])>=2")))
Formula 8 simplified : !F"((s4[0]+s4[1])+s4[2])>=2"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15 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,1.07309,48876,1,0,461,95289,185,469,2609,113886,1136
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X("a5[0]>=2"))))
Formula 9 simplified : !GX"a5[0]>=2"
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,1.07582,49180,1,0,461,95401,191,469,2611,114056,1144
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(G(F("((((((((n9[0]+n9[1])+n9[2])+n9[3])+n9[4])+n9[5])+n9[6])+n9[7])+n9[8])<=((n5[0]+n5[1])+n5[2])")))))
Formula 10 simplified : !XGF"((((((((n9[0]+n9[1])+n9[2])+n9[3])+n9[4])+n9[5])+n9[6])+n9[7])+n9[8])<=((n5[0]+n5[1])+n5[2])"
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,1.08358,49224,1,0,477,95652,200,487,2663,114817,1197
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 : !(("((((((((n7[0]+n7[1])+n7[2])+n7[3])+n7[4])+n7[5])+n7[6])+n7[7])+n7[8])>=3"))
Formula 11 simplified : !"((((((((n7[0]+n7[1])+n7[2])+n7[3])+n7[4])+n7[5])+n7[6])+n7[7])+n7[8])>=3"
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,1.08425,49224,1,0,477,95652,203,487,2673,114818,1199
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(X(G(G("a4[0]<=a2[0]"))))))
Formula 12 simplified : !XXG"a4[0]<=a2[0]"
5 unique states visited
5 strongly connected components in search stack
5 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,1.10137,49504,1,0,503,97195,209,537,2677,118268,1307
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 : !((X("((Cstart[0]+Cstart[1])+Cstart[2])>=3")))
Formula 13 simplified : !X"((Cstart[0]+Cstart[1])+Cstart[2])>=3"
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,1.10198,49516,1,0,503,97195,212,537,2681,118268,1309
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("((n1[0]+n1[1])+n1[2])<=((n3[0]+n3[1])+n3[2])"))
Formula 14 simplified : !"((n1[0]+n1[1])+n1[2])<=((n3[0]+n3[1])+n3[2])"
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,1.10255,49644,1,0,503,97195,215,537,2688,118268,1311
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((("AstopOK[0]<=((Cstart[0]+Cstart[1])+Cstart[2])")U(G(G("a2[0]>=2")))))
Formula 15 simplified : !("AstopOK[0]<=((Cstart[0]+Cstart[1])+Cstart[2])" U G"a2[0]>=2")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.18394,52176,1,0,546,104799,236,644,2722,135508,1521
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
Exit code :0

BK_STOP 1496378674536

--------------------
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
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 4:44:30 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 4:44:30 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 02, 2017 4:44:32 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1759 ms
Jun 02, 2017 4:44:32 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 30 places.
Jun 02, 2017 4:44:32 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 02, 2017 4:44:32 AM 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,

Jun 02, 2017 4:44:32 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 26 transitions.
Jun 02, 2017 4:44:32 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 02, 2017 4:44:32 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 121 ms
Jun 02, 2017 4:44:32 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 19 ms
Jun 02, 2017 4:44:32 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 02, 2017 4:44:33 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 29 place invariants in 36 ms
Jun 02, 2017 4:44:33 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 86 variables to be positive in 330 ms
Jun 02, 2017 4:44:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Jun 02, 2017 4:44:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/56 took 5 ms. Total solver calls (SAT/UNSAT): 1(1/0)
Jun 02, 2017 4:44:34 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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]
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
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states
Computing Next relation with stutter on 47 deadlock states

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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
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 r060-smll-149440927900194"
echo "====================================================================="
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 ;