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 212K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.7K 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 9.9K 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 8.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is GPPP-PT-C0001N0000000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r249-blw7-152732550500070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527993826763

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/graph2966440664944991033.txt, -o, /tmp/graph2966440664944991033.bin, -w, /tmp/graph2966440664944991033.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/graph2966440664944991033.bin, -l, -1, -v, -w, /tmp/graph2966440664944991033.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 : !((("(i5.u4.DHAP>=1)")U(F(X(X("((i0.u1.Pyr>=1)&&(i0.u1.NADH>=1))"))))))
Formula 0 simplified : !("(i5.u4.DHAP>=1)" U FXX"((i0.u1.Pyr>=1)&&(i0.u1.NADH>=1))")
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.091321,19140,1,0,5827,1795,458,6829,442,4719,11179
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((X("((u8.Ru5P>=1)&&(u8.a2>=1))"))U(("((i5.u4.E4P>=1)&&(u8.Xu5P>=1))")U("((i2.u3.GSSG>=1)&&(i2.u2.NADPH>=1))")))))
Formula 1 simplified : !F(X"((u8.Ru5P>=1)&&(u8.a2>=1))" U ("((i5.u4.E4P>=1)&&(u8.Xu5P>=1))" U "((i2.u3.GSSG>=1)&&(i2.u2.NADPH>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
invariant :i5:u9:c1 + i5:u9:c2 = 7
invariant :u8:a1 + u8:a2 = 2
0 ticks for the emptiness check
invariant :4'u7:F6P + -11'u7:G6P + -5'u7:b2 + -16'u8:Ru5P + -48'u8:R5P + -48'u8:S7P + 16'u8:a2 + -4'i0:u0:_1_3_BPG + 4'i0:u0:ADP + -4'i0:u1:NADH + 4'i0:u1:Pyr + -7'i0:u6:Gluc + 4'i5:u4:E4P + -8'i5:u9:c2 = 0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
invariant :-4'u7:F6P + 11'u7:G6P + 5'u7:b2 + 16'u8:Ru5P + 48'u8:R5P + 48'u8:S7P + -16'u8:a2 + 4'i0:u0:ATP + 4'i0:u0:_1_3_BPG + 4'i0:u1:NADH + -4'i0:u1:Pyr + 28'i0:u6:start + 7'i0:u6:Gluc + -4'i5:u4:E4P + 8'i5:u9:c2 = 44
invariant :i0:u1:NADplus + i0:u1:NADH = 2
invariant :6'u7:F6P + -2'u7:b2 + -2'u8:Ru5P + -6'u8:R5P + -9'u8:S7P + 2'u8:a2 + 3'i5:u4:GAP + 9'i5:u4:E4P + 6'i5:u4:FBP + 3'i5:u4:DHAP + -3'i5:u9:c2 = 0
invariant :u5:_3PG + u5:_2PG + u5:PEP + i0:u0:_1_3_BPG + -1'i0:u1:NADH + i0:u1:Pyr = 0
invariant :u8:Xu5P + -2'u8:R5P + -1'u8:S7P + u8:a2 + -1'i5:u4:E4P = 0
invariant :21'u7:G6P + 7'u7:b2 + 28'u8:Ru5P + 84'u8:R5P + 84'u8:S7P + -28'u8:a2 + 12'i0:u1:NADH + 12'i0:u1:Lac + 84'i0:u6:start + 21'i0:u6:Gluc + 12'i5:u9:c2 = 84
invariant :u7:b1 + u7:b2 = 3
invariant :i2:u2:NADPplus + i2:u2:NADPH = 2
invariant :2'i2:u3:GSSG + i2:u3:GSH = 2
invariant :-21'u7:G6P + -7'u7:b2 + -28'u8:Ru5P + -84'u8:R5P + -84'u8:S7P + 28'u8:a2 + 12'i0:u6:Pi + -21'i0:u6:Gluc + -12'i5:u9:c2 = 0
STATS,0,0.093923,19516,1,0,5904,1797,518,6892,443,4725,11838
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("((i0.u0.ATP>=1)&&(i0.u6.Gluc>=1))")))
Formula 2 simplified : !G"((i0.u0.ATP>=1)&&(i0.u6.Gluc>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.109063,19768,1,0,6770,1826,549,8614,443,4904,15195
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(("(i0.u6.start>=1)")U(X("((u5.PEP>=1)&&(i0.u0.ADP>=1))"))))))
Formula 3 simplified : !FX("(i0.u6.start>=1)" U X"((u5.PEP>=1)&&(i0.u0.ADP>=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.118434,20284,1,0,7699,1832,577,9397,443,4964,17554
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G("((i2.u3.GSSG>=1)&&(i2.u2.NADPH>=1))")))
Formula 4 simplified : !G"((i2.u3.GSSG>=1)&&(i2.u2.NADPH>=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.119066,20548,1,0,7699,1832,585,9397,443,4964,17564
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X("((u7.F6P>=1)&&(i0.u0.ATP>=1))"))))
Formula 5 simplified : !XX"((u7.F6P>=1)&&(i0.u0.ATP>=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.120242,20548,1,0,7741,1832,590,9447,443,4967,17717
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(i5.u4.DHAP>=1)"))
Formula 6 simplified : !"(i5.u4.DHAP>=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.12048,20548,1,0,7741,1832,595,9447,444,4967,17724
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(("(i0.u6.start>=1)")U(X("(i5.u4.DHAP>=1)"))))))
Formula 7 simplified : !XX("(i0.u6.start>=1)" U X"(i5.u4.DHAP>=1)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.121975,20800,1,0,7791,1832,601,9499,444,4971,17886
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("((u7.G6P>=1)&&(u7.b1>=3))"))
Formula 8 simplified : !"((u7.G6P>=1)&&(u7.b1>=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,0.122292,20800,1,0,7791,1832,611,9499,448,4971,17890
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((u5.PEP>=1)&&(i0.u0.ADP>=1))"))
Formula 9 simplified : !"((u5.PEP>=1)&&(i0.u0.ADP>=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.122672,20992,1,0,7791,1832,611,9499,448,4971,17902
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("((u7.G6P>=1)&&(u7.b1>=3))"))
Formula 10 simplified : !"((u7.G6P>=1)&&(u7.b1>=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,0.122935,20992,1,0,7791,1832,611,9499,448,4971,17902
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(X(X(F("(u5._2PG>=1)")))))))
Formula 11 simplified : !XXXXF"(u5._2PG>=1)"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.129181,20992,1,0,8173,1832,637,9884,448,4972,19241
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("((i0.u0.ATP>=1)&&(i0.u6.Gluc>=1))"))
Formula 12 simplified : !"((i0.u0.ATP>=1)&&(i0.u6.Gluc>=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.129454,20992,1,0,8173,1832,637,9884,448,4972,19241
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((("((u7.G6P>=1)&&(u7.b1>=3))")U("(i5.u4.FBP>=1)"))U("((u8.Ru5P>=1)&&(u8.a1>=2))"))))
Formula 13 simplified : !X(("((u7.G6P>=1)&&(u7.b1>=3))" U "(i5.u4.FBP>=1)") U "((u8.Ru5P>=1)&&(u8.a1>=2))")
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.131778,21476,1,0,8195,1832,688,9915,452,4972,19348
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F("((u8.Ru5P>=1)&&(u8.a1>=2))")))
Formula 14 simplified : !F"((u8.Ru5P>=1)&&(u8.a1>=2))"
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.13235,21476,1,0,8195,1832,700,9915,452,4972,19414
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((G(X(F("(i5.u4.FBP>=1)"))))U(("((i0.u0.ATP>=1)&&(i0.u6.Gluc>=1))")U("((u5.PEP>=1)&&(i0.u0.ADP>=1))"))))
Formula 15 simplified : !(GXF"(i5.u4.FBP>=1)" U ("((i0.u0.ATP>=1)&&(i0.u6.Gluc>=1))" U "((u5.PEP>=1)&&(i0.u0.ADP>=1))"))
26 unique states visited
26 strongly connected components in search stack
26 transitions explored
26 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.147146,22140,1,0,8790,1853,703,10701,452,5223,21418
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1527993828610

--------------------
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:43:47 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]
Jun 03, 2018 2:43:47 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 2:43:47 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 27 ms
Jun 03, 2018 2:43:47 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 03, 2018 2:43:48 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 4 ms
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 17 ms
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 7 ms
Begin: Sun Jun 3 02:43:48 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 02:43:48 2018
network size: 33 nodes, 148 links, 44 weight
quality increased from -0.0392419 to 0.50617
end computation: Sun Jun 3 02:43:48 2018
level 1:
start computation: Sun Jun 3 02:43:48 2018
network size: 10 nodes, 52 links, 44 weight
quality increased from 0.50617 to 0.567177
end computation: Sun Jun 3 02:43:48 2018
level 2:
start computation: Sun Jun 3 02:43:48 2018
network size: 6 nodes, 22 links, 44 weight
quality increased from 0.567177 to 0.567177
end computation: Sun Jun 3 02:43:48 2018
End: Sun Jun 3 02:43:48 2018
Total duration: 0 sec
0.567177
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 5 ms
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 2 redundant transitions.
Jun 03, 2018 2:43:48 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Jun 03, 2018 2:43:48 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 22 transitions.
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 9 ms
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
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)
Jun 03, 2018 2:43:48 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 133ms 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="GPPP-PT-C0001N0000000001"
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/GPPP-PT-C0001N0000000001.tgz
mv GPPP-PT-C0001N0000000001 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 GPPP-PT-C0001N0000000001, 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 r249-blw7-152732550500070"
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 ;