fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033475900578
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldPPPt-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.490 10895.00 27400.00 126.10 TFFFFFFFFTTFTFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.3K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 16K 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.7K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:48 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 19K 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-001B-00
FORMULA_NAME ShieldPPPt-PT-001B-01
FORMULA_NAME ShieldPPPt-PT-001B-02
FORMULA_NAME ShieldPPPt-PT-001B-03
FORMULA_NAME ShieldPPPt-PT-001B-04
FORMULA_NAME ShieldPPPt-PT-001B-05
FORMULA_NAME ShieldPPPt-PT-001B-06
FORMULA_NAME ShieldPPPt-PT-001B-07
FORMULA_NAME ShieldPPPt-PT-001B-08
FORMULA_NAME ShieldPPPt-PT-001B-09
FORMULA_NAME ShieldPPPt-PT-001B-10
FORMULA_NAME ShieldPPPt-PT-001B-11
FORMULA_NAME ShieldPPPt-PT-001B-12
FORMULA_NAME ShieldPPPt-PT-001B-13
FORMULA_NAME ShieldPPPt-PT-001B-14
FORMULA_NAME ShieldPPPt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1590606203747

[2020-05-27 19:03: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 19:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 19:03:26] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2020-05-27 19:03:26] [INFO ] Transformed 81 places.
[2020-05-27 19:03:26] [INFO ] Transformed 74 transitions.
[2020-05-27 19:03:26] [INFO ] Found NUPN structural information;
[2020-05-27 19:03:26] [INFO ] Parsed PT model containing 81 places and 74 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 6 resets, run finished after 189 ms. (steps per millisecond=529 ) 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, 0]
// Phase 1: matrix 74 rows 81 cols
[2020-05-27 19:03:26] [INFO ] Computed 12 place invariants in 6 ms
[2020-05-27 19:03:27] [INFO ] [Real]Absence check using 12 positive place invariants in 71 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 19:03:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 19:03:27] [INFO ] Flatten gal took : 90 ms
FORMULA ShieldPPPt-PT-001B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 19:03:27] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
[2020-05-27 19:03:27] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-27 19:03:27] [INFO ] Flatten gal took : 6 ms
[2020-05-27 19:03:27] [INFO ] Input system was already deterministic with 74 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/graph16265624467428767120.txt, -o, /tmp/graph16265624467428767120.bin, -w, /tmp/graph16265624467428767120.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/graph16265624467428767120.bin, -l, -1, -v, -w, /tmp/graph16265624467428767120.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 19:03:27] [INFO ] Decomposing Gal with order
[2020-05-27 19:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 74 rows 81 cols
[2020-05-27 19:03:27] [INFO ] Computed 12 place invariants in 2 ms
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p15 + p16 + p17 + p18 + p19 = 1
inv : p0 + p4 + p5 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p29 + p30 + p31 + p32 + p33 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p22 + p23 + p24 + p25 + p26 = 1
inv : p0 + p4 + p5 + p6 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 = 1
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p15 + p16 + p17 + p20 + p21 = 1
inv : p0 + p4 + p5 + p6 + p7 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p29 + p30 + p31 + p34 + p35 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p22 + p23 + p24 + p27 + p28 = 1
Total of 12 invariants.
[2020-05-27 19:03:27] [INFO ] Computed 12 place invariants in 3 ms
[2020-05-27 19:03:27] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-27 19:03:28] [INFO ] Flatten gal took : 63 ms
[2020-05-27 19:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 19:03:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-27 19:03:28] [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("(i6.u19.p58==1)"))||(G("((i7.u0.p3==1)&&(i3.u8.p22==1))"))))
Formula 0 simplified : !(F"(i6.u19.p58==1)" | G"((i7.u0.p3==1)&&(i3.u8.p22==1))")
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
[2020-05-27 19:03:28] [INFO ] Proved 81 variables to be positive in 273 ms
[2020-05-27 19:03:28] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2020-05-27 19:03:28] [INFO ] Computation of disable matrix completed :0/74 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:03:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:03:28] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2020-05-27 19:03:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t56, u10.t52, i1.u5.t59, i2.u6.t58, i3.u8.t55, i4.t48, i4.t41, i4.u12.t42, i4.u12.t49, i4.u15.t46, i5.t31, i5.u17.t35, i5.u17.t37, i6.t26, i6.t19, i6.u22.t20, i6.u22.t27, i6.u23.t24, i7.u0.t60, i8.t14, i8.t7, i8.u25.t8, i8.u25.t15, i8.u26.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/48/26/74
Computing Next relation with stutter on 3 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
25 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.290895,22076,1,0,10328,427,1177,19739,280,929,22074
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(i1.u4.p10==1)"))))
Formula 1 simplified : !FG"(i1.u4.p10==1)"
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 19:03:29] [INFO ] Computing symmetric co enabling matrix : 74 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
181 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,2.10409,88108,1,0,158600,507,1202,174073,280,1532,239857
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(G(F(G((("(i1.u5.p13==1)")U("(i6.u19.p68==1)"))U(!(X("((u10.p32!=1)||(i8.u26.p79!=1))"))))))))))
Formula 2 simplified : !GFGFG(("(i1.u5.p13==1)" U "(i6.u19.p68==1)") U !X"((u10.p32!=1)||(i8.u26.p79!=1))")
Computing Next relation with stutter on 3 deadlock states
46 unique states visited
45 strongly connected components in search stack
47 transitions explored
46 items max in DFS search stack
64 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,2.74612,100744,1,0,181135,592,1314,208395,284,2016,290050
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("(i5.u17.p53==1)")U((G(X(X(F("(i5.u17.p53==1)")))))&&(!((G(X("(i5.u17.p53==1)")))U(X("(i5.u17.p53==1)")))))))
Formula 3 simplified : !("(i5.u17.p53==1)" U (GXXF"(i5.u17.p53==1)" & !(GX"(i5.u17.p53==1)" U X"(i5.u17.p53==1)")))
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 19:03:31] [INFO ] Computation of co-enabling matrix(23/74) took 1525 ms. Total solver calls (SAT/UNSAT): 445(2/443)
48 unique states visited
47 strongly connected components in search stack
49 transitions explored
47 items max in DFS search stack
127 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,4.02275,124620,1,0,235098,604,1347,263669,284,2104,362076
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((G("(i5.u16.p52==1)"))U((!(F(("(i5.u18.p57==1)")U("(i8.u25.p77==1)"))))&&(!(X("(i8.u25.p77==1)")))))))
Formula 4 simplified : !G(G"(i5.u16.p52==1)" U (!F("(i5.u18.p57==1)" U "(i8.u25.p77==1)") & !X"(i8.u25.p77==1)"))
Computing Next relation with stutter on 3 deadlock states
55 unique states visited
55 strongly connected components in search stack
55 transitions explored
55 items max in DFS search stack
16 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,4.177,128448,1,0,243758,642,1379,272744,284,2420,380783
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((!(X(F((F("(i5.u17.p53==1)"))&&("(i5.u17.p53==1)")))))U(X((X("(i1.u4.p10==1)"))&&(F("(i1.u4.p10==1)")))))))
Formula 5 simplified : !X(!XF("(i5.u17.p53==1)" & F"(i5.u17.p53==1)") U X(X"(i1.u4.p10==1)" & F"(i1.u4.p10==1)"))
Computing Next relation with stutter on 3 deadlock states
40 unique states visited
40 strongly connected components in search stack
41 transitions explored
40 items max in DFS search stack
14 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,4.32074,132668,1,0,252660,642,1412,285255,284,2430,399327
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F((F((F(X("(i5.u18.p57==1)")))&&("((u10.p31!=1)||(i5.u18.p57!=1))")))U(F("((i2.u6.p19==1)&&(i2.u6.p21==1))"))))))
Formula 6 simplified : !GF(F("((u10.p31!=1)||(i5.u18.p57!=1))" & FX"(i5.u18.p57==1)") U F"((i2.u6.p19==1)&&(i2.u6.p21==1))")
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 19:03:32] [INFO ] Computation of Finished co-enabling matrix. took 3225 ms. Total solver calls (SAT/UNSAT): 766(7/759)
[2020-05-27 19:03:32] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2020-05-27 19:03:32] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:03:32] [INFO ] Built C files in 5264ms 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]
47 unique states visited
47 strongly connected components in search stack
48 transitions explored
47 items max in DFS search stack
66 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,4.98296,155900,1,0,305485,647,1458,339214,288,2461,471069
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(X(!(X((X("((i7.u0.p3==1)&&(i3.u8.p22==1))"))U("((i7.u0.p3!=1)||(i3.u8.p22!=1))"))))))))
Formula 7 simplified : !G!X!X(X"((i7.u0.p3==1)&&(i3.u8.p22==1))" U "((i7.u0.p3!=1)||(i3.u8.p22!=1))")
Computing Next relation with stutter on 3 deadlock states
130 unique states visited
130 strongly connected components in search stack
131 transitions explored
130 items max in DFS search stack
45 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,5.429,165932,1,0,325756,648,1481,374664,288,2561,511308
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X((X(G(X("(u10.p31==1)"))))||("(i4.u13.p38==1)")))))
Formula 8 simplified : X("(i4.u13.p38==1)" | XGX"(u10.p31==1)")
Computing Next relation with stutter on 3 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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,5.43012,166196,1,0,325756,648,1502,374664,288,2561,511340
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(("(i8.u28.p76==1)")U(F("(i2.u7.p17==1)")))))
Formula 9 simplified : "(i8.u28.p76==1)" U F"(i2.u7.p17==1)"
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
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,5.55361,170156,1,0,335032,648,1513,386703,288,2562,528807
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(!(G((F((F("(i8.u28.p76==1)"))&&(("(i6.u20.p63==1)")U("(i8.u24.p70==1)"))))&&("(i6.u20.p63==1)"))))))
Formula 10 simplified : !X!G("(i6.u20.p63==1)" & F(F"(i8.u28.p76==1)" & ("(i6.u20.p63==1)" U "(i8.u24.p70==1)")))
Computing Next relation with stutter on 3 deadlock states
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,5.55605,170680,1,0,335032,648,1563,386703,288,2562,528855
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(("(i8.u28.p76==1)")U(G(((F("(i8.u28.p76==1)"))&&(G("(i3.u8.p23==1)")))&&("(i3.u8.p23==1)"))))))
Formula 11 simplified : !X("(i8.u28.p76==1)" U G("(i3.u8.p23==1)" & F"(i8.u28.p76==1)" & G"(i3.u8.p23==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,5.55874,170680,1,0,335054,648,1576,386739,288,2562,528966
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(((G("(i4.u13.p42!=1)"))||(X("((i2.u7.p20==1)&&(i6.u23.p67==1))")))U(X(X("((i2.u7.p20==1)&&(i6.u23.p67==1))"))))))
Formula 12 simplified : !X((G"(i4.u13.p42!=1)" | X"((i2.u7.p20==1)&&(i6.u23.p67==1))") U XX"((i2.u7.p20==1)&&(i6.u23.p67==1))")
Computing Next relation with stutter on 3 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
10 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,5.6716,173844,1,0,343174,648,1619,398480,288,2562,545590
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Compilation finished in 1175 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 69 ms.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1590606214642

--------------------
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-001B"
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-001B, 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-159033475900578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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