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)
....................
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
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 r224-ebro-152732378800125
=====================================================================

--------------------
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-PT-02-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527574448820

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.201805151631/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.201805151631/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 : !((F(("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3))")U("(RequestBufferSlots>=3)"))))
Formula 0 simplified : !F("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3))" U "(RequestBufferSlots>=3)")
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
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.249258,21696,1,0,106,27424,82,85,790,38800,172
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(X("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3))"))))
Formula 1 simplified : !GX"((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.264037,22288,1,0,107,28116,94,86,851,40394,188
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X("((((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=RequestBufferSlots)")))
Formula 2 simplified : !X"((((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=RequestBufferSlots)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.264841,22288,1,0,107,28116,97,86,857,40394,190
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X((F("((Server_Waiting_2+Server_Waiting_1)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3))"))U(X("(RequestBufferSlots<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4))")))))
Formula 3 simplified : !X(F"((Server_Waiting_2+Server_Waiting_1)<=(((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3))" U X"(RequestBufferSlots<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 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.267614,22676,1,0,107,28116,108,86,887,40394,197
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(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)>=3)"))))
Formula 4 simplified : !GF"((((((((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)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.272406,22676,1,0,107,28160,117,86,919,40472,205
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X((F("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)>=1)"))U(G("((Server_Waiting_2+Server_Waiting_1)>=1)")))))
Formula 5 simplified : !X(F"((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)>=1)" U G"((Server_Waiting_2+Server_Waiting_1)>=1)")
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant :Client_Sending_1 + Client_Waiting_1 = 1
invariant :Client_Waiting_3 + Client_Sending_3 = 1
invariant :Client_Waiting_4 + Client_Sending_4 = 1
invariant :Server_Anwering_3_2 + Server_Anwering_1_2 + Server_Waiting_2 + Server_Anwering_4_2 + Server_Anwering_2_2 = 1
invariant :Client_Sending_2 + Client_Waiting_2 = 1
invariant :Server_Anwering_4_1 + Server_Anwering_3_1 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Waiting_1 = 1
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,0.356303,24680,1,0,138,37071,123,127,924,55091,303
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4))")U(("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=RequestBufferSlots)")U("((Server_Waiting_2+Server_Waiting_1)>=1)"))))
Formula 6 simplified : !("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)<=(((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4))" U ("((((Client_Sending_1+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)<=RequestBufferSlots)" U "((Server_Waiting_2+Server_Waiting_1)>=1)"))
Computing Next relation with stutter on 1 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.359169,25344,1,0,138,37071,140,127,938,55091,309
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F((G("((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)<=RequestBufferSlots)"))U(F("((((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))")))))
Formula 7 simplified : !F(G"((((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1)<=RequestBufferSlots)" U F"((((RequestBuffer_1+RequestBuffer_2)+RequestBuffer_4)+RequestBuffer_3)<=(((Client_Waiting_4+Client_Waiting_3)+Client_Waiting_2)+Client_Waiting_1))")
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.360162,25344,1,0,138,37071,149,127,947,55091,313
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G("(Server_Anwering_1_2<=Client_Waiting_1)"))))
Formula 8 simplified : !G"(Server_Anwering_1_2<=Client_Waiting_1)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 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.460901,27452,1,0,175,47729,155,176,951,73620,420
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(X(X(G(true))))))
Formula 9 simplified : 0
Computing Next relation with stutter on 1 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.461186,27452,1,0,175,47729,155,176,951,73620,420
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(X("(Server_Anwering_3_2<=RequestBuffer_3)"))))
Formula 10 simplified : !XX"(Server_Anwering_3_2<=RequestBuffer_3)"
Computing Next relation with stutter on 1 deadlock states
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.461759,27452,1,0,175,47729,158,176,954,73627,422
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(F(F("(Client_Sending_2<=Client_Waiting_1)")))))
Formula 11 simplified : !XF"(Client_Sending_2<=Client_Waiting_1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.46245,27696,1,0,175,47729,167,176,958,73627,426
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((true))
Formula 12 simplified : 0
Computing Next relation with stutter on 1 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.462657,27696,1,0,175,47729,167,176,958,73627,426
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((X("(Server_Anwering_4_2<=Server_Anwering_3_2)"))U(X("(Client_Waiting_3<=RequestBuffer_1)")))))
Formula 13 simplified : !X(X"(Server_Anwering_4_2<=Server_Anwering_3_2)" U X"(Client_Waiting_3<=RequestBuffer_1)")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.528441,28972,1,0,208,54704,179,204,970,85782,509
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(G(F(G("(Client_Waiting_1<=Server_Anwering_3_1)"))))))
Formula 14 simplified : !GFG"(Client_Waiting_1<=Server_Anwering_3_1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.850535,37520,1,0,325,93906,192,305,975,159005,734
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X(G("(Client_Sending_4<=Client_Waiting_1)")))))
Formula 15 simplified : !FXG"(Client_Sending_4<=Client_Waiting_1)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
24 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.09682,42272,1,0,386,112815,205,370,979,198774,904
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527574454006

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /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 -consoleLog -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
May 29, 2018 6:14:11 AM 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]
May 29, 2018 6:14:11 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 6:14:11 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 57 ms
May 29, 2018 6:14:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 23 places.
May 29, 2018 6:14:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 transitions.
May 29, 2018 6:14:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
May 29, 2018 6:14:12 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 81 ms
May 29, 2018 6:14:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
May 29, 2018 6:14:12 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 29, 2018 6:14:12 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 28 transitions.
May 29, 2018 6:14:12 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 17 ms
May 29, 2018 6:14:13 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 423 ms
May 29, 2018 6:14:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
May 29, 2018 6:14:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 6:14:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 6:14:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
May 29, 2018 6:14:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 6:14:13 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 2) 1) (>= (select s0 9) 1)) (= (store (store (store (store s0 2 (- (select s0 2) 1)) 22 (+ (select s0 22) 1)) 8 (+ (select s0 8) 1)) 9 (- (select s0 9) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
May 29, 2018 6:14:13 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1314ms 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-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
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
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 r224-ebro-152732378800125"
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 ;