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 Philosophers-COL-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-149440871800159
=====================================================================

--------------------
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 Philosophers-COL-000005-LTLFireability-0
FORMULA_NAME Philosophers-COL-000005-LTLFireability-1
FORMULA_NAME Philosophers-COL-000005-LTLFireability-10
FORMULA_NAME Philosophers-COL-000005-LTLFireability-11
FORMULA_NAME Philosophers-COL-000005-LTLFireability-12
FORMULA_NAME Philosophers-COL-000005-LTLFireability-13
FORMULA_NAME Philosophers-COL-000005-LTLFireability-14
FORMULA_NAME Philosophers-COL-000005-LTLFireability-15
FORMULA_NAME Philosophers-COL-000005-LTLFireability-2
FORMULA_NAME Philosophers-COL-000005-LTLFireability-3
FORMULA_NAME Philosophers-COL-000005-LTLFireability-4
FORMULA_NAME Philosophers-COL-000005-LTLFireability-5
FORMULA_NAME Philosophers-COL-000005-LTLFireability-6
FORMULA_NAME Philosophers-COL-000005-LTLFireability-7
FORMULA_NAME Philosophers-COL-000005-LTLFireability-8
FORMULA_NAME Philosophers-COL-000005-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496345062772


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 : !((G(F(((((("Philo0.catch2_0>=1")&&("Philo4.fork_4>=1"))||(("Philo1.catch2_1>=1")&&("Philo0.fork_0>=1")))||(("Philo2.catch2_2>=1")&&("Philo1.fork_1>=1")))||(("Philo3.catch2_3>=1")&&("Philo2.fork_2>=1")))||(("Philo4.catch2_4>=1")&&("Philo3.fork_3>=1"))))))
Formula 0 simplified : !GF(("Philo0.catch2_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.catch2_1>=1") | ("Philo1.fork_1>=1" & "Philo2.catch2_2>=1") | ("Philo2.fork_2>=1" & "Philo3.catch2_3>=1") | ("Philo3.fork_3>=1" & "Philo4.catch2_4>=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.07429,27324,1,0,612,145,303,451,121,197,1220
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(G((((("Philo0.eat_0>=1")||("Philo1.eat_1>=1"))||("Philo2.eat_2>=1"))||("Philo3.eat_3>=1"))||("Philo4.eat_4>=1"))))))
Formula 1 simplified : !FG("Philo0.eat_0>=1" | "Philo1.eat_1>=1" | "Philo2.eat_2>=1" | "Philo3.eat_3>=1" | "Philo4.eat_4>=1")
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.08309,27448,1,0,1526,146,358,1144,122,200,2790
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((((("Philo0.eat_0>=1")||("Philo1.eat_1>=1"))||("Philo2.eat_2>=1"))||("Philo3.eat_3>=1"))||("Philo4.eat_4>=1")))
Formula 2 simplified : !("Philo0.eat_0>=1" | "Philo1.eat_1>=1" | "Philo2.eat_2>=1" | "Philo3.eat_3>=1" | "Philo4.eat_4>=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.084467,27716,1,0,1529,146,360,1149,122,200,2850
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(((((("Philo0.catch2_0>=1")&&("Philo4.fork_4>=1"))||(("Philo1.catch2_1>=1")&&("Philo0.fork_0>=1")))||(("Philo2.catch2_2>=1")&&("Philo1.fork_1>=1")))||(("Philo3.catch2_3>=1")&&("Philo2.fork_2>=1")))||(("Philo4.catch2_4>=1")&&("Philo3.fork_3>=1")))))
Formula 3 simplified : !X(("Philo0.catch2_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.catch2_1>=1") | ("Philo1.fork_1>=1" & "Philo2.catch2_2>=1") | ("Philo2.fork_2>=1" & "Philo3.catch2_3>=1") | ("Philo3.fork_3>=1" & "Philo4.catch2_4>=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.093239,27736,1,0,1577,146,360,1182,122,200,3079
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(F((((((("Philo0.catch2_0>=1")&&("Philo4.fork_4>=1"))||(("Philo1.catch2_1>=1")&&("Philo0.fork_0>=1")))||(("Philo2.catch2_2>=1")&&("Philo1.fork_1>=1")))||(("Philo3.catch2_3>=1")&&("Philo2.fork_2>=1")))||(("Philo4.catch2_4>=1")&&("Philo3.fork_3>=1")))U(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1"))))))))
Formula 4 simplified : !FXF((("Philo0.catch2_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.catch2_1>=1") | ("Philo1.fork_1>=1" & "Philo2.catch2_2>=1") | ("Philo2.fork_2>=1" & "Philo3.catch2_3>=1") | ("Philo3.fork_3>=1" & "Philo4.catch2_4>=1")) U (("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=1")))
2 unique states visited
0 strongly connected components in search stack
1 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.106743,27792,1,0,1579,146,619,1184,126,200,3246
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X(G(((((("Philo0.catch2_0>=1")&&("Philo4.fork_4>=1"))||(("Philo1.catch2_1>=1")&&("Philo0.fork_0>=1")))||(("Philo2.catch2_2>=1")&&("Philo1.fork_1>=1")))||(("Philo3.catch2_3>=1")&&("Philo2.fork_2>=1")))||(("Philo4.catch2_4>=1")&&("Philo3.fork_3>=1"))))))U((F(((((("Philo0.catch2_0>=1")&&("Philo4.fork_4>=1"))||(("Philo1.catch2_1>=1")&&("Philo0.fork_0>=1")))||(("Philo2.catch2_2>=1")&&("Philo1.fork_1>=1")))||(("Philo3.catch2_3>=1")&&("Philo2.fork_2>=1")))||(("Philo4.catch2_4>=1")&&("Philo3.fork_3>=1"))))U(F(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1")))))))
Formula 5 simplified : !(GXG(("Philo0.catch2_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.catch2_1>=1") | ("Philo1.fork_1>=1" & "Philo2.catch2_2>=1") | ("Philo2.fork_2>=1" & "Philo3.catch2_3>=1") | ("Philo3.fork_3>=1" & "Philo4.catch2_4>=1")) U (F(("Philo0.catch2_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.catch2_1>=1") | ("Philo1.fork_1>=1" & "Philo2.catch2_2>=1") | ("Philo2.fork_2>=1" & "Philo3.catch2_3>=1") | ("Philo3.fork_3>=1" & "Philo4.catch2_4>=1")) U F(("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=1"))))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
invariant : -1'Philo0:think_0 + 1'Philo0:fork_0 + -1'Philo0:catch1_0 + 1'Philo1:catch1_1 + 1'Philo1:eat_1= 0
invariant : 1'Philo0:think_0 + -1'Philo0:fork_0 + 1'Philo0:catch1_0 + 1'Philo1:think_1 + 1'Philo1:catch2_1= 1
invariant : 1'Philo2:think_2 + -1'Philo2:fork_2 + 1'Philo2:catch1_2 + 1'Philo3:think_3 + 1'Philo3:catch2_3= 1
invariant : -1'Philo0:think_0 + -1'Philo0:catch2_0 + -1'Philo3:think_3 + 1'Philo3:fork_3 + -1'Philo3:catch1_3 + -1'Philo4:think_4 + 1'Philo4:fork_4 + 1'Philo4:eat_4= -1
invariant : 1'Philo3:think_3 + -1'Philo3:fork_3 + 1'Philo3:catch1_3 + 1'Philo4:think_4 + 1'Philo4:catch2_4= 1
invariant : 1'Philo1:think_1 + -1'Philo1:fork_1 + 1'Philo1:catch1_1 + 1'Philo2:think_2 + 1'Philo2:catch2_2= 1
invariant : -1'Philo1:think_1 + 1'Philo1:fork_1 + -1'Philo1:catch1_1 + 1'Philo2:catch1_2 + 1'Philo2:eat_2= 0
invariant : -1'Philo2:think_2 + 1'Philo2:fork_2 + -1'Philo2:catch1_2 + 1'Philo3:catch1_3 + 1'Philo3:eat_3= 0
invariant : 1'Philo0:think_0 + 1'Philo0:catch1_0 + 1'Philo0:catch2_0 + 1'Philo0:eat_0= 1
invariant : 1'Philo0:think_0 + 1'Philo0:catch2_0 + 1'Philo4:think_4 + -1'Philo4:fork_4 + 1'Philo4:catch1_4= 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]
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.776575,29616,1,0,1579,146,619,1184,126,200,3291
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(((((("Philo4.fork_4>=1")&&("Philo0.think_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.think_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.think_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.think_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.think_4>=1"))))U(X(G(F((((("Philo0.eat_0>=1")||("Philo1.eat_1>=1"))||("Philo2.eat_2>=1"))||("Philo3.eat_3>=1"))||("Philo4.eat_4>=1")))))))
Formula 6 simplified : !(X(("Philo0.think_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.think_1>=1") | ("Philo1.fork_1>=1" & "Philo2.think_2>=1") | ("Philo2.fork_2>=1" & "Philo3.think_3>=1") | ("Philo3.fork_3>=1" & "Philo4.think_4>=1")) U XGF("Philo0.eat_0>=1" | "Philo1.eat_1>=1" | "Philo2.eat_2>=1" | "Philo3.eat_3>=1" | "Philo4.eat_4>=1"))
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 Philosophers-COL-000005-LTLFireability-6 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-7 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-8 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-9 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Philosophers-COL-000005-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496345068294

--------------------
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 7:24:24 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 7:24:24 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 01, 2017 7:24:25 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1100 ms
Jun 01, 2017 7:24:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Jun 01, 2017 7:24:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 01, 2017 7:24:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Jun 01, 2017 7:24:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Jun 01, 2017 7:24:25 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays think, fork, catch1, catch2, eat to variables to allow decomposition.
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 5 redundant transitions.
Jun 01, 2017 7:24:26 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
Jun 01, 2017 7:24:26 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 23 ms
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 25 variables to be positive in 84 ms
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 25 transitions.
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/25 took 3 ms. Total solver calls (SAT/UNSAT): 7(3/4)
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 61 ms. Total solver calls (SAT/UNSAT): 155(75/80)
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 25 transitions.
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 59 ms. Total solver calls (SAT/UNSAT): 155(50/105)
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 25 transitions.
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 112 ms. Total solver calls (SAT/UNSAT): 325(195/130)
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 25 transitions.
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2017 7:24:26 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 592ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 7:24:27 PM 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((LTLAP3==true)))U(X([](<>((LTLAP1==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: LTL layer: formula: (X((LTLAP3==true)))U(X([](<>((LTLAP1==true)))))
pins2lts-seq, 0.001: Expression is: ((X (LTLAP3 == true )) U (X ([] (<> (LTLAP1 == true )))))
pins2lts-seq, 0.002: buchi has 6 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: -> 4, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 3, | !(LTLAP1 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.002: state 3: accepting
pins2lts-seq, 0.002: -> 3, | !(LTLAP1 == true )
pins2lts-seq, 0.002: state 4: non-accepting
pins2lts-seq, 0.002: -> 5, | !(LTLAP3 == true )
pins2lts-seq, 0.002: -> 3, | !(LTLAP1 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.002: state 5: non-accepting
pins2lts-seq, 0.002: -> 5, | true
pins2lts-seq, 0.002: -> 3, | !(LTLAP1 == true )
pins2lts-seq, 0.002: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 26, there are 37 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now

Jun 01, 2017 7:24:27 PM 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, [](((LTLAP3==true))U([](<>((LTLAP3==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: Initializing POR dependencies: labels 30, guards 25
pins2lts-seq, 0.000: LTL layer: formula: [](((LTLAP3==true))U([](<>((LTLAP3==true)))))
pins2lts-seq, 0.000: Expression is: ([] ((LTLAP3 == true ) U ([] (<> (LTLAP3 == true )))))
pins2lts-seq, 0.000: buchi has 4 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | true
pins2lts-seq, 0.001: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.001: state 1: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.001: state 2: non-accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 35 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 145 / 35, labels: 1 / 31
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.002: accepting cycle found!
pins2lts-seq, 0.002: exiting now

Jun 01, 2017 7:24:27 PM 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, []((((LTLAP2==true))U((LTLAP1==true)))U(X(<>((LTLAP3==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: []((((LTLAP2==true))U((LTLAP1==true)))U(X(<>((LTLAP3==true)))))
pins2lts-seq, 0.000: Expression is: ([] (((LTLAP2 == true ) U (LTLAP1 == true )) U (X (<> (LTLAP3 == true )))))
pins2lts-seq, 0.000: buchi has 4 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP1 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 3, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP1 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true )
pins2lts-seq, 0.000: state 3: accepting
pins2lts-seq, 0.000: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP1 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.000: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 26, there are 35 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 7:24:27 PM 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, (<>((LTLAP2==true)))U(<>((LTLAP0==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: Initializing POR dependencies: labels 30, guards 25
pins2lts-seq, 0.001: LTL layer: formula: (<>((LTLAP2==true)))U(<>((LTLAP0==true)))
pins2lts-seq, 0.001: Expression is: ((<> (LTLAP2 == true )) U (<> (LTLAP0 == true )))
pins2lts-seq, 0.001: buchi has 1 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 26 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 26, labels: 1 / 31
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.002: accepting cycle found!
pins2lts-seq, 0.002: exiting now

Jun 01, 2017 7:24:27 PM 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, (LTLAP1==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.003: Loading model from ./gal.so
pins2lts-seq, 0.003: library has no initializer
pins2lts-seq, 0.003: loading model GAL
pins2lts-seq, 0.004: completed loading model GAL
pins2lts-seq, 0.004: Initializing POR dependencies: labels 30, guards 25
pins2lts-seq, 0.004: LTL layer: formula: (LTLAP1==true)
pins2lts-seq, 0.004: Expression is: (LTLAP1 == true )
pins2lts-seq, 0.004: buchi has 2 states
pins2lts-seq, 0.004: state 0: accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.004: state 1: accepting
pins2lts-seq, 0.004: -> 1, | true
pins2lts-seq, 0.004: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.004: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.004: State length is 26, there are 27 groups
pins2lts-seq, 0.004: Running scc search strategy
pins2lts-seq, 0.004: Using a tree for state storage
pins2lts-seq, 0.004: Visible groups: 0 / 27, labels: 1 / 31
pins2lts-seq, 0.004: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now

Jun 01, 2017 7:24:27 PM 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, <>([]([](<>([]((LTLAP2==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: Initializing POR dependencies: labels 30, guards 25
pins2lts-seq, 0.000: LTL layer: formula: <>([]([](<>([]((LTLAP2==true))))))
pins2lts-seq, 0.000: Expression is: (<> ([] ([] (<> ([] (LTLAP2 == true ))))))
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 29 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 29, labels: 1 / 31
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.002: accepting cycle found!
pins2lts-seq, 0.002: exiting now

Jun 01, 2017 7:24:27 PM 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((X((LTLAP4==true)))U(X((LTLAP1==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((X((LTLAP4==true)))U(X((LTLAP1==true)))))
pins2lts-seq, 0.000: Expression is: (<> (X ((X (LTLAP4 == true )) U (X (LTLAP1 == true )))))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 2, | true
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.000: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 26, there are 28 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 7:24:27 PM 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(((LTLAP0==true))U((LTLAP2==true))))U(X([]((LTLAP1==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(((LTLAP0==true))U((LTLAP2==true))))U(X([]((LTLAP1==true))))
pins2lts-seq, 0.000: Expression is: ((X ((LTLAP0 == true ) U (LTLAP2 == true ))) U (X ([] (LTLAP1 == true ))))
pins2lts-seq, 0.000: buchi has 7 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP1 == true ) && !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 3, | !(LTLAP1 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 4, | true
pins2lts-seq, 0.000: -> 5, | !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 6, | !(LTLAP2 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | true
pins2lts-seq, 0.000: state 3: accepting
pins2lts-seq, 0.000: -> 3, | !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.000: state 4: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP1 == true ) && !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 3, | !(LTLAP1 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 4, | true
pins2lts-seq, 0.000: -> 5, | !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 6, | !(LTLAP2 == true )
pins2lts-seq, 0.000: state 5: non-accepting
pins2lts-seq, 0.000: -> 5, | true
pins2lts-seq, 0.000: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.000: state 6: non-accepting
pins2lts-seq, 0.000: -> 6, | !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 5, | !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 3, | !(LTLAP1 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP1 == true ) && !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.001: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 47 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.002: accepting cycle found!
pins2lts-seq, 0.002: exiting now

Jun 01, 2017 7:24:27 PM 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, []((<>([]((LTLAP3==true))))U(<>((LTLAP0==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: Initializing POR dependencies: labels 30, guards 25
pins2lts-seq, 0.000: LTL layer: formula: []((<>([]((LTLAP3==true))))U(<>((LTLAP0==true))))
pins2lts-seq, 0.000: Expression is: ([] ((<> ([] (LTLAP3 == true ))) U (<> (LTLAP0 == true ))))
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 28 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 28, labels: 1 / 31
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.002: accepting cycle found!
pins2lts-seq, 0.002: exiting now

Jun 01, 2017 7:24:27 PM 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(<>((LTLAP2==true)))))U((LTLAP0==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(<>((LTLAP2==true)))))U((LTLAP0==true))
pins2lts-seq, 0.000: Expression is: (([] (X (<> (LTLAP2 == true )))) U (LTLAP0 == true ))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.000: state 1: non-accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: -> 2, | !(LTLAP2 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | !(LTLAP2 == true )
pins2lts-seq, 0.000: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 26, 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 7:24:27 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 01, 2017 7:24:27 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 01, 2017 7:24:27 PM 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="Philosophers-COL-000005"
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/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 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 Philosophers-COL-000005, 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 r050-smll-149440871800159"
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 ;