About the Execution of ITS-Tools for AutoFlight-PT-03a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15740.690 | 5709.00 | 11982.00 | 154.50 | FFTFFTFFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r006-smll-158897516000406.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 AutoFlight-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897516000406
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.6K Mar 25 23:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 23:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 10:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 10:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 23K Mar 24 05:37 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 AutoFlight-PT-03a-00
FORMULA_NAME AutoFlight-PT-03a-01
FORMULA_NAME AutoFlight-PT-03a-02
FORMULA_NAME AutoFlight-PT-03a-03
FORMULA_NAME AutoFlight-PT-03a-04
FORMULA_NAME AutoFlight-PT-03a-05
FORMULA_NAME AutoFlight-PT-03a-06
FORMULA_NAME AutoFlight-PT-03a-07
FORMULA_NAME AutoFlight-PT-03a-08
FORMULA_NAME AutoFlight-PT-03a-09
FORMULA_NAME AutoFlight-PT-03a-10
FORMULA_NAME AutoFlight-PT-03a-11
FORMULA_NAME AutoFlight-PT-03a-12
FORMULA_NAME AutoFlight-PT-03a-13
FORMULA_NAME AutoFlight-PT-03a-14
FORMULA_NAME AutoFlight-PT-03a-15
=== Now, execution of the tool begins
BK_START 1589531055351
[2020-05-15 08:24:17] [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-15 08:24:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 08:24:17] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2020-05-15 08:24:17] [INFO ] Transformed 82 places.
[2020-05-15 08:24:17] [INFO ] Transformed 80 transitions.
[2020-05-15 08:24:17] [INFO ] Found NUPN structural information;
[2020-05-15 08:24:17] [INFO ] Parsed PT model containing 82 places and 80 transitions in 167 ms.
Ensure Unique test removed 15 transitions
Reduce redundant transitions removed 15 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3664 resets, run finished after 515 ms. (steps per millisecond=194 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 65 rows 82 cols
[2020-05-15 08:24:18] [INFO ] Computed 22 place invariants in 7 ms
[2020-05-15 08:24:18] [INFO ] [Real]Absence check using 21 positive place invariants in 28 ms returned sat
[2020-05-15 08:24:18] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 08:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:24:18] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-15 08:24:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2020-05-15 08:24:18] [INFO ] [Real]Added 15 Read/Feed constraints in 5 ms returned sat
[2020-05-15 08:24:18] [INFO ] Computed and/alt/rep : 64/181/64 causal constraints in 11 ms.
[2020-05-15 08:24:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:24:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-05-15 08:24:18] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 08:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:24:18] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-05-15 08:24:18] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-05-15 08:24:18] [INFO ] Computed and/alt/rep : 64/181/64 causal constraints in 10 ms.
[2020-05-15 08:24:18] [INFO ] Added : 49 causal constraints over 10 iterations in 131 ms. Result :sat
[2020-05-15 08:24:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-15 08:24:19] [INFO ] Flatten gal took : 50 ms
FORMULA AutoFlight-PT-03a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 08:24:19] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 08:24:19] [INFO ] Applying decomposition
[2020-05-15 08:24:19] [INFO ] Flatten gal took : 13 ms
[2020-05-15 08:24:19] [INFO ] Input system was already deterministic with 65 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/graph13689530812360702985.txt, -o, /tmp/graph13689530812360702985.bin, -w, /tmp/graph13689530812360702985.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/graph13689530812360702985.bin, -l, -1, -v, -w, /tmp/graph13689530812360702985.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 08:24:19] [INFO ] Decomposing Gal with order
[2020-05-15 08:24:19] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 65 rows 82 cols
[2020-05-15 08:24:19] [INFO ] Computed 22 place invariants in 3 ms
inv : p0 + p21 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p18 + p19 + p20 = 1
[2020-05-15 08:24:19] [INFO ] Removed a total of 6 redundant transitions.
inv : p0 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 = 1
inv : p0 + p62 + p63 + p64 + p65 + p66 + p67 = 1
inv : p0 + p24 = 1
inv : p0 + p4 + p5 + p6 = 1
inv : p0 + p68 + p69 + p70 + p71 + p72 + p73 = 1
inv : p0 + p8 + p9 + p10 = 1
inv : -4*p0 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 - p61 - p67 - p73 - p79 - p81 = -4
inv : 5*p0 + p47 + p61 + p67 + p73 + p79 + p81 = 5
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p27 = 1
inv : p0 + p7 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p30 = 1
inv : p0 + p14 = 1
inv : p0 + p80 + p81 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p11 + p12 + p13 = 1
inv : p0 + p74 + p75 + p76 + p77 + p78 + p79 = 1
Total of 22 invariants.
[2020-05-15 08:24:19] [INFO ] Computed 22 place invariants in 15 ms
[2020-05-15 08:24:19] [INFO ] Flatten gal took : 48 ms
[2020-05-15 08:24:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-15 08:24:19] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-15 08:24:19] [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(("(u4.p16!=1)")&&((F(!(("(((u4.p16==1)&&(i9.u8.p28==1))&&(i9.u9.p77==1))")U(G("(i2.u7.p26==1)")))))||(G("((i9.u8.p28==1)&&(i9.u9.p77==1))"))))))
Formula 0 simplified : !X("(u4.p16!=1)" & (F!("(((u4.p16==1)&&(i9.u8.p28==1))&&(i9.u9.p77==1))" U G"(i2.u7.p26==1)") | G"((i9.u8.p28==1)&&(i9.u9.p77==1))"))
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t72, t73, u0.t28, u4.t16, i1.u3.t19, i7.u1.t25, i8.u2.t22, i9.u5.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/57/8/65
Computing Next relation with stutter on 6 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.093613,19948,1,0,3469,1469,1165,4388,424,2730,9482
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((!((G("((i7.u23.p24==1)&&(i7.u23.p66==1))"))U("(i8.u2.p10==1)")))||(X("((i7.u23.p24==1)&&(i7.u23.p66==1))"))))))
Formula 1 simplified : !FG(!(G"((i7.u23.p24==1)&&(i7.u23.p66==1))" U "(i8.u2.p10==1)") | X"((i7.u23.p24==1)&&(i7.u23.p66==1))")
Computing Next relation with stutter on 6 deadlock states
[2020-05-15 08:24:19] [INFO ] Proved 82 variables to be positive in 210 ms
3 unique states visited
2 strongly connected components in search stack
4 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.12066,20916,1,0,5151,1724,1244,6689,428,3655,13649
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(F(G(X(((G("((i4.i0.u11.p21==1)&&(i5.u12.p34==1))"))&&(F("((i1.u3.p13==1)&&(i2.u24.p70==1))")))&&("(i2.u7.p26==1)"))))))))
Formula 2 simplified : !F!FGX("(i2.u7.p26==1)" & G"((i4.i0.u11.p21==1)&&(i5.u12.p34==1))" & F"((i1.u3.p13==1)&&(i2.u24.p70==1))")
Computing Next relation with stutter on 6 deadlock states
[2020-05-15 08:24:19] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2020-05-15 08:24:19] [INFO ] Computation of disable matrix completed :0/65 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 08:24:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 08:24:19] [INFO ] Computing symmetric may enable matrix : 65 transitions.
3 unique states visited
0 strongly connected components in search stack
4 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,0.126681,21336,1,0,5599,1724,1320,6992,428,3655,15047
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(G("(i5.u14.p38==1)")))&&(!(X(F(((!(G(F("((i4.i0.u11.p21==1)&&(i4.i0.u16.p43==1))"))))||("(u27.p67!=1)"))||("(u27.p80!=1)")))))))
Formula 3 simplified : !(XG"(i5.u14.p38==1)" & !XF("(u27.p67!=1)" | "(u27.p80!=1)" | !GF"((i4.i0.u11.p21==1)&&(i4.i0.u16.p43==1))"))
Computing Next relation with stutter on 6 deadlock states
[2020-05-15 08:24:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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,0.13161,21588,1,0,5753,1729,1368,7182,434,3695,15457
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(X("((u27.p79==1)&&(u27.p80==1))")))||(!(X(G((X("(i4.i1.u19.p52==1)"))U(F(G(F("(i4.i1.u19.p52==1)"))))))))))
Formula 4 simplified : !(GX"((u27.p79==1)&&(u27.p80==1))" | !XG(X"(i4.i1.u19.p52==1)" U FGF"(i4.i1.u19.p52==1)"))
Computing Next relation with stutter on 6 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
13 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.26832,26720,1,0,16982,1764,1419,24479,439,4302,34821
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(X(F(("(i7.u1.p6==1)")U("(i1.u3.p13==1)")))))))
Formula 5 simplified : !GXXF("(i7.u1.p6==1)" U "(i1.u3.p13==1)")
Computing Next relation with stutter on 6 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.30436,28040,1,0,19976,1765,1449,27262,439,4317,40194
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F("((i4.i0.u15.p14==1)&&(i4.i0.u16.p42==1))"))))
Formula 6 simplified : F"((i4.i0.u15.p14==1)&&(i4.i0.u16.p42==1))"
Computing Next relation with stutter on 6 deadlock states
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,0.317468,28568,1,0,21081,1768,1470,28430,439,4363,43387
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((F(X(X((!(G(F("((i8.u2.p10==1)&&(i2.u24.p69==1))"))))||("((i9.u5.p18==1)&&(u27.p60==1))")))))U(F("((i8.u2.p10==1)&&(i2.u24.p69==1))")))))
Formula 7 simplified : !F(FXX("((i9.u5.p18==1)&&(u27.p60==1))" | !GF"((i8.u2.p10==1)&&(i2.u24.p69==1))") U F"((i8.u2.p10==1)&&(i2.u24.p69==1))")
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.3265,28832,1,0,22043,1768,1496,29331,439,4363,45304
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(("(u4.p17==1)")U("((i4.i0.u11.p21==1)&&(i4.i0.u20.p57==1))"))))
Formula 8 simplified : !F("(u4.p17==1)" U "((i4.i0.u11.p21==1)&&(i4.i0.u20.p57==1))")
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.33103,29096,1,0,22384,1768,1519,29741,439,4363,46138
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(X(G("((u0.p1==1)&&(i8.u17.p44==1))"))))))
Formula 9 simplified : !XXXG"((u0.p1==1)&&(i8.u17.p44==1))"
Computing Next relation with stutter on 6 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.338784,29360,1,0,23013,1770,1540,30360,439,4454,47601
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(G(F("((i9.u8.p28==1)&&(i9.u9.p77==1))"))))&&(!((F("(i7.u1.p6==1)"))U("(i7.u1.p6==1)")))))
Formula 10 simplified : !(!GF"((i9.u8.p28==1)&&(i9.u9.p77==1))" & !(F"(i7.u1.p6==1)" U "(i7.u1.p6==1)"))
Computing Next relation with stutter on 6 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 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.394984,30936,1,0,26811,1770,1571,36151,439,4463,53455
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((G(F("(((i1.u3.p13!=1)||(i2.u24.p70!=1))&&(i8.u2.p9==1))")))&&(("(i8.u2.p9==1)")U(G("(i8.u2.p9==1)"))))))
Formula 11 simplified : !X(GF"(((i1.u3.p13!=1)||(i2.u24.p70!=1))&&(i8.u2.p9==1))" & ("(i8.u2.p9==1)" U G"(i8.u2.p9==1)"))
Computing Next relation with stutter on 6 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,0.396917,31444,1,0,26811,1770,1586,36151,439,4463,53474
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA AutoFlight-PT-03a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X(F("(((i4.i1.u10.p31!=1)||(u27.p81!=1))||((i4.i0.u11.p21==1)&&(i4.i0.u20.p57==1)))")))))
Formula 12 simplified : !XXF"(((i4.i1.u10.p31!=1)||(u27.p81!=1))||((i4.i0.u11.p21==1)&&(i4.i0.u20.p57==1)))"
Computing Next relation with stutter on 6 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,0.398007,31444,1,0,26811,1770,1612,36152,440,4463,53523
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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-15 08:24:20] [INFO ] Built C files in 711ms 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 1589531061060
--------------------
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="AutoFlight-PT-03a"
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 AutoFlight-PT-03a, 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 r006-smll-158897516000406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03a.tgz
mv AutoFlight-PT-03a 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 '
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 ;