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_RwMutex-PT-r0010w0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-csrt-149443434700141
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496654482729


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(X(X(X((((((((((("p17>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1"))))))))
Formula 0 simplified : !FXXX("p17>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 50 cols
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p29 + 1'p39= -8
invariant : 1'p12 + 1'p42= 1
invariant : 1'p26 + 1'p6= 1
invariant : 1'p28 + 1'p8= 1
invariant : 1'p20 + 1'p50= 1
invariant : 1'p11 + 1'p31= 1
invariant : 1'p23 + 1'p3= 1
invariant : 1'p17 + 1'p47= 1
invariant : 1'p29 + 1'p9= 1
invariant : 1'p1 + -1'p10 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p40= -9
invariant : 1'p13 + 1'p43= 1
invariant : 1'p10 + 1'p30= 1
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p26 + 1'p36= -8
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p27 + 1'p37= -8
invariant : 1'p2 + 1'p22= 1
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p2 + -1'p20 + 1'p32= -9
invariant : 1'p1 + -1'p11 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p41= -9
invariant : 1'p18 + 1'p48= 1
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p24 + 1'p34= -8
invariant : 1'p19 + 1'p49= 1
invariant : 1'p27 + 1'p7= 1
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p28 + 1'p38= -8
invariant : 1'p16 + 1'p46= 1
invariant : 1'p24 + 1'p4= 1
invariant : 1'p25 + 1'p5= 1
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p23 + 1'p33= -8
invariant : 1'p1 + -1'p12 + -1'p13 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + 1'p25 + 1'p35= -8
invariant : 1'p14 + 1'p44= 1
invariant : 1'p1 + 1'p21= 1
invariant : 1'p15 + 1'p45= 1
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
72 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.76898,48624,1,0,29,48304,70,8,1425,38210,62
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F(G((("p36>=1")&&("p6>=1"))U("p49>=1"))))))
Formula 1 simplified : !GFG(("p6>=1" & "p36>=1") U "p49>=1")
1 unique states visited
1 strongly connected components in search stack
1 transitions explored
1 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.804771,49964,1,0,42,50311,97,18,1480,43017,123
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(X(("p37>=1")&&("p7>=1")))))
Formula 2 simplified : !GX("p7>=1" & "p37>=1")
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.824254,50768,1,0,52,51088,110,19,1486,44164,182
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(G("p44>=1"))))
Formula 3 simplified : !XG"p44>=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.826948,51040,1,0,54,51118,116,20,1487,44348,200
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((G(G("p22>=1")))U(F(X(("p11>=1")&&("p41>=1")))))))
Formula 4 simplified : !G(G"p22>=1" U FX("p11>=1" & "p41>=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.833473,51156,1,0,56,51138,128,20,1491,44376,218
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((((((((((("p21>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1")))
Formula 5 simplified : !("p21>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=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.852789,51416,1,0,56,51138,134,20,1495,44376,220
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X(G(F(X((((((((((("p12>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1"))))))))
Formula 6 simplified : !FXGFX("p12>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1")
4 unique states visited
4 strongly connected components in search stack
5 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.955029,51512,1,0,56,51138,146,20,1499,44403,232
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X((((((((((((("p17>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1"))U((((((((((("p13>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1")))U(F((((((((((("p17>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1"))))))
Formula 7 simplified : !X((("p17>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1") U ("p13>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1")) U F("p17>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1"))
3 unique states visited
3 strongly connected components in search stack
3 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,1.00746,51456,1,0,60,52067,146,22,1499,45410,245
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((G(F(F((((((((((("p17>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1")))))U(("p29>=1")U(X("p24>=1")))))
Formula 8 simplified : !(GF("p17>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1") U ("p29>=1" U X"p24>=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]
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.68002,52716,1,0,70,52550,205,30,1554,46265,297
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(F(G(G(G("p43>=1")))))))
Formula 9 simplified : !XFG"p43>=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,1.68513,52716,1,0,81,52731,218,39,1555,47112,379
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F("p45>=1")))
Formula 10 simplified : !F"p45>=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,1.68735,52720,1,0,91,52832,227,39,1556,47197,436
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(X(F(F(G("p24>=1")))))))
Formula 11 simplified : !FXFG"p24>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.75468,53956,1,0,120,58464,237,49,1556,55792,499
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(G((((((((((("p14>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1")))))
Formula 12 simplified : !FG("p14>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.78823,54228,1,0,120,58699,273,61,1588,57042,550
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(("p26>=1")U(F((((((((((("p21>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1"))))))
Formula 13 simplified : !X("p26>=1" U F("p21>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.84853,55396,1,0,120,58702,279,61,1588,57054,578
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X((((((((((("p18>=1")&&("p32>=1"))&&("p33>=1"))&&("p34>=1"))&&("p35>=1"))&&("p36>=1"))&&("p37>=1"))&&("p38>=1"))&&("p39>=1"))&&("p40>=1"))&&("p41>=1"))))
Formula 14 simplified : !X("p18>=1" & "p32>=1" & "p33>=1" & "p34>=1" & "p35>=1" & "p36>=1" & "p37>=1" & "p38>=1" & "p39>=1" & "p40>=1" & "p41>=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,1.87458,55396,1,0,120,58702,285,61,1592,57054,580
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X(X("p25>=1")))))
Formula 15 simplified : !GXX"p25>=1"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.91263,56256,1,0,139,62142,291,70,1593,62182,634
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496654487355

--------------------
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 9:21:24 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 9:21:24 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 53 ms
Jun 05, 2017 9:21:24 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Jun 05, 2017 9:21:24 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 transitions.
Jun 05, 2017 9:21:24 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 57 ms
Jun 05, 2017 9:21:24 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 29 ms
Jun 05, 2017 9:21:24 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 05, 2017 9:21:25 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 16 ms
Jun 05, 2017 9:21:25 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 314 ms
Jun 05, 2017 9:21:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 40 transitions.
Jun 05, 2017 9:21:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/40 took 8 ms. Total solver calls (SAT/UNSAT): 22(11/11)
Jun 05, 2017 9:21:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 231 ms. Total solver calls (SAT/UNSAT): 660(330/330)
Jun 05, 2017 9:21:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 40 transitions.
Jun 05, 2017 9:21:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 223 ms. Total solver calls (SAT/UNSAT): 660(330/330)
Jun 05, 2017 9:21:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 40 transitions.
Jun 05, 2017 9:21:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 129 ms. Total solver calls (SAT/UNSAT): 820(325/495)
Jun 05, 2017 9:21:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 40 transitions.
Jun 05, 2017 9:21:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 05, 2017 9:21:26 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1180ms conformant to PINS in folder :/home/mcc/execution
Jun 05, 2017 9:21:27 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 exact ! Faster fixpoint algorithm enabled.

Jun 05, 2017 9:21:27 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 05, 2017 9:21:27 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 05, 2017 9:21:27 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTS min runner thread failed on error :java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:66)
at java.lang.Thread.run(Thread.java:748)

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_RwMutex-PT-r0010w0010"
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_RwMutex-PT-r0010w0010.tgz
mv S_RwMutex-PT-r0010w0010 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_RwMutex-PT-r0010w0010, 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-149443434700141"
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 ;