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 JoinFreeModules-PT-0004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r200-blw7-149581092400014
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496655463475


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 : !((G(G(false))))
Formula 0 simplified : 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.066905,24096,1,0,81,7339,88,39,1047,6166,82
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F(X(G("p7<=p2"))))))
Formula 1 simplified : !GFXG"p7<=p2"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.109754,25628,1,0,99,13904,101,63,1059,15746,132
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(("p13<=p19")U(G("p14<=p4")))))
Formula 2 simplified : !X("p13<=p19" U G"p14<=p4")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 20 cols
invariant : 1'p6 + 1'p7 + 1'p8 + 1'p9 + 1'p10= 7
invariant : 1'p1 + 1'p2 + 1'p3 + 1'p4 + 1'p5= 7
invariant : 1'p11 + 1'p12 + 1'p13 + 1'p14 + 1'p15= 7
invariant : 1'p16 + 1'p17 + 1'p18 + 1'p19 + 1'p20= 7
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]
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
38 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.488547,41488,1,0,227,77676,119,237,1084,134034,448
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G("p5<=p12")))
Formula 3 simplified : !G"p5<=p12"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
29 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.772996,51684,1,0,346,115725,125,358,1098,211443,756
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(F(("p5<=p13")U("p19>=3")))))
Formula 4 simplified : !F("p5<=p13" U "p19>=3")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.81674,53624,1,0,458,126165,134,518,1099,226659,1047
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(F(G(F("p9>=1"))))))
Formula 5 simplified : !GFGF"p9>=1"
3 unique states visited
3 strongly connected components in search stack
4 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.818745,53904,1,0,460,126612,143,519,1101,227063,1058
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(("p20>=3")U(F("p9>=2")))))
Formula 6 simplified : !X("p20>=3" U F"p9>=2")
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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.904587,57712,1,0,570,143927,152,629,1103,254573,1347
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(X(G(F("p20>=3"))))))
Formula 7 simplified : !XXGF"p20>=3"
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,0.905565,57828,1,0,571,143941,161,631,1105,254596,1358
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(G(X(G("p16<=p14"))))))
Formula 8 simplified : !FGXG"p16<=p14"
3 unique states visited
2 strongly connected components in search stack
4 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.908971,58228,1,0,575,144632,167,634,1118,255391,1375
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(X(F(X("p20<=p2"))))))
Formula 9 simplified : !FXFX"p20<=p2"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.938799,59632,1,0,674,153537,176,727,1123,267032,1548
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G((F("p15<=p18"))U(X("p16<=p18")))))
Formula 10 simplified : !G(F"p15<=p18" U X"p16<=p18")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.942224,60356,1,0,686,154118,190,744,1149,267808,1587
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0004-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(F(F(G("p12>=2"))))))
Formula 11 simplified : !GFG"p12>=2"
Exit code :0
Exit code :1
FORMULA JoinFreeModules-PT-0004-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA JoinFreeModules-PT-0004-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA JoinFreeModules-PT-0004-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA JoinFreeModules-PT-0004-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA JoinFreeModules-PT-0004-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496655466738

--------------------
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 9:37:44 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 9:37:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 33 ms
Jun 05, 2017 9:37:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 21 places.
Jun 05, 2017 9:37:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 transitions.
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 1 fixed domain variables (out of 21 variables) in GAL type JoinFreeModules_PT_0004
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 1 constant array cells/variables (out of 21 variables) in type JoinFreeModules_PT_0004
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: p,
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 1 constant variables :p
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 2 expressions due to constant valuations.
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 91 ms
Jun 05, 2017 9:37:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 11 ms
Jun 05, 2017 9:37:45 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 4 place invariants in 9 ms
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 20 variables to be positive in 28 ms
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 33 transitions.
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/33 took 2 ms. Total solver calls (SAT/UNSAT): 4(2/2)
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 148(64/84)
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 33 transitions.
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 148(80/68)
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 33 transitions.
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 86 ms. Total solver calls (SAT/UNSAT): 561(513/48)
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 33 transitions.
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 202 ms. Total solver calls (SAT/UNSAT): 60(0/60)
Jun 05, 2017 9:37:45 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 542ms conformant to PINS in folder :/home/mcc/execution
Jun 05, 2017 9:37:46 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, [](<>(<>([]((LTLAP13==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 51, guards 33
pins2lts-seq, 0.002: LTL layer: formula: [](<>(<>([]((LTLAP13==true)))))
pins2lts-seq, 0.002: Expression is: ([] (<> (<> ([] (LTLAP13 == true )))))
pins2lts-seq, 0.002: buchi has 2 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP13 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP13 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 52 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 21, 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.002: Visible groups: 0 / 37, labels: 1 / 52
pins2lts-seq, 0.002: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now

Jun 05, 2017 9:37:46 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, (LTLAP14==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 51, guards 33
pins2lts-seq, 0.000: LTL layer: formula: (LTLAP14==true)
pins2lts-seq, 0.000: Expression is: (LTLAP14 == true )
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP14 == true )
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 52 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 21, 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: 0 / 35, labels: 1 / 52
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.002: state space 1 levels, 1 states 0 transitions

Jun 05, 2017 9:37:46 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)], 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 51, guards 33
pins2lts-seq, 0.000: LTL layer: formula: (LTLAP15==true)
pins2lts-seq, 0.000: Expression is: (LTLAP15 == true )
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 52 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 21, 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: 0 / 35, labels: 1 / 52
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.002: state space 1 levels, 1 states 0 transitions

Jun 05, 2017 9:37:46 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, []((LTLAP16==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 51, guards 33
pins2lts-seq, 0.000: LTL layer: formula: []((LTLAP16==true))
pins2lts-seq, 0.000: Expression is: ([] (LTLAP16 == 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, | !(LTLAP16 == 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 52 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 21, there are 36 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 / 36, labels: 1 / 52
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.001: accepting cycle found!
pins2lts-seq, 0.001: exiting now

Jun 05, 2017 9:37:46 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)], 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 51, guards 33
pins2lts-seq, 0.000: LTL layer: formula: (LTLAP17==true)
pins2lts-seq, 0.000: Expression is: (LTLAP17 == true )
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP17 == true )
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 52 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 21, 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: 0 / 35, labels: 1 / 52
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.002: state space 1 levels, 1 states 0 transitions

Jun 05, 2017 9:37:46 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 05, 2017 9:37:46 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="JoinFreeModules-PT-0004"
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/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 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 JoinFreeModules-PT-0004, 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 r200-blw7-149581092400014"
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 ;