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 192K
-rw-r--r-- 1 mcc users 4.1K 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.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Kanban-PT-0005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732585700002
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527499752937

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/graph1347150559252003308.txt, -o, /tmp/graph1347150559252003308.bin, -w, /tmp/graph1347150559252003308.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/graph1347150559252003308.bin, -l, -1, -v, -w, /tmp/graph1347150559252003308.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(F(("(u1.P4>=1)")U(G("(u1.P4>=1)"))))))
Formula 0 simplified : !XF("(u1.P4>=1)" U G"(u1.P4>=1)")
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.101061,19880,1,0,5168,1963,171,9327,129,8833,5174
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((X(F("(u4.Pback2>=1)")))U(G(F("(u4.Pback2>=1)"))))))
Formula 1 simplified : !X(XF"(u4.Pback2>=1)" U GF"(u4.Pback2>=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.104146,20340,1,0,5314,2017,205,9632,132,9224,5481
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((F(G("(u0.Pm3>=1)")))U(X(G("(u4.Pback2>=1)"))))))
Formula 2 simplified : !F(FG"(u0.Pm3>=1)" U XG"(u4.Pback2>=1)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 16 rows 16 cols
invariant :u0:Pm3 + u0:Pback3 + u0:Pout3 + -1'u4:Pm2 + -1'u4:Pout2 + -1'u4:Pback2 = 0
invariant :u0:P2 + u4:Pm2 + u4:Pout2 + u4:Pback2 = 5
invariant :u4:P3 + u4:Pm2 + u4:Pout2 + u4:Pback2 = 5
invariant :i2:u2:Pm1 + i2:u2:Pback1 + i2:u3:P1 + i2:u3:Pout1 = 5
invariant :u1:P4 + u1:Pm4 + u1:Pback4 + u1:Pout4 = 5
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 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.184257,23540,1,0,11735,2912,220,18473,132,17733,8552
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("(u4.Pm2>=1)")))
Formula 3 simplified : !X"(u4.Pm2>=1)"
4 unique states visited
4 strongly connected components in search stack
4 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.184823,23540,1,0,11735,2912,227,18473,133,17741,8568
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X(F("(i2.u2.Pm1>=1)")))U("(u1.Pm4>=1)"))))
Formula 4 simplified : !F(XF"(i2.u2.Pm1>=1)" U "(u1.Pm4>=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.185221,23804,1,0,11737,2912,243,18478,134,17741,8608
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(G(X("(((u0.P2>=1)&&(u1.Pout4>=1))&&(u4.P3>=1))"))))U(F(("(i2.u3.Pout1>=1)")U("(((u0.P2>=1)&&(u1.Pout4>=1))&&(u4.P3>=1))")))))
Formula 5 simplified : !(XGX"(((u0.P2>=1)&&(u1.Pout4>=1))&&(u4.P3>=1))" U F("(i2.u3.Pout1>=1)" U "(((u0.P2>=1)&&(u1.Pout4>=1))&&(u4.P3>=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,0.18702,23804,1,0,11927,2955,267,18626,134,17854,9009
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(F(F(X("(u1.Pm4>=1)")))))))
Formula 6 simplified : !GFX"(u1.Pm4>=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,0.188505,24056,1,0,12017,2981,267,18737,134,18007,9160
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(G(X("(u0.Pback3>=1)"))))U(F("(u0.Pback3>=1)"))))
Formula 7 simplified : !(GX"(u0.Pback3>=1)" U F"(u0.Pback3>=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,0.195579,24056,1,0,12744,3075,287,19515,134,18491,10179
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G(G("(u1.P4>=1)"))))U(F("(u1.P4>=1)"))))
Formula 8 simplified : !(XG"(u1.P4>=1)" U F"(u1.P4>=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.195967,24312,1,0,12744,3075,298,19515,134,18491,10190
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(i2.u3.Pout1>=1)"))
Formula 9 simplified : !"(i2.u3.Pout1>=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.196272,24312,1,0,12744,3075,301,19515,134,18491,10194
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(G("(i2.u3.Pout1>=1)")))U("(u0.Pback3>=1)")))
Formula 10 simplified : !(FG"(i2.u3.Pout1>=1)" U "(u0.Pback3>=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,0.198793,24512,1,0,12896,3097,310,19665,134,18553,10636
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X("(i2.u2.Pback1>=1)")))
Formula 11 simplified : !X"(i2.u2.Pback1>=1)"
4 unique states visited
4 strongly connected components in search stack
4 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.199157,24512,1,0,12896,3097,313,19665,134,18553,10641
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(("(i2.u2.Pm1>=1)")U(X(X("(u1.Pm4>=1)"))))))
Formula 12 simplified : !G("(i2.u2.Pm1>=1)" U XX"(u1.Pm4>=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,0.201728,24956,1,0,12947,3111,318,19727,134,18578,10760
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("(u4.Pm2>=1)"))
Formula 13 simplified : !"(u4.Pm2>=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.201956,24956,1,0,12947,3111,318,19727,134,18578,10763
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((("(i2.u2.Pm1>=1)")U("(u4.Pm2>=1)"))U(("(u1.Pback4>=1)")U(G("(u0.Pm3>=1)")))))
Formula 14 simplified : !(("(i2.u2.Pm1>=1)" U "(u4.Pm2>=1)") U ("(u1.Pback4>=1)" U G"(u0.Pm3>=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.205992,25900,1,0,12947,3111,398,19727,134,18578,10815
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X("(u1.P4>=1)")))
Formula 15 simplified : !X"(u1.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.206223,25900,1,0,12947,3111,398,19727,134,18578,10821
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Kanban-PT-0005-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1527499756244

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

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 09:29:15 2018
network size: 16 nodes, 56 links, 32 weight
quality increased from -0.0772569 to 0.630208
end computation: Mon May 28 09:29:15 2018
level 1:
start computation: Mon May 28 09:29:15 2018
network size: 5 nodes, 21 links, 32 weight
quality increased from 0.630208 to 0.664931
end computation: Mon May 28 09:29:15 2018
level 2:
start computation: Mon May 28 09:29:15 2018
network size: 4 nodes, 14 links, 32 weight
quality increased from 0.664931 to 0.664931
end computation: Mon May 28 09:29:15 2018
End: Mon May 28 09:29:15 2018
Total duration: 0 sec
0.664931
May 28, 2018 9:29:15 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 9:29:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 18 ms
May 28, 2018 9:29:15 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 9:29:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
May 28, 2018 9:29:15 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 28, 2018 9:29:15 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 16 transitions.
May 28, 2018 9:29:15 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 5 place invariants in 9 ms
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 28, 2018 9:29:15 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 198ms 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="Kanban-PT-0005"
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/Kanban-PT-0005.tgz
mv Kanban-PT-0005 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 Kanban-PT-0005, 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-152732585700002"
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 ;