fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r285-csrt-152749176500627
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for RefineWMG-PT-002002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15756.830 4754.00 8496.00 115.50 FFFFFFFFFFTFFFTF 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)
....................
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.4K May 30 22:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 22:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 28 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 27 05:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 05:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 6.9K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is RefineWMG-PT-002002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749176500627

=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528036640519

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph4644160652866326887.txt, -o, /tmp/graph4644160652866326887.bin, -w, /tmp/graph4644160652866326887.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph4644160652866326887.bin, -l, -1, -v, -w, /tmp/graph4644160652866326887.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X("(u4.p7>=1)")))
Formula 0 simplified : !X"(u4.p7>=1)"
built 3 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 11 rows 14 cols
invariant :u0:p + u0:pprime + u0:p1 + u0:p6 = 7
invariant :u2:p2 + u2:p3 = 2
invariant :u1:psecond + u1:pterce = 5
invariant :u4:p7 + u4:p8 = 2
invariant :u5:p9 + u5:p10 = 2
invariant :u3:p4 + u3:p5 = 2
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
29 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.318553,22052,1,0,9850,4382,149,20115,174,23557,13881
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((("(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))")U("(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))"))U(("(u3.p4>=1)")U("(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))")))))
Formula 1 simplified : !F("(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))" U ("(u3.p4>=1)" U "(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.327467,22488,1,0,10529,4417,181,21264,174,24226,15341
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G(F("(u0.p1>=5)")))))
Formula 2 simplified : !GF"(u0.p1>=5)"
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.331504,22752,1,0,10620,4506,207,21379,175,24593,15452
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X("(u3.p4>=1)"))))
Formula 3 simplified : !XX"(u3.p4>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.33234,23144,1,0,10632,4506,209,21381,175,24593,15497
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(G(F(X("(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))")))))))
Formula 4 simplified : !FXGFX"(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.334975,23344,1,0,10708,4581,209,21493,175,24886,15618
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(u2.p2>=1)"))
Formula 5 simplified : !"(u2.p2>=1)"
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.335214,23344,1,0,10708,4581,212,21493,175,24886,15623
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(G(X(G("(u2.p2>=1)")))))))
Formula 6 simplified : !FXGXG"(u2.p2>=1)"
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.342857,23696,1,0,11027,4934,212,21950,175,26057,16124
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(F(G(F("(u5.p9>=1)"))))))
Formula 7 simplified : !FGF"(u5.p9>=1)"
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.343574,23696,1,0,11029,4934,227,21953,175,26057,16144
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("(u4.p7>=1)")))
Formula 8 simplified : !F"(u4.p7>=1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.344029,23944,1,0,11032,4934,241,21963,175,26057,16183
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(G(G(("(u0.p1>=5)")U("(u3.p4>=1)"))))))
Formula 9 simplified : !FG("(u0.p1>=5)" U "(u3.p4>=1)")
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]
1 unique states visited
1 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
29 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.641808,33352,1,0,26027,9260,261,60783,175,55181,36090
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((G(G("(u2.p2>=1)")))U("(u3.p4>=1)"))))
Formula 10 simplified : !X(G"(u2.p2>=1)" U "(u3.p4>=1)")
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.64386,33688,1,0,26027,9260,267,60783,175,55181,36102
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(X(("(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))")U("((u1.psecond>=2)&&(u0.pprime>=2))"))))))
Formula 11 simplified : !GFX("(((u2.p3>=1)&&(u3.p4>=1))&&(u0.p6>=1))" U "((u1.psecond>=2)&&(u0.pprime>=2))")
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.64602,33944,1,0,26111,9290,296,60972,175,55324,36202
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("(u5.p10>=1)")))
Formula 12 simplified : !G"(u5.p10>=1)"
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.646397,33944,1,0,26111,9290,308,60972,176,55324,36212
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("(u0.p1>=5)"))
Formula 13 simplified : !"(u0.p1>=5)"
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.646617,33944,1,0,26111,9290,308,60972,176,55324,36215
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((("(((u4.p8>=1)&&(u5.p9>=1))&&(u0.p>=1))")U(X("((u1.psecond>=2)&&(u0.pprime>=2))")))U("(u5.p9>=1)")))
Formula 14 simplified : !(("(((u4.p8>=1)&&(u5.p9>=1))&&(u0.p>=1))" U X"((u1.psecond>=2)&&(u0.pprime>=2))") U "(u5.p9>=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.64769,34096,1,0,26111,9290,330,60972,178,55324,36224
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X((X("(u4.p7>=1)"))U(G("(((u4.p8>=1)&&(u5.p9>=1))&&(u0.p>=1))"))))))
Formula 15 simplified : !GX(X"(u4.p7>=1)" U G"(((u4.p8>=1)&&(u5.p9>=1))&&(u0.p>=1))")
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 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.670933,34492,1,0,26290,9468,350,61224,178,55988,36439
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RefineWMG-PT-002-002-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1528036645273

--------------------
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 LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 03, 2018 2:37:23 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 03, 2018 2:37:23 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 2:37:23 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 49 ms
Jun 03, 2018 2:37:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
Jun 03, 2018 2:37:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 11 transitions.
Jun 03, 2018 2:37:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Jun 03, 2018 2:37:23 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 2:37:23 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 23 ms
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Begin: Sun Jun 3 14:37:24 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 14:37:24 2018
network size: 14 nodes, 46 links, 22 weight
quality increased from -0.0796602 to 0.656566
end computation: Sun Jun 3 14:37:24 2018
level 1:
start computation: Sun Jun 3 14:37:24 2018
network size: 6 nodes, 20 links, 22 weight
quality increased from 0.656566 to 0.656566
end computation: Sun Jun 3 14:37:24 2018
End: Sun Jun 3 14:37:24 2018
Total duration: 0 sec
0.656566
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 2:37:24 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Jun 03, 2018 2:37:24 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 11 transitions.
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 5 ms
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 14 variables to be positive in 45 ms
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 11 transitions.
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/11 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 11 transitions.
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 11 transitions.
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 127 ms. Total solver calls (SAT/UNSAT): 15(15/0)
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 11 transitions.
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 11(0/11)
Jun 03, 2018 2:37:24 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 619ms 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="RefineWMG-PT-002002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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/RefineWMG-PT-002002.tgz
mv RefineWMG-PT-002002 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 itstoolsl"
echo " Input is RefineWMG-PT-002002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-csrt-152749176500627"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;