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

--------------------
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 1496365203179


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(((((("Fork_5>=1")&&("Catch2_1>=1"))||(("Catch2_4>=1")&&("Fork_3>=1")))||(("Fork_4>=1")&&("Catch2_5>=1")))||(("Fork_1>=1")&&("Catch2_2>=1")))||(("Fork_2>=1")&&("Catch2_3>=1"))))))
Formula 0 simplified : !GF(("Catch2_1>=1" & "Fork_5>=1") | ("Catch2_4>=1" & "Fork_3>=1") | ("Catch2_5>=1" & "Fork_4>=1") | ("Catch2_2>=1" & "Fork_1>=1") | ("Catch2_3>=1" & "Fork_2>=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.102279,27512,1,0,10,2479,73,6,679,1553,22
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
Checking formula 1 : !((F(G(G((((("Eat_4>=1")||("Eat_3>=1"))||("Eat_2>=1"))||("Eat_1>=1"))||("Eat_5>=1"))))))
Formula 1 simplified : !FG("Eat_1>=1" | "Eat_2>=1" | "Eat_3>=1" | "Eat_4>=1" | "Eat_5>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.125976,27932,1,0,35,4952,114,30,707,5457,88
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
Checking formula 2 : !(((((("Eat_4>=1")||("Eat_3>=1"))||("Eat_2>=1"))||("Eat_1>=1"))||("Eat_5>=1")))
Formula 2 simplified : !("Eat_1>=1" | "Eat_2>=1" | "Eat_3>=1" | "Eat_4>=1" | "Eat_5>=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.128179,28204,1,0,35,4954,116,30,707,5471,92
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
Checking formula 3 : !((X(((((("Fork_5>=1")&&("Catch2_1>=1"))||(("Catch2_4>=1")&&("Fork_3>=1")))||(("Fork_4>=1")&&("Catch2_5>=1")))||(("Fork_1>=1")&&("Catch2_2>=1")))||(("Fork_2>=1")&&("Catch2_3>=1")))))
Formula 3 simplified : !X(("Catch2_1>=1" & "Fork_5>=1") | ("Catch2_4>=1" & "Fork_3>=1") | ("Catch2_5>=1" & "Fork_4>=1") | ("Catch2_2>=1" & "Fork_1>=1") | ("Catch2_3>=1" & "Fork_2>=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.140765,28212,1,0,37,5080,116,31,707,5564,99
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
Checking formula 4 : !((F(X(F((((((("Fork_5>=1")&&("Catch2_1>=1"))||(("Catch2_4>=1")&&("Fork_3>=1")))||(("Fork_4>=1")&&("Catch2_5>=1")))||(("Fork_1>=1")&&("Catch2_2>=1")))||(("Fork_2>=1")&&("Catch2_3>=1")))U(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1"))))))))
Formula 4 simplified : !FXF((("Catch2_1>=1" & "Fork_5>=1") | ("Catch2_4>=1" & "Fork_3>=1") | ("Catch2_5>=1" & "Fork_4>=1") | ("Catch2_2>=1" & "Fork_1>=1") | ("Catch2_3>=1" & "Fork_2>=1")) U (("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=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.159202,28528,1,0,37,5131,338,31,917,5569,103
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((G(X(G(((((("Fork_5>=1")&&("Catch2_1>=1"))||(("Catch2_4>=1")&&("Fork_3>=1")))||(("Fork_4>=1")&&("Catch2_5>=1")))||(("Fork_1>=1")&&("Catch2_2>=1")))||(("Fork_2>=1")&&("Catch2_3>=1"))))))U((F(((((("Fork_5>=1")&&("Catch2_1>=1"))||(("Catch2_4>=1")&&("Fork_3>=1")))||(("Fork_4>=1")&&("Catch2_5>=1")))||(("Fork_1>=1")&&("Catch2_2>=1")))||(("Fork_2>=1")&&("Catch2_3>=1"))))U(F(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1")))))))
Formula 5 simplified : !(GXG(("Catch2_1>=1" & "Fork_5>=1") | ("Catch2_4>=1" & "Fork_3>=1") | ("Catch2_5>=1" & "Fork_4>=1") | ("Catch2_2>=1" & "Fork_1>=1") | ("Catch2_3>=1" & "Fork_2>=1")) U (F(("Catch2_1>=1" & "Fork_5>=1") | ("Catch2_4>=1" & "Fork_3>=1") | ("Catch2_5>=1" & "Fork_4>=1") | ("Catch2_2>=1" & "Fork_1>=1") | ("Catch2_3>=1" & "Fork_2>=1")) U F(("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=1"))))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
invariant : 1'Think_4 + 1'Think_5 + -1'Fork_4 + 1'Catch1_4 + 1'Catch2_5= 1
invariant : 1'Think_3 + 1'Think_4 + -1'Fork_3 + 1'Catch1_3 + 1'Catch2_4= 1
invariant : 1'Think_1 + 1'Think_5 + -1'Fork_5 + 1'Catch1_5 + 1'Catch2_1= 1
invariant : -1'Think_2 + 1'Fork_2 + -1'Catch1_2 + 1'Catch1_3 + 1'Eat_3= 0
invariant : -1'Think_3 + 1'Fork_3 + -1'Catch1_3 + 1'Catch1_4 + 1'Eat_4= 0
invariant : 1'Think_1 + 1'Think_2 + -1'Fork_1 + 1'Catch1_1 + 1'Catch2_2= 1
invariant : -1'Think_5 + 1'Fork_5 + 1'Catch1_1 + -1'Catch1_5 + 1'Eat_1= 0
invariant : -1'Think_1 + 1'Fork_1 + -1'Catch1_1 + 1'Catch1_2 + 1'Eat_2= 0
invariant : -1'Think_4 + 1'Fork_4 + 1'Catch1_5 + -1'Catch1_4 + 1'Eat_5= 0
invariant : 1'Think_2 + 1'Think_3 + -1'Fork_2 + 1'Catch1_2 + 1'Catch2_3= 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.970941,30132,1,0,37,5131,338,31,917,5569,107
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((X(((((("Fork_1>=1")&&("Think_2>=1"))||(("Fork_5>=1")&&("Think_1>=1")))||(("Think_4>=1")&&("Fork_3>=1")))||(("Fork_2>=1")&&("Think_3>=1")))||(("Fork_4>=1")&&("Think_5>=1"))))U(X(G(F((((("Eat_4>=1")||("Eat_3>=1"))||("Eat_2>=1"))||("Eat_1>=1"))||("Eat_5>=1")))))))
Formula 6 simplified : !(X(("Fork_1>=1" & "Think_2>=1") | ("Fork_5>=1" & "Think_1>=1") | ("Fork_3>=1" & "Think_4>=1") | ("Fork_2>=1" & "Think_3>=1") | ("Fork_4>=1" & "Think_5>=1")) U XGF("Eat_1>=1" | "Eat_2>=1" | "Eat_3>=1" | "Eat_4>=1" | "Eat_5>=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 1496365208534

--------------------
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 02, 2017 1:00:05 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 1:00:05 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 66 ms
Jun 02, 2017 1:00:05 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
Jun 02, 2017 1:00:05 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Jun 02, 2017 1:00:06 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 75 ms
Jun 02, 2017 1:00:06 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
Jun 02, 2017 1:00:06 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Jun 02, 2017 1:00:06 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 21 ms
Jun 02, 2017 1:00:06 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 25 variables to be positive in 161 ms
Jun 02, 2017 1:00:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 25 transitions.
Jun 02, 2017 1:00:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/25 took 2 ms. Total solver calls (SAT/UNSAT): 3(1/2)
Jun 02, 2017 1:00:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 94 ms. Total solver calls (SAT/UNSAT): 155(75/80)
Jun 02, 2017 1:00:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 25 transitions.
Jun 02, 2017 1:00:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 86 ms. Total solver calls (SAT/UNSAT): 155(50/105)
Jun 02, 2017 1:00:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 25 transitions.
Jun 02, 2017 1:00:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 148 ms. Total solver calls (SAT/UNSAT): 325(195/130)
Jun 02, 2017 1:00:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 25 transitions.
Jun 02, 2017 1:00:07 AM 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 02, 2017 1:00:07 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 757ms conformant to PINS in folder :/home/mcc/execution
Jun 02, 2017 1:00:08 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((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.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: (X((LTLAP3==true)))U(X([](<>((LTLAP1==true)))))
pins2lts-seq, 0.002: 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.003: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 26, there are 37 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

Jun 02, 2017 1:00:08 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, [](((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.000: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.000: state 1: non-accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.000: state 2: non-accepting
pins2lts-seq, 0.000: -> 2, | true
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 3, | !(LTLAP3 == true )
pins2lts-seq, 0.000: state 3: accepting
pins2lts-seq, 0.000: -> 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 02, 2017 1:00:08 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, []((((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 02, 2017 1:00:08 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, (<>((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.000: LTL layer: formula: (<>((LTLAP2==true)))U(<>((LTLAP0==true)))
pins2lts-seq, 0.000: Expression is: ((<> (LTLAP2 == true )) U (<> (LTLAP0 == true )))
pins2lts-seq, 0.000: buchi has 1 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.000: 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.001: accepting cycle found!
pins2lts-seq, 0.001: exiting now

Jun 02, 2017 1:00:08 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, (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: Initializing POR dependencies: labels 30, guards 25
pins2lts-seq, 0.000: LTL layer: formula: (LTLAP1==true)
pins2lts-seq, 0.000: Expression is: (LTLAP1 == true )
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: 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 27 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 / 27, 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 02, 2017 1:00:08 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, <>([]([](<>([]((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.000: 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.001: accepting cycle found!
pins2lts-seq, 0.001: exiting now

Jun 02, 2017 1:00:08 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((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 02, 2017 1:00:08 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(((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.000: -> 2, | !(LTLAP1 == true ) && !(LTLAP2 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.000: There are 31 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 26, there are 47 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 02, 2017 1:00:08 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, []((<>([]((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.000: 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 02, 2017 1:00:08 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(<>((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 02, 2017 1:00:08 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 1:00:08 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="Philosophers-PT-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-PT-000005.tgz
mv Philosophers-PT-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-PT-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-149440871900204"
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 ;