fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r150-csrt-149443434600041
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_Railroad-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
254.440 3061.00 6542.00 119.80 TTFTFFFFTTFTTFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_Railroad-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-csrt-149443434600041
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496650795523


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 : !(((X(G(false)))U(G(X("pl_P29_2>=0")))))
Formula 0 simplified : !GX"pl_P29_2>=0"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 54 cols
invariant : -1'pl_P11_1 + 1'pl_P29_1= 0
invariant : 1'pl_P23_1 + -1'pl_P26_1 + 1'pl_P30_1 + 1'pl_P34_1 + 1'pl_P35_1 + 1'pl_P7_3= 1
invariant : 1'pl_P12_1 + 1'pl_P15_1 + 1'pl_P31_1= 1
invariant : 1'pl_P18_1 + 1'pl_P27_1 + 1'pl_P41_1= 1
invariant : -1'pl_P0_1 + -1'pl_P0_2 + -1'pl_P0_3 + -1'pl_P0_4 + -1'pl_P0_5 + -1'pl_P0_6 + 1'pl_P2_1 + 1'pl_P30_1 + 5'pl_P34_1 + 4'pl_P34_2 + 3'pl_P34_3 + 2'pl_P34_4 + 1'pl_P34_5= 1
invariant : 1'pl_P10_1 + -1'pl_P30_1 + 1'pl_P35_1 + 1'pl_P7_1= 0
invariant : -1'pl_P16_1 + 1'pl_P4_1= 0
invariant : 1'pl_P11_1 + 1'pl_P26_1 + 1'pl_P29_2= 1
invariant : 1'pl_P0_1 + 1'pl_P0_2 + 1'pl_P0_3 + 1'pl_P0_4 + 1'pl_P0_5 + 1'pl_P0_6 + -1'pl_P2_1 + -1'pl_P30_1 + -4'pl_P34_1 + -3'pl_P34_2 + -2'pl_P34_3 + -1'pl_P34_4 + 1'pl_P34_6= 0
invariant : 1'pl_P18_1 + 1'pl_P27_1 + 1'pl_P28_1= 1
invariant : 1'pl_P0_5 + 1'pl_P20_1 + 1'pl_P25_1 + 1'pl_P40_5= 1
invariant : 1'pl_P13_1 + 1'pl_P19_1 + 1'pl_P32_1= 1
invariant : 1'pl_P0_6 + 1'pl_P40_6= 0
invariant : 1'pl_P10_1 + 1'pl_P11_1 + 1'pl_P26_1 + 1'pl_P33_1= 1
invariant : -1'pl_P26_1 + 1'pl_P29_3= 0
invariant : 1'pl_P0_1 + 1'pl_P16_1 + 1'pl_P17_1 + 1'pl_P40_1= 1
invariant : -1'pl_P12_1 + 1'pl_P21_1= 0
invariant : 1'pl_P0_4 + -1'pl_P27_1 + 1'pl_P40_4= 0
invariant : -1'pl_P10_1 + -1'pl_P11_1 + -1'pl_P34_1 + -1'pl_P35_1 + 1'pl_P39_1= -1
invariant : 1'pl_P0_2 + 1'pl_P13_1 + 1'pl_P19_1 + 1'pl_P40_2= 1
invariant : 1'pl_P23_1 + 1'pl_P30_1 + 1'pl_P36_1= 1
invariant : 1'pl_P20_1 + 1'pl_P25_1 + 1'pl_P5_1= 1
invariant : -1'pl_P25_1 + 1'pl_P8_1= 0
invariant : 1'pl_P16_1 + 1'pl_P17_1 + 1'pl_P6_1= 1
invariant : -1'pl_P19_1 + 1'pl_P22_1= 0
invariant : 1'pl_P2_1 + 1'pl_P30_1 + 1'pl_P42_1= 1
invariant : 1'pl_P0_3 + 1'pl_P12_1 + 1'pl_P15_1 + 1'pl_P40_3= 1
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
35 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.381737,35024,1,0,145,40914,130,76,2073,45606,235
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(G(G("pl_P40_1>=0"))))))
Formula 1 simplified : !G"pl_P40_1>=0"
1 unique states visited
0 strongly connected components in search stack
1 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.387059,35428,1,0,154,41159,136,87,2074,46534,317
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X("pl_P40_6<=pl_P25_1"))U(X(F("pl_P29_1<=pl_P6_1")))))
Formula 2 simplified : !(X"pl_P40_6<=pl_P25_1" U XF"pl_P29_1<=pl_P6_1")
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.387642,35764,1,0,154,41159,145,87,2079,46534,321
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(F(("pl_P30_1<=0")U("pl_P40_3<=pl_P31_1")))))
Formula 3 simplified : !GF("pl_P30_1<=0" U "pl_P40_3<=pl_P31_1")
1 unique states visited
0 strongly connected components in search stack
1 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.402658,36464,1,0,154,41767,152,87,2126,49245,328
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("pl_P17_1>=3"))
Formula 4 simplified : !"pl_P17_1>=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.405342,36724,1,0,154,41887,157,87,2128,49457,334
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((((false)U("pl_P17_1>=0"))U(G(F("pl_P34_1<=pl_P29_3")))))
Formula 5 simplified : !("pl_P17_1>=0" U GF"pl_P34_1<=pl_P29_3")
2 unique states visited
0 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.408177,36968,1,0,160,42018,166,88,2132,49831,353
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X((F("pl_P34_2>=1"))U(F("pl_P15_1>=0")))))
Formula 6 simplified : !X(F"pl_P34_2>=1" U F"pl_P15_1>=0")
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.408726,37228,1,0,160,42018,175,88,2133,49831,357
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((false))
Formula 7 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.408868,37228,1,0,160,42018,175,88,2133,49831,357
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(F(X(F("pl_P0_1>=1"))))))
Formula 8 simplified : !FXF"pl_P0_1>=1"
3 unique states visited
3 strongly connected components in search stack
3 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.457467,38444,1,0,236,49633,184,112,2134,62686,500
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X("pl_P16_1<=pl_P40_5")))
Formula 9 simplified : !X"pl_P16_1<=pl_P40_5"
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.458,38468,1,0,236,49633,187,112,2138,62687,502
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F("pl_P18_1>=3")))
Formula 10 simplified : !F"pl_P18_1>=3"
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.462348,38808,1,0,236,49633,196,112,2140,62731,555
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(X(X(X("pl_P40_6>=0"))))))
Formula 11 simplified : !FXXX"pl_P40_6>=0"
4 unique states visited
0 strongly connected components in search stack
3 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.462891,38872,1,0,236,49634,205,112,2142,62732,562
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(F(X(G("pl_P26_1<=pl_P7_3"))))))
Formula 12 simplified : !XFXG"pl_P26_1<=pl_P7_3"
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.478847,39784,1,0,277,50449,218,172,2147,65786,755
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(F("pl_P5_1>=1")))U(G(G(false)))))
Formula 13 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.479007,39788,1,0,277,50449,218,172,2147,65786,755
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(G("pl_P33_1>=3"))))
Formula 14 simplified : !XG"pl_P33_1>=3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.480017,40064,1,0,277,50459,224,172,2149,65827,762
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X("pl_P27_1>=3"))))
Formula 15 simplified : !GX"pl_P27_1>=3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.480666,40092,1,0,277,50459,230,172,2151,65827,767
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496650798584

--------------------
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 8:19:56 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 70 ms
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 places.
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 14 fixed domain variables (out of 68 variables) in GAL type Railroad_PT_005
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 14 constant array cells/variables (out of 68 variables) in type Railroad_PT_005
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: pl_P7_2,pl_P29_5,pl_P7_6,pl_P1_1,pl_P37_1,pl_P29_4,pl_P24_1,pl_P14_1,pl_P7_4,pl_P38_1,pl_P9_1,pl_P29_6,pl_P7_5,pl_P3_1,
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 14 constant variables :pl_P7_2, pl_P29_5, pl_P7_6, pl_P1_1, pl_P37_1, pl_P29_4, pl_P24_1, pl_P14_1, pl_P7_4, pl_P38_1, pl_P9_1, pl_P29_6, pl_P7_5, pl_P3_1
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 10 expressions due to constant valuations.
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 119 ms
Jun 05, 2017 8:19:57 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
Jun 05, 2017 8:19:57 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 27 place invariants in 19 ms
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 54 variables to be positive in 141 ms
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Jun 05, 2017 8:19:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/56 took 4 ms. Total solver calls (SAT/UNSAT): 20(6/14)
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 220 ms. Total solver calls (SAT/UNSAT): 1010(231/779)
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/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], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions tr_T18_1, tr_T24_2, tr_T24_3, tr_T24_4, tr_T24_5, tr_T3_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :5/45/6/56

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="S_Railroad-PT-005"
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/S_Railroad-PT-005.tgz
mv S_Railroad-PT-005 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 S_Railroad-PT-005, 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 r150-csrt-149443434600041"
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 ;