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-159033475900602.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 ShieldPPPt-PT-003A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475900602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.2K May 14 01:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 08:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 08:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 21K 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 ShieldPPPt-PT-003A-00
FORMULA_NAME ShieldPPPt-PT-003A-01
FORMULA_NAME ShieldPPPt-PT-003A-02
FORMULA_NAME ShieldPPPt-PT-003A-03
FORMULA_NAME ShieldPPPt-PT-003A-04
FORMULA_NAME ShieldPPPt-PT-003A-05
FORMULA_NAME ShieldPPPt-PT-003A-06
FORMULA_NAME ShieldPPPt-PT-003A-07
FORMULA_NAME ShieldPPPt-PT-003A-08
FORMULA_NAME ShieldPPPt-PT-003A-09
FORMULA_NAME ShieldPPPt-PT-003A-10
FORMULA_NAME ShieldPPPt-PT-003A-11
FORMULA_NAME ShieldPPPt-PT-003A-12
FORMULA_NAME ShieldPPPt-PT-003A-13
FORMULA_NAME ShieldPPPt-PT-003A-14
FORMULA_NAME ShieldPPPt-PT-003A-15

=== Now, execution of the tool begins

BK_START 1590606503188

[2020-05-27 19:08:25] [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 19:08:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 19:08:25] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-05-27 19:08:25] [INFO ] Transformed 78 places.
[2020-05-27 19:08:25] [INFO ] Transformed 57 transitions.
[2020-05-27 19:08:25] [INFO ] Found NUPN structural information;
[2020-05-27 19:08:25] [INFO ] Parsed PT model containing 78 places and 57 transitions in 71 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1537 steps, including 0 resets, run visited all 35 properties in 14 ms. (steps per millisecond=109 )
[2020-05-27 19:08:25] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 19:08:25] [INFO ] Flatten gal took : 31 ms
FORMULA ShieldPPPt-PT-003A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 19:08:25] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 19:08:25] [INFO ] Applying decomposition
[2020-05-27 19:08:25] [INFO ] Flatten gal took : 8 ms
[2020-05-27 19:08:25] [INFO ] Input system was already deterministic with 56 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/graph16478076750236896483.txt, -o, /tmp/graph16478076750236896483.bin, -w, /tmp/graph16478076750236896483.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/graph16478076750236896483.bin, -l, -1, -v, -w, /tmp/graph16478076750236896483.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 19:08:25] [INFO ] Decomposing Gal with order
[2020-05-27 19:08:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 19:08:25] [INFO ] Removed a total of 9 redundant transitions.
[2020-05-27 19:08:25] [INFO ] Flatten gal took : 89 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 78 cols
[2020-05-27 19:08:25] [INFO ] Computed 34 place invariants in 4 ms
inv : p0 + p55 + p58 + p59 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p35 + p38 + p39 = 1
inv : p0 + p26 + p27 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p74 + p75 = 1
inv : p0 + p40 + p41 + p42 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p60 + p63 + p64 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p30 + p33 + p34 = 1
inv : p0 + p10 + p11 + p12 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p35 + p36 + p37 = 1
inv : p0 + p72 + p73 = 1
inv : p0 + p60 + p61 + p62 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p30 + p31 + p32 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p65 + p68 + p69 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p65 + p66 + p67 = 1
inv : p0 + p76 + p77 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p40 + p43 + p44 = 1
inv : p0 + p70 + p71 = 1
Total of 34 invariants.
[2020-05-27 19:08:25] [INFO ] Computed 34 place invariants in 5 ms
[2020-05-27 19:08:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2020-05-27 19:08:25] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-27 19:08:25] [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 : !(((X(G("(i9.u13.p45!=1)")))&&(!(G(X("((i3.u2.p7!=1)||(i3.u2.p9!=1))"))))))
Formula 0 simplified : !(XG"(i9.u13.p45!=1)" & !GX"((i3.u2.p7!=1)||(i3.u2.p9!=1))")
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
[2020-05-27 19:08:25] [INFO ] Proved 78 variables to be positive in 146 ms
[2020-05-27 19:08:25] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2020-05-27 19:08:25] [INFO ] Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:08:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:08:25] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2020-05-27 19:08:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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,0.102874,18940,1,0,6362,162,720,8939,130,736,10595
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((!(X("(i8.u21.p70==1)")))||(G("(i1.u8.p26==1)")))))
Formula 1 simplified : !F(!X"(i8.u21.p70==1)" | G"(i1.u8.p26==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,0.10465,19560,1,0,6362,162,758,8939,130,736,10612
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-003A-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G(F(("((i9.u13.p45!=1)||(i9.u19.p60!=1))")U(F("((i9.u13.p45==1)&&(i9.u19.p60==1))")))))&&(F(G("((i7.u12.p43==1)&&(i2.u15.p50==1))"))))))
Formula 2 simplified : !F(GF("((i9.u13.p45!=1)||(i9.u19.p60!=1))" U F"((i9.u13.p45==1)&&(i9.u19.p60==1))") & FG"((i7.u12.p43==1)&&(i2.u15.p50==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.123737,20716,1,0,8106,162,802,11335,132,746,13177
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(!(G((G("((i0.u3.p13==1)&&(i1.u8.p27==1))"))U(("((i0.u3.p13==1)&&(i1.u8.p27==1))")U(X(X("((i0.u3.p13==1)&&(i1.u8.p27==1))")))))))))
Formula 3 simplified : !G!G(G"((i0.u3.p13==1)&&(i1.u8.p27==1))" U ("((i0.u3.p13==1)&&(i1.u8.p27==1))" U XX"((i0.u3.p13==1)&&(i1.u8.p27==1))"))
[2020-05-27 19:08:26] [INFO ] Computing symmetric co enabling matrix : 56 transitions.
[2020-05-27 19:08:27] [INFO ] Computation of Finished co-enabling matrix. took 738 ms. Total solver calls (SAT/UNSAT): 164(20/144)
[2020-05-27 19:08:27] [INFO ] Computing Do-Not-Accords matrix : 56 transitions.
[2020-05-27 19:08:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:08:27] [INFO ] Built C files in 2112ms 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 1196 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 86 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( [](([]((LTLAP7==true)))U(((LTLAP7==true))U(X(X((LTLAP7==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, [](!( [](([]((LTLAP7==true)))U(((LTLAP7==true))U(X(X((LTLAP7==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, [](!( [](([]((LTLAP7==true)))U(((LTLAP7==true))U(X(X((LTLAP7==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)
458 unique states visited
194 strongly connected components in search stack
459 transitions explored
221 items max in DFS search stack
878 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,8.91862,303796,1,0,602434,168,847,814295,132,1022,584820
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(F(("((i3.u2.p7!=1)||(i3.u2.p9!=1))")U("((i8.u18.p56==1)&&(i8.u21.p71==1))"))))||(G("((i0.u3.p13==1)&&(i1.u8.p27==1))"))))
Formula 4 simplified : !(XF("((i3.u2.p7!=1)||(i3.u2.p9!=1))" U "((i8.u18.p56==1)&&(i8.u21.p71==1))") | G"((i0.u3.p13==1)&&(i1.u8.p27==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,8.92957,304056,1,0,602755,168,874,814593,132,1022,585447
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(X((X(("((i1.u1.p4==1)&&(i1.u6.p23==1))")U("((i6.u10.p33==1)&&(i2.u15.p50==1))")))U((G(X("((i8.u18.p58==1)&&(i7.u23.p75==1))")))U(!(X("((i0.u3.p11==1)&&(i5.u5.p21==1))")))))))))
Formula 5 simplified : !GFX(X("((i1.u1.p4==1)&&(i1.u6.p23==1))" U "((i6.u10.p33==1)&&(i2.u15.p50==1))") U (GX"((i8.u18.p58==1)&&(i7.u23.p75==1))" U !X"((i0.u3.p11==1)&&(i5.u5.p21==1))"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,8.94106,304652,1,0,602936,168,925,814801,132,1022,585737
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(X("(i1.u6.p22==1)")))U("(i1.u6.p22==1)")))
Formula 6 simplified : !(GX"(i1.u6.p22==1)" U "(i1.u6.p22==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,8.94476,304652,1,0,602960,168,941,814825,132,1022,585853
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X((("(i7.u23.p74==1)")U("((i2.u4.p17==1)&&(i2.u4.p19==1))"))&&("(i10.u22.p72==1)")))))
Formula 7 simplified : X("(i10.u22.p72==1)" & ("(i7.u23.p74==1)" U "((i2.u4.p17==1)&&(i2.u4.p19==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,8.94619,304864,1,0,602960,168,968,814825,133,1022,585859
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-003A-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((X(X(("((u20.p66==1)&&(i10.u24.p77==1))")U("((i0.u0.p1!=1)||(i3.u7.p24!=1))"))))U(X("((i4.u16.p51==1)||((i0.u0.p1==1)&&(i3.u7.p24==1)))")))))
Formula 8 simplified : !F(XX("((u20.p66==1)&&(i10.u24.p77==1))" U "((i0.u0.p1!=1)||(i3.u7.p24!=1))") U X"((i4.u16.p51==1)||((i0.u0.p1==1)&&(i3.u7.p24==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,8.95773,304864,1,0,603508,168,1010,815319,133,1022,587054
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(!(G((F("(i10.u24.p76==1)"))&&(G("((i0.u3.p13==1)&&(i1.u8.p27==1))"))))))U(X("((i0.u3.p13==1)&&(i1.u8.p27==1))"))))
Formula 9 simplified : !(F!G(F"(i10.u24.p76==1)" & G"((i0.u3.p13==1)&&(i1.u8.p27==1))") U X"((i0.u3.p13==1)&&(i1.u8.p27==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,9.07647,307768,1,0,612326,168,1021,824143,133,1024,598487
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(X((X(G(X(G("(i9.u13.p45==1)")))))U((G("(i9.u13.p45==1)"))||("((i2.u4.p15==1)&&(i2.u15.p49==1))"))))))
Formula 10 simplified : !GX(XGXG"(i9.u13.p45==1)" U ("((i2.u4.p15==1)&&(i2.u15.p49==1))" | G"(i9.u13.p45==1)"))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,9.08441,308284,1,0,612684,168,1047,824506,133,1025,599199
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((F("(i9.u13.p45==1)"))&&(G(((X((G("(i4.u16.p51==1)"))&&("((i4.u16.p51==1)||((i9.u19.p63==1)&&(i10.u24.p77==1)))")))||("(i7.u12.p40!=1)"))||("(i7.u23.p74!=1)"))))))
Formula 11 simplified : !F(F"(i9.u13.p45==1)" & G("(i7.u12.p40!=1)" | "(i7.u23.p74!=1)" | X("((i4.u16.p51==1)||((i9.u19.p63==1)&&(i10.u24.p77==1)))" & G"(i4.u16.p51==1)")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,9.08914,308520,1,0,612684,168,1058,824506,133,1025,599230
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(!(X(F(X(F(G(!(X(G((F("((i4.u9.p29==1)&&(i6.u14.p48==1))"))U("((u20.p66==1)&&(i10.u24.p77==1))")))))))))))))
Formula 12 simplified : !G!XFXFG!XG(F"((i4.u9.p29==1)&&(i6.u14.p48==1))" U "((u20.p66==1)&&(i10.u24.p77==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,9.0953,308520,1,0,612860,168,1112,824713,133,1025,599528
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-003A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590606516847

--------------------
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="ShieldPPPt-PT-003A"
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 ShieldPPPt-PT-003A, 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-159033475900602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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