fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r212-smll-152732263300498
Last Updated
June 26, 2018

About the Execution of ITS-Tools for RwMutex-PT-r0010w0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15752.890 43854.00 92214.00 479.30 FFFFFFFFFFTFFFFT normal

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 328K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 10K 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.5K 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 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 172K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is RwMutex-PT-r0010w0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263300498
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527823528422

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((X(("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p45>=1))")U("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p36>=1))")))U((F("(((((((((((p110>=1)&&(p122>=1))&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))"))U(F("(p224>=1)")))))
Formula 0 simplified : !(X("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p45>=1))" U "(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p36>=1))") U (F"(((((((((((p110>=1)&&(p122>=1))&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))" U F"(p224>=1)"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 220 rows 230 cols
invariant :p105 + p225 = 1
invariant :p167 + p47 = 1
invariant :p183 + p63 = 1
invariant :p186 + p66 = 1
invariant :p188 + p68 = 1
invariant :p125 + -1'p129 + -1'p5 + p9 = 0
invariant :p184 + p64 = 1
invariant :p161 + p41 = 1
invariant :p170 + p50 = 1
invariant :p122 + -1'p129 + -1'p2 + p9 = 0
invariant :p174 + p54 = 1
invariant :p157 + p37 = 1
invariant :p191 + p71 = 1
invariant :p180 + p60 = 1
invariant :p121 + -1'p129 + p131 + p9 = 1
invariant :p193 + p73 = 1
invariant :p179 + p59 = 1
invariant :p165 + p45 = 1
invariant :p195 + p75 = 1
invariant :p127 + -1'p129 + -1'p7 + p9 = 0
invariant :p187 + p67 = 1
invariant :p120 + -1'p129 + p130 + p9 = 1
invariant :p209 + p89 = 1
invariant :p159 + p39 = 1
invariant :p168 + p48 = 1
invariant :p119 + p9 = 1
invariant :p158 + p38 = 1
invariant :p181 + p61 = 1
invariant :p163 + p43 = 1
invariant :p207 + p87 = 1
invariant :p11 + p129 + -1'p131 + -1'p9 = 0
invariant :p178 + p58 = 1
invariant :p1 + p129 + p132 + p133 + -1'p14 + -1'p15 + -1'p16 + -1'p17 + -1'p18 + -1'p19 + -1'p20 + -1'p21 + -1'p22 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + -1'p23 + p230 + -1'p24 + -1'p25 + -1'p26 + -1'p27 + -1'p28 + -1'p29 + -1'p30 + -1'p31 + -1'p32 + -1'p33 + -1'p34 + -1'p35 + -1'p36 + -1'p37 + -1'p38 + -1'p39 + -1'p40 + -1'p41 + -1'p42 + -1'p43 + -1'p44 + -1'p45 + -1'p46 + -1'p47 + -1'p48 + -1'p49 + -1'p50 + -1'p51 + -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 + -1'p71 + -1'p72 + -1'p73 + -1'p74 + -1'p75 + -1'p76 + -1'p77 + -1'p78 + -1'p79 + -1'p80 + -1'p81 + -1'p82 + -1'p83 + -1'p84 + -1'p85 + -1'p86 + -1'p87 + -1'p88 + -1'p89 + -1'p9 + -1'p90 + -1'p91 + -1'p92 + -1'p93 + -1'p94 + -1'p95 + -1'p96 + -1'p97 + -1'p98 + -1'p99 = -86
invariant :p148 + p28 = 1
invariant :p215 + p95 = 1
invariant :p101 + p221 = 1
invariant :p153 + p33 = 1
invariant :p203 + p83 = 1
invariant :p201 + p81 = 1
invariant :p204 + p84 = 1
invariant :p196 + p76 = 1
invariant :p198 + p78 = 1
invariant :p218 + p98 = 1
invariant :p104 + p224 = 1
invariant :p176 + p56 = 1
invariant :p169 + p49 = 1
invariant :p197 + p77 = 1
invariant :p111 + -1'p129 + -1'p132 + -1'p133 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + -1'p220 + -1'p221 + -1'p222 + -1'p223 + -1'p224 + -1'p225 + -1'p226 + -1'p227 + -1'p228 + -1'p229 + p23 + -1'p230 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p9 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 = 87
invariant :p172 + p52 = 1
invariant :p217 + p97 = 1
invariant :p135 + p15 = 1
invariant :p175 + p55 = 1
invariant :p108 + p228 = 1
invariant :p112 + p2 = 1
invariant :p205 + p85 = 1
invariant :p145 + p25 = 1
invariant :p162 + p42 = 1
invariant :p206 + p86 = 1
invariant :p200 + p80 = 1
invariant :p214 + p94 = 1
invariant :p143 + p23 = 1
invariant :p100 + p220 = 1
invariant :p13 + p133 = 1
invariant :p216 + p96 = 1
invariant :p166 + p46 = 1
invariant :p192 + p72 = 1
invariant :p182 + p62 = 1
invariant :p124 + -1'p129 + -1'p4 + p9 = 0
invariant :p109 + p229 = 1
invariant :p194 + p74 = 1
invariant :p114 + p4 = 1
invariant :p152 + p32 = 1
invariant :p117 + p7 = 1
invariant :p164 + p44 = 1
invariant :p115 + p5 = 1
invariant :p149 + p29 = 1
invariant :p147 + p27 = 1
invariant :p118 + p8 = 1
invariant :p128 + -1'p129 + -1'p8 + p9 = 0
invariant :p126 + -1'p129 + -1'p6 + p9 = 0
invariant :p123 + -1'p129 + -1'p3 + p9 = 0
invariant :p146 + p26 = 1
invariant :p151 + p31 = 1
invariant :p138 + p18 = 1
invariant :p113 + p3 = 1
invariant :p106 + p226 = 1
invariant :p190 + p70 = 1
invariant :p208 + p88 = 1
invariant :p212 + p92 = 1
invariant :p110 + p230 = 1
invariant :p171 + p51 = 1
invariant :p102 + p222 = 1
invariant :p154 + p34 = 1
invariant :p140 + p20 = 1
invariant :p160 + p40 = 1
invariant :p107 + p227 = 1
invariant :p139 + p19 = 1
invariant :p185 + p65 = 1
invariant :p141 + p21 = 1
invariant :p210 + p90 = 1
invariant :p202 + p82 = 1
invariant :p116 + p6 = 1
invariant :p144 + p24 = 1
invariant :p150 + p30 = 1
invariant :p177 + p57 = 1
invariant :p137 + p17 = 1
invariant :p219 + p99 = 1
invariant :p103 + p223 = 1
invariant :p155 + p35 = 1
invariant :p12 + p132 = 1
invariant :p10 + p129 + -1'p130 + -1'p9 = 0
invariant :p199 + p79 = 1
invariant :p189 + p69 = 1
invariant :p173 + p53 = 1
invariant :p136 + p16 = 1
invariant :p142 + p22 = 1
invariant :p156 + p36 = 1
invariant :p134 + p14 = 1
invariant :p213 + p93 = 1
invariant :p211 + p91 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3523 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,35.3497,923656,1,0,25,2.80349e+06,20,10,9682,370946,62
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(X(F(("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p36>=1))")U("((p10>=1)&&(p130>=1))"))))))
Formula 1 simplified : !XXF("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p36>=1))" U "((p10>=1)&&(p130>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
18 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,35.5393,928580,1,0,45,2.80649e+06,29,19,9686,374745,117
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X(G("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p64>=1))")))U("(p161>=1)")))
Formula 2 simplified : !(XG"(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p64>=1))" U "(p161>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,35.6552,930848,1,0,55,2.80812e+06,39,21,9708,377009,177
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p74>=1))")U(F("((p126>=1)&&(p6>=1))")))U(G(("(p185>=1)")U("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p79>=1))")))))
Formula 3 simplified : !(("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p74>=1))" U F"((p126>=1)&&(p6>=1))") U G("(p185>=1)" U "(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p79>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,35.7159,931916,1,0,58,2.80926e+06,56,21,9852,379313,205
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((X(X(F("(p137>=1)"))))U(G("(p195>=1)"))))
Formula 4 simplified : !(XXF"(p137>=1)" U G"(p195>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,35.7216,932296,1,0,60,2.80927e+06,62,21,9853,379421,223
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p14>=1))")U("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p86>=1))")))U("(p206>=1)")))
Formula 5 simplified : !(F("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p14>=1))" U "(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p86>=1))") U "(p206>=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,35.7376,932548,1,0,72,2.80999e+06,75,21,9859,379795,290
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(G(F(("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p75>=1))")U("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p71>=1))"))))))
Formula 6 simplified : !XGF("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p75>=1))" U "(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p71>=1))")
4 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,35.7413,932548,1,0,73,2.81005e+06,84,21,9862,379820,303
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((("(p228>=1)")U(G(("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p24>=1))")U("(p170>=1)")))))
Formula 7 simplified : !("(p228>=1)" U G("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p24>=1))" U "(p170>=1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,35.7646,933076,1,0,76,2.81039e+06,121,21,9912,380082,334
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(F(X(F(F("(p179>=1)")))))))
Formula 8 simplified : !XFXF"(p179>=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,35.794,933604,1,0,85,2.81151e+06,130,22,9913,381133,384
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("(p161>=1)"))
Formula 9 simplified : !"(p161>=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,35.7948,933604,1,0,85,2.81151e+06,130,22,9913,381133,384
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p69>=1))"))
Formula 10 simplified : !"(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p69>=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,35.7967,933868,1,0,85,2.81151e+06,133,22,9916,381133,386
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X((G("(((((((((((p12>=1)&&(p122>=1))&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))"))U(F("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p81>=1))"))))))
Formula 11 simplified : !GX(G"(((((((((((p12>=1)&&(p122>=1))&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))" U F"(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p81>=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,35.8021,933868,1,0,85,2.81161e+06,142,23,9919,381667,398
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X("(p188>=1)")))
Formula 12 simplified : !X"(p188>=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,35.8044,933868,1,0,86,2.81171e+06,145,23,9920,381711,403
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G((F(X("((p124>=1)&&(p4>=1))")))U(X(G("(p150>=1)"))))))
Formula 13 simplified : !G(FX"((p124>=1)&&(p4>=1))" U XG"(p150>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
28 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,36.0834,940936,1,0,89,2.81235e+06,162,24,9926,384041,423
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(G(G(("(((((((((((p109>=1)&&(p122>=1))&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))")U("(p157>=1)"))))))
Formula 14 simplified : !FG("(((((((((((p109>=1)&&(p122>=1))&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))" U "(p157>=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,36.177,943300,1,0,92,2.81289e+06,175,24,9935,385371,444
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((G(("(p185>=1)")U("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p56>=1))")))U("(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p58>=1))")))
Formula 15 simplified : !(G("(p185>=1)" U "(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p56>=1))") U "(((((((((((p122>=1)&&(p123>=1))&&(p124>=1))&&(p125>=1))&&(p126>=1))&&(p127>=1))&&(p128>=1))&&(p129>=1))&&(p130>=1))&&(p131>=1))&&(p58>=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,36.1833,943508,1,0,92,2.81289e+06,195,24,9972,385371,450
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0100-LTLFireability-15 TRUE 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 1527823572276

--------------------
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:25:31 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:25:31 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 3:25:31 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 161 ms
Jun 01, 2018 3:25:31 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 230 places.
Jun 01, 2018 3:25:31 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 220 transitions.
Jun 01, 2018 3:25:31 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 46 ms
Jun 01, 2018 3:25:32 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 280 ms
Jun 01, 2018 3:25:32 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
Jun 01, 2018 3:25:32 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Jun 01, 2018 3:25:32 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 220 transitions.
Jun 01, 2018 3:25:33 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 120 place invariants in 164 ms
Jun 01, 2018 3:25:35 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 230 variables to be positive in 2591 ms
Jun 01, 2018 3:25:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 220 transitions.
Jun 01, 2018 3:25:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/220 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:25:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:25:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 220 transitions.
Jun 01, 2018 3:25:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:25:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 220 transitions.
Jun 01, 2018 3:25:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/220) took 85 ms. Total solver calls (SAT/UNSAT): 102(101/1)
Jun 01, 2018 3:25:52 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(11/220) took 3258 ms. Total solver calls (SAT/UNSAT): 1389(1377/12)
Jun 01, 2018 3:25:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(56/220) took 6266 ms. Total solver calls (SAT/UNSAT): 2452(2403/49)
Jun 01, 2018 3:25:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(125/220) took 9601 ms. Total solver calls (SAT/UNSAT): 3460(3351/109)
Jun 01, 2018 3:26:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(138/220) took 12779 ms. Total solver calls (SAT/UNSAT): 4537(4428/109)
Jun 01, 2018 3:26:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(153/220) took 15907 ms. Total solver calls (SAT/UNSAT): 5627(5518/109)
Jun 01, 2018 3:26:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(174/220) took 18928 ms. Total solver calls (SAT/UNSAT): 6775(6666/109)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
Jun 01, 2018 3:26:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 21530 ms. Total solver calls (SAT/UNSAT): 7603(7494/109)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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:26:11 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 38477ms 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-r0010w0100"
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-r0010w0100.tgz
mv RwMutex-PT-r0010w0100 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-r0010w0100, 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-152732263300498"
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 ;