Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902546200466.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546200466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 2.6K Mar 30 18:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 30 18:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 29 08:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 29 08:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 23:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 26 23:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 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 200K 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 DLCround-PT-04a-00
FORMULA_NAME DLCround-PT-04a-01
FORMULA_NAME DLCround-PT-04a-02
FORMULA_NAME DLCround-PT-04a-03
FORMULA_NAME DLCround-PT-04a-04
FORMULA_NAME DLCround-PT-04a-05
FORMULA_NAME DLCround-PT-04a-06
FORMULA_NAME DLCround-PT-04a-07
FORMULA_NAME DLCround-PT-04a-08
FORMULA_NAME DLCround-PT-04a-09
FORMULA_NAME DLCround-PT-04a-10
FORMULA_NAME DLCround-PT-04a-11
FORMULA_NAME DLCround-PT-04a-12
FORMULA_NAME DLCround-PT-04a-13
FORMULA_NAME DLCround-PT-04a-14
FORMULA_NAME DLCround-PT-04a-15

=== Now, execution of the tool begins

BK_START 1589599178429

[2020-05-16 03:19:41] [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-16 03:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 03:19:41] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2020-05-16 03:19:41] [INFO ] Transformed 139 places.
[2020-05-16 03:19:41] [INFO ] Transformed 823 transitions.
[2020-05-16 03:19:41] [INFO ] Found NUPN structural information;
[2020-05-16 03:19:41] [INFO ] Parsed PT model containing 139 places and 823 transitions in 264 ms.
Ensure Unique test removed 91 transitions
Reduce redundant transitions removed 91 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 611 ms. (steps per millisecond=163 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-16 03:19:42] [INFO ] Flow matrix only has 122 transitions (discarded 610 similar events)
// Phase 1: matrix 122 rows 139 cols
[2020-05-16 03:19:42] [INFO ] Computed 69 place invariants in 13 ms
[2020-05-16 03:19:42] [INFO ] [Real]Absence check using 69 positive place invariants in 64 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-16 03:19:43] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-16 03:19:43] [INFO ] Flatten gal took : 154 ms
FORMULA DLCround-PT-04a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 03:19:43] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 03:19:43] [INFO ] Applying decomposition
[2020-05-16 03:19:43] [INFO ] Flatten gal took : 55 ms
[2020-05-16 03:19:43] [INFO ] Input system was already deterministic with 732 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/graph15175648379590919166.txt, -o, /tmp/graph15175648379590919166.bin, -w, /tmp/graph15175648379590919166.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/graph15175648379590919166.bin, -l, -1, -v, -w, /tmp/graph15175648379590919166.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 03:19:44] [INFO ] Decomposing Gal with order
[2020-05-16 03:19:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 03:19:44] [INFO ] Removed a total of 619 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 122 out of 732 initially.
// Phase 1: matrix 122 rows 139 cols
[2020-05-16 03:19:44] [INFO ] Computed 69 place invariants in 21 ms
inv : p0 + p86 = 1
inv : p0 + p94 = 1
inv : p0 + p135 = 1
inv : p0 + p119 = 1
inv : p0 + p127 = 1
inv : p0 + p103 = 1
inv : p0 + p111 = 1
inv : p0 + p85 = 1
inv : p0 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p93 = 1
inv : p0 + p134 = 1
inv : p0 + p118 = 1
inv : p0 + p126 = 1
inv : p0 + p102 = 1
inv : p0 + p110 = 1
inv : p0 + p80 = 1
inv : p0 + p88 = 1
inv : p0 + p15 + p16 + p17 + p18 + p19 + p20 + p21 = 1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p129 = 1
inv : p0 + p137 = 1
inv : p0 + p113 = 1
inv : p0 + p121 = 1
inv : p0 + p97 = 1
inv : p0 + p105 = 1
inv : p0 + p87 = 1
inv : p0 + p95 = 1
inv : p0 + p128 = 1
inv : p0 + p79 = 1
inv : p0 + p136 = 1
inv : p0 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 = 1
inv : p0 + p112 = 1
inv : p0 + p120 = 1
inv : p0 + p96 = 1
inv : p0 + p104 = 1
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 = 1
inv : p0 + p82 = 1
inv : p0 + p90 = 1
inv : p0 + p131 = 1
inv : p0 + p115 = 1
inv : p0 + p123 = 1
inv : p0 + p99 = 1
inv : p0 + p107 = 1
inv : p0 + p81 = 1
inv : p0 + p89 = 1
inv : p0 + p130 = 1
inv : p0 + p138 = 1
inv : p0 + p114 = 1
inv : p0 + p122 = 1
inv : p0 + p98 = 1
inv : p0 + p106 = 1
inv : p0 + p84 = 1
inv : p0 + p92 = 1
inv : p0 + p133 = 1
inv : p0 + p117 = 1
inv : p0 + p125 = 1
inv : p0 + p101 = 1
inv : p0 + p109 = 1
inv : p0 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p83 = 1
inv : p0 + p91 = 1
inv : p0 + p132 = 1
inv : p0 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 = 1
inv : p0 + p116 = 1
inv : p0 + p124 = 1
inv : p0 + p100 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p108 = 1
Total of 69 invariants.
[2020-05-16 03:19:44] [INFO ] Computed 69 place invariants in 24 ms
[2020-05-16 03:19:44] [INFO ] Flatten gal took : 256 ms
[2020-05-16 03:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 34 ms.
[2020-05-16 03:19:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 36 ms
[2020-05-16 03:19:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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 10 LTL properties
Checking formula 0 : !(((!(X("((u0.p7==1)&&(i8.u16.p112==1))")))||(X((G(!(X("(i4.u6.p29==1)"))))&&("((i6.u11.p51!=1)||(i6.u11.p129!=1))")))))
Formula 0 simplified : !(!X"((u0.p7==1)&&(i8.u16.p112==1))" | X("((i6.u11.p51!=1)||(i6.u11.p129!=1))" & G!X"(i4.u6.p29==1)"))
built 31 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-16 03:19:44] [INFO ] Proved 139 variables to be positive in 485 ms
[2020-05-16 03:19:44] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2020-05-16 03:19:44] [INFO ] Computation of disable matrix completed :0/732 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
12 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.198356,20120,1,0,1785,2579,1508,2027,1520,5121,5766
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-04a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X((G("((i5.u8.p39==1)&&(i5.u8.p94==1))"))U((X("((((i8.u16.p77==1)&&(i5.u8.p126==1))&&(u0.p2==1))&&(i7.u12.p103==1))"))||(X("((i8.u16.p77==1)&&(i5.u8.p126==1))")))))))
Formula 1 simplified : X(G"((i5.u8.p39==1)&&(i5.u8.p94==1))" U (X"((((i8.u16.p77==1)&&(i5.u8.p126==1))&&(u0.p2==1))&&(i7.u12.p103==1))" | X"((i8.u16.p77==1)&&(i5.u8.p126==1))"))
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,0.206748,21340,1,0,1822,2620,1548,2070,1527,5225,6021
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-04a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(X(!(X(((G(X("((i7.u12.p62==1)&&(i7.u14.p134==1))")))||("((i8.u16.p71==1)&&(i8.u16.p118==1))"))||("((i7.u14.p59==1)&&(i7.u14.p106==1))"))))))))
Formula 2 simplified : !FGX!X("((i7.u14.p59==1)&&(i7.u14.p106==1))" | "((i8.u16.p71==1)&&(i8.u16.p118==1))" | GX"((i7.u12.p62==1)&&(i7.u14.p134==1))")
5 unique states visited
5 strongly connected components in search stack
6 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,0.218842,21476,1,0,1950,2822,1611,2270,1538,5616,6612
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-04a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X((F(X(((G(!(G("(((i7.u12.p63==1)&&(i7.u14.p132==1))||((u3.p28==1)&&(i7.u14.p110==1)))"))))&&("(u3.p28==1)"))&&("(i4.u6.p86==1)"))))&&("((i7.u12.p63!=1)||(i7.u14.p132!=1))")))))
Formula 3 simplified : !FX("((i7.u12.p63!=1)||(i7.u14.p132!=1))" & FX("(i4.u6.p86==1)" & "(u3.p28==1)" & G!G"(((i7.u12.p63==1)&&(i7.u14.p132==1))||((u3.p28==1)&&(i7.u14.p110==1)))"))
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,0.234063,21668,1,0,2485,2943,1672,2926,1543,6299,8612
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-04a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(F(((G(!(F((F("((i5.u8.p43==1)&&(i5.u8.p124==1))"))||("((i7.u13.p65==1)&&(i7.u14.p106==1))")))))&&("(i5.u8.p42==1)"))&&("(i5.u8.p123==1)"))))))
Formula 4 simplified : !GXF("(i5.u8.p42==1)" & "(i5.u8.p123==1)" & G!F("((i7.u13.p65==1)&&(i7.u14.p106==1))" | F"((i5.u8.p43==1)&&(i5.u8.p124==1))"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.252173,21808,1,0,2757,3021,1851,3287,1557,6638,9773
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-04a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(((X(!(F(X((G("((i7.u14.p61==1)&&(i7.u14.p110==1))"))U("(i7.u14.p68==1)"))))))||(F("((i7.u14.p61==1)&&(i7.u14.p110==1))")))||("((i7.u14.p61==1)&&(i7.u14.p110==1))")))))
Formula 5 simplified : !FX("((i7.u14.p61==1)&&(i7.u14.p110==1))" | X!FX(G"((i7.u14.p61==1)&&(i7.u14.p110==1))" U "(i7.u14.p68==1)") | F"((i7.u14.p61==1)&&(i7.u14.p110==1))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.261717,21808,1,0,3215,3125,1899,3883,1564,7064,11214
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-04a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(G((X("((i5.u8.p46==1)&&(i5.u8.p92==1))"))||(("((i5.u8.p46==1)&&(i5.u8.p92==1))")U("((i6.u11.p56==1)&&(i6.u11.p127==1))")))))))
Formula 6 simplified : !GFG(X"((i5.u8.p46==1)&&(i5.u8.p92==1))" | ("((i5.u8.p46==1)&&(i5.u8.p92==1))" U "((i6.u11.p56==1)&&(i6.u11.p127==1))"))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.272667,22324,1,0,3582,3227,1984,4412,1573,7465,12254
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-04a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F("(i8.u16.p78==1)"))U("(((u3.p22==1)&&(i8.u16.p117==1))||((i7.u14.p67==1)&&(i8.u16.p138==1)))")))
Formula 7 simplified : !(F"(i8.u16.p78==1)" U "(((u3.p22==1)&&(i8.u16.p117==1))||((i7.u14.p67==1)&&(i8.u16.p138==1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.289669,22588,1,0,4299,3501,2029,5322,1576,8912,14124
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-04a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((!(X(F(G("((i8.u16.p77==1)&&(i8.u16.p117==1))")))))&&("((i4.u6.p36!=1)||(i4.u6.p82!=1))"))))
Formula 8 simplified : !X("((i4.u6.p36!=1)||(i4.u6.p82!=1))" & !XFG"((i8.u16.p77==1)&&(i8.u16.p117==1))")
5 unique states visited
5 strongly connected components in search stack
6 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,0.293342,22588,1,0,4318,3501,2063,5341,1582,8940,14217
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-04a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((("(u2.p19==1)")U((G("((i4.u6.p37==1)&&(i4.u4.p79==1))"))||(F("(u2.p19==1)"))))&&(X(((F("((i4.u6.p37==1)&&(i4.u4.p79==1))"))&&("(i4.u6.p37==1)"))&&("(i4.u4.p79==1)")))))
Formula 9 simplified : !(("(u2.p19==1)" U (G"((i4.u6.p37==1)&&(i4.u4.p79==1))" | F"(u2.p19==1)")) & X("(i4.u4.p79==1)" & "(i4.u6.p37==1)" & F"((i4.u6.p37==1)&&(i4.u4.p79==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.299347,22588,1,0,4442,3503,2106,5513,1582,8942,14844
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-04a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-16 03:19:45] [INFO ] Computation of Complete disable matrix. took 173 ms. Total solver calls (SAT/UNSAT): 0(0/0)
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-16 03:19:45] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2020-05-16 03:19:45] [INFO ] Computation of Complete enable matrix. took 78 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 03:19:48] [INFO ] Computing symmetric co enabling matrix : 732 transitions.
[2020-05-16 03:19:49] [INFO ] Computation of co-enabling matrix(0/732) took 580 ms. Total solver calls (SAT/UNSAT): 731(0/731)
[2020-05-16 03:19:52] [INFO ] Computation of co-enabling matrix(32/732) took 3612 ms. Total solver calls (SAT/UNSAT): 4080(303/3777)
[2020-05-16 03:19:55] [INFO ] Computation of co-enabling matrix(58/732) took 6694 ms. Total solver calls (SAT/UNSAT): 6784(555/6229)
[2020-05-16 03:19:58] [INFO ] Computation of co-enabling matrix(96/732) took 9694 ms. Total solver calls (SAT/UNSAT): 9368(869/8499)
[2020-05-16 03:20:01] [INFO ] Computation of co-enabling matrix(120/732) took 12785 ms. Total solver calls (SAT/UNSAT): 11528(1271/10257)
[2020-05-16 03:20:04] [INFO ] Computation of co-enabling matrix(148/732) took 15809 ms. Total solver calls (SAT/UNSAT): 13999(1708/12291)
[2020-05-16 03:20:07] [INFO ] Computation of co-enabling matrix(176/732) took 18859 ms. Total solver calls (SAT/UNSAT): 16334(2118/14216)
[2020-05-16 03:20:10] [INFO ] Computation of co-enabling matrix(200/732) took 21929 ms. Total solver calls (SAT/UNSAT): 18404(2489/15915)
[2020-05-16 03:20:13] [INFO ] Computation of co-enabling matrix(236/732) took 24956 ms. Total solver calls (SAT/UNSAT): 20468(2924/17544)
[2020-05-16 03:20:16] [INFO ] Computation of co-enabling matrix(279/732) took 28019 ms. Total solver calls (SAT/UNSAT): 22724(3410/19314)
[2020-05-16 03:20:19] [INFO ] Computation of co-enabling matrix(318/732) took 31022 ms. Total solver calls (SAT/UNSAT): 24818(3814/21004)
[2020-05-16 03:20:22] [INFO ] Computation of co-enabling matrix(360/732) took 34075 ms. Total solver calls (SAT/UNSAT): 26908(4239/22669)
[2020-05-16 03:20:25] [INFO ] Computation of co-enabling matrix(403/732) took 37196 ms. Total solver calls (SAT/UNSAT): 29041(4610/24431)
[2020-05-16 03:20:28] [INFO ] Computation of co-enabling matrix(443/732) took 40227 ms. Total solver calls (SAT/UNSAT): 31137(4980/26157)
[2020-05-16 03:20:31] [INFO ] Computation of co-enabling matrix(501/732) took 43236 ms. Total solver calls (SAT/UNSAT): 32698(5603/27095)
[2020-05-16 03:20:35] [INFO ] Computation of co-enabling matrix(559/732) took 46277 ms. Total solver calls (SAT/UNSAT): 34023(6182/27841)
[2020-05-16 03:20:38] [INFO ] Computation of co-enabling matrix(614/732) took 49297 ms. Total solver calls (SAT/UNSAT): 35099(6500/28599)
[2020-05-16 03:20:41] [INFO ] Computation of co-enabling matrix(688/732) took 52335 ms. Total solver calls (SAT/UNSAT): 36176(6808/29368)
[2020-05-16 03:20:42] [INFO ] Computation of Finished co-enabling matrix. took 53660 ms. Total solver calls (SAT/UNSAT): 36360(6858/29502)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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-16 03:20:42] [INFO ] Built C files in 58983ms 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 1589599242923

--------------------
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="DLCround-PT-04a"
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 DLCround-PT-04a, 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 r051-ebro-158902546200466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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