fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r110-blw3-149441614000033
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_DNAwalker-PT-04track28LL

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1173.090 36842.00 75623.00 123.90 FFFFFFFFFFFFFFFF 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_DNAwalker-PT-04track28LL, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-blw3-149441614000033
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496406531285


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 : !((F(F(F(X(F(("A6>=2")&&("A10>=1"))))))))
Formula 0 simplified : !FXF("A6>=2" & "A10>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 250 rows 34 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
699 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,7.03659,203500,1,0,864,830990,522,371,2751,1.10086e+06,776
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((("A9>=2")&&("A5>=1")))
Formula 1 simplified : !("A5>=1" & "A9>=2")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
175 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,8.77606,248684,1,0,911,982193,536,432,2821,1.39398e+06,879
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((G(G(F(("A27>=2")&&("A24>=1")))))U((X(("A26>=2")&&("A24>=1")))U(X(("A24>=2")&&("A19>=1"))))))
Formula 2 simplified : !(GF("A24>=1" & "A27>=2") U (X("A24>=1" & "A26>=2") U X("A19>=1" & "A24>=2")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
276 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,11.5422,314116,1,0,1056,1.20549e+06,573,549,2845,1.80476e+06,1153
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G("B18>=1")))
Formula 3 simplified : !G"B18>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,12.5064,337940,1,0,1178,1.31594e+06,579,662,2846,1.95456e+06,1386
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((((X(("A7>=2")&&("A3>=1")))U(X(("A8>=2")&&("A16>=1"))))U(X((("A3>=2")&&("A5>=1"))U(("A19>=2")&&("A25>=1"))))))
Formula 4 simplified : !((X("A3>=1" & "A7>=2") U X("A8>=2" & "A16>=1")) U X(("A3>=2" & "A5>=1") U ("A19>=2" & "A25>=1")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
134 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,13.8635,363268,1,0,1211,1.40588e+06,645,698,2906,2.07317e+06,1468
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((((X(("A5>=2")&&("A1>=1")))U(G(("A5>=2")&&("A6>=1"))))U((G(("A4>=2")&&("A9>=1")))U(G(("A3>=2")&&("A10>=1"))))))
Formula 5 simplified : !((X("A1>=1" & "A5>=2") U G("A5>=2" & "A6>=1")) U (G("A4>=2" & "A9>=1") U G("A3>=2" & "A10>=1")))
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
410 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,18.0024,441876,1,0,1326,1.69056e+06,698,815,2953,2.52694e+06,1918
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X("B19>=1"))))
Formula 6 simplified : !FX"B19>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
63 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,18.6285,459116,1,0,1444,1.76695e+06,707,936,2954,2.64645e+06,2194
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((G(G(("A14>=2")&&("A19>=1"))))U(F((("A4>=2")&&("A5>=1"))U(("A3>=2")&&("A11>=1"))))))
Formula 7 simplified : !(G("A14>=2" & "A19>=1") U F(("A4>=2" & "A5>=1") U ("A3>=2" & "A11>=1")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
808 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,26.7042,621268,1,0,1604,2.36914e+06,719,1059,2958,3.70396e+06,2477
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(((("A6>=2")&&("A14>=1"))U(("A10>=2")&&("A24>=1")))U((("A27>=2")&&("A28>=1"))U(("A14>=2")&&("A19>=1"))))))
Formula 8 simplified : !G((("A6>=2" & "A14>=1") U ("A10>=2" & "A24>=1")) U (("A27>=2" & "A28>=1") U ("A14>=2" & "A19>=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,26.7266,621716,1,0,1604,2.36914e+06,820,1059,3058,3.70396e+06,2488
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(F(G(G(F(("A22>=2")&&("A11>=1"))))))))
Formula 9 simplified : !XFGF("A11>=1" & "A22>=2")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
305 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,29.7862,678840,1,0,1677,2.5905e+06,832,1116,3062,4.04734e+06,2639
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((("A10>=2")&&("A6>=1"))U(X((("A3>=2")&&("A9>=1"))U(("A12>=2")&&("A10>=1"))))))
Formula 10 simplified : !(("A6>=1" & "A10>=2") U X(("A3>=2" & "A9>=1") U ("A10>=1" & "A12>=2")))
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,29.789,679120,1,0,1677,2.59053e+06,857,1116,3084,4.04736e+06,2648
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(("A2>=2")&&("A10>=1"))))
Formula 11 simplified : !F("A2>=2" & "A10>=1")
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
333 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,33.1238,762972,1,0,1821,2.91784e+06,869,1238,3088,4.5956e+06,2931
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((("A24>=2")&&("A11>=1")))
Formula 12 simplified : !("A11>=1" & "A24>=2")
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,33.1248,763288,1,0,1821,2.91784e+06,873,1238,3091,4.5956e+06,2933
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DNAwalker-PT-04track28LL-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G(X(G(F(("A21>=2")&&("A23>=1"))))))))
Formula 13 simplified : !FGXGF("A21>=2" & "A23>=1")
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA DNAwalker-PT-04track28LL-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-04track28LL-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-04track28LL-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496406568127

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 12:28:52 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 12:28:52 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 80 ms
Jun 02, 2017 12:28:52 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 34 places.
Jun 02, 2017 12:28:52 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 transitions.
Jun 02, 2017 12:28:53 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 77 ms
Jun 02, 2017 12:28:53 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
Jun 02, 2017 12:28:53 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2017 12:28:53 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 12 ms
Jun 02, 2017 12:28:53 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 34 variables to be positive in 94 ms
Jun 02, 2017 12:28:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 250 transitions.
Jun 02, 2017 12:28:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/250 took 3 ms. Total solver calls (SAT/UNSAT): 5(0/5)
Jun 02, 2017 12:28:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :51/250 took 1009 ms. Total solver calls (SAT/UNSAT): 1586(855/731)
Jun 02, 2017 12:28:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :102/250 took 2025 ms. Total solver calls (SAT/UNSAT): 3271(1772/1499)
Jun 02, 2017 12:28:56 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :147/250 took 3042 ms. Total solver calls (SAT/UNSAT): 4939(2677/2262)
Jun 02, 2017 12:28:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :191/250 took 4057 ms. Total solver calls (SAT/UNSAT): 6697(3603/3094)
Jun 02, 2017 12:28:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 5005 ms. Total solver calls (SAT/UNSAT): 8366(4492/3874)
Jun 02, 2017 12:28:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 250 transitions.
Jun 02, 2017 12:28:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :66/250 took 1017 ms. Total solver calls (SAT/UNSAT): 2106(568/1538)
Jun 02, 2017 12:29:00 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :131/250 took 2029 ms. Total solver calls (SAT/UNSAT): 4283(1127/3156)
Jun 02, 2017 12:29:01 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :185/250 took 3045 ms. Total solver calls (SAT/UNSAT): 6441(1749/4692)
Jun 02, 2017 12:29:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3932 ms. Total solver calls (SAT/UNSAT): 8366(2250/6116)
Jun 02, 2017 12:29:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 250 transitions.
Jun 02, 2017 12:29:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(11/250) took 1060 ms. Total solver calls (SAT/UNSAT): 2934(2934/0)
Jun 02, 2017 12:29:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(23/250) took 2090 ms. Total solver calls (SAT/UNSAT): 5724(5724/0)
Jun 02, 2017 12:29:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(34/250) took 3115 ms. Total solver calls (SAT/UNSAT): 8155(8155/0)
Jun 02, 2017 12:29:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(47/250) took 4141 ms. Total solver calls (SAT/UNSAT): 10872(10872/0)
Jun 02, 2017 12:29:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(61/250) took 5171 ms. Total solver calls (SAT/UNSAT): 13609(13609/0)
Jun 02, 2017 12:29:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(77/250) took 6214 ms. Total solver calls (SAT/UNSAT): 16497(16497/0)
Jun 02, 2017 12:29:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(94/250) took 7236 ms. Total solver calls (SAT/UNSAT): 19285(19285/0)
Jun 02, 2017 12:29:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(113/250) took 8246 ms. Total solver calls (SAT/UNSAT): 22059(22059/0)
Jun 02, 2017 12:29:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(135/250) took 9260 ms. Total solver calls (SAT/UNSAT): 24820(24820/0)
Jun 02, 2017 12:29:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(163/250) took 10273 ms. Total solver calls (SAT/UNSAT): 27634(27634/0)
Jun 02, 2017 12:29:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(206/250) took 11280 ms. Total solver calls (SAT/UNSAT): 30429(30429/0)
Jun 02, 2017 12:29:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 11654 ms. Total solver calls (SAT/UNSAT): 31375(31375/0)
Jun 02, 2017 12:29:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 250 transitions.
Jun 02, 2017 12:29:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 10421 ms. Total solver calls (SAT/UNSAT): 1055(0/1055)
Jun 02, 2017 12:29:24 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 31486ms conformant to PINS in folder :/home/mcc/execution
Jun 02, 2017 12:29:27 PM 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([](<>((LTLAP27==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.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: <>([](X([](<>((LTLAP27==true))))))
pins2lts-seq, 0.002: Expression is: (<> ([] (X ([] (<> (LTLAP27 == true ))))))
pins2lts-seq, 0.003: buchi has 2 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 0, | true
pins2lts-seq, 0.003: -> 1, | !(LTLAP27 == true )
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP27 == true )
pins2lts-seq, 0.003: There are 280 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 35, there are 253 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

Jun 02, 2017 12:29:27 PM 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, (LTLAP28==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.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 279, guards 250
pins2lts-seq, 0.021: LTL layer: formula: (LTLAP28==true)
pins2lts-seq, 0.022: Expression is: (LTLAP28 == true )
pins2lts-seq, 0.022: buchi has 2 states
pins2lts-seq, 0.022: state 0: accepting
pins2lts-seq, 0.022: -> 1, | !(LTLAP28 == true )
pins2lts-seq, 0.022: state 1: accepting
pins2lts-seq, 0.022: -> 1, | true
pins2lts-seq, 0.022: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.022: There are 280 state labels and 1 edge labels
pins2lts-seq, 0.022: State length is 35, there are 252 groups
pins2lts-seq, 0.022: Running scc search strategy
pins2lts-seq, 0.022: Using a tree for state storage
pins2lts-seq, 0.022: Visible groups: 0 / 252, labels: 1 / 280
pins2lts-seq, 0.022: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.024: accepting cycle found!
pins2lts-seq, 0.024: exiting now

Jun 02, 2017 12:29:27 PM 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, (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.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 279, guards 250
pins2lts-seq, 0.023: LTL layer: formula: (LTLAP10==true)
pins2lts-seq, 0.023: Expression is: (LTLAP10 == true )
pins2lts-seq, 0.023: buchi has 2 states
pins2lts-seq, 0.023: state 0: accepting
pins2lts-seq, 0.023: -> 1, | !(LTLAP10 == true )
pins2lts-seq, 0.023: state 1: accepting
pins2lts-seq, 0.024: -> 1, | true
pins2lts-seq, 0.024: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.024: There are 280 state labels and 1 edge labels
pins2lts-seq, 0.024: State length is 35, there are 252 groups
pins2lts-seq, 0.024: Running scc search strategy
pins2lts-seq, 0.024: Using a tree for state storage
pins2lts-seq, 0.024: Visible groups: 0 / 252, labels: 1 / 280
pins2lts-seq, 0.024: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.025: accepting cycle found!
pins2lts-seq, 0.025: exiting now

Jun 02, 2017 12:29:27 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 12:29:27 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 12:29:27 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null

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_DNAwalker-PT-04track28LL"
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_DNAwalker-PT-04track28LL.tgz
mv S_DNAwalker-PT-04track28LL 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_DNAwalker-PT-04track28LL, 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 r110-blw3-149441614000033"
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 ;