About the Execution of ITS-Tools for GPPP-PT-C0001N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
684.320 | 24188.00 | 48128.00 | 126.60 | FFFFFFFFTFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is GPPP-PT-C0001N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-blw3-149440267000519
=====================================================================
--------------------
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-C0001N0000000010-LTLFireability-0
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-1
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-15
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-2
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-3
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-4
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-5
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-6
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-7
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-8
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1496296472271
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 : !((("_3PG>=1")U("GAP>=1")))
Formula 0 simplified : !("_3PG>=1" U "GAP>=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= -60
invariant : 1'ATP + 1'ADP + 7'start= 47
invariant : 1'Xu5P + -2'R5P + -1'S7P + -1'E4P + 1'a2= 0
invariant : 1'NADplus + 1'NADH= 20
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= 20
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= 20
invariant : 1'NADPplus + 1'NADPH= 20
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
329 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.31257,79872,1,0,44,256813,75,25,1218,296316,66
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(G(X(X("DHAP>=1")))))))
Formula 1 simplified : !GXX"DHAP>=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,3.31661,80468,1,0,46,256982,81,25,1219,296554,79
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(("ATP>=1")&&("Gluc>=1"))))
Formula 2 simplified : !F("ATP>=1" & "Gluc>=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.31735,80564,1,0,47,256986,95,27,1224,296571,87
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(X(("Xu5P>=1")&&("R5P>=1")))))
Formula 3 simplified : !FX("R5P>=1" & "Xu5P>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
21 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.52416,85300,1,0,159,274189,109,53,1229,319500,334
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("_2PG>=1"))
Formula 4 simplified : !"_2PG>=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,3.52461,85320,1,0,159,274189,112,53,1230,319500,336
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(("G6P>=1")&&("b1>=3"))))
Formula 5 simplified : !X("G6P>=1" & "b1>=3")
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,3.52741,85584,1,0,159,274305,120,53,1235,319678,340
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((("F6P>=1")&&("ATP>=1")))
Formula 6 simplified : !("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,3.5279,85584,1,0,159,274305,126,53,1239,319678,342
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(X(F(("_3PG>=1")U("_2PG>=1"))))))
Formula 7 simplified : !GXF("_3PG>=1" U "_2PG>=1")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
156 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,5.09206,111564,1,0,342,408048,132,54,1239,465808,810
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((G(X(F((("NADPplus>=2")&&("G6P>=1"))&&("b2>=1")))))U(F(F(X("_3PG>=1"))))))
Formula 8 simplified : !(GXF("G6P>=1" & "NADPplus>=2" & "b2>=1") U FX"_3PG>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
64 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,5.72906,126764,1,0,490,473681,139,90,1239,562954,1134
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X(F(("GSH>=2")U("GAP>=1"))))))
Formula 9 simplified : !XXF("GSH>=2" U "GAP>=1")
3 unique states visited
0 strongly connected components in search stack
2 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,5.81474,129368,1,0,601,485825,146,115,1239,579303,1372
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((((("NADPplus>=2")&&("G6P>=1"))&&("b2>=1"))U("DHAP>=1")))
Formula 10 simplified : !(("G6P>=1" & "NADPplus>=2" & "b2>=1") U "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,5.81596,129540,1,0,601,485825,170,115,1259,579303,1376
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(("F6P>=1")&&("ATP>=1"))))
Formula 11 simplified : !X("ATP>=1" & "F6P>=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,5.81636,129724,1,0,601,485825,170,115,1259,579303,1378
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(("GSSG>=1")&&("NADPH>=1"))))
Formula 12 simplified : !F("GSSG>=1" & "NADPH>=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,5.82198,129740,1,0,636,486425,184,125,1264,580080,1475
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G(("PEP>=1")&&("ADP>=1")))))
Formula 13 simplified : !FG("ADP>=1" & "PEP>=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]
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.
BK_STOP 1496296496459
--------------------
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:54:33 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 37 ms
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 25 ms
Jun 01, 2017 5:54:34 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
Jun 01, 2017 5:54:34 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 16 ms
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 33 variables to be positive in 64 ms
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 22 transitions.
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/22 took 13 ms. Total solver calls (SAT/UNSAT): 4(1/3)
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 191 ms. Total solver calls (SAT/UNSAT): 95(26/69)
Jun 01, 2017 5:54:34 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 22 transitions.
Jun 01, 2017 5:54:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 185 ms. Total solver calls (SAT/UNSAT): 95(39/56)
Jun 01, 2017 5:54:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 22 transitions.
Jun 01, 2017 5:54:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 480 ms. Total solver calls (SAT/UNSAT): 253(169/84)
Jun 01, 2017 5:54:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 22 transitions.
Jun 01, 2017 5:54:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 19991 ms. Total solver calls (SAT/UNSAT): 37(0/37)
Jun 01, 2017 5:54:55 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 21081ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 5:54:56 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>([]((LTLAP11==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 37, guards 22
pins2lts-seq, 0.002: LTL layer: formula: <>([]((LTLAP11==true)))
pins2lts-seq, 0.002: Expression is: (<> ([] (LTLAP11 == true )))
pins2lts-seq, 0.002: buchi has 2 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP11 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP11 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.003: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.003: There are 38 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 34, there are 26 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.003: Visible groups: 0 / 26, labels: 1 / 38
pins2lts-seq, 0.003: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now
Jun 01, 2017 5:54:56 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, <>([](X(((LTLAP4==true))U((LTLAP12==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: <>([](X(((LTLAP4==true))U((LTLAP12==true)))))
pins2lts-seq, 0.000: Expression is: (<> ([] (X ((LTLAP4 == true ) U (LTLAP12 == true )))))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP12 == true ) && !(LTLAP4 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP12 == true ) && !(LTLAP4 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP12 == true ) && !(LTLAP4 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: There are 38 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 34, there are 30 groups
pins2lts-seq, 0.000: Running scc search strategy
pins2lts-seq, 0.000: Using a tree for state storage
pins2lts-seq, 0.001: accepting cycle found!
pins2lts-seq, 0.001: exiting now
Jun 01, 2017 5:54:56 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (X((LTLAP13==true)))U([]([](<>((LTLAP14==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: (X((LTLAP13==true)))U([]([](<>((LTLAP14==true)))))
pins2lts-seq, 0.000: Expression is: ((X (LTLAP13 == true )) U ([] ([] (<> (LTLAP14 == true )))))
pins2lts-seq, 0.000: buchi has 6 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP14 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP14 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: -> 4, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP14 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP14 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 3, | !(LTLAP14 == true ) && !(LTLAP13 == true )
pins2lts-seq, 0.000: state 3: accepting
pins2lts-seq, 0.000: -> 3, | !(LTLAP14 == true )
pins2lts-seq, 0.000: state 4: non-accepting
pins2lts-seq, 0.000: -> 5, | !(LTLAP13 == true )
pins2lts-seq, 0.000: -> 3, | !(LTLAP14 == true ) && !(LTLAP13 == true )
pins2lts-seq, 0.000: state 5: non-accepting
pins2lts-seq, 0.000: -> 5, | true
pins2lts-seq, 0.000: -> 3, | !(LTLAP14 == true )
pins2lts-seq, 0.000: There are 38 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 34, there are 34 groups
pins2lts-seq, 0.000: Running scc search strategy
pins2lts-seq, 0.000: Using a tree for state storage
pins2lts-seq, 0.001: accepting cycle found!
pins2lts-seq, 0.001: exiting now
Jun 01, 2017 5:54:56 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 01, 2017 5:54:56 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 01, 2017 5:54:56 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
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-C0001N0000000010"
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-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 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-C0001N0000000010, 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-149440267000519"
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 '
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 ;