Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814600625.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814600625
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.5K Mar 31 06:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 06:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 23:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 23:19 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:49 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:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K 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 DiscoveryGPU-PT-08b-00
FORMULA_NAME DiscoveryGPU-PT-08b-01
FORMULA_NAME DiscoveryGPU-PT-08b-02
FORMULA_NAME DiscoveryGPU-PT-08b-03
FORMULA_NAME DiscoveryGPU-PT-08b-04
FORMULA_NAME DiscoveryGPU-PT-08b-05
FORMULA_NAME DiscoveryGPU-PT-08b-06
FORMULA_NAME DiscoveryGPU-PT-08b-07
FORMULA_NAME DiscoveryGPU-PT-08b-08
FORMULA_NAME DiscoveryGPU-PT-08b-09
FORMULA_NAME DiscoveryGPU-PT-08b-10
FORMULA_NAME DiscoveryGPU-PT-08b-11
FORMULA_NAME DiscoveryGPU-PT-08b-12
FORMULA_NAME DiscoveryGPU-PT-08b-13
FORMULA_NAME DiscoveryGPU-PT-08b-14
FORMULA_NAME DiscoveryGPU-PT-08b-15

=== Now, execution of the tool begins

BK_START 1590129723194

[2020-05-22 06:42:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-22 06:42:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:42:04] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2020-05-22 06:42:04] [INFO ] Transformed 240 places.
[2020-05-22 06:42:04] [INFO ] Transformed 254 transitions.
[2020-05-22 06:42:04] [INFO ] Found NUPN structural information;
[2020-05-22 06:42:04] [INFO ] Parsed PT model containing 240 places and 254 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 386 resets, run finished after 248 ms. (steps per millisecond=403 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 254 rows 240 cols
[2020-05-22 06:42:05] [INFO ] Computed 10 place invariants in 29 ms
[2020-05-22 06:42:05] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2020-05-22 06:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:42:05] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-05-22 06:42:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:42:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned unsat
[2020-05-22 06:42:05] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2020-05-22 06:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:42:05] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-22 06:42:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:42:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned unsat
[2020-05-22 06:42:06] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2020-05-22 06:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:42:06] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-05-22 06:42:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:42:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-22 06:42:06] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-22 06:42:06] [INFO ] Flatten gal took : 72 ms
FORMULA DiscoveryGPU-PT-08b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:42:06] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:42:06] [INFO ] Applying decomposition
[2020-05-22 06:42:06] [INFO ] Flatten gal took : 18 ms
[2020-05-22 06:42:06] [INFO ] Input system was already deterministic with 254 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/graph3410736752330501596.txt, -o, /tmp/graph3410736752330501596.bin, -w, /tmp/graph3410736752330501596.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/graph3410736752330501596.bin, -l, -1, -v, -w, /tmp/graph3410736752330501596.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:42:06] [INFO ] Decomposing Gal with order
[2020-05-22 06:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 254 rows 240 cols
[2020-05-22 06:42:06] [INFO ] Computed 10 place invariants in 4 ms
inv : p0 + p1 + p2 + p3 + 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 = 1
inv : p0 + p1 + p2 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 = 1
inv : p0 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 = 1
inv : p0 + p1 + 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 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 = 1
inv : p0 + p1 + p2 + p3 + p4 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 = 1
inv : p0 + p224 + p234 + p235 + p236 + p237 + p238 + p239 = 1
Total of 10 invariants.
[2020-05-22 06:42:06] [INFO ] Computed 10 place invariants in 7 ms
[2020-05-22 06:42:06] [INFO ] Removed a total of 67 redundant transitions.
[2020-05-22 06:42:06] [INFO ] Flatten gal took : 80 ms
[2020-05-22 06:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2020-05-22 06:42:06] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 18 ms
[2020-05-22 06:42:06] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 7 LTL properties
Checking formula 0 : !((G("((i2.i0.u7.p10==0)||(i19.u60.p164==1))")))
Formula 0 simplified : !G"((i2.i0.u7.p10==0)||(i19.u60.p164==1))"
built 67 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-22 06:42:07] [INFO ] Proved 240 variables to be positive in 305 ms
[2020-05-22 06:42:07] [INFO ] Computing symmetric may disable matrix : 254 transitions.
[2020-05-22 06:42:07] [INFO ] Computation of disable matrix completed :0/254 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:42:07] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:42:07] [INFO ] Computing symmetric may enable matrix : 254 transitions.
[2020-05-22 06:42:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:42:07] [INFO ] Computing symmetric co enabling matrix : 254 transitions.
[2020-05-22 06:42:10] [INFO ] Computation of co-enabling matrix(95/254) took 2478 ms. Total solver calls (SAT/UNSAT): 3280(17/3263)
[2020-05-22 06:42:13] [INFO ] Computation of co-enabling matrix(212/254) took 5498 ms. Total solver calls (SAT/UNSAT): 6066(1022/5044)
[2020-05-22 06:42:13] [INFO ] Computation of Finished co-enabling matrix. took 6345 ms. Total solver calls (SAT/UNSAT): 6424(1292/5132)
[2020-05-22 06:42:13] [INFO ] Computing Do-Not-Accords matrix : 254 transitions.
[2020-05-22 06:42:14] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:42:14] [INFO ] Built C files in 7440ms 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 2648 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((LTLAP0==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, -p, --pins-guards, --when, --ltl, []((LTLAP0==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, -p, --pins-guards, --when, --ltl, []((LTLAP0==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)
Reverse transition relation is NOT exact ! Due to transitions t9, u84.t11, u84.t12, u84.t14, i1.u4.t159, i1.u4.t161, i2.i0.u7.t155, i2.i0.u7.t163, i3.u11.t149, i3.u11.t165, i5.i0.u13.t137, i5.i0.u13.t145, i6.u15.t141, i6.u15.t143, i7.u21.t131, i7.u21.t147, i8.u24.t112, i8.u24.t128, i9.u26.t122, i9.u26.t124, i10.i0.u29.t118, i10.i0.u29.t126, i11.i0.u34.t99, i11.i0.u34.t107, i12.u36.t103, i12.u36.t105, i13.u42.t93, i13.u42.t109, i14.u46.t84, i14.u46.t86, i15.i0.u44.t80, i15.i0.u44.t88, i16.u43.t74, i16.u43.t90, i17.i0.u53.t61, i17.i0.u53.t69, i18.u55.t65, i18.u55.t67, i19.u61.t55, i19.u61.t71, i20.u63.t36, i20.u63.t52, i21.u66.t46, i21.u66.t48, i22.i0.u64.t42, i22.i0.u64.t50, i23.u75.t27, i23.u75.t29, i24.i0.u73.t23, i24.i0.u73.t31, i25.u81.t17, i25.u81.t33, i27.t3, i27.u87.t4, i27.u87.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/199/55/254
Computing Next relation with stutter on 256 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5181 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,51.8386,1446868,1,0,2.91058e+06,430,2737,4.46052e+06,228,2209,8378133
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(F((X(F(G("((i5.i1.u18.p50!=0)&&(i16.u43.p139!=1))"))))&&("(i19.u61.p166==1)"))))))
Formula 1 simplified : !XGF("(i19.u61.p166==1)" & XFG"((i5.i1.u18.p50!=0)&&(i16.u43.p139!=1))")
Computing Next relation with stutter on 256 deadlock states
95 unique states visited
95 strongly connected components in search stack
96 transitions explored
95 items max in DFS search stack
1695 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,68.7826,1921608,1,0,3.83425e+06,483,2888,6.02304e+06,230,2753,10648283
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((F(G("((i10.i0.u29.p75==0)||(i20.u63.p193==1))")))&&("((i10.i0.u29.p75==0)||(i20.u63.p193==1))"))))
Formula 2 simplified : !F("((i10.i0.u29.p75==0)||(i20.u63.p193==1))" & FG"((i10.i0.u29.p75==0)||(i20.u63.p193==1))")
Computing Next relation with stutter on 256 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
23549 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,304.281,2700780,1,0,5.04036e+06,484,915,9.89655e+06,112,2764,7324008
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((("(((i0.u0.p2==0)||(i0.u0.p2==1))&&((i5.i1.u18.p50==0)||(i22.i1.u70.p188==1)))")U("((i5.i1.u18.p50==0)||(i22.i1.u70.p188==1))"))&&("((i5.i1.u18.p50==0)||(i22.i1.u70.p188==1))"))))
Formula 3 simplified : !G("((i5.i1.u18.p50==0)||(i22.i1.u70.p188==1))" & ("(((i0.u0.p2==0)||(i0.u0.p2==1))&&((i5.i1.u18.p50==0)||(i22.i1.u70.p188==1)))" U "((i5.i1.u18.p50==0)||(i22.i1.u70.p188==1))"))
Computing Next relation with stutter on 256 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10548 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,409.755,3258388,1,0,6.1857e+06,484,1378,1.14178e+07,137,3206,2356574
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(!(G(F(G(F(G((F("((i22.i0.u64.p184==0)||(i21.u67.p178==1))"))U(X(F(X("((i3.u11.p9==0)||(i27.u87.p237==1))"))))))))))))))
Formula 4 simplified : !XX!GFGFG(F"((i22.i0.u64.p184==0)||(i21.u67.p178==1))" U XFX"((i3.u11.p9==0)||(i27.u87.p237==1))")
Computing Next relation with stutter on 256 deadlock states
183 unique states visited
181 strongly connected components in search stack
187 transitions explored
183 items max in DFS search stack
2947 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,439.23,3259852,1,0,6.1857e+06,484,1733,1.14178e+07,147,3206,5381810
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((G("((i16.u43.p117==0)||(i1.u3.p12==1))"))||(G(X(F("((i10.i0.u29.p75==0)||(i2.i0.u7.p10==1))")))))))
Formula 5 simplified : !G(G"((i16.u43.p117==0)||(i1.u3.p12==1))" | GXF"((i10.i0.u29.p75==0)||(i2.i0.u7.p10==1))")
Computing Next relation with stutter on 256 deadlock states
65 unique states visited
65 strongly connected components in search stack
66 transitions explored
65 items max in DFS search stack
2588 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,465.115,3259852,1,0,6.1857e+06,489,1942,1.14178e+07,148,3206,9714673
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((F(X("(i25.u81.p198!=1)")))&&(!(X("((i7.u20.p56==0)||(i21.u66.p177==1))"))))&&("((i21.u67.p178==0)||(i19.u61.p166==1))"))))
Formula 6 simplified : !X("((i21.u67.p178==0)||(i19.u61.p166==1))" & FX"(i25.u81.p198!=1)" & !X"((i7.u20.p56==0)||(i21.u66.p177==1))")
Computing Next relation with stutter on 256 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,465.141,3259852,1,0,6.1857e+06,489,1966,1.14178e+07,151,3206,9716198
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590130209018

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DiscoveryGPU-PT-08b"
export BK_EXAMINATION="LTLCardinality"
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 DiscoveryGPU-PT-08b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814600625"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08b.tgz
mv DiscoveryGPU-PT-08b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;