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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-csrt-149443434600042
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496650796661


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((((("pl_P23_1>=1")&&("pl_P34_4>=1"))&&("pl_P40_2>=1"))U((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P42_1>=1")))U(((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_2>=1"))U((("pl_P23_1>=1")&&("pl_P34_5>=1"))&&("pl_P40_5>=1"))))))
Formula 0 simplified : !G((("pl_P23_1>=1" & "pl_P34_4>=1" & "pl_P40_2>=1") U ("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P42_1>=1")) U (("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_2>=1") U ("pl_P23_1>=1" & "pl_P34_5>=1" & "pl_P40_5>=1")))
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
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
33 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.397296,36580,1,0,115,28628,230,54,2210,28146,137
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((("pl_P23_1>=1")&&("pl_P34_5>=1"))&&("pl_P40_6>=1"))U(("pl_P12_1>=1")&&("pl_P21_1>=1"))))
Formula 1 simplified : !(("pl_P23_1>=1" & "pl_P34_5>=1" & "pl_P40_6>=1") U ("pl_P12_1>=1" & "pl_P21_1>=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.398813,36900,1,0,115,28628,259,54,2237,28146,141
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_1>=1"))U(((("pl_P23_1>=1")&&("pl_P34_5>=1"))&&("pl_P40_2>=1"))U(G((("pl_P23_1>=1")&&("pl_P34_5>=1"))&&("pl_P40_2>=1"))))))
Formula 2 simplified : !(("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_1>=1") U (("pl_P23_1>=1" & "pl_P34_5>=1" & "pl_P40_2>=1") U G("pl_P23_1>=1" & "pl_P34_5>=1" & "pl_P40_2>=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.40082,36908,1,0,115,28628,303,54,2282,28148,150
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X((((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_3>=1"))U(("pl_P10_1>=1")&&("pl_P29_2>=1")))U(F(F((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_1>=1")))))))
Formula 3 simplified : !X((("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_3>=1") U ("pl_P10_1>=1" & "pl_P29_2>=1")) U F("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_1>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 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.497398,39804,1,0,160,42785,316,76,2287,49131,270
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(("pl_P29_2>=1")&&("pl_P33_1>=1"))))
Formula 4 simplified : !X("pl_P29_2>=1" & "pl_P33_1>=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.499122,40068,1,0,160,42795,324,76,2292,49172,274
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(F(G(X(X(("pl_P29_2>=1")&&("pl_P33_1>=1"))))))))
Formula 5 simplified : !FGXX("pl_P29_2>=1" & "pl_P33_1>=1")
9 unique states visited
9 strongly connected components in search stack
10 transitions explored
9 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.514388,40452,1,0,173,43361,326,82,2292,50748,318
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((X(X(X((("pl_P0_1>=1")&&("pl_P2_1>=1"))&&("pl_P6_1>=1")))))U(G(F(F((("pl_P23_1>=1")&&("pl_P34_4>=1"))&&("pl_P40_3>=1")))))))
Formula 6 simplified : !(XXX("pl_P0_1>=1" & "pl_P2_1>=1" & "pl_P6_1>=1") U GF("pl_P23_1>=1" & "pl_P34_4>=1" & "pl_P40_3>=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.521518,40720,1,0,174,43858,341,82,2299,51126,327
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P40_1>=1")))
Formula 7 simplified : !("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P40_1>=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.522271,40720,1,0,174,43858,348,82,2305,51126,329
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X((("pl_P23_1>=1")&&("pl_P34_6>=1"))&&("pl_P40_6>=1"))))
Formula 8 simplified : !X("pl_P23_1>=1" & "pl_P34_6>=1" & "pl_P40_6>=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.522971,40848,1,0,174,43858,357,82,2312,51127,331
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(F(("pl_P7_1>=1")&&("pl_P30_1>=1")))))
Formula 9 simplified : !F("pl_P7_1>=1" & "pl_P30_1>=1")
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.527265,40848,1,0,178,43905,371,87,2317,51360,366
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(F((("pl_P23_1>=1")&&("pl_P34_6>=1"))&&("pl_P40_5>=1")))))
Formula 10 simplified : !GF("pl_P23_1>=1" & "pl_P34_6>=1" & "pl_P40_5>=1")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.528753,41028,1,0,179,43941,384,87,2323,51384,375
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(X((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P42_1>=1")))))
Formula 11 simplified : !XX("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P42_1>=1")
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.53073,41036,1,0,179,43963,391,87,2329,51422,382
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G((("pl_P28_1>=1")&&("pl_P41_1>=1"))U(G((("pl_P23_1>=1")&&("pl_P34_4>=1"))&&("pl_P40_1>=1")))))))
Formula 12 simplified : !G(("pl_P28_1>=1" & "pl_P41_1>=1") U G("pl_P23_1>=1" & "pl_P34_4>=1" & "pl_P40_1>=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.533486,41080,1,0,179,43963,433,87,2369,51424,391
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((("pl_P0_4>=1")&&("pl_P2_1>=1"))&&("pl_P27_1>=1"))))
Formula 13 simplified : !X("pl_P0_4>=1" & "pl_P2_1>=1" & "pl_P27_1>=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.534336,41096,1,0,179,43963,446,87,2378,51424,393
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_4>=1"))))
Formula 14 simplified : !G("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_4>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.53546,41104,1,0,179,43963,462,87,2389,51425,398
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(F(F(X(G((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P40_3>=1"))))))))
Formula 15 simplified : !XFXG("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P40_3>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.587536,41788,1,0,221,49692,483,123,2398,60792,552
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496650800016

--------------------
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 05, 2017 8:19:58 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 48 ms
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 places.
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Jun 05, 2017 8:19:58 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:58 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:58 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: pl_P37_1,pl_P24_1,pl_P7_6,pl_P9_1,pl_P1_1,pl_P7_5,pl_P29_4,pl_P29_5,pl_P14_1,pl_P3_1,pl_P7_4,pl_P29_6,pl_P38_1,pl_P7_2,
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 14 constant variables :pl_P37_1, pl_P24_1, pl_P7_6, pl_P9_1, pl_P1_1, pl_P7_5, pl_P29_4, pl_P29_5, pl_P14_1, pl_P3_1, pl_P7_4, pl_P29_6, pl_P38_1, pl_P7_2
Jun 05, 2017 8:19:58 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 104 ms
Jun 05, 2017 8:19:58 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
Jun 05, 2017 8:19:58 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 05, 2017 8:19:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 27 place invariants in 26 ms
Jun 05, 2017 8:19:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 54 variables to be positive in 166 ms
Jun 05, 2017 8:19:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Jun 05, 2017 8:19:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/56 took 5 ms. Total solver calls (SAT/UNSAT): 20(6/14)
Jun 05, 2017 8:19:59 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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="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/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 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 r150-csrt-149443434600042"
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 ;