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-158897699100466.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-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 63K 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-03-00
FORMULA_NAME BusinessProcesses-PT-03-01
FORMULA_NAME BusinessProcesses-PT-03-02
FORMULA_NAME BusinessProcesses-PT-03-03
FORMULA_NAME BusinessProcesses-PT-03-04
FORMULA_NAME BusinessProcesses-PT-03-05
FORMULA_NAME BusinessProcesses-PT-03-06
FORMULA_NAME BusinessProcesses-PT-03-07
FORMULA_NAME BusinessProcesses-PT-03-08
FORMULA_NAME BusinessProcesses-PT-03-09
FORMULA_NAME BusinessProcesses-PT-03-10
FORMULA_NAME BusinessProcesses-PT-03-11
FORMULA_NAME BusinessProcesses-PT-03-12
FORMULA_NAME BusinessProcesses-PT-03-13
FORMULA_NAME BusinessProcesses-PT-03-14
FORMULA_NAME BusinessProcesses-PT-03-15

=== Now, execution of the tool begins

BK_START 1589250215636

[2020-05-12 02:23:38] [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:23:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:23:38] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-05-12 02:23:38] [INFO ] Transformed 274 places.
[2020-05-12 02:23:38] [INFO ] Transformed 237 transitions.
[2020-05-12 02:23:38] [INFO ] Found NUPN structural information;
[2020-05-12 02:23:38] [INFO ] Parsed PT model containing 274 places and 237 transitions in 96 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1182 resets, run finished after 292 ms. (steps per millisecond=342 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:23:38] [INFO ] Computed 43 place invariants in 14 ms
[2020-05-12 02:23:38] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2020-05-12 02:23:38] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:39] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2020-05-12 02:23:40] [INFO ] Deduced a trap composed of 11 places in 1023 ms
[2020-05-12 02:23:40] [INFO ] Deduced a trap composed of 11 places in 640 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 32 places in 45 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 22 places in 47 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 25 places in 37 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 28 places in 94 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 35 places in 72 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 28 places in 47 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 34 places in 101 ms
[2020-05-12 02:23:41] [INFO ] Deduced a trap composed of 35 places in 42 ms
[2020-05-12 02:23:41] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2740 ms
[2020-05-12 02:23:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:23:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 65 ms returned sat
[2020-05-12 02:23:42] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:42] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-05-12 02:23:42] [INFO ] Deduced a trap composed of 11 places in 154 ms
[2020-05-12 02:23:42] [INFO ] Deduced a trap composed of 11 places in 197 ms
[2020-05-12 02:23:42] [INFO ] Deduced a trap composed of 8 places in 161 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 32 places in 115 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 28 places in 124 ms
[2020-05-12 02:23:43] [INFO ] Deduced a trap composed of 28 places in 109 ms
[2020-05-12 02:23:44] [INFO ] Deduced a trap composed of 28 places in 62 ms
[2020-05-12 02:23:44] [INFO ] Deduced a trap composed of 35 places in 130 ms
[2020-05-12 02:23:44] [INFO ] Deduced a trap composed of 28 places in 63 ms
[2020-05-12 02:23:44] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2020-05-12 02:23:44] [INFO ] Deduced a trap composed of 35 places in 46 ms
[2020-05-12 02:23:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2026 ms
[2020-05-12 02:23:44] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 36 ms.
[2020-05-12 02:23:45] [INFO ] Added : 144 causal constraints over 29 iterations in 789 ms. Result :sat
[2020-05-12 02:23:45] [INFO ] [Real]Absence check using 31 positive place invariants in 90 ms returned sat
[2020-05-12 02:23:45] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 11 ms returned sat
[2020-05-12 02:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:45] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-05-12 02:23:45] [INFO ] Deduced a trap composed of 11 places in 100 ms
[2020-05-12 02:23:45] [INFO ] Deduced a trap composed of 14 places in 159 ms
[2020-05-12 02:23:46] [INFO ] Deduced a trap composed of 9 places in 438 ms
[2020-05-12 02:23:46] [INFO ] Deduced a trap composed of 14 places in 178 ms
[2020-05-12 02:23:46] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2020-05-12 02:23:46] [INFO ] Deduced a trap composed of 11 places in 85 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 74 places in 201 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 19 places in 252 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 73 places in 74 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 44 places in 65 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 19 places in 95 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 72 places in 52 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 29 places in 50 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 41 places in 64 ms
[2020-05-12 02:23:47] [INFO ] Deduced a trap composed of 32 places in 55 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 43 places in 69 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 71 places in 53 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 68 places in 46 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 68 places in 49 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 51 places in 212 ms
[2020-05-12 02:23:48] [INFO ] Deduced a trap composed of 79 places in 165 ms
[2020-05-12 02:23:49] [INFO ] Deduced a trap composed of 56 places in 115 ms
[2020-05-12 02:23:49] [INFO ] Deduced a trap composed of 72 places in 123 ms
[2020-05-12 02:23:49] [INFO ] Deduced a trap composed of 37 places in 258 ms
[2020-05-12 02:23:49] [INFO ] Deduced a trap composed of 33 places in 46 ms
[2020-05-12 02:23:49] [INFO ] Deduced a trap composed of 72 places in 55 ms
[2020-05-12 02:23:51] [INFO ] Deduced a trap composed of 74 places in 2067 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 28 places in 1366 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 19 places in 132 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 69 places in 136 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 73 places in 102 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 74 places in 60 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 78 places in 67 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 72 places in 89 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 69 places in 126 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 71 places in 381 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 28 places in 152 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 73 places in 299 ms
[2020-05-12 02:23:55] [INFO ] Deduced a trap composed of 72 places in 114 ms
[2020-05-12 02:23:55] [INFO ] Deduced a trap composed of 69 places in 107 ms
[2020-05-12 02:23:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 9547 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-12 02:23:55] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-12 02:23:55] [INFO ] Flatten gal took : 84 ms
FORMULA BusinessProcesses-PT-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:23:55] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:23:55] [INFO ] Applying decomposition
[2020-05-12 02:23:55] [INFO ] Flatten gal took : 19 ms
[2020-05-12 02:23:55] [INFO ] Input system was already deterministic with 236 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/graph5892272392610382701.txt, -o, /tmp/graph5892272392610382701.bin, -w, /tmp/graph5892272392610382701.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/graph5892272392610382701.bin, -l, -1, -v, -w, /tmp/graph5892272392610382701.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:23:55] [INFO ] Decomposing Gal with order
[2020-05-12 02:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:23:55] [INFO ] Computed 43 place invariants in 4 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p76 + p77 + p78 + p261 + p262 = 1
inv : p62 + p63 - p249 - p250 = 0
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p147 + p148 + p149 + p150 + p151 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p167 + p168 + p169 + p170 + p171 = 1
inv : p91 + p92 + p93 - p269 - p270 = 0
inv : p73 + p74 + p75 - p257 - p258 = 0
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p172 + p173 + p174 + p175 + p176 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p177 + p178 + p179 + p180 + p181 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p18 + p19 + p209 + p210 + p213 + p214 + p215 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p162 + p163 + p164 + p165 + p166 = 1
inv : p16 + p17 + p20 + p21 - p209 - p210 - p213 - p214 - p215 = 0
inv : p0 + p1 + p2 + p3 + p4 + p88 + p89 + p90 + p269 + p270 = 1
inv : p0 + p1 + p102 + p103 + p187 + p188 + p189 + p190 + p191 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p57 + p58 + p59 + p60 + p61 + p249 + p250 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p127 + p128 + p129 + p130 + p131 = 1
inv : p40 + p41 + p42 - p231 - p232 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p22 + p23 + p24 + p218 + p219 = 1
inv : p0 + p29 + p30 + p31 + p32 + p35 + p36 + p197 + p198 + p199 + p200 + p201 + p202 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p224 + p225 + 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 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p28 + p33 + p34 - p197 - p198 - p199 - p200 - p201 - p202 - p204 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p212 - p213 - p214 - p215 - p216 - p217 - p218 - p219 - p224 - p225 - 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 - p254 - p255 - p256 - p257 - p258 - p259 - p260 - p261 - p262 - p263 - p264 - p265 - p266 - p267 - p268 - p269 - p270 - p271 - p272 - p273 = 0
inv : p55 + p56 - p243 - p244 = 0
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p122 + p123 + p124 + p125 + p126 = 1
inv : p0 + p1 + p102 + p103 + p104 + p182 + p183 + p184 + p185 + p186 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p152 + p153 + p154 + p155 + p156 = 1
inv : p0 + p1 + p102 + p192 + p193 + p194 + p195 + p196 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p70 + p71 + p72 + p257 + p258 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p82 + p83 + p84 + p265 + p266 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p142 + p143 + p144 + p145 + p146 = 1
inv : p48 + p49 - p237 - p238 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p43 + p44 + p45 + p46 + p47 + p237 + p238 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p50 + p51 + p52 + p53 + p54 + p243 + p244 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 = 1
inv : p0 + p197 + p198 + p199 + p200 + p201 + p202 + 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 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 = 1
inv : p67 + p68 + p69 - p253 - p254 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p64 + p65 + p66 + p253 + p254 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p137 + p138 + p139 + p140 + p141 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p132 + p133 + p134 + p135 + p136 = 1
inv : p0 + p1 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p157 + p158 + p159 + p160 + p161 = 1
inv : p0 + p1 + p2 + p3 + p94 + p95 + p96 + p97 = 1
inv : p79 + p80 + p81 - p261 - p262 = 0
inv : p85 + p86 + p87 - p265 - p266 = 0
inv : p25 + p26 + p27 - p218 - p219 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p37 + p38 + p39 + p231 + p232 = 1
inv : p0 + p1 + p2 + p98 + p99 + p100 + p101 = 1
Total of 43 invariants.
[2020-05-12 02:23:55] [INFO ] Computed 43 place invariants in 5 ms
[2020-05-12 02:23:55] [INFO ] Removed a total of 48 redundant transitions.
[2020-05-12 02:23:56] [INFO ] Flatten gal took : 128 ms
[2020-05-12 02:23:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-12 02:23:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 21 ms
[2020-05-12 02:23: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 13 LTL properties
Checking formula 0 : !(((!(F("((i16.u83.p210!=1)||(((i3.i1.u10.p22==1)&&(i3.i2.u50.p124==1))&&(i15.u80.p273==1)))")))||(!(F("(i6.i0.u45.p112==1)")))))
Formula 0 simplified : !(!F"((i16.u83.p210!=1)||(((i3.i1.u10.p22==1)&&(i3.i2.u50.p124==1))&&(i15.u80.p273==1)))" | !F"(i6.i0.u45.p112==1)")
built 43 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 37 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t137, t157, t163, t169, t179, i0.i1.u35.t140, i0.i1.u37.t136, i0.i2.t115, i0.i2.u56.t116, i1.t141, i1.u31.t148, i1.u33.t144, i2.u27.t156, i2.u29.t152, i3.i0.t195, i3.i0.u9.t191, i3.i1.t187, i3.i1.u8.t193, i3.i1.u10.t190, i3.i2.t127, i3.i2.u50.t128, i4.t186, i4.t184, i4.u14.t182, i4.u15.t180, i5.t172, i5.u18.t174, i6.i1.t103, i6.i1.u62.t104, i6.i2.t99, i6.i2.u65.t100, i6.i3.t95, i6.i3.u67.t96, i7.i1.t130, i7.i1.u49.t131, i7.i2.t123, i7.i2.u53.t124, i7.i3.t119, i7.i3.u54.t120, i8.i0.u16.t178, i8.i1.t111, i8.i1.u58.t112, i9.i0.t160, i9.i0.u24.t162, i9.i1.t107, i9.i1.u60.t108, i10.t168, i10.u22.t166, i11.t91, i11.u68.t92, i12.i0.t87, i12.i0.u70.t88, i12.i1.t83, i12.i1.u72.t84, i12.i2.t79, i12.i2.u75.t80, i13.t75, i13.u76.t76, i14.t71, i14.u78.t72, i15.t55, i15.t51, i15.t47, i15.t40, i15.t36, i15.t33, i15.t31, i15.t28, i15.t26, i15.t23, i15.t21, i15.t18, i15.t15, i15.t12, i15.t9, i15.t6, i15.t3, i15.u80.t1, i16.t49, i16.u83.t53, i17.t42, i17.t38, i17.u88.t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/153/83/236
Computing Next relation with stutter on 18 deadlock states
48 unique states visited
48 strongly connected components in search stack
49 transitions explored
48 items max in DFS search stack
168 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.80711,90944,1,0,160633,537,3702,251402,246,992,410694
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F(G((F("(i5.u96.p238==1)"))||("(((i1.u31.p76==1)&&(i12.i2.u75.p184==1))&&(i15.u80.p273==1))")))))&&(X("(((i1.u31.p76==1)&&(i12.i2.u75.p184==1))&&(i15.u80.p273==1))"))))
Formula 1 simplified : !(!FG("(((i1.u31.p76==1)&&(i12.i2.u75.p184==1))&&(i15.u80.p273==1))" | F"(i5.u96.p238==1)") & X"(((i1.u31.p76==1)&&(i12.i2.u75.p184==1))&&(i15.u80.p273==1))")
Computing Next relation with stutter on 18 deadlock states
[2020-05-12 02:23:57] [INFO ] Proved 273 variables to be positive in 2089 ms
[2020-05-12 02:23:57] [INFO ] Computing symmetric may disable matrix : 236 transitions.
[2020-05-12 02:23:57] [INFO ] Computation of disable matrix completed :0/236 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:23:57] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:23:57] [INFO ] Computing symmetric may enable matrix : 236 transitions.
[2020-05-12 02:23:58] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:24:00] [INFO ] Computing symmetric co enabling matrix : 236 transitions.
[2020-05-12 02:24:01] [INFO ] Computation of co-enabling matrix(0/236) took 668 ms. Total solver calls (SAT/UNSAT): 213(0/213)
[2020-05-12 02:24:04] [INFO ] Computation of co-enabling matrix(12/236) took 4174 ms. Total solver calls (SAT/UNSAT): 1563(171/1392)
[2020-05-12 02:24:07] [INFO ] Computation of co-enabling matrix(46/236) took 7262 ms. Total solver calls (SAT/UNSAT): 4484(532/3952)
[2020-05-12 02:24:10] [INFO ] Computation of co-enabling matrix(93/236) took 10275 ms. Total solver calls (SAT/UNSAT): 6471(831/5640)
[2020-05-12 02:24:13] [INFO ] Computation of co-enabling matrix(173/236) took 13292 ms. Total solver calls (SAT/UNSAT): 7538(973/6565)
[2020-05-12 02:24:16] [INFO ] Computation of Finished co-enabling matrix. took 16108 ms. Total solver calls (SAT/UNSAT): 8391(1245/7146)
[2020-05-12 02:24:16] [INFO ] Computing Do-Not-Accords matrix : 236 transitions.
[2020-05-12 02:24:16] [INFO ] Computation of Completed DNA matrix. took 72 ms. Total solver calls (SAT/UNSAT): 45(0/45)
[2020-05-12 02:24:16] [INFO ] Built C files in 21087ms 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]
Compilation finished in 2448 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( <>([](( <>((LTLAP2==true))) || ( (LTLAP3==true)) ))) ) && ( X((LTLAP3==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( <>([](( <>((LTLAP2==true))) || ( (LTLAP3==true)) ))) ) && ( X((LTLAP3==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( <>([](( <>((LTLAP2==true))) || ( (LTLAP3==true)) ))) ) && ( X((LTLAP3==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
11335 unique states visited
4 strongly connected components in search stack
13109 transitions explored
65 items max in DFS search stack
11521 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,117.014,2246732,1,0,4.05566e+06,554,1934,6.1255e+06,142,1142,171643
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(((!(("(i6.i1.u63.p156==1)")U(X("(i6.i1.u63.p156==1)"))))||(!(X("(i6.i1.u63.p156==1)"))))U(G((X("(i12.i2.u75.p183==1)"))||("(i6.i1.u63.p156==1)"))))))
Formula 2 simplified : (!("(i6.i1.u63.p156==1)" U X"(i6.i1.u63.p156==1)") | !X"(i6.i1.u63.p156==1)") U G("(i6.i1.u63.p156==1)" | X"(i12.i2.u75.p183==1)")
Computing Next relation with stutter on 18 deadlock states
115 unique states visited
115 strongly connected components in search stack
116 transitions explored
115 items max in DFS search stack
216 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,119.234,2246916,1,0,4.05566e+06,554,2289,6.1255e+06,152,1142,450940
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((!((F("(((i5.u20.p48==1)&&(i6.i3.u67.p165==1))&&(i5.u96.p237==1))"))U("((i12.i0.u70.p173==1)&&(i2.u28.p68==1))")))||(!(F(X(!(F("(((i5.u20.p48!=1)||(i6.i3.u67.p165!=1))||(i5.u96.p237!=1))")))))))))
Formula 3 simplified : !F(!(F"(((i5.u20.p48==1)&&(i6.i3.u67.p165==1))&&(i5.u96.p237==1))" U "((i12.i0.u70.p173==1)&&(i2.u28.p68==1))") | !FX!F"(((i5.u20.p48!=1)||(i6.i3.u67.p165!=1))||(i5.u96.p237!=1))")
Computing Next relation with stutter on 18 deadlock states
1268 unique states visited
0 strongly connected components in search stack
2508 transitions explored
65 items max in DFS search stack
482 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,124.058,2247312,1,0,4.05566e+06,554,2485,6.1255e+06,154,1142,1128706
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-03-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((F(G("(i3.i0.u9.p21==1)")))U((!(G(F("(i3.i0.u9.p21==1)"))))&&(!(X("((i17.u88.p221==1)||(i7.i1.u49.p118==1))")))))))
Formula 4 simplified : !G(FG"(i3.i0.u9.p21==1)" U (!GF"(i3.i0.u9.p21==1)" & !X"((i17.u88.p221==1)||(i7.i1.u49.p118==1))"))
Computing Next relation with stutter on 18 deadlock states
68 unique states visited
68 strongly connected components in search stack
69 transitions explored
68 items max in DFS search stack
101 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,125.068,2247708,1,0,4.05566e+06,564,2559,6.1255e+06,154,1155,1259082
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(F(X(F((!(X(X("(i7.i0.u47.p115==1)"))))||("(i15.u97.p240!=1)"))))))))
Formula 5 simplified : GFXF("(i15.u97.p240!=1)" | !XX"(i7.i0.u47.p115==1)")
Computing Next relation with stutter on 18 deadlock states
66 unique states visited
65 strongly connected components in search stack
67 transitions explored
66 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,125.084,2247840,1,0,4.05566e+06,564,2591,6.1255e+06,154,1155,1261395
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((!(X((X(("(i12.i3.u42.p106==1)")U("(i3.i1.u10.p23==1)")))&&(F("(i12.i3.u42.p106==1)")))))&&(!(F("(i3.i1.u10.p23==1)"))))&&(!(G("(i12.i3.u42.p106==1)")))))
Formula 6 simplified : !(!X(X("(i12.i3.u42.p106==1)" U "(i3.i1.u10.p23==1)") & F"(i12.i3.u42.p106==1)") & !F"(i3.i1.u10.p23==1)" & !G"(i12.i3.u42.p106==1)")
Computing Next relation with stutter on 18 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,125.498,2247840,1,0,4.05566e+06,565,2613,6.1255e+06,154,1164,1369308
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G((X("(i6.i3.u66.p162==1)"))U("(i6.i3.u66.p162==1)")))&&((("(i6.i3.u66.p162==1)")U(G("(((i2.u28.p67==1)&&(i7.i2.u53.p130==1))&&(i2.u104.p253==1))")))||(F("(i6.i3.u66.p162==1)")))))
Formula 7 simplified : !(G(X"(i6.i3.u66.p162==1)" U "(i6.i3.u66.p162==1)") & (("(i6.i3.u66.p162==1)" U G"(((i2.u28.p67==1)&&(i7.i2.u53.p130==1))&&(i2.u104.p253==1))") | F"(i6.i3.u66.p162==1)"))
Computing Next relation with stutter on 18 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,125.5,2247840,1,0,4.05566e+06,565,2627,6.1255e+06,154,1164,1369366
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X("(((i4.u15.p35!=1)||(i8.i1.u58.p145!=1))||(i17.u88.p226!=1))"))&&((F(("(((i4.u15.p35!=1)||(i8.i1.u58.p145!=1))||(i17.u88.p226!=1))")U("(((i4.u15.p35==1)&&(i8.i1.u58.p145==1))&&(i17.u88.p226==1))")))U("(i15.u109.p264==1)"))))
Formula 8 simplified : !(X"(((i4.u15.p35!=1)||(i8.i1.u58.p145!=1))||(i17.u88.p226!=1))" & (F("(((i4.u15.p35!=1)||(i8.i1.u58.p145!=1))||(i17.u88.p226!=1))" U "(((i4.u15.p35==1)&&(i8.i1.u58.p145==1))&&(i17.u88.p226==1))") U "(i15.u109.p264==1)"))
Computing Next relation with stutter on 18 deadlock states
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
11 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,125.613,2247840,1,0,4.05566e+06,601,2703,6.1255e+06,154,1317,1395680
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((F((("(i7.i2.u52.p131==1)")U("(i12.i2.u74.p182==1)"))||("(i7.i2.u52.p131==1)")))||(X("((i1.u2.p6==1)&&(i12.i2.u74.p182==1))")))))
Formula 9 simplified : !X(F("(i7.i2.u52.p131==1)" | ("(i7.i2.u52.p131==1)" U "(i12.i2.u74.p182==1)")) | X"((i1.u2.p6==1)&&(i12.i2.u74.p182==1))")
Computing Next relation with stutter on 18 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,125.621,2247840,1,0,4.05566e+06,601,2778,6.1255e+06,154,1320,1399087
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((!(F(!(F(G((G("(i10.u23.p56==1)"))&&("(i0.i1.u37.p95==1)")))))))||(!(G("(i0.i1.u37.p95==1)"))))))
Formula 10 simplified : !X(!F!FG("(i0.i1.u37.p95==1)" & G"(i10.u23.p56==1)") | !G"(i0.i1.u37.p95==1)")
Computing Next relation with stutter on 18 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,125.622,2247840,1,0,4.05566e+06,601,2791,6.1255e+06,154,1320,1399128
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-03-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((G(F("(i6.i3.u67.p163!=1)")))&&(("(i6.i3.u67.p163==1)")U("(((i0.i1.u37.p94==1)&&(i7.i1.u49.p119==1))&&(i15.u80.p273==1))")))))
Formula 11 simplified : !F(GF"(i6.i3.u67.p163!=1)" & ("(i6.i3.u67.p163==1)" U "(((i0.i1.u37.p94==1)&&(i7.i1.u49.p119==1))&&(i15.u80.p273==1))"))
Computing Next relation with stutter on 18 deadlock states
65 unique states visited
65 strongly connected components in search stack
65 transitions explored
65 items max in DFS search stack
85 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,126.474,2247840,1,0,4.05566e+06,601,2869,6.1255e+06,154,1425,1585869
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(G("(i9.i1.u61.p147==1)")))||(F("(i8.i0.u16.p39==1)"))))
Formula 12 simplified : !(XG"(i9.i1.u61.p147==1)" | F"(i8.i0.u16.p39==1)")
Computing Next relation with stutter on 18 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
22 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,126.69,2247840,1,0,4.05566e+06,601,2933,6.1255e+06,154,1425,1613455
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589250366319

--------------------
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-03"
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-03, 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-158897699100466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 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 ;