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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.7K May 14 01:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 18:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 18:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 08:36 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 9.4K 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 ShieldPPPs-PT-001A-00
FORMULA_NAME ShieldPPPs-PT-001A-01
FORMULA_NAME ShieldPPPs-PT-001A-02
FORMULA_NAME ShieldPPPs-PT-001A-03
FORMULA_NAME ShieldPPPs-PT-001A-04
FORMULA_NAME ShieldPPPs-PT-001A-05
FORMULA_NAME ShieldPPPs-PT-001A-06
FORMULA_NAME ShieldPPPs-PT-001A-07
FORMULA_NAME ShieldPPPs-PT-001A-08
FORMULA_NAME ShieldPPPs-PT-001A-09
FORMULA_NAME ShieldPPPs-PT-001A-10
FORMULA_NAME ShieldPPPs-PT-001A-11
FORMULA_NAME ShieldPPPs-PT-001A-12
FORMULA_NAME ShieldPPPs-PT-001A-13
FORMULA_NAME ShieldPPPs-PT-001A-14
FORMULA_NAME ShieldPPPs-PT-001A-15

=== Now, execution of the tool begins

BK_START 1590589037238

[2020-05-27 14:17:19] [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 14:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 14:17:19] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2020-05-27 14:17:19] [INFO ] Transformed 34 places.
[2020-05-27 14:17:19] [INFO ] Transformed 29 transitions.
[2020-05-27 14:17:19] [INFO ] Found NUPN structural information;
[2020-05-27 14:17:19] [INFO ] Parsed PT model containing 34 places and 29 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 711 resets, run finished after 155 ms. (steps per millisecond=645 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 29 rows 34 cols
[2020-05-27 14:17:19] [INFO ] Computed 12 place invariants in 3 ms
[2020-05-27 14:17:19] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 14:17:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 14:17:19] [INFO ] Flatten gal took : 27 ms
FORMULA ShieldPPPs-PT-001A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001A-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 14:17:19] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 14:17:19] [INFO ] Applying decomposition
[2020-05-27 14:17:19] [INFO ] Flatten gal took : 11 ms
[2020-05-27 14:17:19] [INFO ] Input system was already deterministic with 29 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/graph16416470003631697073.txt, -o, /tmp/graph16416470003631697073.bin, -w, /tmp/graph16416470003631697073.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/graph16416470003631697073.bin, -l, -1, -v, -w, /tmp/graph16416470003631697073.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 29 rows 34 cols
[2020-05-27 14:17:19] [INFO ] Computed 12 place invariants in 1 ms
inv : p0 + p30 + p31 + p32 + p33 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p20 + p21 + p22 + p23 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p26 + p27 + p28 + p29 = 1
inv : p0 + p10 + p11 + p12 = 1
Total of 12 invariants.
[2020-05-27 14:17:19] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-27 14:17:19] [INFO ] Decomposing Gal with order
[2020-05-27 14:17:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 14:17:19] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-27 14:17:20] [INFO ] Flatten gal took : 28 ms
[2020-05-27 14:17:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2020-05-27 14:17:20] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-27 14:17:20] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((F(X(G(X(X(F(("(i3.u6.p15==1)")U((!(F("(i4.u8.p22==1)")))||(G("(i3.u6.p15==1)")))))))))))
Formula 0 simplified : !FXGXXF("(i3.u6.p15==1)" U (!F"(i4.u8.p22==1)" | G"(i3.u6.p15==1)"))
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-27 14:17:20] [INFO ] Proved 34 variables to be positive in 145 ms
[2020-05-27 14:17:20] [INFO ] Computing symmetric may disable matrix : 29 transitions.
[2020-05-27 14:17:20] [INFO ] Computation of disable matrix completed :0/29 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 14:17:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 14:17:20] [INFO ] Computing symmetric may enable matrix : 29 transitions.
[2020-05-27 14:17:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t14, t25, i1.t16, i1.u10.t5, i1.u10.t6, i3.t2, i4.u8.t3, i4.u8.t4, i4.u8.t11, i5.t26, i5.u11.t7, i5.u11.t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/9/14/23
Computing Next relation with stutter on 3 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
55 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.574282,45848,1,0,74454,156,414,72133,121,393,81563
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((G(X(X(G(F("((i1.u3.p8==1)&&(i1.u10.p28==1))"))))))||(("((i1.u3.p8==1)&&(i1.u10.p28==1))")U("(i2.u0.p0==1)")))))
Formula 1 simplified : !G(GXXGF"((i1.u3.p8==1)&&(i1.u10.p28==1))" | ("((i1.u3.p8==1)&&(i1.u10.p28==1))" U "(i2.u0.p0==1)"))
Computing Next relation with stutter on 3 deadlock states
10 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 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.650028,49452,1,0,81729,181,518,81891,122,498,94817
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X(!(F(X("((i2.u4.p11==1)&&(i4.u8.p23==1))")))))||(F(X(G("((i2.u4.p11==1)&&(i4.u8.p23==1))")))))))
Formula 2 simplified : !G(X!FX"((i2.u4.p11==1)&&(i4.u8.p23==1))" | FXG"((i2.u4.p11==1)&&(i4.u8.p23==1))")
Computing Next relation with stutter on 3 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.760173,54384,1,0,92852,181,552,95355,124,498,109375
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(F(X(((G(F(G("((i2.u4.p11==1)&&(i4.u8.p21==1))"))))&&("(i2.u4.p11==1)"))&&("(i4.u8.p21==1)")))))))
Formula 3 simplified : XFX("(i2.u4.p11==1)" & "(i4.u8.p21==1)" & GFG"((i2.u4.p11==1)&&(i4.u8.p21==1))")
Computing Next relation with stutter on 3 deadlock states
17 unique states visited
0 strongly connected components in search stack
29 transitions explored
11 items max in DFS search stack
7 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.827762,57932,1,0,102360,181,600,103696,125,498,121741
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-001A-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G(((!(X(!(X("((i2.u0.p2==1)&&(i2.u4.p10==1))")))))||("(i0.u1.p3!=1)"))||("(i5.u11.p30!=1)")))U("((i1.u10.p28==1)||((i2.u0.p2==1)&&(i2.u4.p10==1)))"))))
Formula 4 simplified : !X(G("(i0.u1.p3!=1)" | "(i5.u11.p30!=1)" | !X!X"((i2.u0.p2==1)&&(i2.u4.p10==1))") U "((i1.u10.p28==1)||((i2.u0.p2==1)&&(i2.u4.p10==1)))")
Computing Next relation with stutter on 3 deadlock states
30 unique states visited
29 strongly connected components in search stack
30 transitions explored
29 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.04623,64100,1,0,115968,181,640,119786,125,503,146524
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((G("((i3.u6.p17!=1)||(i3.u7.p19!=1))"))&&(((((G("((i3.u6.p17==1)&&(i3.u7.p19==1))"))||("(i2.u4.p11!=1)"))||("(i4.u8.p21!=1)"))||("(i3.u6.p17!=1)"))||("(i3.u7.p19!=1)")))))
Formula 5 simplified : !G(G"((i3.u6.p17!=1)||(i3.u7.p19!=1))" & ("(i2.u4.p11!=1)" | "(i3.u6.p17!=1)" | "(i3.u7.p19!=1)" | "(i4.u8.p21!=1)" | G"((i3.u6.p17==1)&&(i3.u7.p19==1))"))
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 14:17:21] [INFO ] Computing symmetric co enabling matrix : 29 transitions.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.09664,66608,1,0,121990,181,719,126392,125,506,157943
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G(F(((!(X(F(X("(i5.u11.p32==1)")))))&&("((i3.u7.p18!=1)||(i1.u10.p27!=1))"))U(((G("((i2.u4.p11==1)&&(i4.u8.p23==1))"))&&("(i3.u7.p18==1)"))&&("(i1.u10.p27==1)")))))))
Formula 6 simplified : !FGF(("((i3.u7.p18!=1)||(i1.u10.p27!=1))" & !XFX"(i5.u11.p32==1)") U ("(i1.u10.p27==1)" & "(i3.u7.p18==1)" & G"((i2.u4.p11==1)&&(i4.u8.p23==1))"))
Computing Next relation with stutter on 3 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 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,1.11948,67664,1,0,124188,182,758,128917,125,511,161539
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(F(X(("((i2.u4.p11==1)&&(i4.u8.p21==1))")U(F("(i3.u6.p15==1)"))))))U(F("(((i3.u6.p15==1)&&(i0.u1.p4==1))&&(i0.u9.p25==1))"))))
Formula 7 simplified : !(!FX("((i2.u4.p11==1)&&(i4.u8.p21==1))" U F"(i3.u6.p15==1)") U F"(((i3.u6.p15==1)&&(i0.u1.p4==1))&&(i0.u9.p25==1))")
Computing Next relation with stutter on 3 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.2064,71884,1,0,133896,182,788,141042,125,511,176532
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("(((i5.u11.p31==1)&&(i2.u4.p11==1))&&(i4.u8.p23==1))")))
Formula 8 simplified : !F"(((i5.u11.p31==1)&&(i2.u4.p11==1))&&(i4.u8.p23==1))"
Computing Next relation with stutter on 3 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
29 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.48918,85084,1,0,165538,182,807,175821,125,511,217123
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(X(G("((i3.u6.p16!=1)||(i5.u11.p31!=1))"))))U((!(F((G("(i5.u11.p31!=1)"))||("((i1.u3.p8==1)&&(i1.u10.p29==1))"))))&&("((i1.u3.p8!=1)||(i1.u10.p29!=1))"))))
Formula 9 simplified : !(FXG"((i3.u6.p16!=1)||(i5.u11.p31!=1))" U ("((i1.u3.p8!=1)||(i1.u10.p29!=1))" & !F("((i1.u3.p8==1)&&(i1.u10.p29==1))" | G"(i5.u11.p31!=1)")))
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 14:17:21] [INFO ] Computation of Finished co-enabling matrix. took 488 ms. Total solver calls (SAT/UNSAT): 121(9/112)
[2020-05-27 14:17:21] [INFO ] Computing Do-Not-Accords matrix : 29 transitions.
[2020-05-27 14:17:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 14:17:21] [INFO ] Built C files in 1775ms 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]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.59561,89832,1,0,177361,182,861,187800,126,511,234191
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(((((X(X(G("((i2.u4.p12==1)&&(i5.u5.p14==1))"))))||("(i2.u4.p12!=1)"))||("(i5.u5.p14!=1)"))||("(i4.u2.p5!=1)"))||("(i0.u9.p24!=1)")))))
Formula 10 simplified : !FG("(i0.u9.p24!=1)" | "(i2.u4.p12!=1)" | "(i4.u2.p5!=1)" | "(i5.u5.p14!=1)" | XXG"((i2.u4.p12==1)&&(i5.u5.p14==1))")
Computing Next relation with stutter on 3 deadlock states
37 unique states visited
27 strongly connected components in search stack
39 transitions explored
37 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.66585,92996,1,0,185358,183,928,195773,126,516,247332
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((G("((i2.u4.p11==1)&&(i4.u8.p21==1))"))&&(X("((i2.u4.p11==1)&&(i4.u8.p21==1))")))))
Formula 11 simplified : !X(G"((i2.u4.p11==1)&&(i4.u8.p21==1))" & X"((i2.u4.p11==1)&&(i4.u8.p21==1))")
Computing Next relation with stutter on 3 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.66719,93260,1,0,185358,183,929,195773,126,516,247345
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590589042524

--------------------
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="ShieldPPPs-PT-001A"
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 ShieldPPPs-PT-001A, 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-159033475600394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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