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-3253
Executing tool itstools
Input is ClientsAndServers-PT-N0001P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-ebro-149580922200149
=====================================================================

--------------------
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 ClientsAndServers-PT-N0001P0-LTLCardinality-0
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-1
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-15
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-2
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-3
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-4
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-5
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-6
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-7
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-8
FORMULA_NAME ClientsAndServers-PT-N0001P0-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496638394451


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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((("CG>=1")U("SA<=SwA"))U(F(F("StR<=MtF")))))
Formula 0 simplified : !(("CG>=1" U "SA<=SwA") U F"StR<=MtF")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 25 cols
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
23 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.286311,26772,1,0,35,16981,60,22,720,17751,45
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(X(F("Mi>=2"))))))
Formula 1 simplified : !GXF"Mi>=2"
invariant : -1'SR + -1'SG + -1'MpG + -1'MwU + 1'SwG= 0
invariant : -1'SA + -1'SF + -1'MpA + -1'MtF + 1'SwA= 0
invariant : -1'SR + -1'CG + -1'CR + -1'SG + -1'MpG + -1'MwU + -1'StR + -1'SpG + 1'CwG= 0
invariant : 1'SR + -1'CA + -1'CF + 1'SG + 1'MpG + 1'MwU + 1'Si + 1'StR + 1'SpG + 1'CwA= 2
invariant : 1'Uf + 1'SF + 1'CF + 1'StF + 1'CG + 1'MtF + 1'SG + 1'MpG + 1'SpG + 1'Cb= 4
invariant : -1'Uf + -1'SF + 1'CA + -1'StF + 1'CR + -1'MtF + -1'SG + -1'MpG + -1'Si + -1'SpG + 1'Ci= 2
invariant : 1'SA + 1'SF + 1'SR + 1'StF + 1'MpA + 1'MtF + 1'SG + 1'MpG + 1'MwU + 1'Si + 1'StR + 1'SpG + 1'SpA= 2
invariant : 1'MpA + 1'MtF + 1'MpG + 1'MwU + 1'Mi= 3
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
18 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.459327,30364,1,0,68,33477,73,55,767,32074,142
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("SR<=CG"))
Formula 2 simplified : !"SR<=CG"
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,0.459887,30364,1,0,68,33477,76,55,770,32076,144
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((("SpA<=MwU")U(G(F("StF<=Mi")))))
Formula 3 simplified : !("SpA<=MwU" U GF"StF<=Mi")
1 unique states visited
0 strongly connected components in search stack
1 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,0.461997,30732,1,0,68,33485,79,55,777,32102,146
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("SwG<=CF"))
Formula 4 simplified : !"SwG<=CF"
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,0.462424,30872,1,0,68,33485,82,55,780,32104,148
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G("SwA>=3")))
Formula 5 simplified : !G"SwA>=3"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.465314,30904,1,0,69,33559,90,56,782,32154,160
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F("CwA<=SwA")))
Formula 6 simplified : !F"CwA<=SwA"
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,0.465872,30940,1,0,69,33559,99,56,786,32154,164
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F("SR>=1")))
Formula 7 simplified : !F"SR>=1"
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.476618,30964,1,0,118,34906,108,88,787,33891,272
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X("MpA<=Cb")))
Formula 8 simplified : !X"MpA<=Cb"
2 unique states visited
0 strongly connected components in search stack
1 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,0.477205,30964,1,0,118,34906,111,88,790,33892,274
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("SpG<=SA"))
Formula 9 simplified : !"SpG<=SA"
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,0.477689,31032,1,0,118,34906,114,88,793,33894,276
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(X(X(G("SF<=SpA"))))))
Formula 10 simplified : !XXXG"SF<=SpA"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
20 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.683259,34960,1,0,257,57907,120,191,797,62142,536
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("SwG>=1"))
Formula 11 simplified : !"SwG>=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.683824,34960,1,0,257,57907,123,191,798,62142,538
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((G(F("CwA<=SA")))U("SG>=3")))
Formula 12 simplified : !(GF"CwA<=SA" U "SG>=3")
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 ClientsAndServers-PT-N0001P0-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
97 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.65851,56356,1,0,407,177538,133,547,809,209329,1223
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((F("SwG>=2"))U(F("SR>=1")))))
Formula 13 simplified : !X(F"SwG>=2" U F"SR>=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,1.66117,56620,1,0,421,177566,133,563,809,209553,1266
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(X("SwA>=2"))))
Formula 14 simplified : !XX"SwA>=2"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.66305,56880,1,0,421,177609,136,563,811,209628,1270
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((G(G("SwG>=2")))U(G("CA>=3"))))
Formula 15 simplified : !(G"SwG>=2" U G"CA>=3")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.66605,57532,1,0,421,177609,154,563,823,209628,1279
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :1
FORMULA ClientsAndServers-PT-N0001P0-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496638399830

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 05, 2017 4:53:16 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 4:53:17 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 53 ms
Jun 05, 2017 4:53:17 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
Jun 05, 2017 4:53:17 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 18 transitions.
Jun 05, 2017 4:53:17 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 61 ms
Jun 05, 2017 4:53:17 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
Jun 05, 2017 4:53:17 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 8 place invariants in 177 ms
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 25 variables to be positive in 231 ms
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 18 transitions.
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/18 took 1 ms. Total solver calls (SAT/UNSAT): 2(1/1)
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 53(20/33)
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 18 transitions.
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 53(23/30)
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 18 transitions.
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 115 ms. Total solver calls (SAT/UNSAT): 171(171/0)
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 18 transitions.
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 202 ms. Total solver calls (SAT/UNSAT): 34(0/34)
Jun 05, 2017 4:53:18 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 760ms conformant to PINS in folder :/home/mcc/execution
Jun 05, 2017 4:53:19 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, ([](<>((LTLAP15==true))))U((LTLAP16==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.001: 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: Initializing POR dependencies: labels 38, guards 18
pins2lts-seq, 0.002: LTL layer: formula: ([](<>((LTLAP15==true))))U((LTLAP16==true))
pins2lts-seq, 0.002: Expression is: (([] (<> (LTLAP15 == true ))) U (LTLAP16 == true ))
pins2lts-seq, 0.003: buchi has 3 states
pins2lts-seq, 0.003: state 0: accepting
pins2lts-seq, 0.003: -> 0, | !(LTLAP16 == true )
pins2lts-seq, 0.003: -> 1, | !(LTLAP16 == true ) && !(LTLAP15 == true )
pins2lts-seq, 0.003: -> 2, | !(LTLAP16 == true )
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.003: state 2: non-accepting
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.003: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.003: There are 39 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 26, there are 24 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 / 24, labels: 2 / 39
pins2lts-seq, 0.003: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now

Jun 05, 2017 4:53:19 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((<>((LTLAP17==true)))U(<>((LTLAP10==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((<>((LTLAP17==true)))U(<>((LTLAP10==true))))
pins2lts-seq, 0.000: Expression is: (X ((<> (LTLAP17 == true )) U (<> (LTLAP10 == true ))))
pins2lts-seq, 0.000: buchi has 2 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: -> 1, | !(LTLAP10 == true )
pins2lts-seq, 0.001: There are 39 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 20 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.002: state space 12 levels, 39 states 51 transitions

Jun 05, 2017 4:53:19 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((LTLAP18==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((LTLAP18==true)))
pins2lts-seq, 0.000: Expression is: (X (X (LTLAP18 == true )))
pins2lts-seq, 0.001: buchi has 4 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 3, | !(LTLAP18 == true )
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.002: There are 39 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 26, there are 22 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

Jun 05, 2017 4:53:19 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, ([]([]((LTLAP17==true))))U([]((LTLAP19==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 38, guards 18
pins2lts-seq, 0.001: LTL layer: formula: ([]([]((LTLAP17==true))))U([]((LTLAP19==true)))
pins2lts-seq, 0.001: Expression is: (([] ([] (LTLAP17 == true ))) U ([] (LTLAP19 == true )))
pins2lts-seq, 0.001: buchi has 6 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP19 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP19 == true ) && !(LTLAP17 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP19 == true )
pins2lts-seq, 0.001: -> 0, | true
pins2lts-seq, 0.001: -> 4, | !(LTLAP17 == true )
pins2lts-seq, 0.001: -> 5, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP19 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP19 == true ) && !(LTLAP17 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP19 == true )
pins2lts-seq, 0.001: -> 0, | true
pins2lts-seq, 0.001: -> 4, | !(LTLAP17 == true )
pins2lts-seq, 0.001: -> 5, | true
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 3: non-accepting
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.001: -> 2, | !(LTLAP17 == true )
pins2lts-seq, 0.001: state 4: non-accepting
pins2lts-seq, 0.001: -> 4, | true
pins2lts-seq, 0.001: -> 2, | !(LTLAP19 == true )
pins2lts-seq, 0.001: state 5: non-accepting
pins2lts-seq, 0.001: -> 5, | true
pins2lts-seq, 0.001: -> 4, | !(LTLAP17 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP19 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP19 == true ) && !(LTLAP17 == true )
pins2lts-seq, 0.002: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 39 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 26, there are 39 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.002: Visible groups: 81 / 39, labels: 2 / 39
pins2lts-seq, 0.002: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.020: accepting cycle found!
pins2lts-seq, 0.020: exiting now

Jun 05, 2017 4:53:19 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 05, 2017 4:53:19 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 05, 2017 4:53:19 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="ClientsAndServers-PT-N0001P0"
export BK_EXAMINATION="LTLCardinality"
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/ClientsAndServers-PT-N0001P0.tgz
mv ClientsAndServers-PT-N0001P0 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0001P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-ebro-149580922200149"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;