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 216K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is RwMutex-PT-r0010w0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263300494
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527823376859

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(X(X("(((((((((((p27>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))")))))
Formula 0 simplified : !GXX"(((((((((((p27>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 60 rows 70 cols
invariant :p29 + p69 = 1
invariant :p21 + p61 = 1
invariant :p17 + p57 = 1
invariant :p18 + p58 = 1
invariant :p20 + p60 = 1
invariant :p47 + -1'p49 + -1'p7 + p9 = 0
invariant :p38 + p8 = 1
invariant :p35 + p5 = 1
invariant :p41 + -1'p49 + p51 + p9 = 1
invariant :p26 + p66 = 1
invariant :p10 + p49 + -1'p50 + -1'p9 = 0
invariant :p13 + p53 = 1
invariant :p39 + p9 = 1
invariant :p36 + p6 = 1
invariant :p16 + p56 = 1
invariant :p23 + p63 = 1
invariant :p40 + -1'p49 + p50 + p9 = 1
invariant :p3 + -1'p43 + p49 + -1'p9 = 0
invariant :p2 + -1'p42 + p49 + -1'p9 = 0
invariant :p37 + p7 = 1
invariant :p32 + p42 + -1'p49 + p9 = 1
invariant :p19 + p59 = 1
invariant :p14 + p54 = 1
invariant :p45 + -1'p49 + -1'p5 + p9 = 0
invariant :p15 + p55 = 1
invariant :p1 + p49 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + -1'p9 = 0
invariant :p4 + -1'p44 + p49 + -1'p9 = 0
invariant :p12 + p52 = 1
invariant :p27 + p67 = 1
invariant :p30 + p70 = 1
invariant :p31 + -1'p49 + -1'p52 + -1'p53 + -1'p54 + -1'p55 + -1'p56 + -1'p57 + -1'p58 + -1'p59 + -1'p60 + -1'p61 + -1'p62 + -1'p63 + -1'p64 + -1'p65 + -1'p66 + -1'p67 + -1'p68 + -1'p69 + -1'p70 + p9 = 1
invariant :p11 + p49 + -1'p51 + -1'p9 = 0
invariant :p25 + p65 = 1
invariant :p48 + -1'p49 + -1'p8 + p9 = 0
invariant :p22 + p62 = 1
invariant :p34 + p44 + -1'p49 + p9 = 1
invariant :p24 + p64 = 1
invariant :p46 + -1'p49 + -1'p6 + p9 = 0
invariant :p28 + p68 = 1
invariant :p33 + p43 + -1'p49 + p9 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
249 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.53311,78076,1,0,10,126670,23,2,2410,60817,31
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G(("((p45>=1)&&(p5>=1))")U("(p67>=1)")))U("(p32>=1)")))
Formula 1 simplified : !(G("((p45>=1)&&(p5>=1))" U "(p67>=1)") U "(p32>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.6383,79416,1,0,29,134204,47,10,2430,71768,86
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F(X(F("(((((((((((p17>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))"))))U("((p2>=1)&&(p42>=1))")))
Formula 2 simplified : !(FXF"(((((((((((p17>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))" U "((p2>=1)&&(p42>=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,2.6393,79416,1,0,29,134204,50,10,2433,71768,88
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(p69>=1)"))
Formula 3 simplified : !"(p69>=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,2.64049,79416,1,0,29,134204,53,10,2434,71823,92
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(("(p52>=1)")U(X(X("((p3>=1)&&(p43>=1))"))))))
Formula 4 simplified : !X("(p52>=1)" U XX"((p3>=1)&&(p43>=1))")
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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,2.64838,79572,1,0,35,134711,60,10,2438,72198,118
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F("((p49>=1)&&(p9>=1))"))))
Formula 5 simplified : !XF"((p49>=1)&&(p9>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 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.70418,80324,1,0,65,139062,69,21,2441,80288,181
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X(F(X("((p46>=1)&&(p6>=1))"))))))
Formula 6 simplified : !FXFX"((p46>=1)&&(p6>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 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.75416,81904,1,0,83,142274,78,30,2444,85043,233
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((G(("(p33>=1)")U("(p69>=1)")))U(X("(p58>=1)"))))
Formula 7 simplified : !(G("(p33>=1)" U "(p69>=1)") U X"(p58>=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,2.75895,83004,1,0,84,142301,90,30,2451,85057,244
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(("(p64>=1)")U("(((((((((((p14>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))"))))
Formula 8 simplified : !X("(p64>=1)" U "(((((((((((p14>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))")
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.76146,83004,1,0,86,142315,102,30,2468,85081,259
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(F(F(("((p2>=1)&&(p42>=1))")U("(p59>=1)"))))))
Formula 9 simplified : !GF("((p2>=1)&&(p42>=1))" U "(p59>=1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.76266,83004,1,0,87,142317,111,30,2469,85101,270
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("(p58>=1)")))
Formula 10 simplified : !X"(p58>=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,2.76301,83004,1,0,87,142317,111,30,2469,85101,270
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("(((((((((((p27>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))"))
Formula 11 simplified : !"(((((((((((p27>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,2.76458,83004,1,0,87,142317,111,30,2469,85101,272
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X("(((((((((((p21>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))")))
Formula 12 simplified : !X"(((((((((((p21>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=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,2.76626,83004,1,0,87,142317,114,30,2472,85102,274
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(("(((((((((((p29>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))")U(X("((p47>=1)&&(p7>=1))")))))
Formula 13 simplified : !X("(((((((((((p29>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))" U X"((p47>=1)&&(p7>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,2.77177,83004,1,0,89,142487,121,30,2478,85193,285
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("(p37>=1)"))
Formula 14 simplified : !"(p37>=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,2.77225,83004,1,0,89,142487,124,30,2479,85193,287
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((((F("((p11>=1)&&(p51>=1))"))U(F("(((((((((((p31>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))")))U(F(X("(((((((((((p18>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))")))))
Formula 15 simplified : !((F"((p11>=1)&&(p51>=1))" U F"(((((((((((p31>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))") U FX"(((((((((((p18>=1)&&(p42>=1))&&(p43>=1))&&(p44>=1))&&(p45>=1))&&(p46>=1))&&(p47>=1))&&(p48>=1))&&(p49>=1))&&(p50>=1))&&(p51>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,2.8093,83768,1,0,111,146091,133,38,2482,90132,342
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0020-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 1527823384686

--------------------
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 01, 2018 3:22:59 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]
Jun 01, 2018 3:22:59 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 3:22:59 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 89 ms
Jun 01, 2018 3:22:59 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 70 places.
Jun 01, 2018 3:23:00 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 60 transitions.
Jun 01, 2018 3:23:00 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 26 ms
Jun 01, 2018 3:23:00 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 105 ms
Jun 01, 2018 3:23:00 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
Jun 01, 2018 3:23:00 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 01, 2018 3:23:00 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 60 transitions.
Jun 01, 2018 3:23:00 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 34 ms
Jun 01, 2018 3:23:01 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 70 variables to be positive in 356 ms
Jun 01, 2018 3:23:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 60 transitions.
Jun 01, 2018 3:23:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/60 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:23:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:23:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 60 transitions.
Jun 01, 2018 3:23:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:23:03 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 01, 2018 3:23:03 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Jun 01, 2018 3:23:03 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (and (and (and (and (and (and (and (>= (select s0 3) 1) (>= (select s0 36) 1)) (>= (select s0 37) 1)) (>= (select s0 38) 1)) (>= (select s0 39) 1)) (>= (select s0 40) 1)) (>= (select s0 41) 1)) (>= (select s0 42) 1)) (>= (select s0 43) 1)) (>= (select s0 45) 1)) (>= (select s0 46) 1)) (= (store (store (store (store (store (store (store (store (store (store (store (store s0 37 (- (select s0 37) 1)) 46 (- (select s0 46) 1)) 36 (- (select s0 36) 1)) 45 (- (select s0 45) 1)) 42 (- (select s0 42) 1)) 3 (- (select s0 3) 1)) 47 (+ (select s0 47) 1)) 41 (- (select s0 41) 1)) 38 (- (select s0 38) 1)) 40 (- (select s0 40) 1)) 43 (- (select s0 43) 1)) 39 (- (select s0 39) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (and (and (and (and (and (and (and (and (and (>= (select s0 3) 1) (>= (select s0 36) 1)) (>= (select s0 37) 1)) (>= (select s0 38) 1)) (>= (select s0 39) 1)) (>= (select s0 40) 1)) (>= (select s0 41) 1)) (>= (select s0 42) 1)) (>= (select s0 43) 1)) (>= (select s0 45) 1)) (>= (select s0 46) 1)) (= (store (store (store (store (store (store (store (store (store (store (store (store s0 37 (- (select s0 37) 1)) 46 (- (select s0 46) 1)) 36 (- (select s0 36) 1)) 45 (- (select s0 45) 1)) 42 (- (select s0 42) 1)) 3 (- (select s0 3) 1)) 47 (+ (select s0 47) 1)) 41 (- (select s0 41) 1)) 38 (- (select s0 38) 1)) 40 (- (select s0 40) 1)) 43 (- (select s0 43) 1)) 39 (- (select s0 39) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
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 01, 2018 3:23:03 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2928ms 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="RwMutex-PT-r0010w0020"
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/RwMutex-PT-r0010w0020.tgz
mv RwMutex-PT-r0010w0020 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 RwMutex-PT-r0010w0020, 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 r212-smll-152732263300494"
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 ;