fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902546200482
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DLCround-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.480 6797.00 19826.00 116.70 FFFFFFFTFFFFFFFT normal

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-158902546200482.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-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546200482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 3.3K Mar 30 18:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 18:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 08:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 08:48 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.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 04:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 04:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 26 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 26 23:09 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 259K 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-05a-00
FORMULA_NAME DLCround-PT-05a-01
FORMULA_NAME DLCround-PT-05a-02
FORMULA_NAME DLCround-PT-05a-03
FORMULA_NAME DLCround-PT-05a-04
FORMULA_NAME DLCround-PT-05a-05
FORMULA_NAME DLCround-PT-05a-06
FORMULA_NAME DLCround-PT-05a-07
FORMULA_NAME DLCround-PT-05a-08
FORMULA_NAME DLCround-PT-05a-09
FORMULA_NAME DLCround-PT-05a-10
FORMULA_NAME DLCround-PT-05a-11
FORMULA_NAME DLCround-PT-05a-12
FORMULA_NAME DLCround-PT-05a-13
FORMULA_NAME DLCround-PT-05a-14
FORMULA_NAME DLCround-PT-05a-15

=== Now, execution of the tool begins

BK_START 1589603727715

[2020-05-16 04:35:31] [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 04:35:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 04:35:31] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2020-05-16 04:35:31] [INFO ] Transformed 167 places.
[2020-05-16 04:35:31] [INFO ] Transformed 1055 transitions.
[2020-05-16 04:35:31] [INFO ] Found NUPN structural information;
[2020-05-16 04:35:31] [INFO ] Parsed PT model containing 167 places and 1055 transitions in 293 ms.
Ensure Unique test removed 112 transitions
Reduce redundant transitions removed 112 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 64 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 923 steps, including 0 resets, run visited all 48 properties in 27 ms. (steps per millisecond=34 )
[2020-05-16 04:35:32] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-16 04:35:32] [INFO ] Flatten gal took : 230 ms
FORMULA DLCround-PT-05a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 04:35:32] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 04:35:32] [INFO ] Applying decomposition
[2020-05-16 04:35:32] [INFO ] Flatten gal took : 140 ms
[2020-05-16 04:35:32] [INFO ] Input system was already deterministic with 943 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/graph2871400518259946128.txt, -o, /tmp/graph2871400518259946128.bin, -w, /tmp/graph2871400518259946128.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/graph2871400518259946128.bin, -l, -1, -v, -w, /tmp/graph2871400518259946128.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 04:35:33] [INFO ] Decomposing Gal with order
[2020-05-16 04:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 04:35:33] [INFO ] Removed a total of 966 redundant transitions.
[2020-05-16 04:35:33] [INFO ] Flatten gal took : 312 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-16 04:35:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 43 ms.
Normalized transition count is 138 out of 943 initially.
// Phase 1: matrix 138 rows 167 cols
[2020-05-16 04:35:33] [INFO ] Computed 88 place invariants in 21 ms
inv : p0 + p151 = 1
inv : p0 + p94 = 1
inv : p0 + p159 = 1
inv : p0 + p135 = 1
inv : p0 + p143 = 1
inv : p0 + p119 = 1
inv : p0 + p127 = 1
inv : p0 + p103 = 1
inv : p0 + p160 = 1
inv : p0 + p111 = 1
inv : p0 + p150 = 1
inv : p0 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p158 = 1
inv : p0 + p93 = 1
inv : p0 + p134 = 1
inv : p0 + p142 = 1
inv : p0 + p118 = 1
inv : p0 + p126 = 1
inv : p0 + p102 = 1
inv : p0 + p110 = 1
inv : p0 + p145 = 1
inv : p0 + p153 = 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 + p162 = 1
inv : p0 + p97 = 1
inv : p0 + p105 = 1
inv : p0 + p144 = 1
inv : p0 + p95 = 1
inv : p0 + p152 = 1
inv : p0 + p128 = 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 + p161 = 1
inv : p0 + p104 = 1
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 = 1
inv : p0 + p147 = 1
inv : p0 + p90 = 1
inv : p0 + p155 = 1
inv : p0 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 = 1
inv : p0 + p131 = 1
inv : p0 + p139 = 1
inv : p0 + p115 = 1
inv : p0 + p123 = 1
inv : p0 + p164 = 1
inv : p0 + p99 = 1
inv : p0 + p107 = 1
inv : p0 + p146 = 1
inv : p0 + p154 = 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 + p163 = 1
inv : p0 + p106 = 1
inv : p0 + p149 = 1
inv : p0 + p92 = 1
inv : p0 + p157 = 1
inv : p0 + p133 = 1
inv : p0 + p141 = 1
inv : p0 + p117 = 1
inv : p0 + p125 = 1
inv : p0 + p166 = 1
inv : p0 + p101 = 1
inv : p0 + p109 = 1
inv : p0 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p148 = 1
inv : p0 + p156 = 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 + p140 = 1
inv : p0 + p116 = 1
inv : p0 + p124 = 1
inv : p0 + p100 = 1
inv : p0 + p165 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p108 = 1
Total of 88 invariants.
[2020-05-16 04:35:33] [INFO ] Computed 88 place invariants in 24 ms
[2020-05-16 04:35:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 45 ms
[2020-05-16 04:35:33] [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 12 LTL properties
Checking formula 0 : !((G((X("((u3.p28==1)&&(i5.u7.p103==1))"))||("((i6.u11.p55==1)&&(i6.u12.p151==1))"))))
Formula 0 simplified : !G("((i6.u11.p55==1)&&(i6.u12.p151==1))" | X"((u3.p28==1)&&(i5.u7.p103==1))")
built 40 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
5 strongly connected components in search stack
11 transitions explored
7 items max in DFS search stack
11 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.19163,20064,1,0,1981,1758,1623,2518,796,4269,6821
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-05a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(G("((i4.u4.p32==1)||(i8.u18.p76==1))")))&&(F("(i8.u18.p76==1)"))))
Formula 1 simplified : !(XG"((i4.u4.p32==1)||(i8.u18.p76==1))" & F"(i8.u18.p76==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.199238,20640,1,0,2083,1804,1643,2617,799,4418,7311
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-05a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F((F(G("(u2.p17==1)")))||("((i7.u15.p66==1)&&(i7.u15.p155==1))")))))
Formula 2 simplified : !GF("((i7.u15.p66==1)&&(i7.u15.p155==1))" | FG"(u2.p17==1)")
4 unique states visited
4 strongly connected components in search stack
5 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.210535,20772,1,0,2352,1896,1731,3043,805,4686,8402
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-05a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X((X((X("((i8.u16.p73==1)&&(i8.u18.p160==1))"))||(X(((G("((i4.u6.p38==1)&&(i4.u6.p94==1))"))&&("(i4.u6.p38==1)"))&&("(i4.u6.p94==1)")))))U(!(F("((u2.p15==1)&&(i9.u19.p133==1))")))))))
Formula 3 simplified : X(X(X"((i8.u16.p73==1)&&(i8.u18.p160==1))" | X("(i4.u6.p38==1)" & "(i4.u6.p94==1)" & G"((i4.u6.p38==1)&&(i4.u6.p94==1))")) U !F"((u2.p15==1)&&(i9.u19.p133==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.228203,22416,1,0,2752,1948,1758,3633,805,4958,9678
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-05a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(F(!(X((F(G("((u3.p28==1)&&(i9.u21.p136==1))")))||(X("(u1.p14==1)"))))))))
Formula 4 simplified : F!X(FG"((u3.p28==1)&&(i9.u21.p136==1))" | X"(u1.p14==1)")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.232819,22416,1,0,2908,1948,1789,3773,807,4996,10212
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-05a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G(X(X(((!(F("((i6.u12.p49!=1)||(i6.u12.p150!=1))")))&&("(i7.u15.p68==1)"))&&("(i7.u15.p120==1)")))))&&(G("((i8.u18.p77==1)&&(i7.u15.p155==1))")))))
Formula 5 simplified : !F(GXX("(i7.u15.p68==1)" & "(i7.u15.p120==1)" & !F"((i6.u12.p49!=1)||(i6.u12.p150!=1))") & G"((i8.u18.p77==1)&&(i7.u15.p155==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.255048,22416,1,0,3271,2003,1841,4148,808,5130,11432
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-05a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!((!(F("((u0.p7==1)&&(i9.u21.p130==1))")))U(("((i6.u12.p56==1)&&(i6.u12.p148==1))")U("((i9.u21.p87==1)&&(i9.u19.p133==1))")))))
Formula 6 simplified : !F"((u0.p7==1)&&(i9.u21.p130==1))" U ("((i6.u12.p56==1)&&(i6.u12.p148==1))" U "((i9.u21.p87==1)&&(i9.u19.p133==1))")
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,0.260052,22416,1,0,3271,2003,1930,4148,813,5130,11498
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G("((i7.u15.p61!=1)||(i7.u15.p114!=1))"))))
Formula 7 simplified : !XG"((i7.u15.p61!=1)||(i7.u15.p114!=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.273706,22416,1,0,3709,2124,1959,4682,817,5515,13050
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-05a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F("((i6.u12.p51==1)&&(i6.u12.p106==1))"))))
Formula 8 simplified : !XF"((i6.u12.p51==1)&&(i6.u12.p106==1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.279711,22416,1,0,3938,2135,1980,4966,818,5546,14042
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-05a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((G("((i4.u5.p35==1)&&(i4.u6.p92==1))"))U(G("(i4.u6.p30==1)")))||(F(("((u0.p7==1)&&(i6.u12.p106==1))")U(F("((i8.u18.p71==1)&&(i8.u18.p126==1))"))))))
Formula 9 simplified : !((G"((i4.u5.p35==1)&&(i4.u6.p92==1))" U G"(i4.u6.p30==1)") | F("((u0.p7==1)&&(i6.u12.p106==1))" U F"((i8.u18.p71==1)&&(i8.u18.p126==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.288907,22416,1,0,4191,2135,2099,5208,827,5587,14985
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-05a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(X((F("((i6.u12.p51==1)&&(i6.u12.p148==1))"))U("((i6.u12.p51!=1)||(i6.u12.p148!=1))"))))&&(F("((u1.p14==1)&&(i6.u10.p107==1))"))))
Formula 10 simplified : !(!X(F"((i6.u12.p51==1)&&(i6.u12.p148==1))" U "((i6.u12.p51!=1)||(i6.u12.p148!=1))") & F"((u1.p14==1)&&(i6.u10.p107==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.292282,22416,1,0,4191,2135,2139,5208,835,5587,15025
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-05a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((!(X((X("((i5.u8.p44==1)&&(i5.u9.p100==1))"))&&("(i8.u18.p70==1)"))))||(((G("(i8.u18.p70==1)"))||(F("((i5.u9.p41==1)&&(i5.u9.p144==1))")))U(X("((i5.u9.p41==1)&&(i5.u9.p144==1))")))))
Formula 11 simplified : !(!X("(i8.u18.p70==1)" & X"((i5.u8.p44==1)&&(i5.u9.p100==1))") | ((G"(i8.u18.p70==1)" | F"((i5.u9.p41==1)&&(i5.u9.p144==1))") U X"((i5.u9.p41==1)&&(i5.u9.p144==1))"))
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,0.293503,22416,1,0,4191,2135,2158,5208,840,5587,15032
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-16 04:35:34] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 04:35:34] [INFO ] Built C files in 1648ms 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 1589603734512

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

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