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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:42 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.1K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 47K 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-01-00
FORMULA_NAME BusinessProcesses-PT-01-01
FORMULA_NAME BusinessProcesses-PT-01-02
FORMULA_NAME BusinessProcesses-PT-01-03
FORMULA_NAME BusinessProcesses-PT-01-04
FORMULA_NAME BusinessProcesses-PT-01-05
FORMULA_NAME BusinessProcesses-PT-01-06
FORMULA_NAME BusinessProcesses-PT-01-07
FORMULA_NAME BusinessProcesses-PT-01-08
FORMULA_NAME BusinessProcesses-PT-01-09
FORMULA_NAME BusinessProcesses-PT-01-10
FORMULA_NAME BusinessProcesses-PT-01-11
FORMULA_NAME BusinessProcesses-PT-01-12
FORMULA_NAME BusinessProcesses-PT-01-13
FORMULA_NAME BusinessProcesses-PT-01-14
FORMULA_NAME BusinessProcesses-PT-01-15

=== Now, execution of the tool begins

BK_START 1589249810748

[2020-05-12 02:16: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:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:16:54] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-05-12 02:16:54] [INFO ] Transformed 200 places.
[2020-05-12 02:16:54] [INFO ] Transformed 178 transitions.
[2020-05-12 02:16:54] [INFO ] Found NUPN structural information;
[2020-05-12 02:16:54] [INFO ] Parsed PT model containing 200 places and 178 transitions in 125 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 112 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1148 resets, run finished after 276 ms. (steps per millisecond=362 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 177 rows 199 cols
[2020-05-12 02:16:55] [INFO ] Computed 30 place invariants in 13 ms
[2020-05-12 02:16:55] [INFO ] [Real]Absence check using 20 positive place invariants in 165 ms returned sat
[2020-05-12 02:16:55] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 60 ms returned sat
[2020-05-12 02:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:16:56] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2020-05-12 02:16:57] [INFO ] Deduced a trap composed of 55 places in 1748 ms
[2020-05-12 02:16:58] [INFO ] Deduced a trap composed of 8 places in 812 ms
[2020-05-12 02:16:58] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2020-05-12 02:16:59] [INFO ] Deduced a trap composed of 25 places in 569 ms
[2020-05-12 02:16:59] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2020-05-12 02:17:00] [INFO ] Deduced a trap composed of 59 places in 867 ms
[2020-05-12 02:17:00] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2020-05-12 02:17:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4466 ms
[2020-05-12 02:17:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:17:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 165 ms returned sat
[2020-05-12 02:17:00] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 50 ms returned sat
[2020-05-12 02:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:17:01] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2020-05-12 02:17:01] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-05-12 02:17:01] [INFO ] Deduced a trap composed of 53 places in 71 ms
[2020-05-12 02:17:01] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2020-05-12 02:17:01] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-05-12 02:17:02] [INFO ] Deduced a trap composed of 59 places in 538 ms
[2020-05-12 02:17:02] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-05-12 02:17:02] [INFO ] Deduced a trap composed of 56 places in 69 ms
[2020-05-12 02:17:02] [INFO ] Deduced a trap composed of 55 places in 91 ms
[2020-05-12 02:17:02] [INFO ] Deduced a trap composed of 52 places in 358 ms
[2020-05-12 02:17:04] [INFO ] Deduced a trap composed of 55 places in 1244 ms
[2020-05-12 02:17:04] [INFO ] Deduced a trap composed of 63 places in 246 ms
[2020-05-12 02:17:04] [INFO ] Deduced a trap composed of 54 places in 104 ms
[2020-05-12 02:17:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3393 ms
[2020-05-12 02:17:04] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 31 ms.
[2020-05-12 02:17:05] [INFO ] Added : 112 causal constraints over 23 iterations in 585 ms. Result :sat
[2020-05-12 02:17:05] [INFO ] Deduced a trap composed of 53 places in 51 ms
[2020-05-12 02:17:05] [INFO ] Deduced a trap composed of 51 places in 72 ms
[2020-05-12 02:17:05] [INFO ] Deduced a trap composed of 53 places in 45 ms
[2020-05-12 02:17:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 245 ms
[2020-05-12 02:17:05] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-12 02:17:05] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-05-12 02:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:17:05] [INFO ] [Real]Absence check using state equation in 85 ms returned unsat
[2020-05-12 02:17:05] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned unsat
[2020-05-12 02:17:05] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-12 02:17:05] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2020-05-12 02:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:17:05] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-05-12 02:17:05] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-05-12 02:17:05] [INFO ] Deduced a trap composed of 56 places in 53 ms
[2020-05-12 02:17:05] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-12 02:17:07] [INFO ] Deduced a trap composed of 51 places in 1844 ms
[2020-05-12 02:17:09] [INFO ] Deduced a trap composed of 17 places in 1805 ms
[2020-05-12 02:17:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3859 ms
[2020-05-12 02:17:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:17:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 48 ms returned sat
[2020-05-12 02:17:09] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 44 ms returned sat
[2020-05-12 02:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:17:09] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2020-05-12 02:17:10] [INFO ] Deduced a trap composed of 8 places in 172 ms
[2020-05-12 02:17:10] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-05-12 02:17:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2020-05-12 02:17:10] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 24 ms.
[2020-05-12 02:17:10] [INFO ] Added : 98 causal constraints over 20 iterations in 573 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-12 02:17:10] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 02:17:10] [INFO ] Flatten gal took : 78 ms
FORMULA BusinessProcesses-PT-01-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:17:11] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
[2020-05-12 02:17:11] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-12 02:17:11] [INFO ] Flatten gal took : 24 ms
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/graph13189738653868815074.txt, -o, /tmp/graph13189738653868815074.bin, -w, /tmp/graph13189738653868815074.weights], workingDir=null]
[2020-05-12 02:17:11] [INFO ] Input system was already deterministic with 177 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13189738653868815074.bin, -l, -1, -v, -w, /tmp/graph13189738653868815074.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:17:11] [INFO ] Decomposing Gal with order
[2020-05-12 02:17:11] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 177 rows 199 cols
[2020-05-12 02:17:11] [INFO ] Removed a total of 54 redundant transitions.
[2020-05-12 02:17:11] [INFO ] Computed 30 place invariants in 32 ms
inv : p0 + p1 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p1 + p2 + p78 + p79 + p80 + p81 = 1
inv : p59 + p62 + p68 - p182 - p185 - p194 = 0
inv : p1 + p2 + p3 + p4 + p57 + p58 - p59 + p60 + p61 + p63 + p64 + p69 + p70 - p71 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 - p163 - p164 - p165 - p166 - p167 - p168 - p169 - p170 - p171 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 + p182 - p183 - p184 - p186 - p187 - p191 - p192 - p193 + p194 - p198 - p199 = 0
inv : p0 + p1 + p82 + p83 + p84 + p85 + p86 + p116 + p117 + p118 + p119 + p120 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p159 + p160 = 1
inv : p0 + p1 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p96 + p97 + p98 + p99 + p100 = 1
inv : p0 + p1 + p82 + p83 + p84 + p126 + p127 + p128 + p129 + p130 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p45 + p46 + p47 + p175 + p176 = 1
inv : p1 + p2 + p3 + p4 + p57 + p58 + p60 + p61 + p62 + p63 + p64 + p72 + p73 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 - p163 - p164 - p165 - p166 - p167 - p168 - p169 - p170 - p171 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p183 - p184 - p185 - p186 - p187 - p191 - p192 - p193 - p198 - p199 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p17 + p18 + p19 + p163 + p164 = 1
inv : p0 + p1 + p82 + p83 + p131 + p132 + p133 + p134 + p135 = 1
inv : p0 + p1 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p197 + p198 + p199 = 1
inv : p20 + p21 + p22 - p163 - p164 = 0
inv : p42 + p43 + p44 - p171 - p172 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 = 1
inv : p194 + p195 + p196 - p197 - p198 - p199 = 0
inv : p0 + p1 + p82 + p83 + p84 + p85 + p86 + p87 + p111 + p112 + p113 + p114 + p115 = 1
inv : p0 + p1 + p82 + p83 + p84 + p85 + p121 + p122 + p123 + p124 + p125 = 1
inv : p15 + p16 - p159 - p160 = 0
inv : p0 + p66 + p67 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p191 + p192 + p193 + p197 + p198 + p199 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p51 + p52 + p53 + p179 + p180 = 1
inv : p0 + p1 + p2 + p3 + p74 + p75 + p76 + p77 = 1
inv : p54 + p55 + p56 - p179 - p180 = 0
inv : p59 + p65 + p71 - p182 - p188 - p197 = 0
inv : p0 + p1 + p82 + p136 + p137 + p138 + p139 + p140 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p39 + p40 + p41 + p171 + p172 = 1
inv : p48 + p49 + p50 - p175 - p176 = 0
inv : p0 + p1 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p93 + p94 + p95 = 1
Total of 30 invariants.
[2020-05-12 02:17:11] [INFO ] Computed 30 place invariants in 33 ms
[2020-05-12 02:17:11] [INFO ] Flatten gal took : 173 ms
[2020-05-12 02:17:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-12 02:17:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2020-05-12 02:17:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 15 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(X("(i4.u19.p49==1)"))))))
Formula 0 simplified : FXX"(i4.u19.p49==1)"
built 31 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 29 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 27 ordering constraints for composite.
built 18 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t106, t110, t134, i0.i1.u29.t95, i1.t140, i1.u4.t142, i2.t122, i2.i0.t120, i2.i0.t133, i2.i1.t125, i2.i1.t127, i2.i1.t129, i3.t114, i3.u7.t137, i3.u16.t117, i4.u18.t113, i5.t101, i5.t99, i5.u22.t105, i6.i1.t86, i6.i1.u39.t87, i6.i2.t82, i6.i2.u40.t83, i7.i1.t78, i7.i1.u42.t79, i7.i2.t58, i7.i2.u52.t59, i8.t74, i8.u45.t75, i9.t70, i9.u47.t71, i10.u20.t109, i11.t54, i11.u54.t55, i12.t42, i12.t37, i12.t35, i12.t33, i12.t30, i12.t27, i12.t25, i12.t23, i12.t20, i12.t17, i12.t5, i12.u56.t3, i12.u56.t14, i13.i1.t66, i13.i1.u49.t67, i13.i2.t62, i13.i2.u50.t63, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/120/53/177
Computing Next relation with stutter on 105 deadlock states
[2020-05-12 02:17:12] [INFO ] Proved 199 variables to be positive in 1348 ms
[2020-05-12 02:17:12] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2020-05-12 02:17:12] [INFO ] Computation of disable matrix completed :0/177 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:17:12] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:17:12] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2020-05-12 02:17:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
143 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.49463,64820,1,0,109604,467,3051,156547,301,1103,272112
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G((F(!(F(X(("(i2.i1.u13.p33==1)")U("(i12.u69.p174==1)"))))))U(X("(i12.u67.p169==1)"))))))
Formula 1 simplified : G(F!FX("(i2.i1.u13.p33==1)" U "(i12.u69.p174==1)") U X"(i12.u67.p169==1)")
Computing Next relation with stutter on 105 deadlock states
[2020-05-12 02:17:15] [INFO ] Computing symmetric co enabling matrix : 177 transitions.
[2020-05-12 02:17:16] [INFO ] Computation of co-enabling matrix(1/177) took 1148 ms. Total solver calls (SAT/UNSAT): 174(95/79)
[2020-05-12 02:17:19] [INFO ] Computation of co-enabling matrix(4/177) took 4608 ms. Total solver calls (SAT/UNSAT): 505(123/382)
[2020-05-12 02:17:23] [INFO ] Computation of co-enabling matrix(7/177) took 8362 ms. Total solver calls (SAT/UNSAT): 745(151/594)
234 unique states visited
0 strongly connected components in search stack
394 transitions explored
85 items max in DFS search stack
1250 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,14.0044,395892,1,0,787767,561,3109,1.05268e+06,303,1611,1349807
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-01-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(((G("(((i1.u6.p15==1)&&(i8.u45.p114==1))&&(i1.u62.p159==1))"))&&(G(X(("(((i4.u18.p45==1)&&(i13.i2.u50.p128==1))&&(i12.u56.p193==1))")U("(i5.u27.p70==1)")))))U("(i7.i0.u34.p85==1)"))))
Formula 2 simplified : !X((G"(((i1.u6.p15==1)&&(i8.u45.p114==1))&&(i1.u62.p159==1))" & GX("(((i4.u18.p45==1)&&(i13.i2.u50.p128==1))&&(i12.u56.p193==1))" U "(i5.u27.p70==1)")) U "(i7.i0.u34.p85==1)")
Computing Next relation with stutter on 105 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,14.0102,396852,1,0,787788,561,3141,1.05271e+06,304,1611,1349926
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G("(i0.i0.u0.p1==1)"))U(F(G((G("(i2.i1.u13.p32==1)"))U("(i6.i1.u39.p97==1)"))))))
Formula 3 simplified : !(G"(i0.i0.u0.p1==1)" U FG(G"(i2.i1.u13.p32==1)" U "(i6.i1.u39.p97==1)"))
Computing Next relation with stutter on 105 deadlock states
48 unique states visited
48 strongly connected components in search stack
48 transitions explored
48 items max in DFS search stack
19 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,14.2015,401416,1,0,795919,561,3195,1.06414e+06,304,1611,1370069
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(X(!(("(i11.u54.p137==1)")U(G("(i3.u68.p172==1)"))))))))
Formula 4 simplified : !G!X!("(i11.u54.p137==1)" U G"(i3.u68.p172==1)")
Computing Next relation with stutter on 105 deadlock states
95 unique states visited
95 strongly connected components in search stack
96 transitions explored
95 items max in DFS search stack
80 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.0073,417508,1,0,826541,561,3262,1.11009e+06,304,1612,1428829
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(("(i8.u44.p115!=1)")&&((!(F("(i1.u5.p14==1)")))||("(i13.i1.u49.p122==1)")))))
Formula 5 simplified : !F("(i8.u44.p115!=1)" & ("(i13.i1.u49.p122==1)" | !F"(i1.u5.p14==1)"))
Computing Next relation with stutter on 105 deadlock states
[2020-05-12 02:17:26] [INFO ] Computation of co-enabling matrix(9/177) took 11502 ms. Total solver calls (SAT/UNSAT): 910(179/731)
36 unique states visited
36 strongly connected components in search stack
36 transitions explored
36 items max in DFS search stack
321 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,18.2216,449184,1,0,896694,561,3340,1.20191e+06,304,1616,1556861
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(((X(("(i9.u17.p43!=1)")U(X("(i9.u17.p43==1)"))))&&(X("(i5.u27.p70==1)")))&&("(i5.u27.p70==1)")))))
Formula 6 simplified : X("(i5.u27.p70==1)" & X("(i9.u17.p43!=1)" U X"(i9.u17.p43==1)") & X"(i5.u27.p70==1)")
Computing Next relation with stutter on 105 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,18.2224,449448,1,0,896694,561,3345,1.20191e+06,304,1616,1556865
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-01-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(("(i5.u24.p61==1)")U((F("((i8.u45.p112==1)||(i1.u5.p13!=1))"))U(X(F("((i8.u45.p112==1)&&(i5.u24.p61==1))"))))))))
Formula 7 simplified : !FX("(i5.u24.p61==1)" U (F"((i8.u45.p112==1)||(i1.u5.p13!=1))" U XF"((i8.u45.p112==1)&&(i5.u24.p61==1))"))
Computing Next relation with stutter on 105 deadlock states
[2020-05-12 02:17:30] [INFO ] Computation of co-enabling matrix(11/177) took 15210 ms. Total solver calls (SAT/UNSAT): 1070(194/876)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
61 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,18.8298,453140,1,0,902839,561,3381,1.21222e+06,304,1616,1574255
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((("(((i9.u17.p42==1)&&(i9.u47.p119==1))&&(i3.u68.p171==1))")||((F("(i0.i0.u1.p4==1)"))&&(F("(i12.u66.p167==1)"))))U(X(X("(((i9.u17.p42==1)&&(i9.u47.p119==1))&&(i3.u68.p171==1))")))))
Formula 8 simplified : !(("(((i9.u17.p42==1)&&(i9.u47.p119==1))&&(i3.u68.p171==1))" | (F"(i0.i0.u1.p4==1)" & F"(i12.u66.p167==1)")) U XX"(((i9.u17.p42==1)&&(i9.u47.p119==1))&&(i3.u68.p171==1))")
Computing Next relation with stutter on 105 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,18.9498,454160,1,0,905504,567,3434,1.21401e+06,304,1677,1580578
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(G(F(G(X("(i0.i1.u30.p77==1)")))))))
Formula 9 simplified : !FGFGX"(i0.i1.u30.p77==1)"
Computing Next relation with stutter on 105 deadlock states
49 unique states visited
48 strongly connected components in search stack
50 transitions explored
49 items max in DFS search stack
93 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,19.8853,459436,1,0,914967,567,3446,1.22924e+06,304,1677,1601202
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((G(X("(((i2.i1.u10.p26==1)&&(i6.i2.u40.p104==1))&&(i12.u58.p149==1))")))&&(X(X(F("(i12.u56.p144==1)")))))))
Formula 10 simplified : !G(GX"(((i2.i1.u10.p26==1)&&(i6.i2.u40.p104==1))&&(i12.u58.p149==1))" & XXF"(i12.u56.p144==1)")
Computing Next relation with stutter on 105 deadlock states
51 unique states visited
51 strongly connected components in search stack
52 transitions explored
51 items max in DFS search stack
15 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,20.0532,460492,1,0,917202,567,3463,1.23265e+06,304,1678,1607924
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((F(!(("(i2.i1.u10.p35==1)")U("((((i9.u17.p42==1)&&(i9.u47.p119==1))&&(i3.u68.p171==1))&&(i2.i0.u9.p25==1))"))))U("((i2.i1.u10.p35==1)||(((i4.u19.p48==1)&&(i7.i1.u42.p109==1))&&(i4.u70.p175==1)))"))))
Formula 11 simplified : !F(F!("(i2.i1.u10.p35==1)" U "((((i9.u17.p42==1)&&(i9.u47.p119==1))&&(i3.u68.p171==1))&&(i2.i0.u9.p25==1))") U "((i2.i1.u10.p35==1)||(((i4.u19.p48==1)&&(i7.i1.u42.p109==1))&&(i4.u70.p175==1)))")
Computing Next relation with stutter on 105 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
74 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,20.7867,467884,1,0,935332,567,3514,1.24892e+06,304,1678,1641750
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-12 02:17:34] [INFO ] Computation of co-enabling matrix(12/177) took 18662 ms. Total solver calls (SAT/UNSAT): 1150(209/941)
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
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:17:36] [INFO ] Built C files in 24811ms 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 1589249856333

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

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