Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is GPPP-PT-C0001N0000000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-blw3-149440267000510
=====================================================================

--------------------
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-0
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-1
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
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-2
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-3
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-4
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-5
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-6
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-7
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-8
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496296317203


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F(("E4P>=1")&&("Xu5P>=1")))U((X(("E4P>=1")&&("Xu5P>=1")))U(("ATP>=1")&&("Gluc>=1")))))
Formula 0 simplified : !(F("E4P>=1" & "Xu5P>=1") U (X("E4P>=1" & "Xu5P>=1") U ("ATP>=1" & "Gluc>=1")))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
invariant : 1'Pi + -1'ATP + -1'NADplus + -1'ADP + 1'Lac= -6
invariant : 1'ATP + 1'ADP + 7'start= 11
invariant : 1'Xu5P + -2'R5P + -1'S7P + -1'E4P + 1'a2= 0
invariant : 1'NADplus + 1'NADH= 2
invariant : 1'Pi + 1'Ru5P + 1'Xu5P + 1'R5P + 1'S7P + 1'GAP + 1'E4P + 1'F6P + 1'G6P + 2'FBP + 1'DHAP + 2'_1_3_BPG + -1'ADP + 1'_3PG + 1'_2PG + 1'PEP= 0
invariant : -1'Pi + 1'NADplus + -1'Ru5P + -1'Xu5P + -1'R5P + -1'S7P + -1'GAP + -1'E4P + -1'F6P + -1'G6P + -2'FBP + -1'DHAP + -1'_1_3_BPG + 1'ADP + 1'Pyr= 2
invariant : 12'Pi + -20'Ru5P + -20'Xu5P + -20'R5P + -28'S7P + -12'GAP + -16'E4P + -24'F6P + -21'G6P + -24'FBP + -12'DHAP + -21'Gluc + 1'b2= 0
invariant : -1'Xu5P + 2'R5P + 1'S7P + 1'E4P + 1'a1= 2
invariant : -8'Pi + 14'Ru5P + 14'Xu5P + 14'R5P + 21'S7P + 7'GAP + 7'E4P + 14'F6P + 14'G6P + 14'FBP + 7'DHAP + 14'Gluc + 1'c2= 0
invariant : -12'Pi + 20'Ru5P + 20'Xu5P + 20'R5P + 28'S7P + 12'GAP + 16'E4P + 24'F6P + 21'G6P + 24'FBP + 12'DHAP + 21'Gluc + 1'b1= 3
invariant : 8'Pi + -14'Ru5P + -14'Xu5P + -14'R5P + -21'S7P + -7'GAP + -7'E4P + -14'F6P + -14'G6P + -14'FBP + -7'DHAP + -14'Gluc + 1'c1= 7
invariant : 2'GSSG + 1'GSH= 2
invariant : 1'NADPplus + 1'NADPH= 2
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
36 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.398091,35924,1,0,238,52537,88,81,1094,57509,459
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(F((G("GSH>=2"))U(X((("S7P>=1")&&("GAP>=1"))&&("c1>=7")))))))
Formula 1 simplified : !XF(G"GSH>=2" U X("GAP>=1" & "S7P>=1" & "c1>=7"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 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.426085,37420,1,0,331,57756,107,105,1103,63340,699
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(F((F((("NADPplus>=2")&&("G6P>=1"))&&("b2>=1")))U(F(("ADP>=1")&&("_1_3_BPG>=1")))))))
Formula 2 simplified : !XF(F("G6P>=1" & "NADPplus>=2" & "b2>=1") U F("ADP>=1" & "_1_3_BPG>=1"))
3 unique states visited
3 strongly connected components in search stack
3 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.441613,38068,1,0,412,60252,121,117,1108,66069,917
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((("Pyr>=1")&&("NADH>=1")))
Formula 3 simplified : !("NADH>=1" & "Pyr>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 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.490392,39152,1,0,412,62725,135,117,1146,71822,929
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((G("FBP>=1"))U(G(("F6P>=1")&&("ATP>=1")))))
Formula 4 simplified : !(G"FBP>=1" U G("ATP>=1" & "F6P>=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.493194,40244,1,0,412,62725,158,117,1162,71823,938
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(G((G(("GSSG>=1")&&("NADPH>=1")))U(X("DHAP>=1"))))))
Formula 5 simplified : !FG(G("GSSG>=1" & "NADPH>=1") U X"DHAP>=1")
73 unique states visited
2 strongly connected components in search stack
73 transitions explored
73 items max in DFS search stack
146 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.95371,78696,1,0,1679,231420,189,578,1180,360331,3615
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((("ATP>=1")&&("Gluc>=1")))
Formula 6 simplified : !("ATP>=1" & "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,1.95449,78956,1,0,1679,231420,189,578,1180,360331,3615
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(("ATP>=7")&&("Lac>=7"))))
Formula 7 simplified : !F("ATP>=7" & "Lac>=7")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 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.12235,83408,1,0,1868,256872,203,657,1185,393355,4135
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(X(G(F(F(("ADP>=1")&&("_1_3_BPG>=1"))))))))
Formula 8 simplified : !FXGF("ADP>=1" & "_1_3_BPG>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
11 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.23182,86492,1,0,1947,272432,203,658,1185,409040,4341
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X(X(X(X("start>=1")))))))
Formula 9 simplified : !XXXXX"start>=1"
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.23689,86640,1,0,1950,272734,206,658,1186,409710,4354
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X((("Pyr>=1")&&("NADH>=1"))U(G("FBP>=1")))))
Formula 10 simplified : !X(("NADH>=1" & "Pyr>=1") U G"FBP>=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,2.24016,86932,1,0,1950,272824,234,658,1208,409859,4365
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
Checking formula 11 : !((((("ADP>=1")&&("_1_3_BPG>=1"))U(F(("Ru5P>=1")&&("a2>=1"))))U(G(("ATP>=7")&&("Lac>=7")))))
Formula 11 simplified : !((("ADP>=1" & "_1_3_BPG>=1") U F("Ru5P>=1" & "a2>=1")) U G("ATP>=7" & "Lac>=7"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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.26797,87696,1,0,2025,276387,261,670,1222,413843,4560
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
Checking formula 12 : !((F(X(G(("FBP>=1")U("GAP>=1"))))))
Formula 12 simplified : !FXG("FBP>=1" U "GAP>=1")
25 unique states visited
3 strongly connected components in search stack
25 transitions explored
25 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,2.56372,91564,1,0,2075,297685,275,692,1229,441427,4763
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
Checking formula 13 : !(((F(G(X((("S7P>=1")&&("GAP>=1"))&&("c1>=7")))))U(X(X(("Ru5P>=1")&&("a1>=2"))))))
Formula 13 simplified : !(FGX("GAP>=1" & "S7P>=1" & "c1>=7") U XX("Ru5P>=1" & "a1>=2"))
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 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.57206,91908,1,0,2096,298065,283,703,1233,442257,4822
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
Checking formula 14 : !((("ATP>=1")&&("Gluc>=1")))
Formula 14 simplified : !("ATP>=1" & "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,2.5727,91908,1,0,2096,298065,283,703,1233,442257,4822
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
Checking formula 15 : !(((("F6P>=1")&&("ATP>=1"))U(F(F(G((("S7P>=1")&&("GAP>=1"))&&("c1>=7")))))))
Formula 15 simplified : !(("ATP>=1" & "F6P>=1") U FG("GAP>=1" & "S7P>=1" & "c1>=7"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 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.6682,94680,1,0,2308,308598,297,855,1238,458384,5452
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
Exit code :0

BK_STOP 1496296322872

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 01, 2017 5:51:58 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 5:51:58 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 37 ms
Jun 01, 2017 5:51:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 01, 2017 5:51:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 32 ms
Jun 01, 2017 5:51:59 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
Jun 01, 2017 5:51:59 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 13 ms
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 33 variables to be positive in 63 ms
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 22 transitions.
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/22 took 16 ms. Total solver calls (SAT/UNSAT): 4(1/3)
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 159 ms. Total solver calls (SAT/UNSAT): 95(28/67)
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 22 transitions.
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 193 ms. Total solver calls (SAT/UNSAT): 95(43/52)
Jun 01, 2017 5:51:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 22 transitions.
Jun 01, 2017 5:52:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 490 ms. Total solver calls (SAT/UNSAT): 253(164/89)
Jun 01, 2017 5:52:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 22 transitions.
Jun 01, 2017 5:52:02 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
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

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000001.tgz
mv GPPP-PT-C0001N0000000001 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is 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 r030-blw3-149440267000510"
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 ;