Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r141-smll-158961510800250.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Raft-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510800250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 2.8K Apr 12 08:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 12 08:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 11 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 21:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 21:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 89K Mar 24 05:38 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 Raft-PT-06-00
FORMULA_NAME Raft-PT-06-01
FORMULA_NAME Raft-PT-06-02
FORMULA_NAME Raft-PT-06-03
FORMULA_NAME Raft-PT-06-04
FORMULA_NAME Raft-PT-06-05
FORMULA_NAME Raft-PT-06-06
FORMULA_NAME Raft-PT-06-07
FORMULA_NAME Raft-PT-06-08
FORMULA_NAME Raft-PT-06-09
FORMULA_NAME Raft-PT-06-10
FORMULA_NAME Raft-PT-06-11
FORMULA_NAME Raft-PT-06-12
FORMULA_NAME Raft-PT-06-13
FORMULA_NAME Raft-PT-06-14
FORMULA_NAME Raft-PT-06-15

=== Now, execution of the tool begins

BK_START 1590054152118

[2020-05-21 09:42:34] [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-21 09:42:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:42:35] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2020-05-21 09:42:35] [INFO ] Transformed 188 places.
[2020-05-21 09:42:35] [INFO ] Transformed 332 transitions.
[2020-05-21 09:42:35] [INFO ] Found NUPN structural information;
[2020-05-21 09:42:35] [INFO ] Parsed PT model containing 188 places and 332 transitions in 220 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 735 ms. (steps per millisecond=136 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 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, 1]
[2020-05-21 09:42:36] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 188 cols
[2020-05-21 09:42:36] [INFO ] Computed 36 place invariants in 21 ms
[2020-05-21 09:42:36] [INFO ] [Real]Absence check using 36 positive place invariants in 62 ms returned sat
[2020-05-21 09:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:36] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-05-21 09:42:36] [INFO ] State equation strengthened by 154 read => feed constraints.
[2020-05-21 09:42:36] [INFO ] [Real]Added 154 Read/Feed constraints in 40 ms returned sat
[2020-05-21 09:42:36] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 66 ms.
[2020-05-21 09:42:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:42:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-05-21 09:42:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:37] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-05-21 09:42:37] [INFO ] [Nat]Added 154 Read/Feed constraints in 33 ms returned sat
[2020-05-21 09:42:37] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 46 ms.
[2020-05-21 09:42:40] [INFO ] Added : 260 causal constraints over 52 iterations in 2944 ms. Result :sat
[2020-05-21 09:42:40] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-05-21 09:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:40] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2020-05-21 09:42:40] [INFO ] [Real]Added 154 Read/Feed constraints in 27 ms returned sat
[2020-05-21 09:42:40] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 51 ms.
[2020-05-21 09:42:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:42:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-05-21 09:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:41] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-05-21 09:42:41] [INFO ] [Nat]Added 154 Read/Feed constraints in 40 ms returned sat
[2020-05-21 09:42:41] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 41 ms.
[2020-05-21 09:42:44] [INFO ] Added : 270 causal constraints over 54 iterations in 3094 ms. Result :sat
[2020-05-21 09:42:44] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-05-21 09:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:45] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-05-21 09:42:45] [INFO ] [Real]Added 154 Read/Feed constraints in 33 ms returned sat
[2020-05-21 09:42:45] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 31 ms.
[2020-05-21 09:42:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:42:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-05-21 09:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:45] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2020-05-21 09:42:45] [INFO ] [Nat]Added 154 Read/Feed constraints in 28 ms returned sat
[2020-05-21 09:42:45] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 35 ms.
[2020-05-21 09:42:48] [INFO ] Added : 257 causal constraints over 52 iterations in 2998 ms. Result :sat
[2020-05-21 09:42:48] [INFO ] [Real]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-05-21 09:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:48] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2020-05-21 09:42:48] [INFO ] [Real]Added 154 Read/Feed constraints in 28 ms returned sat
[2020-05-21 09:42:48] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 32 ms.
[2020-05-21 09:42:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:42:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 23 ms returned sat
[2020-05-21 09:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:49] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2020-05-21 09:42:49] [INFO ] [Nat]Added 154 Read/Feed constraints in 30 ms returned sat
[2020-05-21 09:42:49] [INFO ] Computed and/alt/rep : 305/2239/279 causal constraints in 31 ms.
[2020-05-21 09:42:52] [INFO ] Added : 263 causal constraints over 53 iterations in 2904 ms. Result :sat
[2020-05-21 09:42:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-21 09:42:52] [INFO ] Flatten gal took : 133 ms
FORMULA Raft-PT-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-06-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:42:52] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 09:42:52] [INFO ] Applying decomposition
[2020-05-21 09:42:53] [INFO ] Flatten gal took : 44 ms
[2020-05-21 09:42:53] [INFO ] Input system was already deterministic with 306 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/graph15368142645766793663.txt, -o, /tmp/graph15368142645766793663.bin, -w, /tmp/graph15368142645766793663.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/graph15368142645766793663.bin, -l, -1, -v, -w, /tmp/graph15368142645766793663.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 09:42:53] [INFO ] Decomposing Gal with order
[2020-05-21 09:42:53] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 280 out of 306 initially.
// Phase 1: matrix 280 rows 188 cols
[2020-05-21 09:42:53] [INFO ] Computed 36 place invariants in 9 ms
inv : p0 + p56 + p57 + p58 + p59 + p60 = 1
inv : p0 + p121 + p122 + p123 + p124 + p125 = 1
inv : p0 + p146 + p147 + p148 + p149 + p150 = 1
inv : p0 + p81 + p82 + p83 + p84 + p85 = 1
inv : p0 + p171 + p172 + p173 + p174 + p175 = 1
inv : p0 + p31 + p32 + p33 + p34 + p35 = 1
inv : p0 + p161 + p162 + p163 + p164 + p165 = 1
inv : p0 + p96 + p97 + p98 + p99 + p100 = 1
inv : p0 + p21 + p22 + p23 + p24 + p25 = 1
inv : p0 + p131 + p132 + p133 + p134 + p135 = 1
inv : p0 + p151 + p152 + p153 + p154 + p155 = 1
inv : p0 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p111 + p112 + p113 + p114 + p115 = 1
inv : p0 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p136 + p137 + p138 + p139 + p140 = 1
inv : p0 + p126 + p127 + p128 + p129 + p130 = 1
inv : p0 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p76 + p77 + p78 + p79 + p80 = 1
inv : p0 + p141 + p142 + p143 + p144 + p145 = 1
inv : p0 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p51 + p52 + p53 + p54 + p55 = 1
inv : p0 + p116 + p117 + p118 + p119 + p120 = 1
inv : p0 + p26 + p27 + p28 + p29 + p30 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 = 1
inv : p0 + p91 + p92 + p93 + p94 + p95 = 1
inv : p0 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p156 + p157 + p158 + p159 + p160 = 1
inv : p0 + p166 + p167 + p168 + p169 + p170 = 1
inv : p0 + p86 + p87 + p88 + p89 + p90 = 1
inv : p0 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p46 + p47 + p48 + p49 + p50 = 1
inv : p0 + p176 + p177 + p178 + p179 + p180 = 1
inv : p0 + p71 + p72 + p73 + p74 + p75 = 1
inv : p0 + p61 + p62 + p63 + p64 + p65 = 1
inv : p0 + p66 + p67 + p68 + p69 + p70 = 1
Total of 36 invariants.
[2020-05-21 09:42:53] [INFO ] Computed 36 place invariants in 32 ms
[2020-05-21 09:42:53] [INFO ] Removed a total of 218 redundant transitions.
[2020-05-21 09:42:53] [INFO ] Flatten gal took : 178 ms
[2020-05-21 09:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 23 ms.
[2020-05-21 09:42:53] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-21 09:42:53] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 14 LTL properties
Checking formula 0 : !((X(X((X(F("((i2.u24.p163==1)&&(i7.u30.p187==1))")))&&(!(F("((i1.u6.p45==1)&&(i1.u23.p160==1))")))))))
Formula 0 simplified : !XX(XF"((i2.u24.p163==1)&&(i7.u30.p187==1))" & !F"((i1.u6.p45==1)&&(i1.u23.p160==1))")
built 29 ordering constraints for composite.
built 25 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 25 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-21 09:42:54] [INFO ] Proved 188 variables to be positive in 702 ms
[2020-05-21 09:42:54] [INFO ] Computing symmetric may disable matrix : 306 transitions.
[2020-05-21 09:42:54] [INFO ] Computation of disable matrix completed :0/306 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:42:54] [INFO ] Computation of Complete disable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:42:54] [INFO ] Computing symmetric may enable matrix : 306 transitions.
[2020-05-21 09:42:54] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions i0.u22.t36, i0.u22.t37, i0.u22.t38, i0.u22.t40, i1.u23.t30, i1.u23.t31, i1.u23.t32, i1.u23.t34, i2.u24.t24, i2.u24.t25, i2.u24.t26, i2.u24.t28, i3.u25.t18, i3.u25.t19, i3.u25.t20, i3.u25.t22, i4.u26.t12, i4.u26.t13, i4.u26.t14, i4.u26.t16, i5.u27.t6, i5.u27.t7, i5.u27.t8, i5.u27.t10, i7.t331, i7.u30.t329, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/176/26/202
[2020-05-21 09:42:58] [INFO ] Computing symmetric co enabling matrix : 306 transitions.
[2020-05-21 09:42:59] [INFO ] Computation of co-enabling matrix(0/306) took 193 ms. Total solver calls (SAT/UNSAT): 300(0/300)
[2020-05-21 09:43:02] [INFO ] Computation of co-enabling matrix(67/306) took 3212 ms. Total solver calls (SAT/UNSAT): 3268(1019/2249)
[2020-05-21 09:43:05] [INFO ] Computation of co-enabling matrix(150/306) took 6244 ms. Total solver calls (SAT/UNSAT): 5219(2633/2586)
[2020-05-21 09:43:08] [INFO ] Computation of co-enabling matrix(237/306) took 9267 ms. Total solver calls (SAT/UNSAT): 7123(4329/2794)
[2020-05-21 09:43:10] [INFO ] Computation of Finished co-enabling matrix. took 11288 ms. Total solver calls (SAT/UNSAT): 8224(5350/2874)
[2020-05-21 09:43:10] [INFO ] Computing Do-Not-Accords matrix : 306 transitions.
[2020-05-21 09:43:12] [INFO ] Computation of Completed DNA matrix. took 2573 ms. Total solver calls (SAT/UNSAT): 84(0/84)
[2020-05-21 09:43:12] [INFO ] Built C files in 19841ms 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 4936 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 53 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(X(( X(<>((LTLAP0==true))) ) && ( !( <>((LTLAP1==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, X(X(( X(<>((LTLAP0==true))) ) && ( !( <>((LTLAP1==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, X(X(( X(<>((LTLAP0==true))) ) && ( !( <>((LTLAP1==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)
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
5006 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,50.0956,766692,1,0,872322,7700,2383,3.4672e+06,897,111488,357613
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-06-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("(i0.u22.p154==1)"))U((X("((i3.u25.p14!=1)||(i3.u25.p170!=1))"))&&((X("((i5.u27.p125==1)&&(i4.u26.p175==1))"))||("(((i3.u25.p14==1)&&(i3.u25.p170==1))&&(i7.u30.p186==1))")))))
Formula 1 simplified : !(G"(i0.u22.p154==1)" U (X"((i3.u25.p14!=1)||(i3.u25.p170!=1))" & ("(((i3.u25.p14==1)&&(i3.u25.p170==1))&&(i7.u30.p186==1))" | X"((i5.u27.p125==1)&&(i4.u26.p175==1))")))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,50.1023,768688,1,0,872322,7700,2443,3.4672e+06,906,111489,357665
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Raft-PT-06-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(!(G(!(G((("(i2.u24.p162==1)")U(!(F("(((i1.u12.p85==1)&&(i3.u25.p170==1))||((i4.u16.p110==1)&&(i4.u26.p175==1)))"))))U("((i5.u27.p50==1)&&(i1.u23.p160==1))")))))))))
Formula 2 simplified : !XX!G!G(("(i2.u24.p162==1)" U !F"(((i1.u12.p85==1)&&(i3.u25.p170==1))||((i4.u16.p110==1)&&(i4.u26.p175==1)))") U "((i5.u27.p50==1)&&(i1.u23.p160==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2378 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,73.8934,1113176,1,0,1.2773e+06,12389,2545,4.67246e+06,909,182624,494847
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-06-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(((((!(F("((i0.u22.p151==1)&&(i7.u30.p187==1))")))U("((i4.u17.p118!=1)||(i3.u25.p170!=1))"))&&(F("((i0.u22.p151==1)&&(i7.u30.p187==1))")))&&("(i1.u6.p45==1)"))&&("(i1.u23.p160==1)")))))
Formula 3 simplified : !GX("(i1.u6.p45==1)" & "(i1.u23.p160==1)" & F"((i0.u22.p151==1)&&(i7.u30.p187==1))" & (!F"((i0.u22.p151==1)&&(i7.u30.p187==1))" U "((i4.u17.p118!=1)||(i3.u25.p170!=1))"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
8 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,73.9823,1115812,1,0,1.28282e+06,12410,2634,4.68398e+06,912,182998,504287
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-06-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("((i4.u16.p106==1)&&(i1.u23.p160==1))")U(G((G((F("((i2.u24.p140==1)&&(i5.u27.p180==1))"))&&(F(G("((i3.u11.p76==1)&&(i0.u22.p155==1))")))))&&(X("(((i2.u24.p140==1)&&(i5.u27.p180==1))||((i4.u16.p106==1)&&(i1.u23.p160==1)))"))))))
Formula 4 simplified : !("((i4.u16.p106==1)&&(i1.u23.p160==1))" U G(G(F"((i2.u24.p140==1)&&(i5.u27.p180==1))" & FG"((i3.u11.p76==1)&&(i0.u22.p155==1))") & X"(((i2.u24.p140==1)&&(i5.u27.p180==1))||((i4.u16.p106==1)&&(i1.u23.p160==1)))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
5 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,74.0305,1117396,1,0,1.28608e+06,12439,2761,4.69156e+06,914,183559,506285
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-06-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(((X("((i2.u24.p137==1)&&(i2.u24.p165==1))"))||(F(G(((X("((i3.u5.p40==1)&&(i1.u23.p160==1))"))&&("(i3.u5.p40==1)"))&&("(i1.u23.p160==1)")))))||("((i4.u26.p95==1)&&(i3.u25.p170==1))")))))
Formula 5 simplified : !XF("((i4.u26.p95==1)&&(i3.u25.p170==1))" | X"((i2.u24.p137==1)&&(i2.u24.p165==1))" | FG("(i1.u23.p160==1)" & "(i3.u5.p40==1)" & X"((i3.u5.p40==1)&&(i1.u23.p160==1))"))
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,74.033,1117660,1,0,1.28608e+06,12439,2777,4.69156e+06,914,183559,506301
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Raft-PT-06-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(!(("((i2.u24.p115==1)&&(i4.u26.p175==1))")U((F(G("((i0.u22.p151==1)&&(i7.u30.p187==1))")))U("((i1.u7.p60==1)&&(i2.u24.p165==1))"))))))
Formula 6 simplified : !G!("((i2.u24.p115==1)&&(i4.u26.p175==1))" U (FG"((i0.u22.p151==1)&&(i7.u30.p187==1))" U "((i1.u7.p60==1)&&(i2.u24.p165==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,74.0391,1117660,1,0,1.28619e+06,12439,2812,4.6922e+06,914,183561,506564
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-06-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X(G(!(F("((i3.u25.p12==1)&&(i3.u25.p170==1))")))))))
Formula 7 simplified : XG!F"((i3.u25.p12==1)&&(i3.u25.p170==1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
83 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,74.8748,1135876,1,0,1.31055e+06,13714,2862,4.83026e+06,918,198911,527146
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-06-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((i3.u20.p145==1)&&(i5.u27.p180==1))")))
Formula 8 simplified : !F"((i3.u20.p145==1)&&(i5.u27.p180==1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,74.8775,1136140,1,0,1.31055e+06,13714,2903,4.83026e+06,918,198911,527190
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Raft-PT-06-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(F((F(X("(i5.u27.p179==1)")))&&(("((i3.u20.p142==1)&&(i3.u25.p170==1))")U("((i1.u23.p158==1)&&(i7.u30.p187==1))")))))))
Formula 9 simplified : XF(FX"(i5.u27.p179==1)" & ("((i3.u20.p142==1)&&(i3.u25.p170==1))" U "((i1.u23.p158==1)&&(i7.u30.p187==1))"))
18 unique states visited
6 strongly connected components in search stack
31 transitions explored
18 items max in DFS search stack
378 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,78.6541,1216396,1,0,1.44998e+06,14613,3033,5.22623e+06,921,210981,647452
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-06-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(((X("((i2.u13.p90==1)&&(i3.u25.p170==1))"))&&("(i3.u25.p168==1)"))U(!(G(F("((i4.u9.p69==1)&&(i4.u26.p175==1))")))))))
Formula 10 simplified : !X(("(i3.u25.p168==1)" & X"((i2.u13.p90==1)&&(i3.u25.p170==1))") U !GF"((i4.u9.p69==1)&&(i4.u26.p175==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
46 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,79.1165,1228804,1,0,1.47405e+06,14716,3083,5.29078e+06,921,212704,666994
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-06-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G(X(F("(i1.u23.p160!=1)"))))||(((F("((i0.u0.p10==1)&&(i0.u22.p155==1))"))U("((i0.u0.p10!=1)||(i0.u22.p155!=1))"))&&(F("((i0.u0.p10==1)&&(i0.u22.p155==1))")))))
Formula 11 simplified : !(GXF"(i1.u23.p160!=1)" | (F"((i0.u0.p10==1)&&(i0.u22.p155==1))" & (F"((i0.u0.p10==1)&&(i0.u22.p155==1))" U "((i0.u0.p10!=1)||(i0.u22.p155!=1))")))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,79.1204,1229332,1,0,1.47405e+06,14716,3139,5.29078e+06,921,212704,667061
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Raft-PT-06-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(G((!(F("(i5.u27.p177==1)")))&&("((i3.u5.p40!=1)||(i1.u23.p160!=1))"))))U(X("((i5.u27.p177==1)||(i1.u23.p160==1))"))))
Formula 12 simplified : !(XG("((i3.u5.p40!=1)||(i1.u23.p160!=1))" & !F"(i5.u27.p177==1)") U X"((i5.u27.p177==1)||(i1.u23.p160==1))")
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,79.1225,1229332,1,0,1.47405e+06,14716,3162,5.29078e+06,921,212704,667076
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Raft-PT-06-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((("((i0.u22.p55==1)&&(i2.u24.p165==1))")U(F("((i5.u19.p133==1)&&(i1.u23.p160==1))")))&&((("((i3.u5.p40==1)&&(i1.u23.p160==1))")U("((i5.u19.p133==1)&&(i1.u23.p160==1))"))||(X(X("(((i3.u5.p40==1)&&(i1.u23.p160==1))&&((i5.u2.p21!=1)||(i5.u27.p180!=1)))"))))))
Formula 13 simplified : !(("((i0.u22.p55==1)&&(i2.u24.p165==1))" U F"((i5.u19.p133==1)&&(i1.u23.p160==1))") & (("((i3.u5.p40==1)&&(i1.u23.p160==1))" U "((i5.u19.p133==1)&&(i1.u23.p160==1))") | XX"(((i3.u5.p40==1)&&(i1.u23.p160==1))&&((i5.u2.p21!=1)||(i5.u27.p180!=1)))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
639 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,85.5111,1348924,1,0,1.6458e+06,14825,3208,5.9104e+06,921,216636,757655
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Raft-PT-06-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590054271440

--------------------
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="Raft-PT-06"
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 Raft-PT-06, 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 r141-smll-158961510800250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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