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)
.................
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 63K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Dekker-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-blw3-152732477600022
=====================================================================

--------------------
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 Dekker-PT-010-LTLFireability-00
FORMULA_NAME Dekker-PT-010-LTLFireability-01
FORMULA_NAME Dekker-PT-010-LTLFireability-02
FORMULA_NAME Dekker-PT-010-LTLFireability-03
FORMULA_NAME Dekker-PT-010-LTLFireability-04
FORMULA_NAME Dekker-PT-010-LTLFireability-05
FORMULA_NAME Dekker-PT-010-LTLFireability-06
FORMULA_NAME Dekker-PT-010-LTLFireability-07
FORMULA_NAME Dekker-PT-010-LTLFireability-08
FORMULA_NAME Dekker-PT-010-LTLFireability-09
FORMULA_NAME Dekker-PT-010-LTLFireability-10
FORMULA_NAME Dekker-PT-010-LTLFireability-11
FORMULA_NAME Dekker-PT-010-LTLFireability-12
FORMULA_NAME Dekker-PT-010-LTLFireability-13
FORMULA_NAME Dekker-PT-010-LTLFireability-14
FORMULA_NAME Dekker-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527985574627

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph5698382487957189712.txt, -o, /tmp/graph5698382487957189712.bin, -w, /tmp/graph5698382487957189712.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph5698382487957189712.bin, -l, -1, -v, -w, /tmp/graph5698382487957189712.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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((("((((((((((u10.flag_0_1>=1)&&(i1.u1.flag_0_2>=1))&&(u2.flag_0_3>=1))&&(u3.flag_0_4>=1))&&(i8.u4.flag_0_5>=1))&&(u5.flag_0_6>=1))&&(u6.flag_0_7>=1))&&(i6.u7.flag_0_8>=1))&&(i9.u8.flag_0_9>=1))&&(i0.u9.p1_0>=1))")U("(((i0.u0.flag_1_0>=1)&&(i1.u11.flag_1_2>=1))&&(i1.u1.p1_2>=1))"))U(X("(((u10.flag_1_1>=1)&&(i1.u11.flag_1_2>=1))&&(i1.u1.p1_2>=1))")))))
Formula 0 simplified : !G(("((((((((((u10.flag_0_1>=1)&&(i1.u1.flag_0_2>=1))&&(u2.flag_0_3>=1))&&(u3.flag_0_4>=1))&&(i8.u4.flag_0_5>=1))&&(u5.flag_0_6>=1))&&(u6.flag_0_7>=1))&&(i6.u7.flag_0_8>=1))&&(i9.u8.flag_0_9>=1))&&(i0.u9.p1_0>=1))" U "(((i0.u0.flag_1_0>=1)&&(i1.u11.flag_1_2>=1))&&(i1.u1.p1_2>=1))") U X"(((u10.flag_1_1>=1)&&(i1.u11.flag_1_2>=1))&&(i1.u1.p1_2>=1))")
built 51 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions exit_0, exit_2, exit_5, exit_8, exit_9, u2.exit_3, u3.exit_4, u5.exit_6, u6.exit_7, u10.exit_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/110/10/120
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.107704,19244,1,0,2408,101,1326,1868,223,109,4487
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(F("(((i1.u11.flag_1_2>=1)&&(u5.flag_1_6>=1))&&(i1.u1.p1_2>=1))")))))
Formula 1 simplified : !GXF"(((i1.u11.flag_1_2>=1)&&(u5.flag_1_6>=1))&&(i1.u1.p1_2>=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.112036,19244,1,0,2692,101,1464,2240,223,109,5025
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(F(("(((u10.flag_1_1>=1)&&(i6.u13.flag_1_8>=1))&&(u10.p1_1>=1))")U(X("((((((((((i0.u0.flag_0_0>=1)&&(i1.u1.flag_0_2>=1))&&(u2.flag_0_3>=1))&&(u3.flag_0_4>=1))&&(i8.u4.flag_0_5>=1))&&(u5.flag_0_6>=1))&&(u6.flag_0_7>=1))&&(i6.u7.flag_0_8>=1))&&(i9.u8.flag_0_9>=1))&&(u10.p1_1>=1))"))))))
Formula 2 simplified : !F("(((u10.flag_1_1>=1)&&(i6.u13.flag_1_8>=1))&&(u10.p1_1>=1))" U X"((((((((((i0.u0.flag_0_0>=1)&&(i1.u1.flag_0_2>=1))&&(u2.flag_0_3>=1))&&(u3.flag_0_4>=1))&&(i8.u4.flag_0_5>=1))&&(u5.flag_0_6>=1))&&(u6.flag_0_7>=1))&&(i6.u7.flag_0_8>=1))&&(i9.u8.flag_0_9>=1))&&(u10.p1_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.119037,19244,1,0,3345,101,1495,3152,223,109,7389
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F("((u6.flag_0_7>=1)&&(u6.p0_7>=1))")))
Formula 3 simplified : !F"((u6.flag_0_7>=1)&&(u6.p0_7>=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.119966,19548,1,0,3345,101,1526,3152,228,109,7400
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Dekker-PT-010-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G((F("(((u3.flag_1_4>=1)&&(u5.flag_1_6>=1))&&(u5.p1_6>=1))"))U(X("(((u6.flag_1_7>=1)&&(i6.u13.flag_1_8>=1))&&(i6.u7.p1_8>=1))"))))))
Formula 4 simplified : !FG(F"(((u3.flag_1_4>=1)&&(u5.flag_1_6>=1))&&(u5.p1_6>=1))" U X"(((u6.flag_1_7>=1)&&(i6.u13.flag_1_8>=1))&&(i6.u7.p1_8>=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.125995,20164,1,0,3793,101,1633,3695,230,109,8228
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(F(X("((u10.flag_1_1>=1)&&(u10.p3_1>=1))"))))U(F(("((u5.flag_1_6>=1)&&(u5.p3_6>=1))")U("(((u3.flag_1_4>=1)&&(u5.flag_1_6>=1))&&(u3.p1_4>=1))")))))
Formula 5 simplified : !(FX"((u10.flag_1_1>=1)&&(u10.p3_1>=1))" U F("((u5.flag_1_6>=1)&&(u5.p3_6>=1))" U "(((u3.flag_1_4>=1)&&(u5.flag_1_6>=1))&&(u3.p1_4>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.130296,20164,1,0,4233,101,1733,4184,230,109,9290
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G("(((i8.u4.flag_1_5>=1)&&(i9.u8.flag_1_9>=1))&&(i9.u14.p1_9>=1))")))
Formula 6 simplified : !G"(((i8.u4.flag_1_5>=1)&&(i9.u8.flag_1_9>=1))&&(i9.u14.p1_9>=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.131785,20164,1,0,4234,101,1768,4204,230,109,9409
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(((i1.u11.flag_1_2>=1)&&(u2.flag_1_3>=1))&&(u2.p1_3>=1))"))
Formula 7 simplified : !"(((i1.u11.flag_1_2>=1)&&(u2.flag_1_3>=1))&&(u2.p1_3>=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,0.132091,20164,1,0,4234,101,1776,4204,230,109,9420
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X("(((u10.flag_1_1>=1)&&(i1.u11.flag_1_2>=1))&&(u10.p1_1>=1))"))))
Formula 8 simplified : !GX"(((u10.flag_1_1>=1)&&(i1.u11.flag_1_2>=1))&&(u10.p1_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.133454,20424,1,0,4246,101,1796,4214,230,109,9486
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X("(((u2.flag_1_3>=1)&&(i6.u13.flag_1_8>=1))&&(i6.u7.p1_8>=1))"))U("((((((((((i0.u0.flag_0_0>=1)&&(u10.flag_0_1>=1))&&(i1.u1.flag_0_2>=1))&&(u2.flag_0_3>=1))&&(u3.flag_0_4>=1))&&(i8.u4.flag_0_5>=1))&&(u5.flag_0_6>=1))&&(u6.flag_0_7>=1))&&(i6.u7.flag_0_8>=1))&&(i9.u14.p1_9>=1))")))
Formula 9 simplified : !(X"(((u2.flag_1_3>=1)&&(i6.u13.flag_1_8>=1))&&(i6.u7.p1_8>=1))" U "((((((((((i0.u0.flag_0_0>=1)&&(u10.flag_0_1>=1))&&(i1.u1.flag_0_2>=1))&&(u2.flag_0_3>=1))&&(u3.flag_0_4>=1))&&(i8.u4.flag_0_5>=1))&&(u5.flag_0_6>=1))&&(u6.flag_0_7>=1))&&(i6.u7.flag_0_8>=1))&&(i9.u14.p1_9>=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.134755,20424,1,0,4247,101,1830,4216,230,109,9535
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(F((F("(((u3.flag_1_4>=1)&&(u6.flag_1_7>=1))&&(u6.p1_7>=1))"))U(F("(((u3.flag_1_4>=1)&&(i9.u8.flag_1_9>=1))&&(u3.p1_4>=1))"))))))
Formula 10 simplified : !F(F"(((u3.flag_1_4>=1)&&(u6.flag_1_7>=1))&&(u6.p1_7>=1))" U F"(((u3.flag_1_4>=1)&&(i9.u8.flag_1_9>=1))&&(u3.p1_4>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.141433,20424,1,0,4829,101,1917,5080,230,109,11080
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G("((i1.u1.flag_0_2>=1)&&(i1.u11.p0_2>=1))")))
Formula 11 simplified : !G"((i1.u1.flag_0_2>=1)&&(i1.u11.p0_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.146441,20680,1,0,5247,101,2018,5694,230,109,12360
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(G(F(X("(((u2.flag_1_3>=1)&&(i6.u13.flag_1_8>=1))&&(u2.p1_3>=1))")))))))
Formula 12 simplified : !XGFX"(((u2.flag_1_3>=1)&&(i6.u13.flag_1_8>=1))&&(u2.p1_3>=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.150131,20944,1,0,5540,101,2129,6087,230,109,12909
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(("(((i0.u0.flag_1_0>=1)&&(u2.flag_1_3>=1))&&(u2.p1_3>=1))")U(G("(((i0.u0.flag_1_0>=1)&&(u6.flag_1_7>=1))&&(i0.u9.p1_0>=1))")))))
Formula 13 simplified : !X("(((i0.u0.flag_1_0>=1)&&(u2.flag_1_3>=1))&&(u2.p1_3>=1))" U G"(((i0.u0.flag_1_0>=1)&&(u6.flag_1_7>=1))&&(i0.u9.p1_0>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.152875,21172,1,0,5540,101,2200,6087,232,109,12997
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((X(G("(((i1.u11.flag_1_2>=1)&&(i9.u8.flag_1_9>=1))&&(i1.u1.p1_2>=1))")))U(X(X("((u6.flag_0_7>=1)&&(u6.p0_7>=1))"))))))
Formula 14 simplified : !F(XG"(((i1.u11.flag_1_2>=1)&&(i9.u8.flag_1_9>=1))&&(i1.u1.p1_2>=1))" U XX"((u6.flag_0_7>=1)&&(u6.p0_7>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.163826,21172,1,0,5620,101,2227,6225,232,109,13333
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(G(G(("(((i0.u0.flag_1_0>=1)&&(u3.flag_1_4>=1))&&(u3.p1_4>=1))")U("(((i1.u11.flag_1_2>=1)&&(i8.u4.flag_1_5>=1))&&(i8.u12.p1_5>=1))"))))))
Formula 15 simplified : !XG("(((i0.u0.flag_1_0>=1)&&(u3.flag_1_4>=1))&&(u3.p1_4>=1))" U "(((i1.u11.flag_1_2>=1)&&(i8.u4.flag_1_5>=1))&&(i8.u12.p1_5>=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.165954,21172,1,0,5620,101,2281,6225,232,109,13401
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 40
// Phase 1: matrix 40 rows 50 cols
invariant :i6:u7:flag_0_8 + -1'i6:u13:p0_8 = 0
invariant :i6:u13:flag_1_8 + i6:u13:p0_8 = 1
invariant :u2:flag_1_3 + -1'u2:p1_3 + -1'u2:p3_3 = 0
invariant :u5:p0_6 + u5:p1_6 + u5:p3_6 = 1
invariant :u10:p0_1 + u10:p1_1 + u10:p3_1 = 1
invariant :u2:p0_3 + u2:p1_3 + u2:p3_3 = 1
invariant :u5:flag_1_6 + -1'u5:p1_6 + -1'u5:p3_6 = 0
invariant :i8:u12:p0_5 + i8:u12:p1_5 + i8:u12:p3_5 = 1
invariant :i9:u8:flag_1_9 + -1'i9:u14:p1_9 + -1'i9:u14:p3_9 = 0
invariant :u5:flag_0_6 + u5:p1_6 + u5:p3_6 = 1
invariant :u6:flag_1_7 + -1'u6:p1_7 + -1'u6:p3_7 = 0
invariant :u10:flag_1_1 + -1'u10:p1_1 + -1'u10:p3_1 = 0
invariant :u3:flag_0_4 + u3:p1_4 + u3:p34 = 1
invariant :i8:u4:flag_1_5 + -1'i8:u12:p1_5 + -1'i8:u12:p3_5 = 0
invariant :u6:p0_7 + u6:p1_7 + u6:p3_7 = 1
invariant :i1:u1:p1_2 + i1:u1:p3_2 + i1:u11:p0_2 = 1
invariant :i1:u1:flag_0_2 + -1'i1:u11:p0_2 = 0
invariant :u6:flag_0_7 + u6:p1_7 + u6:p3_7 = 1
invariant :u10:flag_0_1 + u10:p1_1 + u10:p3_1 = 1
invariant :u2:flag_0_3 + u2:p1_3 + u2:p3_3 = 1
invariant :i1:u11:flag_1_2 + i1:u11:p0_2 = 1
invariant :i9:u14:p0_9 + i9:u14:p1_9 + i9:u14:p3_9 = 1
invariant :i0:u0:flag_1_0 + -1'i0:u9:p1_0 + -1'i0:u9:p3_0 = 0
invariant :i8:u4:flag_0_5 + i8:u12:p1_5 + i8:u12:p3_5 = 1
invariant :u3:flag_1_4 + -1'u3:p1_4 + -1'u3:p34 = 0
invariant :i6:u7:p1_8 + i6:u7:p3_8 + i6:u13:p0_8 = 1
invariant :u3:p0_4 + u3:p1_4 + u3:p34 = 1
invariant :i0:u0:flag_0_0 + i0:u9:p1_0 + i0:u9:p3_0 = 1
invariant :i0:u9:p0_0 + i0:u9:p1_0 + i0:u9:p3_0 = 1
invariant :i9:u8:flag_0_9 + i9:u14:p1_9 + i9:u14:p3_9 = 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527985578100

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 55 ms
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 120 transitions.
Jun 03, 2018 12:26:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 76 ms
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 33 ms
Begin: Sun Jun 3 00:26:16 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 00:26:16 2018
network size: 50 nodes, 680 links, 240 weight
quality increased from -0.0235104 to 0.433112
end computation: Sun Jun 3 00:26:16 2018
level 1:
start computation: Sun Jun 3 00:26:16 2018
network size: 15 nodes, 219 links, 240 weight
quality increased from 0.433112 to 0.575
end computation: Sun Jun 3 00:26:16 2018
level 2:
start computation: Sun Jun 3 00:26:16 2018
network size: 10 nodes, 100 links, 240 weight
quality increased from 0.575 to 0.575
end computation: Sun Jun 3 00:26:16 2018
End: Sun Jun 3 00:26:16 2018
Total duration: 0 sec
0.575
Jun 03, 2018 12:26:16 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 12:26:17 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
Jun 03, 2018 12:26:17 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 12:26:17 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 285 redundant transitions.
Jun 03, 2018 12:26:17 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Jun 03, 2018 12:26:17 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 12:26:17 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 120 transitions.
Jun 03, 2018 12:26:17 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 11 ms
Skipping mayMatrices nes/nds SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.computeAndDeclareInvariants(KInductionSolver.java:293)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:71)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 03, 2018 12:26:17 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 375ms conformant to PINS in folder :/home/mcc/execution

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="Dekker-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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/Dekker-PT-010.tgz
mv Dekker-PT-010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is Dekker-PT-010, 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 r237-blw3-152732477600022"
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 ;