About the Execution of ITS-Tools for CSRepetitions-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
275.260 | 5339.00 | 10557.00 | 182.70 | FFFTTTTFTFFTFFTT | normal |
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-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r020-ebro-149436312000113
=====================================================================
--------------------
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 1496308315304
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(("(Server_Waiting_2+Server_Waiting_1)<=(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)")U(G("RequestBufferSlots>=1")))))
Formula 0 simplified : !X("(Server_Waiting_2+Server_Waiting_1)<=(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)" U G"RequestBufferSlots>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant : 1'Client_Sending_1 + 1'Client_Waiting_1= 1
invariant : 1'Client_Waiting_3 + 1'Client_Sending_3= 1
invariant : 1'Client_Waiting_4 + 1'Client_Sending_4= 1
invariant : 1'Server_Anwering_3_2 + 1'Server_Anwering_1_2 + 1'Server_Waiting_2 + 1'Server_Anwering_4_2 + 1'Server_Anwering_2_2= 1
invariant : 1'Client_Sending_2 + 1'Client_Waiting_2= 1
invariant : 1'Server_Anwering_4_1 + 1'Server_Anwering_3_1 + 1'Server_Anwering_2_1 + 1'Server_Anwering_1_1 + 1'Server_Waiting_1= 1
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
25 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.310662,28740,1,0,120,25846,101,67,852,33686,172
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
Checking formula 1 : !(((("(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)")U("(Server_Waiting_2+Server_Waiting_1)>=2"))U(X(F("(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)")))))
Formula 1 simplified : !(("(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)" U "(Server_Waiting_2+Server_Waiting_1)>=2") U XF"(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.566468,33980,1,0,156,46941,110,105,915,69697,274
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
Checking formula 2 : !((X("(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>=3")))
Formula 2 simplified : !X"(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)>=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.567725,34000,1,0,156,46941,113,105,923,69697,276
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(X("(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)>=2"))))
Formula 3 simplified : !FX"(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
11 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.679234,35696,1,0,186,53417,122,145,936,80946,365
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
Checking formula 4 : !(((F(F("(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)")))U(G(G("(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)")))))
Formula 4 simplified : !(F"(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)" U G"(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+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
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.905986,39788,1,0,243,68706,139,202,1262,105792,489
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
Checking formula 5 : !((F(X(F(X("(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(Server_Waiting_2+Server_Waiting_1)"))))))
Formula 5 simplified : !FXFX"(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(Server_Waiting_2+Server_Waiting_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,0.907421,39868,1,0,243,68706,148,202,1274,105792,493
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)>=3"))
Formula 6 simplified : !"(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)>=3"
3 unique states visited
3 strongly connected components in search stack
3 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,0.914017,40108,1,0,243,69056,151,202,1279,106358,497
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
Checking formula 7 : !(((("(Server_Waiting_2+Server_Waiting_1)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)")U("(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)>=3"))U(X(F("(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)>=2")))))
Formula 7 simplified : !(("(Server_Waiting_2+Server_Waiting_1)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)" U "(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)>=3") U XF"(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)>=2")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.951555,40584,1,0,254,71401,160,233,1311,110273,570
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
Checking formula 8 : !(("(Server_Waiting_2+Server_Waiting_1)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)"))
Formula 8 simplified : !"(Server_Waiting_2+Server_Waiting_1)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_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,0.952511,40604,1,0,254,71401,163,233,1318,110273,572
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)"))
Formula 9 simplified : !"(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)"
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.953765,40648,1,0,254,71401,166,233,1332,110273,574
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G("(Server_Waiting_2+Server_Waiting_1)>=2")))
Formula 10 simplified : !G"(Server_Waiting_2+Server_Waiting_1)>=2"
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.972417,41004,1,0,271,72775,172,248,1338,112445,621
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
Checking formula 11 : !((F(F(("(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)")U("(Server_Waiting_2+Server_Waiting_1)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)")))))
Formula 11 simplified : !F("(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)" U "(Server_Waiting_2+Server_Waiting_1)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)")
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.983797,41132,1,0,293,73816,181,262,1360,113663,676
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X("(Server_Waiting_2+Server_Waiting_1)>=1"))U(F("RequestBufferSlots>=2"))))
Formula 12 simplified : !(X"(Server_Waiting_2+Server_Waiting_1)>=1" U F"RequestBufferSlots>=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.984742,41336,1,0,293,73816,190,262,1362,113663,680
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(Server_Waiting_2+Server_Waiting_1)"))
Formula 13 simplified : !"(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(Server_Waiting_2+Server_Waiting_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,0.98529,41336,1,0,293,73816,190,262,1362,113663,682
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G((X("RequestBufferSlots>=1"))U(F("(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=RequestBufferSlots")))))
Formula 14 simplified : !G(X"RequestBufferSlots>=1" U F"(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=RequestBufferSlots")
2 unique states visited
0 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,1.02452,42164,1,0,311,77293,199,272,1383,119072,733
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(G(F(F("(Server_Waiting_2+Server_Waiting_1)<=(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)"))))))
Formula 15 simplified : !FGF"(Server_Waiting_2+Server_Waiting_1)<=(((((((Server_Anwering_3_2+Server_Anwering_1_2)+Server_Anwering_4_1)+Server_Anwering_3_1)+Server_Anwering_2_1)+Server_Anwering_1_1)+Server_Anwering_4_2)+Server_Anwering_2_2)"
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.04108,42512,1,0,326,78485,206,289,1430,120742,786
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
Exit code :0
BK_STOP 1496308320643
--------------------
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 9:11:58 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 9:11:58 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 71 ms
Jun 01, 2017 9:11:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 23 places.
Jun 01, 2017 9:11:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 transitions.
Jun 01, 2017 9:11:58 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 82 ms
Jun 01, 2017 9:11:58 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 16 ms
Jun 01, 2017 9:11:58 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 22 ms
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 74 ms
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/28 took 3 ms. Total solver calls (SAT/UNSAT): 4(3/1)
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 103 ms. Total solver calls (SAT/UNSAT): 208(104/104)
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 91 ms. Total solver calls (SAT/UNSAT): 208(104/104)
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 28 transitions.
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 128 ms. Total solver calls (SAT/UNSAT): 406(330/76)
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 28 transitions.
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 206 ms. Total solver calls (SAT/UNSAT): 48(0/48)
Jun 01, 2017 9:11:59 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 900ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 9:12:00 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 Send_Answer_3_2, Prepare_Request_2, Send_Answer_4_2, Send_Answer_1_1, Prepare_Request_3, Lose_Request_4, Prepare_Request_1, Send_Answer_3_1, Send_Answer_2_1, Lose_Request_2, Send_Answer_4_1, Lose_Request_3, Prepare_Request_4, Send_Answer_1_2, Send_Answer_2_2, Lose_Request_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Jun 01, 2017 9:12:00 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 01, 2017 9:12:00 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 01, 2017 9:12:00 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTS min runner thread failed on error :java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:66)
at java.lang.Thread.run(Thread.java:748)
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-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
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-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-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 r020-ebro-149436312000113"
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 '
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 ;