fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r110-blw3-149441614500428
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_GlobalResAllocation-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
858.920 12773.00 25704.00 147.50 FFFTTTFFFTTFTTFF 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-3254
Executing tool itstools
Input is S_GlobalResAllocation-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-blw3-149441614500428
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496445177256


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("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])<=(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])")))
Formula 0 simplified : !G"(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])<=(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
278 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,3.08354,92936,1,0,6,241692,23,0,10275,88115,20
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F(G(F("((prin[0]+prin[1])+prin[2])>=2"))))))
Formula 1 simplified : !FGF"((prin[0]+prin[1])+prin[2])>=2"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 711 rows 33 cols
invariant : 4'processes[0] + 1'prin[0] + 1'prreleased[0]= 4
invariant : 4'processes[2] + -1'resources[0] + -1'resources[1] + -1'resources[2] + -1'resources[3] + -1'resources[4] + -1'resources[5] + -1'prin[0] + -1'prin[1] + 1'prreleased[2]= -2
invariant : 1'resources[0] + 1'incriticals[0] + 1'incriticals[6] + 1'incriticals[12]= 1
invariant : 1'resources[2] + 1'incriticals[2] + 1'incriticals[8] + 1'incriticals[14]= 1
invariant : 4'processes[1] + 1'prin[1] + 1'prreleased[1]= 4
invariant : 1'resources[1] + 1'incriticals[1] + 1'incriticals[7] + 1'incriticals[13]= 1
invariant : 1'resources[5] + 1'prin[0] + 1'prin[1] + -1'incriticals[0] + -1'incriticals[1] + -1'incriticals[2] + -1'incriticals[3] + -1'incriticals[4] + -1'incriticals[6] + -1'incriticals[7] + -1'incriticals[8] + -1'incriticals[9] + -1'incriticals[10] + 1'incriticals[17]= 1
invariant : -1'prin[0] + 1'incriticals[0] + 1'incriticals[1] + 1'incriticals[2] + 1'incriticals[3] + 1'incriticals[4] + 1'incriticals[5]= 0
invariant : -1'prin[1] + 1'incriticals[6] + 1'incriticals[7] + 1'incriticals[8] + 1'incriticals[9] + 1'incriticals[10] + 1'incriticals[11]= 0
invariant : 1'resources[3] + 1'incriticals[3] + 1'incriticals[9] + 1'incriticals[15]= 1
invariant : 1'resources[4] + 1'incriticals[4] + 1'incriticals[10] + 1'incriticals[16]= 1
invariant : 1'resources[0] + 1'resources[1] + 1'resources[2] + 1'resources[3] + 1'resources[4] + 1'resources[5] + 1'prin[0] + 1'prin[1] + 1'prin[2]= 6
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
21 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,3.28438,101220,1,0,8,249740,32,0,10300,93957,33
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(X("((prreleased[0]+prreleased[1])+prreleased[2])<=(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])")))U(F(F("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])<=(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])")))))
Formula 2 simplified : !(GX"((prreleased[0]+prreleased[1])+prreleased[2])<=(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])" U F"(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])<=(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
62 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,3.91941,106980,1,0,21,272188,38,6,10636,117333,68
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(F(G(G("(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])<=((prin[0]+prin[1])+prin[2])"))))))
Formula 3 simplified : !FG"(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])<=((prin[0]+prin[1])+prin[2])"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
71 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,4.62311,119380,1,0,26,303250,51,11,11553,148429,104
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=2"))
Formula 4 simplified : !"(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=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,4.62377,119380,1,0,26,303250,54,11,11560,148429,106
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((F("((processes[0]+processes[1])+processes[2])>=2"))U(X("((processes[0]+processes[1])+processes[2])>=3")))))
Formula 5 simplified : !G(F"((processes[0]+processes[1])+processes[2])>=2" U X"((processes[0]+processes[1])+processes[2])>=3")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,4.79124,126420,1,0,28,314896,68,11,11576,157226,119
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=2"))
Formula 6 simplified : !"(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=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,4.79177,126420,1,0,28,314896,68,11,11576,157226,119
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((processes[0]+processes[1])+processes[2])>=2"))
Formula 7 simplified : !"((processes[0]+processes[1])+processes[2])>=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,4.79216,126556,1,0,28,314896,68,11,11576,157226,121
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("((prreleased[0]+prreleased[1])+prreleased[2])>=3"))
Formula 8 simplified : !"((prreleased[0]+prreleased[1])+prreleased[2])>=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,4.79254,126676,1,0,28,314896,71,11,11580,157226,123
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(("((processes[0]+processes[1])+processes[2])>=3")U(X("(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])>=1")))))
Formula 9 simplified : !X("((processes[0]+processes[1])+processes[2])>=3" U X"(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])>=1")
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,4.87443,129168,1,0,31,318700,76,11,11686,159600,137
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(("((processes[0]+processes[1])+processes[2])<=(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])")U("((prin[0]+prin[1])+prin[2])<=((prreleased[0]+prreleased[1])+prreleased[2])")))))
Formula 10 simplified : !XX("((processes[0]+processes[1])+processes[2])<=(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])" U "((prin[0]+prin[1])+prin[2])<=((prreleased[0]+prreleased[1])+prreleased[2])")
7 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
188 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,6.75323,181008,1,0,39,361541,88,12,11954,199800,167
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X(X(X("(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])<=((prin[0]+prin[1])+prin[2])"))))))
Formula 11 simplified : !GXXX"(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])<=((prin[0]+prin[1])+prin[2])"
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 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,6.97261,181136,1,0,41,371380,88,13,11954,210550,177
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G(G("((processes[0]+processes[1])+processes[2])>=2")))U(F(F("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=3")))))
Formula 12 simplified : !(G"((processes[0]+processes[1])+processes[2])>=2" U F"(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=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,6.97351,181176,1,0,41,371380,97,13,11961,210550,181
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((prreleased[0]+prreleased[1])+prreleased[2])<=((processes[0]+processes[1])+processes[2])"))
Formula 13 simplified : !"((prreleased[0]+prreleased[1])+prreleased[2])<=((processes[0]+processes[1])+processes[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,6.97401,181176,1,0,41,371380,100,13,11968,210550,183
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=2")))
Formula 14 simplified : !G"(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
111 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,8.08089,182836,1,0,48,412543,103,13,12002,247815,221
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])<=((prin[0]+prin[1])+prin[2])")U(X("(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])>=2")))))
Formula 15 simplified : !G("(((((resources[0]+resources[1])+resources[2])+resources[3])+resources[4])+resources[5])<=((prin[0]+prin[1])+prin[2])" U X"(((((((((((((((((incriticals[0]+incriticals[1])+incriticals[2])+incriticals[3])+incriticals[4])+incriticals[5])+incriticals[6])+incriticals[7])+incriticals[8])+incriticals[9])+incriticals[10])+incriticals[11])+incriticals[12])+incriticals[13])+incriticals[14])+incriticals[15])+incriticals[16])+incriticals[17])>=2")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
18 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,8.25329,186852,1,0,48,414117,109,13,12372,250282,227
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0

BK_STOP 1496445190029

--------------------
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 11:12:58 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 11:12:58 PM 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 11:12:59 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1301 ms
Jun 02, 2017 11:12:59 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Jun 02, 2017 11:12:59 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 02, 2017 11:12:59 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Proc->processes,prin,prreleased,
Res->resources,
PR->incriticals,

Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: r2 symmetric to r1 in transition enter2
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: r3 symmetric to r2 in transition enter3
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: r2 symmetric to r1 in transition enter3
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: r3 symmetric to r2 in transition enter4
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: r2 symmetric to r1 in transition enter4
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: r1 symmetric to r4 in transition enter4
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: r2 symmetric to r1 in transition release2
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 7 transitions.
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 830 instantiations of transitions. Total transitions/syncs built is 717
Jun 02, 2017 11:13:00 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 816 ms
Jun 02, 2017 11:13:00 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 55 ms
Jun 02, 2017 11:13:00 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 02, 2017 11:13:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 12 place invariants in 45 ms
Jun 02, 2017 11:13:09 PM 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 exact ! Faster fixpoint algorithm enabled.

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="S_GlobalResAllocation-COL-03"
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/S_GlobalResAllocation-COL-03.tgz
mv S_GlobalResAllocation-COL-03 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 S_GlobalResAllocation-COL-03, 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 r110-blw3-149441614500428"
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 ;