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 196K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.4K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 11K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is NeighborGrid-PT-d2n3m1c12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732585800060
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527500003211

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/graph7954874964854854919.txt, -o, /tmp/graph7954874964854854919.bin, -w, /tmp/graph7954874964854854919.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/graph7954874964854854919.bin, -l, -1, -v, -w, /tmp/graph7954874964854854919.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(G(X(G("(u1.p_1_1>=1)"))))))
Formula 0 simplified : !XGXG"(u1.p_1_1>=1)"
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 9 cols
invariant :u0:p_0_0 + u0:p_0_1 + u0:p_1_0 + u1:p_0_2 + u1:p_1_1 + u1:p_1_2 + u1:p_2_0 + u1:p_2_1 + u1:p_2_2 = 9
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
120 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.23075,51720,1,0,12904,48926,220,105177,244,492491,3777
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(u0.p_0_1>=1)"))))
Formula 1 simplified : !FG"(u0.p_0_1>=1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.47809,60900,1,0,17656,56867,243,140409,245,601326,7162
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(X(G(F("(u1.p_2_2>=1)")))))))
Formula 2 simplified : !XFXGF"(u1.p_2_2>=1)"
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.48421,61092,1,0,17823,57091,259,140961,246,602182,7437
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(u1.p_1_1>=1)"))
Formula 3 simplified : !"(u1.p_1_1>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.48455,61348,1,0,17823,57091,259,140961,246,602182,7440
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(("(u1.p_2_2>=1)")U(G("(u1.p_1_1>=1)"))))))
Formula 4 simplified : !G("(u1.p_2_2>=1)" U G"(u1.p_1_1>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
107 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,2.54421,87564,1,0,29456,83127,284,241441,250,938472,10355
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F("(u1.p_1_1>=1)"))))
Formula 5 simplified : !GF"(u1.p_1_1>=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,2.54671,87564,1,0,29496,83136,295,241589,250,938639,10450
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((F(F("(u0.p_1_0>=1)")))U(G(F("(u0.p_0_0>=1)"))))))
Formula 6 simplified : !G(F"(u0.p_1_0>=1)" U GF"(u0.p_0_0>=1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,2.55517,88372,1,0,29626,83189,311,241787,251,939090,10642
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X((G("(u0.p_1_0>=1)"))U(G("(u0.p_0_1>=1)"))))))
Formula 7 simplified : !FX(G"(u0.p_1_0>=1)" U G"(u0.p_0_1>=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]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
74 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.29724,113116,1,0,38472,105323,311,337732,251,1.28614e+06,13062
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(u0.p_1_0>=1)"))
Formula 8 simplified : !"(u0.p_1_0>=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,3.2977,113380,1,0,38472,105323,314,337732,251,1.28614e+06,13066
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(u1.p_1_1>=1)")U("(u1.p_1_2>=1)")))
Formula 9 simplified : !("(u1.p_1_1>=1)" U "(u1.p_1_2>=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,3.2982,113640,1,0,38472,105323,328,337732,256,1.28614e+06,13072
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F(F(F("(u0.p_0_1>=1)"))))))
Formula 10 simplified : !GF"(u0.p_0_1>=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,3.29907,113640,1,0,38474,105323,339,337740,256,1.28614e+06,13100
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(F(("(u0.p_0_1>=1)")U("(u1.p_1_2>=1)")))))
Formula 11 simplified : !F("(u0.p_0_1>=1)" U "(u1.p_1_2>=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,3.30085,113640,1,0,38474,105323,351,337740,256,1.28614e+06,13108
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(("(u1.p_1_1>=1)")U("(u0.p_1_0>=1)")))U((G("(u1.p_1_2>=1)"))U(F("(u1.p_2_1>=1)")))))
Formula 12 simplified : !(X("(u1.p_1_1>=1)" U "(u0.p_1_0>=1)") U (G"(u1.p_1_2>=1)" U F"(u1.p_2_1>=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,3.30212,113908,1,0,38474,105323,365,337740,256,1.28614e+06,13116
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G((F(X("(u1.p_2_0>=1)")))U(F(G("(u0.p_0_1>=1)"))))))
Formula 13 simplified : !G(FX"(u1.p_2_0>=1)" U FG"(u0.p_0_1>=1)")
2 unique states visited
2 strongly connected components in search stack
2 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,3.30288,114040,1,0,38474,105323,365,337740,256,1.28614e+06,13116
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((("(u1.p_1_1>=1)")U((F("(u0.p_0_1>=1)"))U(G("(u1.p_0_2>=1)")))))
Formula 14 simplified : !("(u1.p_1_1>=1)" U (F"(u0.p_0_1>=1)" U G"(u1.p_0_2>=1)"))
Compilation finished in 719 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 79 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, ((LTLAP0==true))U((<>((LTLAP1==true)))U([]((LTLAP8==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 71 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X(X(<>(<>(X((LTLAP5==true)))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 80 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1527500010274

--------------------
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
May 28, 2018 9:33:25 AM 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]
May 28, 2018 9:33:25 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 9:33:25 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 41 ms
May 28, 2018 9:33:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 9 places.
May 28, 2018 9:33:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 transitions.
May 28, 2018 9:33:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
May 28, 2018 9:33:25 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 9:33:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 34 ms
May 28, 2018 9:33:26 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 40 ms
Begin: Mon May 28 09:33:26 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 09:33:26 2018
network size: 9 nodes, 40 links, 80 weight
quality increased from -0.125 to 0.08875
end computation: Mon May 28 09:33:26 2018
level 1:
start computation: Mon May 28 09:33:26 2018
network size: 2 nodes, 4 links, 80 weight
quality increased from 0.08875 to 0.08875
end computation: Mon May 28 09:33:26 2018
End: Mon May 28 09:33:26 2018
Total duration: 0 sec
0.08875
May 28, 2018 9:33:26 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 9:33:26 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 11 ms
May 28, 2018 9:33:26 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 9:33:26 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 12 redundant transitions.
May 28, 2018 9:33:26 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
May 28, 2018 9:33:26 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 28, 2018 9:33:26 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 40 transitions.
May 28, 2018 9:33:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 6 ms
May 28, 2018 9:33:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 9 variables to be positive in 45 ms
May 28, 2018 9:33:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 40 transitions.
May 28, 2018 9:33:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/40 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:33:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:33:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 40 transitions.
May 28, 2018 9:33:26 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 28, 2018 9:33:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 40 transitions.
May 28, 2018 9:33:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1380 ms. Total solver calls (SAT/UNSAT): 780(780/0)
May 28, 2018 9:33:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 40 transitions.
May 28, 2018 9:33:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 807 ms. Total solver calls (SAT/UNSAT): 260(0/260)
May 28, 2018 9:33:29 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2680ms 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="NeighborGrid-PT-d2n3m1c12"
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/NeighborGrid-PT-d2n3m1c12.tgz
mv NeighborGrid-PT-d2n3m1c12 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 NeighborGrid-PT-d2n3m1c12, 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 r261-csrt-152732585800060"
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 ;