fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r006-smll-158897516000382
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for AutoFlight-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15748.050 26959.00 49468.00 482.10 FFFFTTFFTTTFFFFF 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-158897516000382.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-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897516000382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.0K Mar 25 23:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 23:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:22 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.3K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 10:41 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 26K 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-01b-00
FORMULA_NAME AutoFlight-PT-01b-01
FORMULA_NAME AutoFlight-PT-01b-02
FORMULA_NAME AutoFlight-PT-01b-03
FORMULA_NAME AutoFlight-PT-01b-04
FORMULA_NAME AutoFlight-PT-01b-05
FORMULA_NAME AutoFlight-PT-01b-06
FORMULA_NAME AutoFlight-PT-01b-07
FORMULA_NAME AutoFlight-PT-01b-08
FORMULA_NAME AutoFlight-PT-01b-09
FORMULA_NAME AutoFlight-PT-01b-10
FORMULA_NAME AutoFlight-PT-01b-11
FORMULA_NAME AutoFlight-PT-01b-12
FORMULA_NAME AutoFlight-PT-01b-13
FORMULA_NAME AutoFlight-PT-01b-14
FORMULA_NAME AutoFlight-PT-01b-15

=== Now, execution of the tool begins

BK_START 1589529788301

[2020-05-15 08:03:11] [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:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 08:03:11] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2020-05-15 08:03:11] [INFO ] Transformed 114 places.
[2020-05-15 08:03:11] [INFO ] Transformed 112 transitions.
[2020-05-15 08:03:11] [INFO ] Found NUPN structural information;
[2020-05-15 08:03:11] [INFO ] Parsed PT model containing 114 places and 112 transitions in 161 ms.
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 1493 resets, run finished after 517 ms. (steps per millisecond=193 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 112 rows 114 cols
[2020-05-15 08:03:12] [INFO ] Computed 10 place invariants in 13 ms
[2020-05-15 08:03:12] [INFO ] [Real]Absence check using 9 positive place invariants in 42 ms returned sat
[2020-05-15 08:03:12] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 08:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:03:12] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-15 08:03:12] [INFO ] Deduced a trap composed of 30 places in 143 ms
[2020-05-15 08:03:12] [INFO ] Deduced a trap composed of 31 places in 84 ms
[2020-05-15 08:03:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2020-05-15 08:03:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:03:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 64 ms returned sat
[2020-05-15 08:03:13] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 08:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:03:13] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-05-15 08:03:13] [INFO ] Deduced a trap composed of 30 places in 69 ms
[2020-05-15 08:03:13] [INFO ] Deduced a trap composed of 40 places in 49 ms
[2020-05-15 08:03:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2020-05-15 08:03:13] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 19 ms.
[2020-05-15 08:03:13] [INFO ] Added : 109 causal constraints over 23 iterations in 380 ms. Result :sat
[2020-05-15 08:03:13] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned unsat
[2020-05-15 08:03:13] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2020-05-15 08:03:13] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 08:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:03:13] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-05-15 08:03:14] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 12 ms.
[2020-05-15 08:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:03:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 121 ms returned sat
[2020-05-15 08:03:14] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 08:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:03:14] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-05-15 08:03:14] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 17 ms.
[2020-05-15 08:03:14] [INFO ] Added : 111 causal constraints over 23 iterations in 274 ms. Result :sat
[2020-05-15 08:03:14] [INFO ] Deduced a trap composed of 36 places in 55 ms
[2020-05-15 08:03:14] [INFO ] Deduced a trap composed of 34 places in 58 ms
[2020-05-15 08:03:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2020-05-15 08:03:14] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-15 08:03:14] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-15 08:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:03:14] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2020-05-15 08:03:14] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2020-05-15 08:03:15] [INFO ] Deduced a trap composed of 30 places in 60 ms
[2020-05-15 08:03:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2020-05-15 08:03:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:03:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 118 ms returned sat
[2020-05-15 08:03:15] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 08:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:03:15] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2020-05-15 08:03:15] [INFO ] Deduced a trap composed of 28 places in 66 ms
[2020-05-15 08:03:15] [INFO ] Deduced a trap composed of 30 places in 62 ms
[2020-05-15 08:03:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2020-05-15 08:03:15] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 12 ms.
[2020-05-15 08:03:15] [INFO ] Added : 109 causal constraints over 22 iterations in 331 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 08:03:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-15 08:03:16] [INFO ] Flatten gal took : 57 ms
FORMULA AutoFlight-PT-01b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 08:03:16] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 08:03:16] [INFO ] Applying decomposition
[2020-05-15 08:03:16] [INFO ] Flatten gal took : 20 ms
[2020-05-15 08:03:16] [INFO ] Input system was already deterministic with 112 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/graph11693335381420560080.txt, -o, /tmp/graph11693335381420560080.bin, -w, /tmp/graph11693335381420560080.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/graph11693335381420560080.bin, -l, -1, -v, -w, /tmp/graph11693335381420560080.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 08:03:16] [INFO ] Decomposing Gal with order
[2020-05-15 08:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 112 rows 114 cols
[2020-05-15 08:03:16] [INFO ] Computed 10 place invariants in 4 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 = 1
inv : p0 + p1 + p2 + p63 + p64 + p65 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 = 1
inv : p0 + p1 + p2 + p3 + p4 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p1 + p2 + p3 + p59 + p60 + p61 + p62 = 1
inv : 3*p0 + 3*p1 + 3*p2 + 3*p63 + 3*p64 + 2*p65 + p66 + p67 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p91 + p92 + p93 + p94 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p112 + p113 = 3
inv : p0 + p1 + p2 + p63 + p110 + p111 + p112 + p113 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p1 + p2 + p63 + p64 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 = 1
inv : -2*p0 - 2*p1 - 2*p2 - 2*p63 - 2*p64 - p65 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 - p82 - p83 - p91 - p92 - p93 - p94 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p112 - p113 = -2
Total of 10 invariants.
[2020-05-15 08:03:16] [INFO ] Computed 10 place invariants in 5 ms
[2020-05-15 08:03:16] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-15 08:03:16] [INFO ] Flatten gal took : 84 ms
[2020-05-15 08:03:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-15 08:03:16] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-15 08:03:16] [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(F("((((i4.i1.u21.p54==1)||(i4.i0.u22.p55==1))&&(i6.u32.p67==1))&&(i8.i0.u34.p82==1))"))))&&(!(G("(i8.i0.u34.p82==1)")))))
Formula 0 simplified : !(!XF"((((i4.i1.u21.p54==1)||(i4.i0.u22.p55==1))&&(i6.u32.p67==1))&&(i8.i0.u34.p82==1))" & !G"(i8.i0.u34.p82==1)")
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-15 08:03:16] [INFO ] Proved 114 variables to be positive in 261 ms
[2020-05-15 08:03:16] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2020-05-15 08:03:16] [INFO ] Computation of disable matrix completed :0/112 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 08:03:16] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 08:03:16] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2020-05-15 08:03:16] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t45, t106, t107, i1.i0.t92, i1.i0.u4.t0, i1.i0.u4.t1, i1.i0.u4.t2, i1.i0.u6.t85, i2.i1.t83, i2.i1.u8.t3, i2.i1.u8.t4, i2.i1.u8.t5, i2.i1.u10.t76, i3.t73, i3.i0.t7, i3.i0.t9, i3.i0.u11.t6, i3.i0.u11.t8, i3.i1.u16.t65, i4.i2.t50, i4.i2.u18.t60, i5.t47, i6.u32.t41, i6.u32.t44, i8.t108, i8.i0.t32, i8.i0.u35.t35, i8.i2.u47.t17, i9.i0.t26, i9.i0.u40.t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/82/30/112
Computing Next relation with stutter on 10 deadlock states
[2020-05-15 08:03:17] [INFO ] Computing symmetric co enabling matrix : 112 transitions.
72 unique states visited
72 strongly connected components in search stack
73 transitions explored
72 items max in DFS search stack
147 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.49363,50896,1,0,69978,198,1740,111071,149,528,126907
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(X(F("((i7.u28.p68==1)&&(i8.i2.u48.p112==1))"))))))
Formula 1 simplified : GXF"((i7.u28.p68==1)&&(i8.i2.u48.p112==1))"
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
152 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,3.028,93700,1,0,160038,200,1785,203920,149,579,261746
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(X(X(F(!(F(((("(i6.u27.p80==1)")U("(i1.i0.u6.p16==1)"))&&("(i4.i0.u19.p48==1)"))||(G("((i1.i1.u5.p15==1)&&(i10.u41.p97==1))")))))))))))
Formula 2 simplified : !XGXXF!F(("(i4.i0.u19.p48==1)" & ("(i6.u27.p80==1)" U "(i1.i0.u6.p16==1)")) | G"((i1.i1.u5.p15==1)&&(i10.u41.p97==1))")
Computing Next relation with stutter on 10 deadlock states
[2020-05-15 08:03:19] [INFO ] Computation of co-enabling matrix(41/112) took 1905 ms. Total solver calls (SAT/UNSAT): 1160(340/820)
[2020-05-15 08:03:21] [INFO ] Computation of Finished co-enabling matrix. took 3945 ms. Total solver calls (SAT/UNSAT): 1745(420/1325)
[2020-05-15 08:03:21] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2020-05-15 08:03:21] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 17(0/17)
[2020-05-15 08:03:21] [INFO ] Built C files in 5618ms 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]
209 unique states visited
163 strongly connected components in search stack
212 transitions explored
209 items max in DFS search stack
256 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.58856,149640,1,0,279377,200,1897,359688,151,586,448880
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!((G(X(F("(i9.i0.u44.p103==1)"))))U(X("(i4.i0.u19.p48==1)")))))
Formula 3 simplified : GXF"(i9.i0.u44.p103==1)" U X"(i4.i0.u19.p48==1)"
Computing Next relation with stutter on 10 deadlock states
74 unique states visited
73 strongly connected components in search stack
75 transitions explored
73 items max in DFS search stack
43 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,6.02685,162544,1,0,312607,206,1918,394158,151,637,489035
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F("(i3.i0.u13.p34==1)")))||(F(X("(i2.i0.u9.p23!=1)")))))
Formula 4 simplified : !(!F"(i3.i0.u13.p34==1)" | FX"(i2.i0.u9.p23!=1)")
Computing Next relation with stutter on 10 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,6.0283,162808,1,0,312607,206,1945,394158,151,637,489084
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA AutoFlight-PT-01b-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(((G("(i2.i0.u9.p26==1)"))&&("(i2.i0.u9.p26==1)"))&&((!(X("(i4.i0.u22.p55==1)")))||("((i3.i0.u14.p39==1)&&(i4.i0.u22.p55==1))"))))))
Formula 5 simplified : !GX("(i2.i0.u9.p26==1)" & G"(i2.i0.u9.p26==1)" & ("((i3.i0.u14.p39==1)&&(i4.i0.u22.p55==1))" | !X"(i4.i0.u22.p55==1)"))
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.03285,162808,1,0,312704,206,1985,394277,152,637,489467
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(!(X("((i8.i0.u34.p92==1)||(i6.u32.p77!=1))"))))||(F(X("((i8.i0.u34.p92==1)||(i3.i1.u17.p29==1))")))))
Formula 6 simplified : !(X!X"((i8.i0.u34.p92==1)||(i6.u32.p77!=1))" | FX"((i8.i0.u34.p92==1)||(i3.i1.u17.p29==1))")
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
3 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,6.06363,163828,1,0,316833,206,2035,396430,152,637,496756
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA AutoFlight-PT-01b-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(X((X("(i3.i0.u14.p39==1)"))||(X(X(X("(i1.i1.u5.p15!=1)")))))))))
Formula 7 simplified : !XFX(X"(i3.i0.u14.p39==1)" | XXX"(i1.i1.u5.p15!=1)")
Computing Next relation with stutter on 10 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 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,6.06516,164356,1,0,316857,206,2064,396437,152,637,496907
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA AutoFlight-PT-01b-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((!(X("(i3.i0.u14.p40==1)")))||(F(X(("(i2.i1.u8.p24!=1)")U("(i9.i1.u39.p109==1)")))))))
Formula 8 simplified : !F(!X"(i3.i0.u14.p40==1)" | FX("(i2.i1.u8.p24!=1)" U "(i9.i1.u39.p109==1)"))
Computing Next relation with stutter on 10 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,6.06603,164356,1,0,316857,206,2097,396437,152,637,496933
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA AutoFlight-PT-01b-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(X(F(X("(i3.i0.u11.p37==1)")))))||(!(F((G("(i7.u29.p71==1)"))U("(i7.u29.p71==1)"))))))
Formula 9 simplified : !(!XFX"(i3.i0.u11.p37==1)" | !F(G"(i7.u29.p71==1)" U "(i7.u29.p71==1)"))
Computing Next relation with stutter on 10 deadlock states
42 unique states visited
42 strongly connected components in search stack
42 transitions explored
42 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,6.27864,169884,1,0,333130,209,2164,410206,152,649,520881
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(X((X(!(G(X(F(G(F("(i7.u29.p71!=1)"))))))))U("((i4.i1.u20.p51!=1)||(i5.u43.p100!=1))")))))
Formula 10 simplified : X(X!GXFGF"(i7.u29.p71!=1)" U "((i4.i1.u20.p51!=1)||(i5.u43.p100!=1))")
Computing Next relation with stutter on 10 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,6.28061,170408,1,0,333130,209,2171,410206,152,649,520895
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(!((!(G((F(!(G(X("(i4.i0.u22.p56==1)")))))||("(i8.i1.u36.p85==1)"))))U("(i3.i1.u15.p41==1)")))))
Formula 11 simplified : !F!(!G("(i8.i1.u36.p85==1)" | F!GX"(i4.i0.u22.p56==1)") U "(i3.i1.u15.p41==1)")
Computing Next relation with stutter on 10 deadlock states
Compilation finished in 2551 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(!( (!( [](( <>(!( [](X((LTLAP24==true)))) )) || ( (LTLAP25==true)) )) )U((LTLAP26==true))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(!( (!( [](( <>(!( [](X((LTLAP24==true)))) )) || ( (LTLAP25==true)) )) )U((LTLAP26==true))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(!( (!( [](( <>(!( [](X((LTLAP24==true)))) )) || ( (LTLAP25==true)) )) )U((LTLAP26==true))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
84 unique states visited
58 strongly connected components in search stack
84 transitions explored
83 items max in DFS search stack
965 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,15.9367,395368,1,0,812592,213,2237,877985,152,689,1182657
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X(G("(i2.i1.u10.p18==1)")))))
Formula 12 simplified : !XXG"(i2.i1.u10.p18==1)"
Computing Next relation with stutter on 10 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,15.9402,395632,1,0,812683,213,2255,878103,152,689,1182936
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA AutoFlight-PT-01b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589529815260

--------------------
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-01b"
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-01b, 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-158897516000382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01b.tgz
mv AutoFlight-PT-01b 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 ;