Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100474.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 2.9K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 79K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-04-00
FORMULA_NAME BusinessProcesses-PT-04-01
FORMULA_NAME BusinessProcesses-PT-04-02
FORMULA_NAME BusinessProcesses-PT-04-03
FORMULA_NAME BusinessProcesses-PT-04-04
FORMULA_NAME BusinessProcesses-PT-04-05
FORMULA_NAME BusinessProcesses-PT-04-06
FORMULA_NAME BusinessProcesses-PT-04-07
FORMULA_NAME BusinessProcesses-PT-04-08
FORMULA_NAME BusinessProcesses-PT-04-09
FORMULA_NAME BusinessProcesses-PT-04-10
FORMULA_NAME BusinessProcesses-PT-04-11
FORMULA_NAME BusinessProcesses-PT-04-12
FORMULA_NAME BusinessProcesses-PT-04-13
FORMULA_NAME BusinessProcesses-PT-04-14
FORMULA_NAME BusinessProcesses-PT-04-15

=== Now, execution of the tool begins

BK_START 1589250473211

[2020-05-12 02:27:54] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:27:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:27:54] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-05-12 02:27:54] [INFO ] Transformed 288 places.
[2020-05-12 02:27:54] [INFO ] Transformed 283 transitions.
[2020-05-12 02:27:54] [INFO ] Found NUPN structural information;
[2020-05-12 02:27:54] [INFO ] Parsed PT model containing 288 places and 283 transitions in 85 ms.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1128 resets, run finished after 194 ms. (steps per millisecond=515 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 281 rows 286 cols
[2020-05-12 02:27:54] [INFO ] Computed 44 place invariants in 15 ms
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using 21 positive place invariants in 25 ms returned sat
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 9 ms returned sat
[2020-05-12 02:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using state equation in 168 ms returned unsat
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using 21 positive place invariants in 34 ms returned sat
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 2 ms returned unsat
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 7 ms returned sat
[2020-05-12 02:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using state equation in 199 ms returned unsat
[2020-05-12 02:27:55] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-05-12 02:27:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 02:27:55] [INFO ] Flatten gal took : 51 ms
FORMULA BusinessProcesses-PT-04-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:27:55] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:27:55] [INFO ] Applying decomposition
[2020-05-12 02:27:55] [INFO ] Flatten gal took : 31 ms
[2020-05-12 02:27:56] [INFO ] Input system was already deterministic with 281 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10149247167506448404.txt, -o, /tmp/graph10149247167506448404.bin, -w, /tmp/graph10149247167506448404.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10149247167506448404.bin, -l, -1, -v, -w, /tmp/graph10149247167506448404.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 281 rows 286 cols
[2020-05-12 02:27:56] [INFO ] Decomposing Gal with order
[2020-05-12 02:27:56] [INFO ] Computed 44 place invariants in 6 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p106 + p107 + p108 - p245 - p246 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p16 + p17 + p19 + p20 + p21 + p22 + p23 + p31 + p32 + p207 + p213 + p214 + p215 + p257 = 1
inv : p0 + p1 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p135 + p136 + p137 = 1
inv : p0 + p73 + p74 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p257 + p258 + p259 + p267 + p268 + p269 + p273 + p274 + p275 + p279 + p280 + p281 + p285 + p286 + p287 = 1
inv : p0 + p1 + p123 + p124 + p178 + p179 + p180 + p181 + p182 = 1
inv : p282 + p283 + p284 - p285 - p286 - p287 = 0
inv : -p57 - p59 - p63 - p69 - p75 - p76 - p77 - p78 + p80 + p81 - p88 + p98 + p99 - p100 - p101 - p102 + p225 + p227 + p231 + p237 - p265 - p266 + p267 + p268 + p269 + p273 - p283 - p284 + p285 + p286 + p287 = 0
inv : p0 + p1 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p148 + p149 + p150 + p151 + p152 = 1
inv : p0 + p1 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p143 + p144 + p145 + p146 + p147 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p16 + p17 + p19 + p20 + p22 + p23 + p24 + p28 + p29 + p207 + p210 + p214 + p215 - p255 - p256 + p257 + p258 + p259 = 1
inv : p0 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p257 + p258 + p259 + p267 + p268 + p269 + p273 + p274 + p275 + p279 + p280 + p281 + p285 + p286 + p287 = 1
inv : p0 + p1 + p123 + p124 + p125 + p126 + p127 + p163 + p164 + p165 + p166 + p167 = 1
inv : p0 + p1 + p123 + p124 + p125 + p126 + p168 + p169 + p170 + p171 + p172 = 1
inv : p57 + p59 + p63 + p69 + p75 + p79 + p88 - p98 - p99 + p100 + p101 + p102 - p225 - p227 - p231 - p237 + p265 + p266 - p267 - p268 - p269 - p273 + p283 + p284 - p285 - p286 - p287 = 0
inv : p112 + p113 + p114 - p249 - p250 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p49 + p50 + p51 + p222 + p223 = 1
inv : p0 + p1 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p153 + p154 + p155 + p156 + p157 = 1
inv : p0 + p1 + p2 + p3 + p115 + p116 + p117 + p118 = 1
inv : p260 + p264 + p265 + p266 - p267 - p268 - p269 = 0
inv : p57 + p59 + p61 + p66 + p75 + p76 + p85 + p91 - p225 - p227 - p229 - p234 + p262 + p263 - p267 - p268 - p269 + p271 + p272 - p273 - p274 - p275 - p276 = 0
inv : p0 + p1 + p2 + p119 + p120 + p121 + p122 = 1
inv : p18 + p24 + p30 - p207 - p213 - p257 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p103 + p104 + p105 + p245 + p246 = 1
inv : -p57 - p59 - p61 - p66 - p75 - p76 + p86 + p87 - p88 - p89 - p90 - p91 + p225 + p227 + p229 + p234 - p262 - p263 + p267 + p268 + p269 - p271 - p272 + p273 + p274 + p275 + p276 = 0
inv : p13 + p14 + p15 - p204 - p205 = 0
inv : p0 + p1 + p123 + p124 + p125 + p126 + p127 + p128 + p158 + p159 + p160 + p161 + p162 = 1
inv : p270 + p271 + p272 - p273 - p274 - p275 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p75 + p76 + p77 + p78 + p88 + p89 + p90 + p91 + p92 + p93 + p100 + p101 + p102 - p188 - p189 - p190 - p191 - p192 - p193 - p194 - p195 - p196 - p197 - p198 - p199 - p200 - p201 - p202 - p203 - p204 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p212 - p213 - p214 - p215 - p216 - p217 - p218 - p219 - p220 - p221 - p222 - p223 - p224 - p225 - p226 - p227 - p228 - p229 - p230 - p231 - p232 - p233 - p234 - p235 - p236 - p237 - p238 - p239 - p240 - p243 - p244 - p245 - p246 - p247 - p248 - p249 - p250 - p251 - p252 - p253 - p257 - p258 - p259 - p267 - p268 - p269 - p273 - p274 - p275 - p279 - p280 - p281 - p285 - p286 - p287 = 0
inv : p260 + p261 + p262 + p263 - p267 - p268 - p269 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p204 + p205 = 1
inv : p0 + p1 + p123 + p183 + p184 + p185 + p186 + p187 = 1
inv : p276 + p277 + p278 - p279 - p280 - p281 = 0
inv : p97 + p98 + p99 - p100 - p101 - p102 = 0
inv : p52 + p53 + p54 - p222 - p223 = 0
inv : -p57 - p61 - p63 - p72 - p75 - p76 - p77 - p78 + p83 + p84 - p94 - p100 + p225 + p229 + p231 + p240 + p267 + p279 + p285 = 0
inv : p0 + p1 + p2 + p3 + p4 + p109 + p110 + p111 + p249 + p250 = 1
inv : p57 + p61 + p63 + p72 + p82 + p94 + p100 - p225 - p229 - p231 - p240 - p267 - p279 - p285 = 0
inv : p254 + p255 + p256 - p257 - p258 - p259 = 0
inv : p0 + p1 + p123 + p124 + p125 + p173 + p174 + p175 + p176 + p177 = 1
inv : p25 + p26 - p214 - p215 = 0
inv : p18 + p21 + p27 - p207 - p210 + p255 + p256 - p257 - p258 - p259 = 0
inv : p0 + p1 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p138 + p140 + p141 + p142 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p75 + p76 + p77 + p78 + p88 + p89 + p90 + p94 + p95 + p96 + p100 + p101 + p102 - p188 - p189 - p190 - p191 - p192 - p193 - p194 - p195 - p196 - p197 - p198 - p199 - p200 - p201 - p202 - p203 - p204 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p212 - p213 - p214 - p215 - p216 - p217 - p218 - p219 - p220 - p221 - p222 - p223 - p224 - p225 - p226 - p227 - p228 - p229 - p230 - p231 - p232 - p233 - p234 - p235 - p236 - p237 - p238 - p239 - p240 - p243 - p244 - p245 - p246 - p247 - p248 - p249 - p250 - p251 - p252 - p253 - p257 - p258 - p259 - p267 - p268 - p269 - p273 - p274 - p275 - p279 - p280 - p281 - p285 - p286 - p287 = 0
Total of 44 invariants.
[2020-05-12 02:27:56] [INFO ] Computed 44 place invariants in 12 ms
[2020-05-12 02:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:27:56] [INFO ] Removed a total of 242 redundant transitions.
[2020-05-12 02:27:56] [INFO ] Flatten gal took : 116 ms
[2020-05-12 02:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2020-05-12 02:27:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
[2020-05-12 02:27:56] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 12 LTL properties
Checking formula 0 : !((((F(!(X("(i0.u43.p105==1)"))))&&(!(F("(i10.u49.p119==1)"))))U("(((i7.u104.p262==1)&&(i7.u105.p265==1))&&(i4.i1.i0.u106.p268==1))")))
Formula 0 simplified : !((F!X"(i0.u43.p105==1)" & !F"(i10.u49.p119==1)") U "(((i7.u104.p262==1)&&(i7.u105.p265==1))&&(i4.i1.i0.u106.p268==1))")
built 34 ordering constraints for composite.
built 7 ordering constraints for composite.
built 33 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 33 ordering constraints for composite.
built 19 ordering constraints for composite.
built 42 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 26 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 30 ordering constraints for composite.
[2020-05-12 02:27:56] [INFO ] Proved 286 variables to be positive in 346 ms
[2020-05-12 02:27:56] [INFO ] Computing symmetric may disable matrix : 281 transitions.
[2020-05-12 02:27:56] [INFO ] Computation of disable matrix completed :0/281 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:27:56] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:27:56] [INFO ] Computing symmetric may enable matrix : 281 transitions.
[2020-05-12 02:27:56] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:27:57] [INFO ] Computing symmetric co enabling matrix : 281 transitions.
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t136, t182, i0.u5.t194, i0.u43.t135, i1.t187, i1.t185, i1.t114, i1.t110, i1.u7.t191, i1.u56.t115, i1.u59.t111, i2.t181, i2.t177, i2.t175, i2.t173, i2.t170, i2.t168, i3.u22.t165, i4.i0.i0.t143, i4.i0.i0.t141, i4.i0.i0.t139, i4.i0.i0.u24.t147, i4.i0.i0.u24.t151, i4.i0.i0.u24.t155, i4.i0.i0.u24.t161, i4.i1.i0.t86, i4.i1.i0.u70.t87, i5.t98, i5.u64.t99, i7.t106, i7.u61.t107, i8.t102, i8.t94, i8.u63.t103, i8.u67.t95, i9.u45.t131, i9.u47.t127, i10.t82, i10.u73.t83, i11.t70, i11.t65, i11.t63, i11.t56, i11.t54, i11.t51, i11.t49, i11.t47, i11.t19, i11.t16, i11.t13, i11.u100.t11, i11.u100.t30, i11.u100.t34, i11.u100.t38, i11.u100.t44, i11.u100.t60, i12.t90, i12.u69.t91, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/179/61/280
[2020-05-12 02:27:59] [INFO ] Computation of co-enabling matrix(8/281) took 2177 ms. Total solver calls (SAT/UNSAT): 1377(822/555)
Computing Next relation with stutter on 460 deadlock states
37 unique states visited
37 strongly connected components in search stack
37 transitions explored
37 items max in DFS search stack
496 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.00317,162824,1,0,289871,838,5241,461363,330,2855,836685
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(G(F("((i2.u17.p40==1)||(i8.u51.p126==1))"))))))
Formula 1 simplified : !GXGF"((i2.u17.p40==1)||(i8.u51.p126==1))"
Computing Next relation with stutter on 460 deadlock states
[2020-05-12 02:28:02] [INFO ] Computation of co-enabling matrix(9/281) took 5277 ms. Total solver calls (SAT/UNSAT): 1546(863/683)
53 unique states visited
53 strongly connected components in search stack
54 transitions explored
53 items max in DFS search stack
380 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,8.80069,251808,1,0,438090,849,5279,680141,331,2913,1145834
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X(!(G("(((i4.i1.i0.u31.p82!=1)||(i4.i1.i0.u70.p181!=1))||(i7.u103.p267!=1))"))))))
Formula 2 simplified : !GX!G"(((i4.i1.i0.u31.p82!=1)||(i4.i1.i0.u70.p181!=1))||(i7.u103.p267!=1))"
Computing Next relation with stutter on 460 deadlock states
53 unique states visited
53 strongly connected components in search stack
54 transitions explored
53 items max in DFS search stack
70 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,9.50485,272656,1,0,481121,850,5315,730552,333,2931,1232134
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(G((G("(i0.u5.p12==1)"))||(F((G("((i4.i0.i0.u27.p64==1)||(((i12.u25.p88==1)&&(i12.u69.p176==1))&&(i12.u88.p273==1)))"))&&("(i11.u76.p195==1)"))))))))
Formula 3 simplified : !X!G(G"(i0.u5.p12==1)" | F("(i11.u76.p195==1)" & G"((i4.i0.i0.u27.p64==1)||(((i12.u25.p88==1)&&(i12.u69.p176==1))&&(i12.u88.p273==1)))"))
Computing Next relation with stutter on 460 deadlock states
72 unique states visited
57 strongly connected components in search stack
75 transitions explored
66 items max in DFS search stack
41 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,9.90187,291276,1,0,518802,853,5390,777799,334,2944,1337598
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((!(G((X("(i1.u8.p18==1)"))&&("(i7.u105.p266==1)"))))U(X("(i4.i1.i0.u71.p178==1)")))))
Formula 4 simplified : !F(!G("(i7.u105.p266==1)" & X"(i1.u8.p18==1)") U X"(i4.i1.i0.u71.p178==1)")
Computing Next relation with stutter on 460 deadlock states
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,9.91821,291804,1,0,519655,853,5439,778549,334,2944,1341439
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(((F(X("(i9.u45.p111==1)")))||(!(F("(i11.u100.p230==1)"))))||(!(X("(((i4.i0.i0.u24.p55!=1)||(i10.u73.p185!=1))||(i11.u100.p253!=1))"))))))
Formula 5 simplified : !F(FX"(i9.u45.p111==1)" | !F"(i11.u100.p230==1)" | !X"(((i4.i0.i0.u24.p55!=1)||(i10.u73.p185!=1))||(i11.u100.p253!=1))")
Computing Next relation with stutter on 460 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,10.0154,295184,1,0,527923,853,5505,786931,337,2946,1368367
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-04-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X(X(X("(((i1.u8.p27==1)&&(i1.u56.p146==1))&&(i1.u80.p254==1))"))))||(!(F("((i11.u81.p209==1)||(((i12.u32.p79==1)&&(i12.u69.p176==1))&&(i7.u103.p264==1)))"))))))
Formula 6 simplified : !X(XXX"(((i1.u8.p27==1)&&(i1.u56.p146==1))&&(i1.u80.p254==1))" | !F"((i11.u81.p209==1)||(((i12.u32.p79==1)&&(i12.u69.p176==1))&&(i7.u103.p264==1)))")
Computing Next relation with stutter on 460 deadlock states
[2020-05-12 02:28:07] [INFO ] Computation of co-enabling matrix(11/281) took 10411 ms. Total solver calls (SAT/UNSAT): 1936(904/1032)
53 unique states visited
53 strongly connected components in search stack
54 transitions explored
53 items max in DFS search stack
585 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,15.8711,474112,1,0,871099,854,5564,1.17681e+06,338,2974,2134136
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(!(("(i11.u74.p190==1)")U(F("(i9.u48.p118!=1)"))))))
Formula 7 simplified : !X!("(i11.u74.p190==1)" U F"(i9.u48.p118!=1)")
Computing Next relation with stutter on 460 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,15.8725,474376,1,0,871099,854,5581,1.17681e+06,338,2974,2134157
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F("(i9.u45.p111!=1)"))))
Formula 8 simplified : !XF"(i9.u45.p111!=1)"
Computing Next relation with stutter on 460 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,15.873,474376,1,0,871099,854,5593,1.17681e+06,338,2974,2134173
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-04-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((!(F((G("((i11.u75.p199==1)||(((i0.u43.p103==1)&&(i12.u69.p175==1))&&(i11.u100.p253==1)))"))U("(i11.u75.p199!=1)"))))&&(!((F("(i11.u75.p199==1)"))U("(i1.u57.p147==1)"))))))
Formula 9 simplified : !F(!F(G"((i11.u75.p199==1)||(((i0.u43.p103==1)&&(i12.u69.p175==1))&&(i11.u100.p253==1)))" U "(i11.u75.p199!=1)") & !(F"(i11.u75.p199==1)" U "(i1.u57.p147==1)"))
Computing Next relation with stutter on 460 deadlock states
[2020-05-12 02:28:12] [INFO ] Computation of co-enabling matrix(13/281) took 14914 ms. Total solver calls (SAT/UNSAT): 2253(982/1271)
[2020-05-12 02:28:15] [INFO ] Computation of co-enabling matrix(33/281) took 17916 ms. Total solver calls (SAT/UNSAT): 4966(1652/3314)
[2020-05-12 02:28:18] [INFO ] Computation of co-enabling matrix(49/281) took 21021 ms. Total solver calls (SAT/UNSAT): 6733(2244/4489)
[2020-05-12 02:28:21] [INFO ] Computation of co-enabling matrix(63/281) took 24076 ms. Total solver calls (SAT/UNSAT): 8380(2782/5598)
51 unique states visited
51 strongly connected components in search stack
51 transitions explored
51 items max in DFS search stack
975 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,25.6253,759412,1,0,1.40249e+06,856,5670,1.71748e+06,341,2979,3072549
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!((G("(i8.u51.p125!=1)"))U("(i8.u51.p125==1)")))||(!(F("((i8.u51.p125!=1)||(i4.i0.i0.u94.p242!=1))")))))
Formula 10 simplified : !(!(G"(i8.u51.p125!=1)" U "(i8.u51.p125==1)") | !F"((i8.u51.p125!=1)||(i4.i0.i0.u94.p242!=1))")
Computing Next relation with stutter on 460 deadlock states
23 unique states visited
0 strongly connected components in search stack
23 transitions explored
23 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,25.6359,759668,1,0,1.40263e+06,856,5725,1.71783e+06,345,2979,3074116
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-04-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(i11.u99.p251==1)")))
Formula 11 simplified : !F"(i11.u99.p251==1)"
Computing Next relation with stutter on 460 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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,25.6715,760724,1,0,1.40492e+06,856,5756,1.7196e+06,345,2979,3082042
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-12 02:28:24] [INFO ] Computation of co-enabling matrix(75/281) took 27101 ms. Total solver calls (SAT/UNSAT): 9682(3273/6409)
[2020-05-12 02:28:26] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-12 02:28:26] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 0) (select s0 1) (select s0 123) (select s0 124) (select s0 125) (select s0 126) (select s0 166) (select s0 167) (select s0 168) (select s0 169) (select s0 170)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 0) (select s0 1) (select s0 123) (select s0 124) (select s0 125) (select s0 126) (select s0 166) (select s0 167) (select s0 168) (select s0 169) (select s0 170)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 0) (select s0 1) (select s0 123) (select s0 124) (select s0 125) (select s0 126) (select s0 166) (select s0 167) (select s0 168) (select s0 169) (select s0 170)))), (assert (>= (select s0 166) 1)), (assert (>= (select s0 0) 0)), (assert (>= (select s0 1) 0)), (assert (>= (select s0 123) 0)), (assert (>= (select s0 124) 0)), (assert (>= (select s0 125) 0)), (assert (>= (select s0 126) 0)), (assert (>= (select s0 166) 0)), (assert (>= (select s0 167) 0)), (assert (>= (select s0 168) 0)), (assert (>= (select s0 169) 0)), (assert (>= (select s0 170) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@6fa5b277
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@6fa5b277
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-12 02:28:26] [INFO ] Built C files in 30331ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589250506737

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-04, 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 r021-oct2-158897699100474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;