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-3253
Executing tool itstools
Input is CSRepetitions-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r020-ebro-149436312000077
=====================================================================

--------------------
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 CSRepetitions-COL-02-LTLCardinality-0
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-1
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-15
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-2
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-3
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-4
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-5
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-6
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-7
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-8
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496303291881


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 : !((X(("(serverWaiting[0]+serverWaiting[1])<=(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])")U(G("requestBufferSlots[0]>=1")))))
Formula 0 simplified : !X("(serverWaiting[0]+serverWaiting[1])<=(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])" U G"requestBufferSlots[0]>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant : 1'clientSending[2] + 1'clientWaiting[2]= 1
invariant : 1'clientSending[3] + 1'clientWaiting[3]= 1
invariant : 1'clientSending[0] + 1'clientWaiting[0]= 1
invariant : 1'serverWaiting[1] + 1'serverAnwering[1] + 1'serverAnwering[3] + 1'serverAnwering[5] + 1'serverAnwering[7]= 1
invariant : 1'clientSending[1] + 1'clientWaiting[1]= 1
invariant : 1'serverWaiting[0] + 1'serverAnwering[0] + 1'serverAnwering[2] + 1'serverAnwering[4] + 1'serverAnwering[6]= 1
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
43 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.484138,32776,1,0,82,48294,69,51,685,60483,140
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((("(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])<=(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])")U("(serverWaiting[0]+serverWaiting[1])>=2"))U(X(F("(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])<=(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])")))))
Formula 1 simplified : !(("(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])<=(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])" U "(serverWaiting[0]+serverWaiting[1])>=2") U XF"(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])<=(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])")
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
42 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.901065,42024,1,0,118,95511,78,89,755,118788,242
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])>=3")))
Formula 2 simplified : !X"(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])>=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,0.902155,42044,1,0,118,95511,81,89,763,118788,244
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X("(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])>=2"))))
Formula 3 simplified : !FX"(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 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.07029,45488,1,0,148,113016,90,129,776,140499,333
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(F("(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])<=(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])")))U(G(G("(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])<=(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])")))))
Formula 4 simplified : !(F"(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])<=(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])" U G"(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])<=(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
32 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.39112,52552,1,0,205,149168,107,186,1033,182520,457
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(F(X("(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=(serverWaiting[0]+serverWaiting[1])"))))))
Formula 5 simplified : !FXFX"(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=(serverWaiting[0]+serverWaiting[1])"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.3925,52624,1,0,205,149168,116,186,1045,182520,461
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])>=3"))
Formula 6 simplified : !"(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])>=3"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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.47823,54452,1,0,205,156848,119,186,1050,195159,465
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(serverWaiting[0]+serverWaiting[1])<=(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])")U("(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])>=3"))U(X(F("(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])>=2")))))
Formula 7 simplified : !(("(serverWaiting[0]+serverWaiting[1])<=(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])" U "(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])>=3") U XF"(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])>=2")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.5552,55956,1,0,216,163324,128,217,1072,203456,538
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(serverWaiting[0]+serverWaiting[1])<=(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])"))
Formula 8 simplified : !"(serverWaiting[0]+serverWaiting[1])<=(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])"
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.55626,55996,1,0,216,163324,131,217,1079,203456,540
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])<=(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])"))
Formula 9 simplified : !"(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])<=(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])"
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.55735,56088,1,0,216,163324,134,217,1093,203456,542
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("(serverWaiting[0]+serverWaiting[1])>=2")))
Formula 10 simplified : !G"(serverWaiting[0]+serverWaiting[1])>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
14 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.69987,57336,1,0,233,168713,140,232,1099,210613,589
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(F(("(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])")U("(serverWaiting[0]+serverWaiting[1])<=(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])")))))
Formula 11 simplified : !F("(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=(((clientWaiting[0]+clientWaiting[1])+clientWaiting[2])+clientWaiting[3])" U "(serverWaiting[0]+serverWaiting[1])<=(((clientSending[0]+clientSending[1])+clientSending[2])+clientSending[3])")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.7164,57668,1,0,255,170764,149,246,1123,212440,644
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X("(serverWaiting[0]+serverWaiting[1])>=1"))U(F("requestBufferSlots[0]>=2"))))
Formula 12 simplified : !(X"(serverWaiting[0]+serverWaiting[1])>=1" U F"requestBufferSlots[0]>=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.71737,57772,1,0,255,170764,158,246,1125,212440,648
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=(serverWaiting[0]+serverWaiting[1])"))
Formula 13 simplified : !"(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=(serverWaiting[0]+serverWaiting[1])"
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.71809,57772,1,0,255,170764,158,246,1125,212440,650
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G((X("requestBufferSlots[0]>=1"))U(F("(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=requestBufferSlots[0]")))))
Formula 14 simplified : !G(X"requestBufferSlots[0]>=1" U F"(((requestBuffer[0]+requestBuffer[1])+requestBuffer[2])+requestBuffer[3])<=requestBufferSlots[0]")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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,1.7882,59332,1,0,273,179792,167,256,1144,221753,701
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(G(F(F("(serverWaiting[0]+serverWaiting[1])<=(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])"))))))
Formula 15 simplified : !FGF"(serverWaiting[0]+serverWaiting[1])<=(((((((serverAnwering[0]+serverAnwering[1])+serverAnwering[2])+serverAnwering[3])+serverAnwering[4])+serverAnwering[5])+serverAnwering[6])+serverAnwering[7])"
3 unique states visited
3 strongly connected components in search stack
4 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,1.81543,59900,1,0,288,182891,174,273,1168,224797,754
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0

BK_STOP 1496303299270

--------------------
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 01, 2017 7:48:14 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 7:48:14 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 01, 2017 7:48:16 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1976 ms
Jun 01, 2017 7:48:16 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
Jun 01, 2017 7:48:16 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 01, 2017 7:48:16 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

Jun 01, 2017 7:48:16 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Jun 01, 2017 7:48:16 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 01, 2017 7:48:16 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 73 ms
Jun 01, 2017 7:48:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
Jun 01, 2017 7:48:16 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 26 ms
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 83 ms
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/28 took 3 ms. Total solver calls (SAT/UNSAT): 4(2/2)
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 102 ms. Total solver calls (SAT/UNSAT): 208(104/104)
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 90 ms. Total solver calls (SAT/UNSAT): 208(104/104)
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 28 transitions.
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 157 ms. Total solver calls (SAT/UNSAT): 406(330/76)
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 28 transitions.
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 175 ms. Total solver calls (SAT/UNSAT): 48(0/48)
Jun 01, 2017 7:48:17 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 844ms 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="CSRepetitions-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/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool itstools"
echo " Input is CSRepetitions-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 r020-ebro-149436312000077"
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 ;