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.r210-tajo-159033476200770.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 ShieldRVs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476200770
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.0K May 14 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 24K May 12 20:42 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 ShieldRVs-PT-002B-00
FORMULA_NAME ShieldRVs-PT-002B-01
FORMULA_NAME ShieldRVs-PT-002B-02
FORMULA_NAME ShieldRVs-PT-002B-03
FORMULA_NAME ShieldRVs-PT-002B-04
FORMULA_NAME ShieldRVs-PT-002B-05
FORMULA_NAME ShieldRVs-PT-002B-06
FORMULA_NAME ShieldRVs-PT-002B-07
FORMULA_NAME ShieldRVs-PT-002B-08
FORMULA_NAME ShieldRVs-PT-002B-09
FORMULA_NAME ShieldRVs-PT-002B-10
FORMULA_NAME ShieldRVs-PT-002B-11
FORMULA_NAME ShieldRVs-PT-002B-12
FORMULA_NAME ShieldRVs-PT-002B-13
FORMULA_NAME ShieldRVs-PT-002B-14
FORMULA_NAME ShieldRVs-PT-002B-15

=== Now, execution of the tool begins

BK_START 1590618744633

[2020-05-27 22:32:26] [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-27 22:32:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 22:32:26] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-05-27 22:32:26] [INFO ] Transformed 83 places.
[2020-05-27 22:32:26] [INFO ] Transformed 93 transitions.
[2020-05-27 22:32:26] [INFO ] Found NUPN structural information;
[2020-05-27 22:32:26] [INFO ] Parsed PT model containing 83 places and 93 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 918 resets, run finished after 113 ms. (steps per millisecond=884 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 93 rows 83 cols
[2020-05-27 22:32:26] [INFO ] Computed 9 place invariants in 5 ms
[2020-05-27 22:32:26] [INFO ] [Real]Absence check using 9 positive place invariants in 29 ms returned sat
[2020-05-27 22:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:32:26] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-27 22:32:26] [INFO ] Deduced a trap composed of 28 places in 64 ms
[2020-05-27 22:32:26] [INFO ] Deduced a trap composed of 13 places in 37 ms
[2020-05-27 22:32:26] [INFO ] Deduced a trap composed of 16 places in 42 ms
[2020-05-27 22:32:26] [INFO ] Deduced a trap composed of 24 places in 29 ms
[2020-05-27 22:32:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 210 ms
[2020-05-27 22:32:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:32:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2020-05-27 22:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:32:26] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-27 22:32:27] [INFO ] Deduced a trap composed of 13 places in 36 ms
[2020-05-27 22:32:27] [INFO ] Deduced a trap composed of 16 places in 30 ms
[2020-05-27 22:32:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2020-05-27 22:32:27] [INFO ] Computed and/alt/rep : 92/247/92 causal constraints in 8 ms.
[2020-05-27 22:32:27] [INFO ] Added : 75 causal constraints over 15 iterations in 138 ms. Result :unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 22:32:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 22:32:27] [INFO ] Flatten gal took : 30 ms
FORMULA ShieldRVs-PT-002B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 22:32:27] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 22:32:27] [INFO ] Applying decomposition
[2020-05-27 22:32:27] [INFO ] Flatten gal took : 9 ms
[2020-05-27 22:32:27] [INFO ] Input system was already deterministic with 93 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/graph17079394344032146017.txt, -o, /tmp/graph17079394344032146017.bin, -w, /tmp/graph17079394344032146017.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/graph17079394344032146017.bin, -l, -1, -v, -w, /tmp/graph17079394344032146017.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 93 rows 83 cols
[2020-05-27 22:32:27] [INFO ] Computed 9 place invariants in 9 ms
inv : p0 + p1 + p5 + p6 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 = 1
inv : p0 + p44 + p45 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 = 1
inv : p0 + p1 + p2 + p3 + p4 = 1
inv : p0 + p44 + p45 + p46 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 = 1
inv : p0 + p44 + p45 + p46 + p47 + p58 + p59 + p60 + p61 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p19 + p20 + p21 + p22 = 1
inv : p0 + p1 + p5 + p6 + p7 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 = 1
inv : p0 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 = 1
Total of 9 invariants.
[2020-05-27 22:32:27] [INFO ] Computed 9 place invariants in 10 ms
[2020-05-27 22:32:27] [INFO ] Decomposing Gal with order
[2020-05-27 22:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 22:32:27] [INFO ] Removed a total of 63 redundant transitions.
[2020-05-27 22:32:27] [INFO ] Flatten gal took : 36 ms
[2020-05-27 22:32:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 22:32:27] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 22:32:27] [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 13 LTL properties
Checking formula 0 : !(((F((G(X("(i8.u25.p72==1)")))||("(i8.u25.p72==1)")))U(((X("(i6.u18.p54!=1)"))U(G("((i7.u22.p69==1)&&(i8.u23.p77==1))")))U("(((i4.i0.u1.p4==1)&&(i1.u6.p16==1))&&(u13.p40==1))"))))
Formula 0 simplified : !(F("(i8.u25.p72==1)" | GX"(i8.u25.p72==1)") U ((X"(i6.u18.p54!=1)" U G"((i7.u22.p69==1)&&(i8.u23.p77==1))") U "(((i4.i0.u1.p4==1)&&(i1.u6.p16==1))&&(u13.p40==1))"))
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
[2020-05-27 22:32:27] [INFO ] Proved 83 variables to be positive in 176 ms
[2020-05-27 22:32:27] [INFO ] Computing symmetric may disable matrix : 93 transitions.
[2020-05-27 22:32:27] [INFO ] Computation of disable matrix completed :0/93 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:32:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:32:27] [INFO ] Computing symmetric may enable matrix : 93 transitions.
[2020-05-27 22:32:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:32:28] [INFO ] Computing symmetric co enabling matrix : 93 transitions.
Reverse transition relation is NOT exact ! Due to transitions u13.t8, u13.t9, u13.t10, u13.t11, u9.t4, u9.t5, u9.t6, u9.t7, i1.t61, i1.u5.t0, i1.u5.t1, i1.u5.t2, i1.u5.t3, i1.u6.t63, i3.t54, i3.u7.t58, i3.u7.t59, i3.u8.t56, i4.i0.u1.t64, i4.i1.t48, i4.i1.u12.t51, i5.u19.t38, i5.u19.t39, i6.t41, i6.u17.t43, i6.u18.t12, i6.u18.t13, i6.u18.t14, i6.u18.t15, i7.t34, i7.u21.t16, i7.u21.t17, i7.u21.t18, i7.u21.t19, i7.u22.t36, i8.t28, i8.u23.t20, i8.u23.t21, i8.u23.t22, i8.u23.t23, i8.u24.t31, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/52/41/93
Computing Next relation with stutter on 8 deadlock states
[2020-05-27 22:32:30] [INFO ] Computation of co-enabling matrix(82/93) took 1887 ms. Total solver calls (SAT/UNSAT): 1378(48/1330)
[2020-05-27 22:32:30] [INFO ] Computation of Finished co-enabling matrix. took 2082 ms. Total solver calls (SAT/UNSAT): 1398(48/1350)
[2020-05-27 22:32:30] [INFO ] Computing Do-Not-Accords matrix : 93 transitions.
[2020-05-27 22:32:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:32:30] [INFO ] Built C files in 3481ms 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 1534 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (<>(( [](X((LTLAP0==true)))) || ( (LTLAP0==true)) ))U(((X((LTLAP1==true)))U([]((LTLAP2==true))))U((LTLAP3==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (<>(( [](X((LTLAP0==true)))) || ( (LTLAP0==true)) ))U(((X((LTLAP1==true)))U([]((LTLAP2==true))))U((LTLAP3==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (<>(( [](X((LTLAP0==true)))) || ( (LTLAP0==true)) ))U(((X((LTLAP1==true)))U([]((LTLAP2==true))))U((LTLAP3==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
87 unique states visited
87 strongly connected components in search stack
87 transitions explored
87 items max in DFS search stack
645 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,6.4772,195640,1,0,393248,550,1360,468365,253,1982,648180
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F((!(G(!(X("(i7.u20.p62==1)")))))||(G(X("(((i3.u8.p30==1)&&(i4.i1.u12.p41==1))&&(i7.u21.p64==1))")))))))
Formula 1 simplified : F(!G!X"(i7.u20.p62==1)" | GX"(((i3.u8.p30==1)&&(i4.i1.u12.p41==1))&&(i7.u21.p64==1))")
Computing Next relation with stutter on 8 deadlock states
208 unique states visited
30 strongly connected components in search stack
211 transitions explored
88 items max in DFS search stack
367 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.152,309432,1,0,628678,685,1500,805291,253,2656,1063874
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G(X("(i7.u20.p62==1)")))||("(u9.p27==1)"))))
Formula 2 simplified : !F("(u9.p27==1)" | GX"(i7.u20.p62==1)")
Computing Next relation with stutter on 8 deadlock states
88 unique states visited
87 strongly connected components in search stack
89 transitions explored
88 items max in DFS search stack
248 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,12.6353,388568,1,0,792600,690,1536,1.03192e+06,255,2690,1318681
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(!(X((G(("(((i4.i0.u1.p4==1)&&(i1.u6.p16==1))&&(u13.p40==1))")U("(i1.u5.p13==1)")))||("(((i1.u5.p15==1)&&(i3.u7.p21==1))&&(u9.p29==1))")))))))
Formula 3 simplified : !FG!X("(((i1.u5.p15==1)&&(i3.u7.p21==1))&&(u9.p29==1))" | G("(((i4.i0.u1.p4==1)&&(i1.u6.p16==1))&&(u13.p40==1))" U "(i1.u5.p13==1)"))
Computing Next relation with stutter on 8 deadlock states
90 unique states visited
89 strongly connected components in search stack
92 transitions explored
90 items max in DFS search stack
43 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,13.0546,404656,1,0,827043,713,1579,1.08287e+06,256,2793,1384610
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(!(F("(i3.u3.p7==1)"))))))
Formula 4 simplified : !XF!F"(i3.u3.p7==1)"
Computing Next relation with stutter on 8 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
965 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,22.7137,751772,1,0,1.5871e+06,725,1628,1.96109e+06,256,2860,2511169
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-002B-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X((G("((i7.u21.p66==1)&&(i8.u23.p77==1))"))U(("(u13.p40==1)")U("(i1.u5.p12==1)"))))||(X("(u13.p38==1)"))))
Formula 5 simplified : !(X(G"((i7.u21.p66==1)&&(i8.u23.p77==1))" U ("(u13.p40==1)" U "(i1.u5.p12==1)")) | X"(u13.p38==1)")
Computing Next relation with stutter on 8 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,22.7659,752016,1,0,1.58729e+06,725,1682,1.96133e+06,262,2860,2511757
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((X("((i8.u23.p76==1)||(((i1.u6.p16==1)&&(i3.u7.p21==1))&&(i3.u8.p30==1)))"))||((!(X(G("((u13.p37==1)||(i8.u23.p76==1))"))))U(F("(u13.p37==1)"))))))
Formula 6 simplified : !F(X"((i8.u23.p76==1)||(((i1.u6.p16==1)&&(i3.u7.p21==1))&&(i3.u8.p30==1)))" | (!XG"((u13.p37==1)||(i8.u23.p76==1))" U F"(u13.p37==1)"))
Computing Next relation with stutter on 8 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
451 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,27.2853,898296,1,0,1.9098e+06,729,1718,2.34039e+06,263,2915,3034341
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("((i7.u22.p69!=1)||(i8.u23.p77!=1))")))
Formula 7 simplified : !G"((i7.u22.p69!=1)||(i8.u23.p77!=1))"
Computing Next relation with stutter on 8 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
174 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,29.0236,967992,1,0,2.06524e+06,730,1739,2.52536e+06,263,2935,3283950
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(G(((!(F("(((u9.p27==1)&&(u13.p38==1))&&(i7.u21.p64==1))")))&&("(i8.u23.p77!=1)"))||("(i6.u18.p50==1)")))))
Formula 8 simplified : G("(i6.u18.p50==1)" | ("(i8.u23.p77!=1)" & !F"(((u9.p27==1)&&(u13.p38==1))&&(i7.u21.p64==1))"))
Computing Next relation with stutter on 8 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
434 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,33.3607,1146608,1,0,2.45949e+06,730,1785,2.99095e+06,263,2939,3865738
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(X("(i1.u4.p18==1)")))))
Formula 9 simplified : !XGX"(i1.u4.p18==1)"
Computing Next relation with stutter on 8 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.3672,1146872,1,0,2.45969e+06,730,1803,2.9912e+06,263,2939,3866377
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G(X(F((G(!(X((G("(u13.p36==1)"))||("(i4.i1.u11.p43==1)")))))&&(!(G("(u13.p36==1)")))))))))
Formula 10 simplified : GXF(G!X("(i4.i1.u11.p43==1)" | G"(u13.p36==1)") & !G"(u13.p36==1)")
Computing Next relation with stutter on 8 deadlock states
89 unique states visited
89 strongly connected components in search stack
90 transitions explored
89 items max in DFS search stack
12 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,33.4891,1150040,1,0,2.46445e+06,730,1848,2.99948e+06,263,2939,3885668
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((!(X((F(G("(i1.u6.p17==1)")))||(X(X(G("(i7.u22.p70==1)")))))))&&(!(G("(((u9.p27==1)&&(i4.i1.u12.p41==1))&&(i7.u21.p64==1))")))))
Formula 11 simplified : !(!X(FG"(i1.u6.p17==1)" | XXG"(i7.u22.p70==1)") & !G"(((u9.p27==1)&&(i4.i1.u12.p41==1))&&(i7.u21.p64==1))")
Computing Next relation with stutter on 8 deadlock states
161 unique states visited
0 strongly connected components in search stack
174 transitions explored
87 items max in DFS search stack
962 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,43.1132,1437888,1,0,3.08568e+06,730,1904,3.53979e+06,263,2977,4860106
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-002B-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(!(X(X(((!(F("(i6.u18.p54==1)")))||("(i4.i1.u12.p34==1)"))&&(F(X("(i4.i1.u12.p34==1)")))))))))
Formula 12 simplified : !X!XX(("(i4.i1.u12.p34==1)" | !F"(i6.u18.p54==1)") & FX"(i4.i1.u12.p34==1)")
Computing Next relation with stutter on 8 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
183 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,44.9423,1514968,1,0,3.26048e+06,735,1964,3.74287e+06,264,3002,5130249
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldRVs-PT-002B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590618801939

--------------------
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="ShieldRVs-PT-002B"
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 ShieldRVs-PT-002B, 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 r210-tajo-159033476200770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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