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 itstools
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 r236-blw3-152732477000022
=====================================================================

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

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 : !((G((("((((((((((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))&&(p1_0>=1))")U("(((flag_1_0>=1)&&(flag_1_2>=1))&&(p1_2>=1))"))U(X("(((flag_1_1>=1)&&(flag_1_2>=1))&&(p1_2>=1))")))))
Formula 0 simplified : !G(("((((((((((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))&&(p1_0>=1))" U "(((flag_1_0>=1)&&(flag_1_2>=1))&&(p1_2>=1))") U X"(((flag_1_1>=1)&&(flag_1_2>=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, 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
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.131019,21256,1,0,262,20181,276,123,2738,15138,271
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
Checking formula 1 : !((G(X(F("(((flag_1_2>=1)&&(flag_1_6>=1))&&(p1_2>=1))")))))
Formula 1 simplified : !GXF"(((flag_1_2>=1)&&(flag_1_6>=1))&&(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.138747,21880,1,0,263,21704,285,123,2741,16398,280
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
Checking formula 2 : !((F(F(("(((flag_1_1>=1)&&(flag_1_8>=1))&&(p1_1>=1))")U(X("((((((((((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))&&(p1_1>=1))"))))))
Formula 2 simplified : !F("(((flag_1_1>=1)&&(flag_1_8>=1))&&(p1_1>=1))" U X"((((((((((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))&&(p1_1>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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.227826,24520,1,0,286,36450,294,133,2752,28718,343
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
Checking formula 3 : !((F("((flag_0_7>=1)&&(p0_7>=1))")))
Formula 3 simplified : !F"((flag_0_7>=1)&&(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.228485,24784,1,0,286,36450,303,133,2754,28718,347
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Dekker-PT-010-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(G((F("(((flag_1_4>=1)&&(flag_1_6>=1))&&(p1_6>=1))"))U(X("(((flag_1_7>=1)&&(flag_1_8>=1))&&(p1_8>=1))"))))))
Formula 4 simplified : !FG(F"(((flag_1_4>=1)&&(flag_1_6>=1))&&(p1_6>=1))" U X"(((flag_1_7>=1)&&(flag_1_8>=1))&&(p1_8>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.241699,25136,1,0,291,39158,318,135,2769,30971,368
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
Checking formula 5 : !(((F(F(X("((flag_1_1>=1)&&(p3_1>=1))"))))U(F(("((flag_1_6>=1)&&(p3_6>=1))")U("(((flag_1_4>=1)&&(flag_1_6>=1))&&(p1_4>=1))")))))
Formula 5 simplified : !(FX"((flag_1_1>=1)&&(p3_1>=1))" U F("((flag_1_6>=1)&&(p3_6>=1))" U "(((flag_1_4>=1)&&(flag_1_6>=1))&&(p1_4>=1))"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
Normalized transition count is 40
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.275809,26188,1,0,312,46202,327,146,2772,37273,430
// Phase 1: matrix 40 rows 50 cols
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
Checking formula 6 : !((G("(((flag_1_5>=1)&&(flag_1_9>=1))&&(p1_9>=1))")))
Formula 6 simplified : !G"(((flag_1_5>=1)&&(flag_1_9>=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
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.278396,26452,1,0,312,46335,333,146,2778,37428,437
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
Checking formula 7 : !(("(((flag_1_2>=1)&&(flag_1_3>=1))&&(p1_3>=1))"))
Formula 7 simplified : !"(((flag_1_2>=1)&&(flag_1_3>=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.278861,26452,1,0,312,46335,336,146,2782,37428,439
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
Checking formula 8 : !((G(X("(((flag_1_1>=1)&&(flag_1_2>=1))&&(p1_1>=1))"))))
Formula 8 simplified : !GX"(((flag_1_1>=1)&&(flag_1_2>=1))&&(p1_1>=1))"
invariant :flag_0_3 + p1_3 + p3_3 = 1
invariant :p0_2 + p1_2 + p3_2 = 1
invariant :p0_1 + p1_1 + p3_1 = 1
invariant :flag_0_5 + p1_5 + p3_5 = 1
invariant :flag_1_5 + -1'p1_5 + -1'p3_5 = 0
invariant :flag_0_6 + p1_6 + p3_6 = 1
invariant :flag_1_4 + -1'p1_4 + -1'p34 = 0
invariant :p0_8 + p1_8 + p3_8 = 1
invariant :flag_1_0 + -1'p1_0 + -1'p3_0 = 0
invariant :flag_0_7 + p1_7 + p3_7 = 1
invariant :flag_1_9 + -1'p1_9 + -1'p3_9 = 0
invariant :p0_3 + p1_3 + p3_3 = 1
invariant :flag_0_0 + p1_0 + p3_0 = 1
invariant :flag_1_2 + -1'p1_2 + -1'p3_2 = 0
invariant :p0_0 + p1_0 + p3_0 = 1
invariant :p0_4 + p1_4 + p34 = 1
invariant :flag_1_1 + -1'p1_1 + -1'p3_1 = 0
invariant :flag_0_1 + p1_1 + p3_1 = 1
invariant :flag_1_3 + -1'p1_3 + -1'p3_3 = 0
invariant :p0_5 + p1_5 + p3_5 = 1
invariant :flag_1_6 + -1'p1_6 + -1'p3_6 = 0
invariant :p0_9 + p1_9 + p3_9 = 1
invariant :p0_6 + p1_6 + p3_6 = 1
invariant :flag_0_4 + p1_4 + p34 = 1
invariant :p0_7 + p1_7 + p3_7 = 1
invariant :flag_1_8 + -1'p1_8 + -1'p3_8 = 0
invariant :flag_0_2 + p1_2 + p3_2 = 1
invariant :flag_0_8 + p1_8 + p3_8 = 1
invariant :flag_0_9 + p1_9 + p3_9 = 1
invariant :flag_1_7 + -1'p1_7 + -1'p3_7 = 0
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.281277,26452,1,0,313,46361,342,146,2785,37523,449
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
Checking formula 9 : !(((X("(((flag_1_3>=1)&&(flag_1_8>=1))&&(p1_8>=1))"))U("((((((((((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))&&(p1_9>=1))")))
Formula 9 simplified : !(X"(((flag_1_3>=1)&&(flag_1_8>=1))&&(p1_8>=1))" U "((((((((((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))&&(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.283087,26708,1,0,313,46383,351,146,2799,37550,455
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
Checking formula 10 : !((F(F((F("(((flag_1_4>=1)&&(flag_1_7>=1))&&(p1_7>=1))"))U(F("(((flag_1_4>=1)&&(flag_1_9>=1))&&(p1_4>=1))"))))))
Formula 10 simplified : !F(F"(((flag_1_4>=1)&&(flag_1_7>=1))&&(p1_7>=1))" U F"(((flag_1_4>=1)&&(flag_1_9>=1))&&(p1_4>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.316495,27500,1,0,323,52290,360,146,2800,41320,514
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
Checking formula 11 : !((G("((flag_0_2>=1)&&(p0_2>=1))")))
Formula 11 simplified : !G"((flag_0_2>=1)&&(p0_2>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.392357,29876,1,0,344,61855,366,156,2802,50797,577
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
Checking formula 12 : !((X(G(G(F(X("(((flag_1_3>=1)&&(flag_1_8>=1))&&(p1_3>=1))")))))))
Formula 12 simplified : !XGFX"(((flag_1_3>=1)&&(flag_1_8>=1))&&(p1_3>=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,0.402684,30140,1,0,345,63182,375,156,2804,51996,586
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
Checking formula 13 : !((X(("(((flag_1_0>=1)&&(flag_1_3>=1))&&(p1_3>=1))")U(G("(((flag_1_0>=1)&&(flag_1_7>=1))&&(p1_0>=1))")))))
Formula 13 simplified : !X("(((flag_1_0>=1)&&(flag_1_3>=1))&&(p1_3>=1))" U G"(((flag_1_0>=1)&&(flag_1_7>=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
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.40596,30368,1,0,345,63205,393,156,2823,52026,595
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
Checking formula 14 : !((F((X(G("(((flag_1_2>=1)&&(flag_1_9>=1))&&(p1_2>=1))")))U(X(X("((flag_0_7>=1)&&(p0_7>=1))"))))))
Formula 14 simplified : !F(XG"(((flag_1_2>=1)&&(flag_1_9>=1))&&(p1_2>=1))" U XX"((flag_0_7>=1)&&(p0_7>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.436396,30680,1,0,373,66237,393,166,2823,55007,653
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
Checking formula 15 : !((X(G(G(("(((flag_1_0>=1)&&(flag_1_4>=1))&&(p1_4>=1))")U("(((flag_1_2>=1)&&(flag_1_5>=1))&&(p1_5>=1))"))))))
Formula 15 simplified : !XG("(((flag_1_0>=1)&&(flag_1_4>=1))&&(p1_4>=1))" U "(((flag_1_2>=1)&&(flag_1_5>=1))&&(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.438849,31136,1,0,373,66249,409,166,2838,55026,660
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
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 1527944977824

--------------------
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:09:36 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:09:36 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 1:09:36 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
Jun 02, 2018 1:09:36 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Jun 02, 2018 1:09:36 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 120 transitions.
Jun 02, 2018 1:09:36 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Jun 02, 2018 1:09:36 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 60 ms
Jun 02, 2018 1:09:36 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Jun 02, 2018 1:09:36 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 120 transitions.
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 15 ms
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 125 ms
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 120 transitions.
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/120 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 120 transitions.
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 11 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)
Jun 02, 2018 1:09:37 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 471ms 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="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-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 itstools"
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 r236-blw3-152732477000022"
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 ;