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 260K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 81K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is ResAllocation-PT-R020C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-qhx2-152732140300154
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528295261501

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 : !(("(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))"))
Formula 0 simplified : !"(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))"
Reverse transition relation is NOT exact ! Due to transitions t_0_20, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/2/42
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 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.263267,19644,1,0,99,20061,110,49,2451,14579,106
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("(((r_1_1>=1)&&(p_1_2>=1))&&(r_0_1>=1))"))
Formula 1 simplified : !"(((r_1_1>=1)&&(p_1_2>=1))&&(r_0_1>=1))"
Computing Next relation with stutter on 19 deadlock states
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.267389,19644,1,0,99,20061,113,49,2456,14580,108
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(X(X("(((r_1_8>=1)&&(p_1_9>=1))&&(r_0_8>=1))")))))
Formula 2 simplified : !XXX"(((r_1_8>=1)&&(p_1_9>=1))&&(r_0_8>=1))"
Computing Next relation with stutter on 19 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.278318,20168,1,0,102,20906,116,52,2461,15369,121
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(((r_1_10>=1)&&(p_1_11>=1))&&(r_0_10>=1))"))
Formula 3 simplified : !"(((r_1_10>=1)&&(p_1_11>=1))&&(r_0_10>=1))"
Computing Next relation with stutter on 19 deadlock states
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.282793,20168,1,0,102,20906,119,52,2466,15370,123
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((X("(r_0_0>=1)"))U((F("((p_0_0>=1)&&(r_0_1>=1))"))U(G("(((r_1_16>=1)&&(p_1_17>=1))&&(r_0_16>=1))")))))
Formula 4 simplified : !(X"(r_0_0>=1)" U (F"((p_0_0>=1)&&(r_0_1>=1))" U G"(((r_1_16>=1)&&(p_1_17>=1))&&(r_0_16>=1))"))
Computing Next relation with stutter on 19 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 80 cols
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.310847,21984,1,0,107,21292,130,57,2476,16105,148
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G((X("(((r_1_9>=1)&&(p_1_10>=1))&&(r_0_9>=1))"))U(F("(((r_1_18>=1)&&(p_1_19>=1))&&(r_0_18>=1))"))))))
Formula 5 simplified : !XG(X"(((r_1_9>=1)&&(p_1_10>=1))&&(r_0_9>=1))" U F"(((r_1_18>=1)&&(p_1_19>=1))&&(r_0_18>=1))")
Computing Next relation with stutter on 19 deadlock states
invariant :p_0_1 + r_0_1 + -1'r_1_1 = 0
invariant :p_0_2 + r_0_2 + -1'r_1_2 = 0
invariant :p_1_8 + r_1_8 = 1
invariant :p_1_11 + r_1_11 = 1
invariant :p_0_7 + r_0_7 + -1'r_1_7 = 0
invariant :p_0_14 + r_0_14 + -1'r_1_14 = 0
invariant :p_1_17 + r_1_17 = 1
invariant :p_0_17 + r_0_17 + -1'r_1_17 = 0
invariant :p_1_7 + r_1_7 = 1
invariant :p_1_15 + r_1_15 = 1
invariant :p_1_14 + r_1_14 = 1
invariant :p_1_2 + r_1_2 = 1
invariant :p_1_4 + r_1_4 = 1
invariant :p_0_9 + r_0_9 + -1'r_1_9 = 0
invariant :p_0_6 + r_0_6 + -1'r_1_6 = 0
invariant :p_0_16 + r_0_16 + -1'r_1_16 = 0
invariant :p_1_0 + r_1_0 = 1
invariant :p_1_9 + r_1_9 = 1
invariant :p_1_6 + r_1_6 = 1
invariant :p_0_3 + r_0_3 + -1'r_1_3 = 0
invariant :p_0_18 + r_0_18 + -1'r_1_18 = 0
invariant :p_1_12 + r_1_12 = 1
invariant :p_0_12 + r_0_12 + -1'r_1_12 = 0
invariant :p_0_15 + r_0_15 + -1'r_1_15 = 0
invariant :p_1_3 + r_1_3 = 1
invariant :p_1_1 + r_1_1 = 1
invariant :p_1_5 + r_1_5 = 1
invariant :p_0_8 + r_0_8 + -1'r_1_8 = 0
invariant :p_1_18 + r_1_18 = 1
invariant :p_1_19 + r_1_19 = 1
invariant :p_0_19 + r_0_19 + -1'r_1_19 = 0
invariant :p_1_16 + r_1_16 = 1
invariant :p_1_10 + r_1_10 = 1
invariant :p_0_4 + r_0_4 + -1'r_1_4 = 0
invariant :p_0_10 + r_0_10 + -1'r_1_10 = 0
invariant :p_0_13 + r_0_13 + -1'r_1_13 = 0
invariant :p_0_11 + r_0_11 + -1'r_1_11 = 0
invariant :p_0_0 + r_0_0 + -1'r_1_0 = 0
invariant :p_0_5 + r_0_5 + -1'r_1_5 = 0
invariant :p_1_13 + r_1_13 = 1
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
102 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.33513,39292,1,0,1135,120029,139,746,2481,145700,1874
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((X("(((r_1_11>=1)&&(p_1_12>=1))&&(r_0_11>=1))"))U(X(G(X("(((r_1_13>=1)&&(p_1_14>=1))&&(r_0_13>=1))"))))))
Formula 6 simplified : !(X"(((r_1_11>=1)&&(p_1_12>=1))&&(r_0_11>=1))" U XGX"(((r_1_13>=1)&&(p_1_14>=1))&&(r_0_13>=1))")
Computing Next relation with stutter on 19 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.34209,39868,1,0,1135,120132,150,746,2496,145818,1883
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X("(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))")))
Formula 7 simplified : !X"(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))"
Computing Next relation with stutter on 19 deadlock states
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.34312,39868,1,0,1135,120147,150,746,2496,145838,1887
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("(((r_1_1>=1)&&(p_1_2>=1))&&(r_0_1>=1))"))
Formula 8 simplified : !"(((r_1_1>=1)&&(p_1_2>=1))&&(r_0_1>=1))"
Computing Next relation with stutter on 19 deadlock states
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.34372,39868,1,0,1135,120147,150,746,2496,145838,1887
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X("((p_0_9>=1)&&(r_0_10>=1))")))
Formula 9 simplified : !X"((p_0_9>=1)&&(r_0_10>=1))"
Computing Next relation with stutter on 19 deadlock states
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.34461,40132,1,0,1135,120147,153,746,2498,145840,1889
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((F(F(G("(p_1_0>=1)"))))U(F(F(X("(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))"))))))
Formula 10 simplified : !(FG"(p_1_0>=1)" U FX"(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))")
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
110 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.43231,57680,1,0,1567,223487,162,1264,2503,301355,2941
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X((G("(((r_1_6>=1)&&(p_1_7>=1))&&(r_0_6>=1))"))U(F("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")))))
Formula 11 simplified : !X(G"(((r_1_6>=1)&&(p_1_7>=1))&&(r_0_6>=1))" U F"(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
80 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,3.24314,71412,1,0,1957,303903,171,1751,2508,415941,3948
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X(F(G("(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))"))))U((G("(r_0_0>=1)"))U("(p_0_19>=1)"))))
Formula 12 simplified : !(XFG"(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))" U (G"(r_0_0>=1)" U "(p_0_19>=1)"))
Computing Next relation with stutter on 19 deadlock states
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]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
201 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,5.26303,102916,1,0,2924,473649,190,2626,2514,697219,5933
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(G(F(("((p_0_10>=1)&&(r_0_11>=1))")U("(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))"))))))
Formula 13 simplified : !GF("((p_0_10>=1)&&(r_0_11>=1))" U "(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))")
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
62 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,5.87715,113908,1,0,3247,541803,190,2947,2514,783974,6741
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((X(F("((p_0_6>=1)&&(r_0_7>=1))")))U(G(F("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))"))))))
Formula 14 simplified : !F(XF"((p_0_6>=1)&&(r_0_7>=1))" U GF"(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")
Computing Next relation with stutter on 19 deadlock states
Compilation finished in 1935 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 78 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, <>((X(<>((LTLAP18==true))))U([](<>((LTLAP15==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 121 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, <>((LTLAP0==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
110 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,6.97565,127372,1,0,3629,619149,190,3330,2514,883133,7700
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F("(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))")))
Formula 15 simplified : !F"(((r_1_5>=1)&&(p_1_6>=1))&&(r_0_5>=1))"
Computing Next relation with stutter on 19 deadlock states
LTSmin run took 106 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1528295287468

--------------------
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 06, 2018 2:27:58 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 06, 2018 2:27:58 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 2:27:58 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 78 ms
Jun 06, 2018 2:27:58 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 80 places.
Jun 06, 2018 2:27:58 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 42 transitions.
Jun 06, 2018 2:27:58 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 13 ms
Jun 06, 2018 2:27:58 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 87 ms
Jun 06, 2018 2:27:58 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Jun 06, 2018 2:27:58 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 41 ms
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 80 variables to be positive in 362 ms
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 42 transitions.
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/42 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 42 transitions.
Jun 06, 2018 2:27:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 2:28:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 42 transitions.
Jun 06, 2018 2:28:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(18/42) took 880 ms. Total solver calls (SAT/UNSAT): 56(56/0)
Jun 06, 2018 2:28:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1727 ms. Total solver calls (SAT/UNSAT): 80(60/20)
Jun 06, 2018 2:28:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 42 transitions.
Jun 06, 2018 2:28:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 187 ms. Total solver calls (SAT/UNSAT): 61(0/61)
Jun 06, 2018 2:28:04 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4801ms 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="ResAllocation-PT-R020C002"
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/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 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 ResAllocation-PT-R020C002, 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 r188-qhx2-152732140300154"
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 ;