Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r052-oct2-155234410600862.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................
=====================================================================
Generated by BenchKit 2-3954
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 r052-oct2-155234410600862
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.3K Feb 10 20:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 20:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 6 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 6 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 23:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 3 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jan 30 23:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 30 23:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 139K Mar 10 17:31 model.pnml

--------------------
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 1552650684422

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F(F(F("(((flag_1_1>=1)&&(flag_1_5>=1))&&(p1_5>=1))"))))U(F(X(F("(((flag_1_1>=1)&&(flag_1_11>=1))&&(p1_1>=1))"))))))
Formula 0 simplified : !(F"(((flag_1_1>=1)&&(flag_1_5>=1))&&(p1_5>=1))" U FXF"(((flag_1_1>=1)&&(flag_1_11>=1))&&(p1_1>=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
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
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
44 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.487464,31196,1,0,565,90953,536,273,4933,59803,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 : !((G(G("(((flag_1_2>=1)&&(flag_1_12>=1))&&(p1_12>=1))"))))
Formula 1 simplified : !G"(((flag_1_2>=1)&&(flag_1_12>=1))&&(p1_12>=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.495394,31604,1,0,565,91186,548,273,5028,60264,619
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 : !(((("(((flag_1_4>=1)&&(flag_1_13>=1))&&(p1_13>=1))")U("(((flag_1_5>=1)&&(flag_1_9>=1))&&(p1_9>=1))"))U(("(((flag_1_8>=1)&&(flag_1_13>=1))&&(p1_8>=1))")U("(((flag_1_1>=1)&&(flag_1_10>=1))&&(p1_1>=1))"))))
Formula 2 simplified : !(("(((flag_1_4>=1)&&(flag_1_13>=1))&&(p1_13>=1))" U "(((flag_1_5>=1)&&(flag_1_9>=1))&&(p1_9>=1))") U ("(((flag_1_8>=1)&&(flag_1_13>=1))&&(p1_8>=1))" U "(((flag_1_1>=1)&&(flag_1_10>=1))&&(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.499068,32564,1,0,565,91186,581,273,5075,60264,627
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 : !((G(X("(((flag_1_2>=1)&&(flag_1_6>=1))&&(p1_6>=1))"))))
Formula 3 simplified : !GX"(((flag_1_2>=1)&&(flag_1_6>=1))&&(p1_6>=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.501384,32564,1,0,565,91204,587,273,5080,60287,634
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((F(F("(((flag_1_7>=1)&&(flag_1_9>=1))&&(p1_7>=1))")))U(X(F("(((flag_1_2>=1)&&(flag_1_12>=1))&&(p1_2>=1))"))))))
Formula 4 simplified : !F(F"(((flag_1_7>=1)&&(flag_1_9>=1))&&(p1_7>=1))" U XF"(((flag_1_2>=1)&&(flag_1_12>=1))&&(p1_2>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.640627,37816,1,0,580,127354,596,273,5083,80514,716
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 : !(((F(X(F("(((flag_1_11>=1)&&(flag_1_14>=1))&&(p1_11>=1))"))))U((X("(((flag_1_3>=1)&&(flag_1_9>=1))&&(p1_3>=1))"))U(G("(((flag_1_6>=1)&&(flag_1_14>=1))&&(p1_6>=1))")))))
Formula 5 simplified : !(FXF"(((flag_1_11>=1)&&(flag_1_14>=1))&&(p1_11>=1))" U (X"(((flag_1_3>=1)&&(flag_1_9>=1))&&(p1_3>=1))" U G"(((flag_1_6>=1)&&(flag_1_14>=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
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.66378,39668,1,0,582,131072,602,273,5087,83766,734
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 : !(("(((flag_1_5>=1)&&(flag_1_11>=1))&&(p1_11>=1))"))
Formula 6 simplified : !"(((flag_1_5>=1)&&(flag_1_11>=1))&&(p1_11>=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.664453,39668,1,0,582,131072,605,273,5090,83766,736
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_1_1>=1)&&(flag_1_9>=1))&&(p1_1>=1))")))
Formula 7 simplified : !F"(((flag_1_1>=1)&&(flag_1_9>=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
11 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.778726,43096,1,0,599,153840,614,276,5091,94590,823
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 : !(("(((((((((((((((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_6>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_11>=1))"))
Formula 8 simplified : !"(((((((((((((((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_6>=1))&&(flag_0_7>=1))&&(flag_0_8>=1))&&(flag_0_9>=1))&&(flag_0_10>=1))&&(flag_0_12>=1))&&(flag_0_13>=1))&&(flag_0_14>=1))&&(p1_11>=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.780088,43096,1,0,599,153840,617,276,5119,94590,825
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 : !(("(((flag_1_3>=1)&&(flag_1_6>=1))&&(p1_3>=1))"))
Formula 9 simplified : !"(((flag_1_3>=1)&&(flag_1_6>=1))&&(p1_3>=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.78077,43360,1,0,599,153840,620,276,5123,94590,827
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 : !((F("(((flag_1_10>=1)&&(flag_1_12>=1))&&(p1_12>=1))")))
Formula 10 simplified : !F"(((flag_1_10>=1)&&(flag_1_12>=1))&&(p1_12>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 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.884272,45472,1,0,614,172316,629,276,5125,103793,911
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 : !((F(F((F("(((flag_1_9>=1)&&(flag_1_10>=1))&&(p1_9>=1))"))U(F("(((flag_1_0>=1)&&(flag_1_13>=1))&&(p1_13>=1))"))))))
Formula 11 simplified : !F(F"(((flag_1_9>=1)&&(flag_1_10>=1))&&(p1_9>=1))" U F"(((flag_1_0>=1)&&(flag_1_13>=1))&&(p1_13>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.04936,50488,1,0,629,204223,638,276,5128,125556,995
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 : !((F(G(X(X(X("(((flag_1_8>=1)&&(flag_1_13>=1))&&(p1_13>=1))")))))))
Formula 12 simplified : !FGXXX"(((flag_1_8>=1)&&(flag_1_13>=1))&&(p1_13>=1))"
4 unique states visited
4 strongly connected components in search stack
5 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,1.0607,50932,1,0,630,205641,643,276,5130,126889,1003
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 : !((X("(((flag_1_4>=1)&&(flag_1_9>=1))&&(p1_4>=1))")))
Formula 13 simplified : !X"(((flag_1_4>=1)&&(flag_1_9>=1))&&(p1_4>=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.06206,51196,1,0,630,205664,646,276,5133,126916,1005
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(G((G("(((flag_1_2>=1)&&(flag_1_12>=1))&&(p1_2>=1))"))U(G("(((flag_1_10>=1)&&(flag_1_14>=1))&&(p1_14>=1))"))))))
Formula 14 simplified : !XG(G"(((flag_1_2>=1)&&(flag_1_12>=1))&&(p1_2>=1))" U G"(((flag_1_10>=1)&&(flag_1_14>=1))&&(p1_14>=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.06833,51576,1,0,630,205682,662,276,5150,126939,1014
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 : !(("(((flag_1_5>=1)&&(flag_1_11>=1))&&(p1_5>=1))"))
Formula 15 simplified : !"(((flag_1_5>=1)&&(flag_1_11>=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
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.06878,51576,1,0,630,205682,665,276,5153,126939,1016
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
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552650688903

--------------------
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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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
Mar 15, 2019 11:51:26 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/, -smt]
Mar 15, 2019 11:51:26 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 15, 2019 11:51:26 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 52 ms
Mar 15, 2019 11:51:26 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 75 places.
Mar 15, 2019 11:51:26 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 255 transitions.
Mar 15, 2019 11:51:26 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 44 ms
Mar 15, 2019 11:51:26 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 181 ms
Mar 15, 2019 11:51:27 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Mar 15, 2019 11:51:27 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 255 transitions.
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 45 place invariants in 19 ms
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 75 variables to be positive in 194 ms
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 255 transitions.
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/255 took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 255 transitions.
Mar 15, 2019 11:51:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 6 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:502)
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)
Mar 15, 2019 11:51:28 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1462ms 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
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 r052-oct2-155234410600862"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-015.tgz
mv Dekker-PT-015 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;