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

About the Execution of ITS-Tools for AutoFlight-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.860 33220.00 50719.00 388.80 TFFTFFFTFTFFFFTF 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-158897516100453.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-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897516100453
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1589555522440

[2020-05-15 15:12:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 15:12:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 15:12:04] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2020-05-15 15:12:04] [INFO ] Transformed 157 places.
[2020-05-15 15:12:04] [INFO ] Transformed 155 transitions.
[2020-05-15 15:12:04] [INFO ] Found NUPN structural information;
[2020-05-15 15:12:04] [INFO ] Parsed PT model containing 157 places and 155 transitions in 134 ms.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2800 resets, run finished after 479 ms. (steps per millisecond=208 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 125 rows 157 cols
[2020-05-15 15:12:05] [INFO ] Computed 40 place invariants in 12 ms
[2020-05-15 15:12:05] [INFO ] [Real]Absence check using 39 positive place invariants in 42 ms returned sat
[2020-05-15 15:12:05] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 15:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:12:05] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-05-15 15:12:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:12:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned unsat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2020-05-15 15:12:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:12:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned unsat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-05-15 15:12:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:12:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned unsat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-05-15 15:12:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:12:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 27 ms returned unsat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive place invariants in 26 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 15:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:12:07] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-05-15 15:12:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:12:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 28 ms returned sat
[2020-05-15 15:12:07] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-15 15:12:07] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-15 15:12:07] [INFO ] Flatten gal took : 67 ms
FORMULA AutoFlight-PT-06a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 15:12:07] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 15:12:07] [INFO ] Applying decomposition
[2020-05-15 15:12:07] [INFO ] Flatten gal took : 19 ms
[2020-05-15 15:12:07] [INFO ] Input system was already deterministic with 125 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/graph1592071421863370232.txt, -o, /tmp/graph1592071421863370232.bin, -w, /tmp/graph1592071421863370232.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/graph1592071421863370232.bin, -l, -1, -v, -w, /tmp/graph1592071421863370232.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 15:12:07] [INFO ] Decomposing Gal with order
[2020-05-15 15:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 125 rows 157 cols
[2020-05-15 15:12:07] [INFO ] Computed 40 place invariants in 7 ms
inv : p0 + p21 = 1
inv : p0 + p18 + p19 + p20 = 1
inv : p0 + p36 + p37 + p38 = 1
inv : p0 + p125 + p126 + p127 + p128 + p129 + p130 = 1
inv : p0 + p54 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p137 + p138 + p139 + p140 + p141 + p142 = 1
inv : p0 + p32 + p33 + p34 = 1
inv : p0 + p28 = 1
inv : p0 + p4 + p5 + p6 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p8 + p9 + p10 = 1
inv : p0 + p45 = 1
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p149 + p150 + p151 + p152 + p153 + p154 = 1
inv : p0 + p7 = 1
inv : p0 + p52 + p53 = 1
inv : 8*p0 + p92 + p118 + p124 + p130 + p136 + p142 + p148 + p154 + p156 = 8
inv : p0 + p48 = 1
inv : p0 + p143 + p144 + p145 + p146 + p147 + p148 = 1
inv : p0 + p58 + p59 = 1
inv : -7*p0 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 - p118 - p124 - p130 - p136 - p142 - p148 - p154 - p156 = -7
inv : p0 + p14 = 1
inv : p0 + p119 + p120 + p121 + p122 + p123 + p124 = 1
inv : p0 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 1
inv : p0 + p39 + p40 + p41 = 1
inv : p0 + p131 + p132 + p133 + p134 + p135 + p136 = 1
inv : p0 + p29 + p30 + p31 = 1
inv : p0 + p42 = 1
inv : p0 + p46 + p47 = 1
inv : p0 + p25 + p26 + p27 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p57 = 1
inv : p0 + p60 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p22 + p23 + p24 = 1
inv : p0 + p51 = 1
inv : p0 + p11 + p12 + p13 = 1
inv : p0 + p35 = 1
Total of 40 invariants.
[2020-05-15 15:12:07] [INFO ] Computed 40 place invariants in 8 ms
[2020-05-15 15:12:07] [INFO ] Removed a total of 12 redundant transitions.
[2020-05-15 15:12:07] [INFO ] Flatten gal took : 79 ms
[2020-05-15 15:12:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2020-05-15 15:12:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
[2020-05-15 15:12:07] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((!(G(X("((i0.i0.u47.p116==0)||(i12.i0.u18.p53==1))")))))
Formula 0 simplified : GX"((i0.i0.u47.p116==0)||(i12.i0.u18.p53==1))"
built 23 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 33 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
[2020-05-15 15:12:08] [INFO ] Proved 157 variables to be positive in 270 ms
[2020-05-15 15:12:08] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2020-05-15 15:12:08] [INFO ] Computation of disable matrix completed :0/125 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:12:08] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:12:08] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2020-05-15 15:12:08] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t142, t143, u11.t28, i0.i0.u10.t31, i2.u13.t25, i3.i1.u1.t55, i6.u0.t58, i6.u2.t52, i7.u4.t46, i7.u7.t40, i7.u9.t34, i10.u6.t43, i11.u3.t49, i12.i1.u8.t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/111/14/125
Computing Next relation with stutter on 12 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
33 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.375726,25764,1,0,17499,4201,1945,26168,602,11018,41686
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(i4.i0.u29.p71==1)"))))
Formula 1 simplified : !FG"(i4.i0.u29.p71==1)"
Computing Next relation with stutter on 12 deadlock states
[2020-05-15 15:12:08] [INFO ] Computing symmetric co enabling matrix : 125 transitions.
[2020-05-15 15:12:11] [INFO ] Computation of co-enabling matrix(85/125) took 2489 ms. Total solver calls (SAT/UNSAT): 1230(675/555)
[2020-05-15 15:12:12] [INFO ] Computation of Finished co-enabling matrix. took 3723 ms. Total solver calls (SAT/UNSAT): 1639(977/662)
[2020-05-15 15:12:12] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2020-05-15 15:12:12] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 31(0/31)
[2020-05-15 15:12:12] [INFO ] Built C files in 4848ms 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]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
411 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.4881,129012,1,0,265933,4788,1974,254796,604,19334,327418
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(F(G(X((G("((i2.u22.p153==0)||(i5.u33.p80==1))"))U(F("(((i10.u51.p134==0)||(i0.i0.u47.p115==1))&&((i5.u43.p106==0)||(i10.u5.p133==1)))"))))))))
Formula 2 simplified : FGX(G"((i2.u22.p153==0)||(i5.u33.p80==1))" U F"(((i10.u51.p134==0)||(i0.i0.u47.p115==1))&&((i5.u43.p106==0)||(i10.u5.p133==1)))")
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,4.54362,130832,1,0,268490,4920,2094,258488,606,20453,334804
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G("((i7.u36.p88==0)||(i5.u39.p97==1))"))))
Formula 3 simplified : !FG"((i7.u36.p88==0)||(i5.u39.p97==1))"
Computing Next relation with stutter on 12 deadlock states
Compilation finished in 2587 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 62 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAP4==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, -p, --pins-guards, --when, --ltl, <>([]((LTLAP4==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, -p, --pins-guards, --when, --ltl, <>([]((LTLAP4==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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1885 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,23.3982,533960,1,0,892083,5141,2133,1.11134e+06,606,24868,1317217
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(F("((i0.i1.u54.p146==0)||(i5.u37.p94==1))")))))
Formula 4 simplified : !FXF"((i0.i1.u54.p146==0)||(i5.u37.p94==1))"
Computing Next relation with stutter on 12 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,23.4,534224,1,0,892083,5141,2157,1.11134e+06,606,24868,1317245
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(X(F("((i12.i1.u8.p27==0)||(i6.u35.p86==1))")))))
Formula 5 simplified : XF"((i12.i1.u8.p27==0)||(i6.u35.p86==1))"
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,23.4514,535788,1,0,895781,5224,2195,1.11574e+06,607,25646,1325730
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(!(G("((i5.u44.p108==0)||(i4.i0.u27.p67==1))")))))
Formula 6 simplified : !X!G"((i5.u44.p108==0)||(i4.i0.u27.p67==1))"
Computing Next relation with stutter on 12 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,23.4893,536844,1,0,898237,5224,2239,1.11835e+06,607,25689,1331750
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((F(G("((i3.i0.u14.p44==0)||(i3.i1.u1.p6==1))")))U(X("((i12.i0.u19.p141==0)||(i6.u35.p85==1))")))U(G(F("((i5.u33.p14==0)||(i5.u39.p98==1))")))))
Formula 7 simplified : !((FG"((i3.i0.u14.p44==0)||(i3.i1.u1.p6==1))" U X"((i12.i0.u19.p141==0)||(i6.u35.p85==1))") U GF"((i5.u33.p14==0)||(i5.u39.p98==1))")
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.5486,540072,1,0,902318,5224,2266,1.12343e+06,607,25689,1337306
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589555555660

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-06a"
export BK_EXAMINATION="LTLCardinality"
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-06a, examination is LTLCardinality"
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-158897516100453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;