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 308K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K 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 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 139K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Dekker-PT-015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r236-blw3-152732477000024
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527945001914

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.201805151631/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.201805151631/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 : !((X(F(F("(((flag_1_2>=1)&&(flag_1_7>=1))&&(p1_2>=1))")))))
Formula 0 simplified : !XF"(((flag_1_2>=1)&&(flag_1_7>=1))&&(p1_2>=1))"
Reverse transition relation is NOT exact ! Due to transitions exit_0, exit_1, exit_2, exit_3, exit_4, exit_5, exit_6, exit_7, exit_8, exit_9, exit_10, exit_11, exit_12, exit_13, exit_14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/240/15/255
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 60
// Phase 1: matrix 60 rows 75 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
37 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.416959,28972,1,0,565,80802,536,273,4935,53554,604
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F("(((((((((((((((flag_0_0>=1)&&(flag_0_2>=1))&&(flag_0_3>=1))&&(flag_0_4>=1))&&(flag_0_5>=1))&&(flag_0_6>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_11>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_1>=1))"))U(X(G(X("(((flag_1_0>=1)&&(flag_1_5>=1))&&(p1_0>=1))"))))))
Formula 1 simplified : !(F"(((((((((((((((flag_0_0>=1)&&(flag_0_2>=1))&&(flag_0_3>=1))&&(flag_0_4>=1))&&(flag_0_5>=1))&&(flag_0_6>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_11>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_1>=1))" U XGX"(((flag_1_0>=1)&&(flag_1_5>=1))&&(p1_0>=1))")
invariant :flag_1_0 + -1'p1_0 + -1'p3_0 = 0
invariant :flag_0_7 + p1_7 + p3_7 = 1
invariant :p0_13 + p1_13 + p3_13 = 1
invariant :p0_4 + p1_4 + p3_4 = 1
invariant :flag_1_5 + -1'p1_5 + -1'p3_5 = 0
invariant :flag_0_10 + p1_10 + p3_10 = 1
invariant :flag_1_13 + -1'p1_13 + -1'p3_13 = 0
invariant :flag_1_10 + -1'p1_10 + -1'p3_10 = 0
invariant :p0_10 + p1_10 + p3_10 = 1
invariant :flag_1_6 + -1'p1_6 + -1'p3_6 = 0
invariant :flag_1_11 + -1'p1_11 + -1'p3_11 = 0
invariant :flag_0_1 + p1_1 + p3_1 = 1
invariant :flag_0_3 + p1_3 + p3_3 = 1
invariant :flag_1_2 + -1'p1_2 + -1'p3_2 = 0
invariant :p0_12 + p1_12 + p3_12 = 1
invariant :flag_0_9 + p1_9 + p3_9 = 1
invariant :flag_1_12 + -1'p1_12 + -1'p3_12 = 0
invariant :flag_0_12 + p1_12 + p3_12 = 1
invariant :flag_0_4 + p1_4 + p3_4 = 1
invariant :p0_6 + p1_6 + p3_6 = 1
invariant :flag_0_0 + p1_0 + p3_0 = 1
invariant :flag_0_5 + p1_5 + p3_5 = 1
invariant :p0_5 + p1_5 + p3_5 = 1
invariant :p0_9 + p1_9 + p3_9 = 1
invariant :flag_1_7 + -1'p1_7 + -1'p3_7 = 0
invariant :flag_0_11 + p1_11 + p3_11 = 1
invariant :p0_7 + p1_7 + p3_7 = 1
invariant :flag_1_9 + -1'p1_9 + -1'p3_9 = 0
invariant :flag_1_14 + -1'p1_14 + -1'p3_14 = 0
invariant :p0_3 + p1_3 + p3_3 = 1
invariant :flag_0_14 + p1_14 + p3_14 = 1
invariant :flag_1_3 + -1'p1_3 + -1'p3_3 = 0
invariant :p0_2 + p1_2 + p3_2 = 1
invariant :p0_14 + p1_14 + p3_14 = 1
invariant :flag_0_8 + p1_8 + p3_8 = 1
invariant :p0_1 + p1_1 + p3_1 = 1
invariant :p0_0 + p1_0 + p3_0 = 1
invariant :flag_1_8 + -1'p1_8 + -1'p3_8 = 0
invariant :p0_11 + p1_11 + p3_11 = 1
invariant :flag_0_13 + p1_13 + p3_13 = 1
invariant :flag_0_6 + p1_6 + p3_6 = 1
invariant :flag_1_4 + -1'p1_4 + -1'p3_4 = 0
invariant :p0_8 + p1_8 + p3_8 = 1
invariant :flag_1_1 + -1'p1_1 + -1'p3_1 = 0
invariant :flag_0_2 + p1_2 + p3_2 = 1
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
21 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.632093,36468,1,0,597,118711,554,286,5060,77499,696
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(X(G(("(((flag_1_0>=1)&&(flag_1_4>=1))&&(p1_4>=1))")U("(((flag_1_3>=1)&&(flag_1_8>=1))&&(p1_8>=1))"))))))
Formula 2 simplified : !GXG("(((flag_1_0>=1)&&(flag_1_4>=1))&&(p1_4>=1))" U "(((flag_1_3>=1)&&(flag_1_8>=1))&&(p1_8>=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.637241,36832,1,0,597,118711,572,286,5079,77525,710
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(F(X(("(((flag_1_7>=1)&&(flag_1_11>=1))&&(p1_7>=1))")U("(((flag_1_9>=1)&&(flag_1_14>=1))&&(p1_9>=1))"))))))
Formula 3 simplified : !FX("(((flag_1_7>=1)&&(flag_1_11>=1))&&(p1_7>=1))" U "(((flag_1_9>=1)&&(flag_1_14>=1))&&(p1_9>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
14 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.786644,42104,1,0,612,153271,581,286,5084,94188,792
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F((G(G("(((flag_1_4>=1)&&(flag_1_8>=1))&&(p1_4>=1))")))U(F("(((flag_1_10>=1)&&(flag_1_14>=1))&&(p1_14>=1))")))))
Formula 4 simplified : !F(G"(((flag_1_4>=1)&&(flag_1_8>=1))&&(p1_4>=1))" U F"(((flag_1_10>=1)&&(flag_1_14>=1))&&(p1_14>=1))")
2 unique states visited
2 strongly connected components in search stack
2 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.899736,44744,1,0,629,168618,590,289,5088,103137,879
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("(((flag_1_9>=1)&&(flag_1_13>=1))&&(p1_13>=1))"))
Formula 5 simplified : !"(((flag_1_9>=1)&&(flag_1_13>=1))&&(p1_13>=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.900398,44744,1,0,629,168618,593,289,5092,103137,881
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(F(F(X("(((flag_1_1>=1)&&(flag_1_5>=1))&&(p1_5>=1))"))))))
Formula 6 simplified : !FX"(((flag_1_1>=1)&&(flag_1_5>=1))&&(p1_5>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
16 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.06044,48704,1,0,644,200760,602,289,5096,120349,963
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(("(((((((((((((((flag_0_0>=1)&&(flag_0_1>=1))&&(flag_0_2>=1))&&(flag_0_3>=1))&&(flag_0_4>=1))&&(flag_0_5>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_11>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_6>=1))")U(X(G("(((flag_1_6>=1)&&(flag_1_10>=1))&&(p1_10>=1))"))))))
Formula 7 simplified : !F("(((((((((((((((flag_0_0>=1)&&(flag_0_1>=1))&&(flag_0_2>=1))&&(flag_0_3>=1))&&(flag_0_4>=1))&&(flag_0_5>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_11>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_6>=1))" U XG"(((flag_1_6>=1)&&(flag_1_10>=1))&&(p1_10>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
29 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.3539,57924,1,0,702,260614,615,318,5101,161243,1124
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(X(G(X("(((((((((((((((flag_0_1>=1)&&(flag_0_2>=1))&&(flag_0_3>=1))&&(flag_0_4>=1))&&(flag_0_5>=1))&&(flag_0_6>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_11>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_0>=1))"))))))
Formula 8 simplified : !XXGX"(((((((((((((((flag_0_1>=1)&&(flag_0_2>=1))&&(flag_0_3>=1))&&(flag_0_4>=1))&&(flag_0_5>=1))&&(flag_0_6>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_11>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_0>=1))"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.37684,58836,1,0,707,262215,621,320,5129,163758,1145
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(X(X("(((flag_1_9>=1)&&(flag_1_12>=1))&&(p1_12>=1))")))))
Formula 9 simplified : !GXX"(((flag_1_9>=1)&&(flag_1_12>=1))&&(p1_12>=1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.44203,60936,1,0,751,276136,627,335,5134,175683,1228
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("((flag_1_6>=1)&&(p3_6>=1))"))
Formula 10 simplified : !"((flag_1_6>=1)&&(p3_6>=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.44261,61200,1,0,751,276136,630,335,5136,175683,1230
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("((flag_0_13>=1)&&(p0_13>=1))")))
Formula 11 simplified : !X"((flag_0_13>=1)&&(p0_13>=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.44394,61200,1,0,752,276151,633,335,5138,175780,1237
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("(((flag_1_10>=1)&&(flag_1_13>=1))&&(p1_13>=1))"))
Formula 12 simplified : !"(((flag_1_10>=1)&&(flag_1_13>=1))&&(p1_13>=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.44433,61200,1,0,752,276151,636,335,5140,175780,1239
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(X(F(X(F("(((flag_1_0>=1)&&(flag_1_10>=1))&&(p1_0>=1))")))))))
Formula 13 simplified : !FXFXF"(((flag_1_0>=1)&&(flag_1_10>=1))&&(p1_0>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
15 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.59818,66476,1,0,767,306791,645,336,5141,194014,1319
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((X(F(F("(((flag_1_7>=1)&&(flag_1_9>=1))&&(p1_9>=1))"))))U(F("(((flag_1_1>=1)&&(flag_1_7>=1))&&(p1_1>=1))"))))
Formula 14 simplified : !(XF"(((flag_1_7>=1)&&(flag_1_9>=1))&&(p1_9>=1))" U F"(((flag_1_1>=1)&&(flag_1_7>=1))&&(p1_1>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
28 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.87953,70964,1,0,782,338337,654,336,5143,210513,1403
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((((F("(((flag_1_0>=1)&&(flag_1_5>=1))&&(p1_0>=1))"))U("(((flag_1_1>=1)&&(flag_1_12>=1))&&(p1_12>=1))"))U(("(((flag_1_7>=1)&&(flag_1_12>=1))&&(p1_7>=1))")U("(((flag_1_6>=1)&&(flag_1_13>=1))&&(p1_6>=1))"))))
Formula 15 simplified : !((F"(((flag_1_0>=1)&&(flag_1_5>=1))&&(p1_0>=1))" U "(((flag_1_1>=1)&&(flag_1_12>=1))&&(p1_12>=1))") U ("(((flag_1_7>=1)&&(flag_1_12>=1))&&(p1_7>=1))" U "(((flag_1_6>=1)&&(flag_1_13>=1))&&(p1_6>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
30 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,2.17879,80864,1,0,816,405630,673,338,5159,250789,1577
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-015-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1527945007001

--------------------
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/ -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/ -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 02, 2018 1:10:03 PM 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/, -smt]
Jun 02, 2018 1:10:03 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 1:10:03 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 82 ms
Jun 02, 2018 1:10:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 75 places.
Jun 02, 2018 1:10:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 255 transitions.
Jun 02, 2018 1:10:03 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 25 ms
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 130 ms
Jun 02, 2018 1:10:04 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Jun 02, 2018 1:10:04 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 255 transitions.
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 45 place invariants in 21 ms
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 75 variables to be positive in 250 ms
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 255 transitions.
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/255 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 255 transitions.
Jun 02, 2018 1:10:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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 02, 2018 1:10:06 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2507ms 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-015"
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/Dekker-PT-015.tgz
mv Dekker-PT-015 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 itstools"
echo " Input is Dekker-PT-015, 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 r236-blw3-152732477000024"
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 ;