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-158897516000421.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-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897516000421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.2K Mar 25 23:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 23:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 18:26 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.6K Mar 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 10:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 29K 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-04a-00
FORMULA_NAME AutoFlight-PT-04a-01
FORMULA_NAME AutoFlight-PT-04a-02
FORMULA_NAME AutoFlight-PT-04a-03
FORMULA_NAME AutoFlight-PT-04a-04
FORMULA_NAME AutoFlight-PT-04a-05
FORMULA_NAME AutoFlight-PT-04a-06
FORMULA_NAME AutoFlight-PT-04a-07
FORMULA_NAME AutoFlight-PT-04a-08
FORMULA_NAME AutoFlight-PT-04a-09
FORMULA_NAME AutoFlight-PT-04a-10
FORMULA_NAME AutoFlight-PT-04a-11
FORMULA_NAME AutoFlight-PT-04a-12
FORMULA_NAME AutoFlight-PT-04a-13
FORMULA_NAME AutoFlight-PT-04a-14
FORMULA_NAME AutoFlight-PT-04a-15

=== Now, execution of the tool begins

BK_START 1589537640919

[2020-05-15 10:14:03] [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 10:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 10:14:03] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2020-05-15 10:14:03] [INFO ] Transformed 107 places.
[2020-05-15 10:14:03] [INFO ] Transformed 105 transitions.
[2020-05-15 10:14:03] [INFO ] Found NUPN structural information;
[2020-05-15 10:14:03] [INFO ] Parsed PT model containing 107 places and 105 transitions in 135 ms.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3260 resets, run finished after 463 ms. (steps per millisecond=215 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 85 rows 107 cols
[2020-05-15 10:14:04] [INFO ] Computed 28 place invariants in 8 ms
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using 27 positive place invariants in 31 ms returned sat
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 10:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2020-05-15 10:14:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned unsat
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using 27 positive place invariants in 21 ms returned sat
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 10:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-05-15 10:14:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 18 ms returned unsat
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 10:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:04] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-05-15 10:14:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned unsat
[2020-05-15 10:14:05] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:05] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2020-05-15 10:14:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:05] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2020-05-15 10:14:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-05-15 10:14:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:14:05] [INFO ] Computed and/alt/rep : 84/244/84 causal constraints in 23 ms.
[2020-05-15 10:14:05] [INFO ] Added : 63 causal constraints over 13 iterations in 258 ms. Result :sat
[2020-05-15 10:14:05] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:05] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-05-15 10:14:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:05] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-15 10:14:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:14:05] [INFO ] Computed and/alt/rep : 84/244/84 causal constraints in 9 ms.
[2020-05-15 10:14:06] [INFO ] Added : 63 causal constraints over 13 iterations in 194 ms. Result :sat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-15 10:14:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned unsat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive place invariants in 16 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2020-05-15 10:14:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned unsat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-05-15 10:14:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned unsat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive place invariants in 21 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2020-05-15 10:14:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned unsat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 10:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:14:06] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-15 10:14:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:14:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-05-15 10:14:07] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-15 10:14:07] [INFO ] Flatten gal took : 80 ms
FORMULA AutoFlight-PT-04a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 10:14:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 10:14:07] [INFO ] Flatten gal took : 27 ms
[2020-05-15 10:14:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-04a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 10:14:07] [INFO ] Applying decomposition
[2020-05-15 10:14:07] [INFO ] Flatten gal took : 24 ms
[2020-05-15 10:14:07] [INFO ] Input system was already deterministic with 85 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/graph10053551838066451255.txt, -o, /tmp/graph10053551838066451255.bin, -w, /tmp/graph10053551838066451255.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 85 rows 107 cols
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10053551838066451255.bin, -l, -1, -v, -w, /tmp/graph10053551838066451255.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 10:14:07] [INFO ] Computed 28 place invariants in 12 ms
inv : p0 + p21 = 1
inv : p0 + p35 + p36 = 1
inv : p0 + p18 + p19 + p20 = 1
inv : p0 + p34 = 1
inv : p0 + p28 = 1
inv : p0 + p4 + p5 + p6 = 1
inv : p0 + p93 + p94 + p95 + p96 + p97 + p98 = 1
inv : p0 + p25 + p26 + p27 = 1
inv : 6*p0 + p62 + p80 + p86 + p92 + p98 + p104 + p106 = 6
inv : p0 + p8 + p9 + p10 = 1
inv : p0 + p37 = 1
inv : -5*p0 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 - p80 - p86 - p92 - p98 - p104 - p106 = -5
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p31 = 1
inv : p0 + p7 = 1
inv : p0 + p81 + p82 + p83 + p84 + p85 + p86 = 1
inv : p0 + p32 + p33 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p0 + p87 + p88 + p89 + p90 + p91 + p92 = 1
inv : p0 + p40 = 1
inv : p0 + p22 + p23 + p24 = 1
inv : p0 + p99 + p100 + p101 + p102 + p103 + p104 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p14 = 1
inv : p0 + p38 + p39 = 1
inv : p0 + p11 + p12 + p13 = 1
Total of 28 invariants.
[2020-05-15 10:14:07] [INFO ] Computed 28 place invariants in 14 ms
[2020-05-15 10:14:07] [INFO ] Decomposing Gal with order
[2020-05-15 10:14:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 10:14:07] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-15 10:14:07] [INFO ] Flatten gal took : 99 ms
[2020-05-15 10:14:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-05-15 10:14:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 17 ms
[2020-05-15 10:14: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 9 LTL properties
Checking formula 0 : !(((X(X((((X((G("(i5.i1.u2.p7==1)"))&&("(i5.i1.u2.p7==1)")))||("(i5.i1.u2.p7==0)"))||("(i1.u3.p9==1)"))||("(i9.i1.u13.p97!=1)"))))U(X("((i5.i1.u2.p7==0)||(i1.u3.p9==1))"))))
Formula 0 simplified : !(XX("(i1.u3.p9==1)" | "(i5.i1.u2.p7==0)" | "(i9.i1.u13.p97!=1)" | X("(i5.i1.u2.p7==1)" & G"(i5.i1.u2.p7==1)")) U X"((i5.i1.u2.p7==0)||(i1.u3.p9==1))")
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 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 6 ordering constraints for composite.
built 6 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 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-15 10:14:08] [INFO ] Proved 107 variables to be positive in 432 ms
[2020-05-15 10:14:08] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2020-05-15 10:14:08] [INFO ] Computation of disable matrix completed :0/85 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:14:08] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:14:08] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2020-05-15 10:14:08] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t95, t96, i1.u3.t32, i1.u5.t26, i2.i0.u4.t29, i3.u7.t20, i3.u9.t17, i7.u0.t38, i8.i0.u1.t35, i9.i0.u6.t23, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/10/85
Computing Next relation with stutter on 8 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.176544,21008,1,0,6729,1196,1313,9406,468,1907,15554
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(G(((!(X("((i9.i0.u6.p19==0)||(u36.p105==1))")))&&("(i9.i0.u30.p78!=0)"))&&("(i5.i1.u24.p64!=1)"))))||(F(G("((i9.i0.u30.p78==0)||(i5.i1.u24.p64==1))")))))
Formula 1 simplified : !(G("(i5.i1.u24.p64!=1)" & "(i9.i0.u30.p78!=0)" & !X"((i9.i0.u6.p19==0)||(u36.p105==1))") | FG"((i9.i0.u30.p78==0)||(i5.i1.u24.p64==1))")
Computing Next relation with stutter on 8 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
48 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.656689,32892,1,0,33519,1512,1396,43876,472,3296,47470
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(G("((i7.u21.p54==0)||(i5.i0.u28.p72==1))")))))
Formula 2 simplified : !FG"((i7.u21.p54==0)||(i5.i0.u28.p72==1))"
Computing Next relation with stutter on 8 deadlock states
[2020-05-15 10:14:08] [INFO ] Computing symmetric co enabling matrix : 85 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
42 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.08004,45300,1,0,58521,1542,1433,88335,473,3454,80341
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((((!(X("((i3.u7.p23==0)||(i1.u3.p8==1))")))&&("(i3.u7.p23!=0)"))&&("(i1.u3.p8!=1)"))&&(X(G("((i9.i1.u12.p36==0)||(i2.i1.u34.p90==1))"))))))
Formula 3 simplified : !X("(i1.u3.p8!=1)" & "(i3.u7.p23!=0)" & !X"((i3.u7.p23==0)||(i1.u3.p8==1))" & XG"((i9.i1.u12.p36==0)||(i2.i1.u34.p90==1))")
Computing Next relation with stutter on 8 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,1.08928,45968,1,0,58930,1575,1546,88855,476,3564,81800
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(F(G("((i5.i0.u29.p28==0)||(i5.i2.u27.p71==1))"))))))
Formula 4 simplified : !G!FG"((i5.i0.u29.p28==0)||(i5.i2.u27.p71==1))"
Computing Next relation with stutter on 8 deadlock states
4 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,1.09749,45968,1,0,59717,1575,1572,89219,476,3564,83979
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA AutoFlight-PT-04a-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((!(F(X("(i8.i1.u32.p31==1)"))))||((!(X(F("((i5.i2.u27.p70==0)||(u36.p61==1))"))))&&("((i5.i2.u27.p70==0)||(u36.p61==1))")))))
Formula 5 simplified : !X(!FX"(i8.i1.u32.p31==1)" | ("((i5.i2.u27.p70==0)||(u36.p61==1))" & !XF"((i5.i2.u27.p70==0)||(u36.p61==1))"))
Computing Next relation with stutter on 8 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,1.10419,46184,1,0,59987,1580,1611,89500,476,3598,84641
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G("((i5.i1.u2.p41==0)||(i8.i0.u31.p82==1))"))))
Formula 6 simplified : G"((i5.i1.u2.p41==0)||(i8.i0.u31.p82==1))"
Computing Next relation with stutter on 8 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,1.11567,46448,1,0,60872,1580,1639,90648,477,3626,86876
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(!(G("(i5.i0.u17.p44==1)")))))
Formula 7 simplified : !X!G"(i5.i0.u17.p44==1)"
Computing Next relation with stutter on 8 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,1.11637,46448,1,0,60872,1580,1657,90648,478,3626,86890
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA AutoFlight-PT-04a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G((X("((i9.i1.u13.p37==0)||(i3.u9.p27==1))"))||(F(X(X(G("(u36.p99==1)")))))))U(G(X(("((i5.i2.u26.p68==0)||(i8.i1.u32.p84==1))")U("(u36.p99==1)"))))))
Formula 8 simplified : !(G(X"((i9.i1.u13.p37==0)||(i3.u9.p27==1))" | FXXG"(u36.p99==1)") U GX("((i5.i2.u26.p68==0)||(i8.i1.u32.p84==1))" U "(u36.p99==1)"))
Computing Next relation with stutter on 8 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
47 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.58624,60368,1,0,89885,1621,1728,123836,480,4361,125691
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-15 10:14:09] [WARNING] Script execution failed on command (assert (and (>= (select s0 8) 1) (>= (select s0 59) 1))) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 10:14:09] [INFO ] Built C files in 2332ms 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 1589537650952

--------------------
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-04a"
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-04a, 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-158897516000421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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