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-159033475400226.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 ShieldIIPt-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-159033475400226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.8K May 14 00:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 00:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.9K May 13 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 07:59 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 17K 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 ShieldIIPt-PT-001B-00
FORMULA_NAME ShieldIIPt-PT-001B-01
FORMULA_NAME ShieldIIPt-PT-001B-02
FORMULA_NAME ShieldIIPt-PT-001B-03
FORMULA_NAME ShieldIIPt-PT-001B-04
FORMULA_NAME ShieldIIPt-PT-001B-05
FORMULA_NAME ShieldIIPt-PT-001B-06
FORMULA_NAME ShieldIIPt-PT-001B-07
FORMULA_NAME ShieldIIPt-PT-001B-08
FORMULA_NAME ShieldIIPt-PT-001B-09
FORMULA_NAME ShieldIIPt-PT-001B-10
FORMULA_NAME ShieldIIPt-PT-001B-11
FORMULA_NAME ShieldIIPt-PT-001B-12
FORMULA_NAME ShieldIIPt-PT-001B-13
FORMULA_NAME ShieldIIPt-PT-001B-14
FORMULA_NAME ShieldIIPt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1590578506469

[2020-05-27 11:21:48] [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 11:21:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 11:21:48] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-05-27 11:21:48] [INFO ] Transformed 73 places.
[2020-05-27 11:21:48] [INFO ] Transformed 68 transitions.
[2020-05-27 11:21:48] [INFO ] Found NUPN structural information;
[2020-05-27 11:21:48] [INFO ] Parsed PT model containing 73 places and 68 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=724 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 68 rows 73 cols
[2020-05-27 11:21:48] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-27 11:21:48] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned unsat
[2020-05-27 11:21:48] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-27 11:21:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 11:21:48] [INFO ] Flatten gal took : 28 ms
FORMULA ShieldIIPt-PT-001B-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 11:21:48] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 11:21:48] [INFO ] Applying decomposition
[2020-05-27 11:21:48] [INFO ] Flatten gal took : 24 ms
[2020-05-27 11:21:48] [INFO ] Input system was already deterministic with 68 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/graph1536837812375512696.txt, -o, /tmp/graph1536837812375512696.bin, -w, /tmp/graph1536837812375512696.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/graph1536837812375512696.bin, -l, -1, -v, -w, /tmp/graph1536837812375512696.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 11:21:49] [INFO ] Decomposing Gal with order
[2020-05-27 11:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 68 rows 73 cols
[2020-05-27 11:21:49] [INFO ] Computed 10 place invariants in 1 ms
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p15 + p16 + p17 + p18 + p19 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p25 + p26 + p27 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p22 + p23 + p24 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 = 1
inv : p0 + p4 + p5 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 = 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 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p4 + p5 + p6 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 = 1
inv : p0 + p4 + p5 + p6 + p7 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 = 1
Total of 10 invariants.
[2020-05-27 11:21:49] [INFO ] Computed 10 place invariants in 3 ms
[2020-05-27 11:21:49] [INFO ] Removed a total of 5 redundant transitions.
[2020-05-27 11:21:49] [INFO ] Flatten gal took : 55 ms
[2020-05-27 11:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 11:21:49] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-27 11:21:49] [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 13 LTL properties
Checking formula 0 : !((!(G(F(((!(F("(i6.u25.p65==1)")))||(!(G("(i2.u9.p28==1)"))))||(F("(i7.u2.p6==1)")))))))
Formula 0 simplified : GF(!F"(i6.u25.p65==1)" | !G"(i2.u9.p28==1)" | F"(i7.u2.p6==1)")
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-27 11:21:49] [INFO ] Proved 73 variables to be positive in 175 ms
[2020-05-27 11:21:49] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2020-05-27 11:21:49] [INFO ] Computation of disable matrix completed :0/68 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:21:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:21:49] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2020-05-27 11:21:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t50, t52, i0.u5.t54, i1.t48, i1.u4.t55, i1.u8.t49, i2.t39, i2.u10.t44, i2.u10.t46, i2.u12.t40, i2.u12.t47, i3.t29, i3.u15.t33, i3.u15.t35, i4.t24, i4.t17, i4.u19.t18, i4.u19.t25, i4.u20.t22, i5.u0.t56, i5.u7.t51, i6.t12, i6.t5, i6.u24.t6, i6.u24.t13, i6.u25.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/42/26/68
Computing Next relation with stutter on 1 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 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,0.171794,23480,1,0,12298,307,1078,19593,202,787,30920
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(X((!(G("(i4.u18.p52==1)")))&&("(i1.u3.p10!=1)"))))))
Formula 1 simplified : !GFX("(i1.u3.p10!=1)" & !G"(i4.u18.p52==1)")
Computing Next relation with stutter on 1 deadlock states
24 unique states visited
24 strongly connected components in search stack
25 transitions explored
24 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.194766,24428,1,0,14174,310,1132,21985,204,799,35978
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X((G(F(G(!(X(X("(i3.u13.p40==1)")))))))&&(G(F("(i0.u5.p16==1)")))))))
Formula 2 simplified : !GX(GFG!XX"(i3.u13.p40==1)" & GF"(i0.u5.p16==1)")
Computing Next relation with stutter on 1 deadlock states
27 unique states visited
27 strongly connected components in search stack
29 transitions explored
27 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,0.204041,25476,1,0,15052,311,1160,23296,204,811,37498
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X(G("((i0.u6.p20==1)&&(i4.u20.p59==1))")))||((F(X("((i0.u5.p19==1)&&(i0.u5.p21==1))")))U(X(F(X(G("(i7.u2.p8==1)")))))))))
Formula 3 simplified : !X(XG"((i0.u6.p20==1)&&(i4.u20.p59==1))" | (FX"((i0.u5.p19==1)&&(i0.u5.p21==1))" U XFXG"(i7.u2.p8==1)"))
Computing Next relation with stutter on 1 deadlock states
[2020-05-27 11:21:50] [INFO ] Computing symmetric co enabling matrix : 68 transitions.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,0.861843,51764,1,0,71118,352,1206,86560,206,1136,95024
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((!(X((F("(i7.u2.p8==1)"))&&(("(i7.u2.p6==1)")U(("(i6.u21.p62==1)")U("(i7.u2.p6==1)"))))))||("(i6.u25.p65==1)"))))
Formula 4 simplified : !G("(i6.u25.p65==1)" | !X(F"(i7.u2.p8==1)" & ("(i7.u2.p6==1)" U ("(i6.u21.p62==1)" U "(i7.u2.p6==1)"))))
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.866085,52176,1,0,71158,352,1296,86622,214,1136,95429
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(F(("(i7.u2.p7==1)")U("(i2.u12.p36==1)"))))U((X("(i2.u12.p36==1)"))&&(G("((i2.u12.p36==1)||(i2.u12.p35==1))")))))
Formula 5 simplified : !(!F("(i7.u2.p7==1)" U "(i2.u12.p36==1)") U (X"(i2.u12.p36==1)" & G"((i2.u12.p36==1)||(i2.u12.p35==1))"))
Computing Next relation with stutter on 1 deadlock states
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,0.868567,52400,1,0,71158,352,1308,86622,216,1136,95446
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(((X(F((X(!(X("(i4.u19.p58==1)"))))&&("(i5.u0.p2==1)"))))&&(X("(i4.u19.p58==1)")))&&("(i4.u19.p58==1)")))))
Formula 6 simplified : !FX("(i4.u19.p58==1)" & X"(i4.u19.p58==1)" & XF("(i5.u0.p2==1)" & X!X"(i4.u19.p58==1)"))
Computing Next relation with stutter on 1 deadlock states
34 unique states visited
34 strongly connected components in search stack
34 transitions explored
34 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.892865,53388,1,0,73958,352,1344,89767,216,1137,102492
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X((F("(i2.u11.p34==1)"))U("(i3.u15.p45==1)")))))
Formula 7 simplified : !FX(F"(i2.u11.p34==1)" U "(i3.u15.p45==1)")
Computing Next relation with stutter on 1 deadlock states
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.912322,53916,1,0,75139,352,1360,91095,216,1137,105169
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G(X((G("(i6.u24.p70==1)"))||("(i0.u6.p17==1)"))))))
Formula 8 simplified : !XGX("(i0.u6.p17==1)" | G"(i6.u24.p70==1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 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,0.913773,54444,1,0,75144,352,1384,91106,216,1137,105250
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(X(G(X("(i6.u22.p68==1)")))))||(G("(i4.u17.p55==1)"))))
Formula 9 simplified : !(FXGX"(i6.u22.p68==1)" | G"(i4.u17.p55==1)")
Computing Next relation with stutter on 1 deadlock states
60 unique states visited
23 strongly connected components in search stack
61 transitions explored
57 items max in DFS search stack
60 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.51321,73448,1,0,114416,354,1415,158501,216,1168,175434
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G(("(i2.u9.p39==1)")U(G(!(G((F("(i3.u15.p45!=1)"))U(F("(i2.u12.p36==1)"))))))))))
Formula 10 simplified : G("(i2.u9.p39==1)" U G!G(F"(i3.u15.p45!=1)" U F"(i2.u12.p36==1)"))
Computing Next relation with stutter on 1 deadlock states
24 unique states visited
24 strongly connected components in search stack
25 transitions explored
24 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,1.61054,78192,1,0,126102,370,1431,168614,216,1229,189918
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((!(G(X("(i4.u18.p56==1)"))))||(G("(i2.u11.p32==1)")))))
Formula 11 simplified : !X(!GX"(i4.u18.p56==1)" | G"(i2.u11.p32==1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,1.61149,78456,1,0,126102,370,1449,168614,216,1229,189947
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-001B-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((!(X(G(X(G("(i6.u24.p63==1)"))))))&&(X("((i2.u9.p38==1)&&(i4.u16.p50!=1))"))))
Formula 12 simplified : !(!XGXG"(i6.u24.p63==1)" & X"((i2.u9.p38==1)&&(i4.u16.p50!=1))")
Computing Next relation with stutter on 1 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.6124,78456,1,0,126103,370,1458,168617,216,1229,189981
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-001B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-27 11:21:51] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-27 11:21:51] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 0) (select s0 4) (select s0 5) (select s0 6) (select s0 7) (select s0 8) (select s0 9) (select s0 10) (select s0 11) (select s0 15) (select s0 16) (select s0 17) (select s0 18) (select s0 19)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 0) (select s0 4) (select s0 5) (select s0 6) (select s0 7) (select s0 8) (select s0 9) (select s0 10) (select s0 11) (select s0 15) (select s0 16) (select s0 17) (select s0 18) (select s0 19)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 0) (select s0 4) (select s0 5) (select s0 6) (select s0 7) (select s0 8) (select s0 9) (select s0 10) (select s0 11) (select s0 15) (select s0 16) (select s0 17) (select s0 18) (select s0 19)))), (assert (= 1 (+ (select s0 0) (select s0 4) (select s0 5) (select s0 6) (select s0 7) (select s0 8) (select s0 9) (select s0 25) (select s0 26) (select s0 27)))), (assert (= 1 (+ (select s0 0) (select s0 4) (select s0 5) (select s0 6) (select s0 7) (select s0 8) (select s0 9) (select s0 10) (select s0 22) (select s0 23) (select s0 24)))), (assert (= 1 (+ (select s0 0) (select s0 4) (select s0 5) (select s0 6) (select s0 7) (select s0 8) (select s0 9) (select s0 10) (select s0 11) (select s0 15) (select s0 16) (select s0 17) (select s0 20) (select s0 21)))), (assert (= 1 (+ (select s0 0) (select s0 4) (select s0 5) (select s0 6) (select s0 7) (select s0 8) (select s0 9) (select s0 10) (select s0 11) (select s0 12) (select s0 13) (select s0 14)))), (assert (>= (select s0 9) 1)), (assert (>= (select s0 0) 0)), (assert (>= (select s0 4) 0)), (assert (>= (select s0 5) 0)), (assert (>= (select s0 6) 0)), (assert (>= (select s0 7) 0)), (assert (>= (select s0 8) 0)), (assert (>= (select s0 9) 0)), (assert (>= (select s0 10) 0)), (assert (>= (select s0 11) 0)), (assert (>= (select s0 12) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 14) 0)), (assert (>= (select s0 15) 0)), (assert (>= (select s0 16) 0)), (assert (>= (select s0 17) 0)), (assert (>= (select s0 18) 0)), (assert (>= (select s0 19) 0)), (assert (>= (select s0 20) 0)), (assert (>= (select s0 21) 0)), (assert (>= (select s0 22) 0)), (assert (>= (select s0 23) 0)), (assert (>= (select s0 24) 0)), (assert (>= (select s0 25) 0)), (assert (>= (select s0 26) 0)), (assert (>= (select s0 27) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@608186a1
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@608186a1
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 11:21:51] [INFO ] Built C files in 2217ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590578511380

--------------------
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="ShieldIIPt-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 ShieldIIPt-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-159033475400226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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