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 LamportFastMutEx-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-blw7-149440486300149
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496267399337


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 : !(((("((P_CS_21[0]+P_CS_21[1])+P_CS_21[2])>=3")U("((y[0]+y[1])+y[2])>=2"))U(F(X("(((((b[0]+b[1])+b[2])+b[3])+b[4])+b[5])>=2")))))
Formula 0 simplified : !(("((P_CS_21[0]+P_CS_21[1])+P_CS_21[2])>=3" U "((y[0]+y[1])+y[2])>=2") U FX"(((((b[0]+b[1])+b[2])+b[3])+b[4])+b[5])>=2")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
12 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.138399,27968,1,0,80,18395,93,31,2050,15405,80
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F(F("((P_awaity[0]+P_awaity[1])+P_awaity[2])<=((P_fordo_12[0]+P_fordo_12[1])+P_fordo_12[2])")))))
Formula 1 simplified : !F"((P_awaity[0]+P_awaity[1])+P_awaity[2])<=((P_fordo_12[0]+P_fordo_12[1])+P_fordo_12[2])"
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.138935,28188,1,0,80,18395,102,31,2058,15405,84
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((P_setx_3[0]+P_setx_3[1])+P_setx_3[2])>=2"))
Formula 2 simplified : !"((P_setx_3[0]+P_setx_3[1])+P_setx_3[2])>=2"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 96 rows 69 cols
invariant : 1'wait[3] + 1'done[3]= 0
invariant : 1'wait[4] + -1'P_await_13[1] + 1'done[4]= 0
invariant : 1'P_start_1[1] + 1'P_setx_3[1] + 1'P_setbi_5[1] + 1'P_ify0_4[1] + 1'P_sety_9[1] + 1'P_ifxi_10[1] + 1'P_setbi_11[1] + 1'P_fordo_12[1] + 1'P_await_13[1] + 1'P_ifyi_15[1] + 1'P_awaity[1] + 1'P_CS_21[1] + 1'P_setbi_24[1]= 1
invariant : 1'wait[5] + -1'P_await_13[1] + 1'done[5]= 0
invariant : 1'wait[1] + -1'P_await_13[0] + 1'done[1]= 0
invariant : 1'wait[8] + -1'P_await_13[2] + 1'done[8]= 0
invariant : 1'b[4] + 1'b[5]= 1
invariant : 1'b[2] + 1'b[3]= 1
invariant : 1'y[0] + 1'y[1] + 1'y[2]= 1
invariant : 1'b[0] + 1'b[1]= 0
invariant : 1'P_start_1[2] + 1'P_setx_3[2] + 1'P_setbi_5[2] + 1'P_ify0_4[2] + 1'P_sety_9[2] + 1'P_ifxi_10[2] + 1'P_setbi_11[2] + 1'P_fordo_12[2] + 1'P_await_13[2] + 1'P_ifyi_15[2] + 1'P_awaity[2] + 1'P_CS_21[2] + 1'P_setbi_24[2]= 1
invariant : 1'P_start_1[0] + 1'P_setx_3[0] + 1'P_setbi_5[0] + 1'P_ify0_4[0] + 1'P_sety_9[0] + 1'P_ifxi_10[0] + 1'P_setbi_11[0] + 1'P_fordo_12[0] + 1'P_await_13[0] + 1'P_ifyi_15[0] + 1'P_awaity[0] + 1'P_CS_21[0] + 1'P_setbi_24[0]= 0
invariant : 1'wait[6] + 1'done[6]= 0
invariant : 1'x[0] + 1'x[1] + 1'x[2]= 1
invariant : 1'wait[7] + -1'P_await_13[2] + 1'done[7]= 0
invariant : 1'wait[0] + 1'done[0]= 0
invariant : 1'wait[2] + -1'P_await_13[0] + 1'done[2]= 0
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.175108,29368,1,0,83,22786,111,31,2130,21577,105
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(F("(((((b[0]+b[1])+b[2])+b[3])+b[4])+b[5])<=((y[0]+y[1])+y[2])")))))
Formula 3 simplified : !XXF"(((((b[0]+b[1])+b[2])+b[3])+b[4])+b[5])<=((y[0]+y[1])+y[2])"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.277865,32468,1,0,124,36383,120,53,2144,39938,223
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((("((P_await_13[0]+P_await_13[1])+P_await_13[2])>=3")U("((P_awaity[0]+P_awaity[1])+P_awaity[2])>=1"))U("((P_await_13[0]+P_await_13[1])+P_await_13[2])>=2")))
Formula 4 simplified : !(("((P_await_13[0]+P_await_13[1])+P_await_13[2])>=3" U "((P_awaity[0]+P_awaity[1])+P_awaity[2])>=1") U "((P_await_13[0]+P_await_13[1])+P_await_13[2])>=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,0.280557,33256,1,0,124,36383,142,53,2174,39940,230
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(F(F("((P_sety_9[0]+P_sety_9[1])+P_sety_9[2])>=3"))))))
Formula 5 simplified : !XF"((P_sety_9[0]+P_sety_9[1])+P_sety_9[2])>=3"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.319389,34124,1,0,145,39893,151,76,2182,45644,349
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(X("((P_awaity[0]+P_awaity[1])+P_awaity[2])>=2")))U("((P_await_13[0]+P_await_13[1])+P_await_13[2])<=((((((((wait[0]+wait[1])+wait[2])+wait[3])+wait[4])+wait[5])+wait[6])+wait[7])+wait[8])")))
Formula 6 simplified : !(FX"((P_awaity[0]+P_awaity[1])+P_awaity[2])>=2" U "((P_await_13[0]+P_await_13[1])+P_await_13[2])<=((((((((wait[0]+wait[1])+wait[2])+wait[3])+wait[4])+wait[5])+wait[6])+wait[7])+wait[8])")
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.321192,34128,1,0,145,39893,154,76,2196,45644,351
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((P_ifxi_10[0]+P_ifxi_10[1])+P_ifxi_10[2])<=((P_CS_21[0]+P_CS_21[1])+P_CS_21[2])"))
Formula 7 simplified : !"((P_ifxi_10[0]+P_ifxi_10[1])+P_ifxi_10[2])<=((P_CS_21[0]+P_CS_21[1])+P_CS_21[2])"
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.321995,34232,1,0,145,39893,157,76,2204,45644,353
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((P_setx_3[0]+P_setx_3[1])+P_setx_3[2])>=3")))
Formula 8 simplified : !F"((P_setx_3[0]+P_setx_3[1])+P_setx_3[2])>=3"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.352746,34968,1,0,167,42145,166,100,2211,50688,482
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((P_fordo_12[0]+P_fordo_12[1])+P_fordo_12[2])<=((P_sety_9[0]+P_sety_9[1])+P_sety_9[2])"))
Formula 9 simplified : !"((P_fordo_12[0]+P_fordo_12[1])+P_fordo_12[2])<=((P_sety_9[0]+P_sety_9[1])+P_sety_9[2])"
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.353345,34968,1,0,167,42145,169,100,2219,50688,484
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("((((((((wait[0]+wait[1])+wait[2])+wait[3])+wait[4])+wait[5])+wait[6])+wait[7])+wait[8])>=3")))
Formula 10 simplified : !G"((((((((wait[0]+wait[1])+wait[2])+wait[3])+wait[4])+wait[5])+wait[6])+wait[7])+wait[8])>=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.354347,35248,1,0,167,42146,175,100,2238,50689,489
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((("((P_setx_3[0]+P_setx_3[1])+P_setx_3[2])>=1")U("((P_ifxi_10[0]+P_ifxi_10[1])+P_ifxi_10[2])>=2"))U(X(G("((x[0]+x[1])+x[2])>=3")))))
Formula 11 simplified : !(("((P_setx_3[0]+P_setx_3[1])+P_setx_3[2])>=1" U "((P_ifxi_10[0]+P_ifxi_10[1])+P_ifxi_10[2])>=2") U XG"((x[0]+x[1])+x[2])>=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.363266,37196,1,0,167,42603,201,100,2266,51520,506
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X("((x[0]+x[1])+x[2])<=((P_await_13[0]+P_await_13[1])+P_await_13[2])")))
Formula 12 simplified : !X"((x[0]+x[1])+x[2])<=((P_await_13[0]+P_await_13[1])+P_await_13[2])"
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.363916,37196,1,0,167,42603,204,100,2274,51520,508
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(F(("((P_setbi_5[0]+P_setbi_5[1])+P_setbi_5[2])>=1")U("((P_ifyi_15[0]+P_ifyi_15[1])+P_ifyi_15[2])<=((P_fordo_12[0]+P_fordo_12[1])+P_fordo_12[2])")))))
Formula 13 simplified : !XF("((P_setbi_5[0]+P_setbi_5[1])+P_setbi_5[2])>=1" U "((P_ifyi_15[0]+P_ifyi_15[1])+P_ifyi_15[2])<=((P_fordo_12[0]+P_fordo_12[1])+P_fordo_12[2])")
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.364467,37360,1,0,167,42603,213,100,2282,51520,512
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(X(("((((((((done[0]+done[1])+done[2])+done[3])+done[4])+done[5])+done[6])+done[7])+done[8])>=3")U("((P_CS_21[0]+P_CS_21[1])+P_CS_21[2])<=(((((b[0]+b[1])+b[2])+b[3])+b[4])+b[5])")))))
Formula 14 simplified : !XX("((((((((done[0]+done[1])+done[2])+done[3])+done[4])+done[5])+done[6])+done[7])+done[8])>=3" U "((P_CS_21[0]+P_CS_21[1])+P_CS_21[2])<=(((((b[0]+b[1])+b[2])+b[3])+b[4])+b[5])")
3 unique states visited
0 strongly connected components in search stack
2 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.36544,37360,1,0,167,42603,223,100,2300,51520,516
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G("((((((((done[0]+done[1])+done[2])+done[3])+done[4])+done[5])+done[6])+done[7])+done[8])>=1")))
Formula 15 simplified : !G"((((((((done[0]+done[1])+done[2])+done[3])+done[4])+done[5])+done[6])+done[7])+done[8])>=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.366233,37380,1,0,167,42603,229,100,2319,51521,521
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0

BK_STOP 1496267403180

--------------------
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
May 31, 2017 9:50:00 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 9:50:00 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 31, 2017 9:50:02 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1402 ms
May 31, 2017 9:50:02 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 18 places.
May 31, 2017 9:50:02 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 31, 2017 9:50:02 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

May 31, 2017 9:50:02 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 17 transitions.
May 31, 2017 9:50:02 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 31, 2017 9:50:02 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $y of transition T_yeqi_15
May 31, 2017 9:50:02 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $x of transition T_xeqi_10
May 31, 2017 9:50:02 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 7 instantiations of transitions. Total transitions/syncs built is 119
May 31, 2017 9:50:02 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 66 ms
May 31, 2017 9:50:02 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 9 ms
May 31, 2017 9:50:02 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 31, 2017 9:50:02 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 17 place invariants in 27 ms
May 31, 2017 9:50:02 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 69 variables to be positive in 136 ms
May 31, 2017 9:50:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 96 transitions.
May 31, 2017 9:50:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/96 took 2 ms. Total solver calls (SAT/UNSAT): 9(1/8)
May 31, 2017 9:50:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 129 ms. Total solver calls (SAT/UNSAT): 1050(106/944)
May 31, 2017 9:50:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 96 transitions.
May 31, 2017 9:50:02 PM 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 T_setx_3_0, T_setx_3_1, T_setx_3_2, T_awaity, T_sety_9_1, T_sety_9_2, T_ynei_15_1, T_ynei_15_2, T_yeqi_15_1, T_yeqi_15_2, T_sety0_23, T_setbi_24_0, T_setbi_24_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :11/15/13/39

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="LamportFastMutEx-COL-2"
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/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 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 LamportFastMutEx-COL-2, 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 r040-blw7-149440486300149"
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 ;