About the Execution of ITS-Tools.M for DLCround-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2126.680 | 92513.00 | 227108.00 | 73.00 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r192-oct2-155234409800349.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
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 r192-oct2-155234409800349
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.6K Feb 10 06:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 10 06:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 6 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 6 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 23:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 23:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 2 22:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 2 22:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 30 12:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 30 12:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 259K Mar 10 17:31 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-LTLFireability-00
FORMULA_NAME DLCround-PT-05a-LTLFireability-01
FORMULA_NAME DLCround-PT-05a-LTLFireability-02
FORMULA_NAME DLCround-PT-05a-LTLFireability-03
FORMULA_NAME DLCround-PT-05a-LTLFireability-04
FORMULA_NAME DLCround-PT-05a-LTLFireability-05
FORMULA_NAME DLCround-PT-05a-LTLFireability-06
FORMULA_NAME DLCround-PT-05a-LTLFireability-07
FORMULA_NAME DLCround-PT-05a-LTLFireability-08
FORMULA_NAME DLCround-PT-05a-LTLFireability-09
FORMULA_NAME DLCround-PT-05a-LTLFireability-10
FORMULA_NAME DLCround-PT-05a-LTLFireability-11
FORMULA_NAME DLCround-PT-05a-LTLFireability-12
FORMULA_NAME DLCround-PT-05a-LTLFireability-13
FORMULA_NAME DLCround-PT-05a-LTLFireability-14
FORMULA_NAME DLCround-PT-05a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1553579384929
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(G(X(G("((p32>=1)&&(p139>=1))")))))))
Formula 0 simplified : !GXGXG"((p32>=1)&&(p139>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 138
// Phase 1: matrix 138 rows 167 cols
invariant :p95 + -1'p166 = 0
invariant :p89 + -1'p166 = 0
invariant :p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + -1'p166 = 0
invariant :p111 + -1'p166 = 0
invariant :p93 + -1'p166 = 0
invariant :p135 + -1'p166 = 0
invariant :p104 + -1'p166 = 0
invariant :p155 + -1'p166 = 0
invariant :p162 + -1'p166 = 0
invariant :p118 + -1'p166 = 0
invariant :p125 + -1'p166 = 0
invariant :p97 + -1'p166 = 0
invariant :p124 + -1'p166 = 0
invariant :p147 + -1'p166 = 0
invariant :p127 + -1'p166 = 0
invariant :p153 + -1'p166 = 0
invariant :p1 + p2 + p3 + p4 + p5 + p6 + p7 + -1'p166 = 0
invariant :p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + -1'p166 = 0
invariant :p136 + -1'p166 = 0
invariant :p130 + -1'p166 = 0
invariant :p157 + -1'p166 = 0
invariant :p160 + -1'p166 = 0
invariant :p107 + -1'p166 = 0
invariant :p163 + -1'p166 = 0
invariant :p122 + -1'p166 = 0
invariant :p152 + -1'p166 = 0
invariant :p146 + -1'p166 = 0
invariant :p161 + -1'p166 = 0
invariant :p0 + p166 = 1
invariant :p101 + -1'p166 = 0
invariant :p140 + -1'p166 = 0
invariant :p90 + -1'p166 = 0
invariant :p123 + -1'p166 = 0
invariant :p137 + -1'p166 = 0
invariant :p116 + -1'p166 = 0
invariant :p15 + p16 + p17 + p18 + p19 + p20 + p21 + -1'p166 = 0
invariant :p158 + -1'p166 = 0
invariant :p133 + -1'p166 = 0
invariant :p128 + -1'p166 = 0
invariant :p103 + -1'p166 = 0
invariant :p115 + -1'p166 = 0
invariant :p142 + -1'p166 = 0
invariant :p139 + -1'p166 = 0
invariant :p92 + -1'p166 = 0
invariant :p96 + -1'p166 = 0
invariant :p148 + -1'p166 = 0
invariant :p119 + -1'p166 = 0
invariant :p145 + -1'p166 = 0
invariant :p165 + -1'p166 = 0
invariant :p131 + -1'p166 = 0
invariant :p121 + -1'p166 = 0
invariant :p134 + -1'p166 = 0
invariant :p98 + -1'p166 = 0
invariant :p138 + -1'p166 = 0
invariant :p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + -1'p166 = 0
invariant :p94 + -1'p166 = 0
invariant :p109 + -1'p166 = 0
invariant :p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + -1'p166 = 0
invariant :p154 + -1'p166 = 0
invariant :p100 + -1'p166 = 0
invariant :p91 + -1'p166 = 0
invariant :p141 + -1'p166 = 0
invariant :p106 + -1'p166 = 0
invariant :p108 + -1'p166 = 0
invariant :p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + -1'p166 = 0
invariant :p144 + -1'p166 = 0
invariant :p129 + -1'p166 = 0
invariant :p151 + -1'p166 = 0
invariant :p150 + -1'p166 = 0
invariant :p22 + p23 + p24 + p25 + p26 + p27 + p28 + -1'p166 = 0
invariant :p156 + -1'p166 = 0
invariant :p126 + -1'p166 = 0
invariant :p143 + -1'p166 = 0
invariant :p105 + -1'p166 = 0
invariant :p132 + -1'p166 = 0
invariant :p110 + -1'p166 = 0
invariant :p112 + -1'p166 = 0
invariant :p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + -1'p166 = 0
invariant :p99 + -1'p166 = 0
invariant :p117 + -1'p166 = 0
invariant :p8 + p9 + p10 + p11 + p12 + p13 + p14 + -1'p166 = 0
invariant :p164 + -1'p166 = 0
invariant :p102 + -1'p166 = 0
invariant :p159 + -1'p166 = 0
invariant :p113 + -1'p166 = 0
invariant :p114 + -1'p166 = 0
invariant :p120 + -1'p166 = 0
invariant :p149 + -1'p166 = 0
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1077 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,10.8917,260288,1,0,9,979106,23,0,6381,376142,26
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((G(X("((p78>=1)&&(p160>=1))")))U("((p139>=1)&&(p35>=1))"))))
Formula 1 simplified : !F(GX"((p78>=1)&&(p160>=1))" U "((p139>=1)&&(p35>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2500 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,35.8884,769504,1,0,100,2.43948e+06,32,33,6384,2.61426e+06,199
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(X(F("((p77>=1)&&(p127>=1))"))))))
Formula 2 simplified : !GFXF"((p77>=1)&&(p127>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 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,35.9224,770760,1,0,101,2.44275e+06,41,33,6387,2.6164e+06,215
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((X("((p77>=1)&&(p150>=1))"))U(X("((p61>=1)&&(p114>=1))"))))))
Formula 3 simplified : !XF(X"((p77>=1)&&(p150>=1))" U X"((p61>=1)&&(p114>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1135 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,47.2772,1026828,1,0,160,3.11681e+06,50,64,6390,3.71705e+06,377
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((false))
Formula 4 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,47.2774,1026828,1,0,160,3.11681e+06,50,64,6390,3.71705e+06,378
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((false))
Formula 5 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,47.2775,1026828,1,0,160,3.11681e+06,50,64,6390,3.71705e+06,378
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((false))
Formula 6 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,47.2776,1026828,1,0,160,3.11681e+06,50,64,6390,3.71705e+06,378
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("(p80>=1)")U(X(("((p31>=1)&&(p139>=1))")U("((p149>=1)&&(p67>=1))")))))
Formula 7 simplified : !("(p80>=1)" U X("((p31>=1)&&(p139>=1))" U "((p149>=1)&&(p67>=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,47.2795,1027256,1,0,160,3.11681e+06,64,64,6400,3.71706e+06,388
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(G(G("((p39>=1)&&(p143>=1))"))))U("((p111>=1)&&(p57>=1))")))
Formula 8 simplified : !(G"((p39>=1)&&(p143>=1))" U "((p111>=1)&&(p57>=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,47.2813,1027388,1,0,160,3.11681e+06,74,64,6410,3.71706e+06,394
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X(X(X(F("(p42>=1)")))))))
Formula 9 simplified : !FXXXF"(p42>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1005 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,57.3289,1254108,1,0,190,3.64869e+06,83,64,6411,4.69135e+06,554
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("((p66>=1)&&(p153>=1))")U(G("((p82>=1)&&(p132>=1))"))))
Formula 10 simplified : !("((p66>=1)&&(p153>=1))" U G"((p82>=1)&&(p132>=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,57.3306,1254332,1,0,190,3.64869e+06,101,64,6429,4.69135e+06,563
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((false))
Formula 11 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,57.3307,1254332,1,0,190,3.64869e+06,101,64,6429,4.69135e+06,563
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(X(X(("((p136>=1)&&(p28>=1))")U("((p52>=1)&&(p112>=1))"))))))
Formula 12 simplified : !FXX("((p136>=1)&&(p28>=1))" U "((p52>=1)&&(p112>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
673 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,64.0632,1362996,1,0,220,3.95772e+06,110,64,6432,5.22857e+06,722
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G(G(X("((p21>=1)&&(p94>=1))"))))U((X("(p39>=1)"))U("((p28>=1)&&(p120>=1))"))))
Formula 13 simplified : !(GX"((p21>=1)&&(p94>=1))" U (X"(p39>=1)" U "((p28>=1)&&(p120>=1))"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1190 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,75.9632,1641344,1,0,281,4.73308e+06,142,94,6460,6.67042e+06,893
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F("((p76>=1)&&(p122>=1))"))))
Formula 14 simplified : !F"((p76>=1)&&(p122>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
342 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,79.392,1657184,1,0,370,4.80747e+06,151,124,6464,6.79669e+06,1060
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((((G("(p26>=1)"))U(F("((p25>=1)&&(p135>=1))")))U(F(G(F("(p50>=1)"))))))
Formula 15 simplified : !((G"(p26>=1)" U F"((p25>=1)&&(p135>=1))") U FGF"(p50>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
21 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,79.6003,1664384,1,0,372,4.82768e+06,160,124,6465,6.81662e+06,1074
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1553579477442
--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 26, 2019 5:49:46 AM fr.lip6.move.gal.application.Application start
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]
Mar 26, 2019 5:49:46 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 5:49:46 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 110 ms
Mar 26, 2019 5:49:46 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 167 places.
Mar 26, 2019 5:49:46 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1055 transitions.
Mar 26, 2019 5:49:46 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 26, 2019 5:49:46 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 24 ms
Mar 26, 2019 5:49:47 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 168 ms
Mar 26, 2019 5:49:47 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 80 ms
Mar 26, 2019 5:49:47 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 1055 transitions.
Mar 26, 2019 5:49:47 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 1055 transitions.
Mar 26, 2019 5:49:47 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 167 places.
Mar 26, 2019 5:49:47 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 1055 transitions.
Mar 26, 2019 5:49:47 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Mar 26, 2019 5:49:47 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 26, 2019 5:49:47 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 88 place invariants in 22 ms
Mar 26, 2019 5:49:48 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 167 variables to be positive in 327 ms
Mar 26, 2019 5:49:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 1055 transitions.
Mar 26, 2019 5:49:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/1055 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 5:49:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 5:49:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 1055 transitions.
Mar 26, 2019 5:49:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 5:49:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 1055 transitions.
Mar 26, 2019 5:49:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(23/1055) took 1470 ms. Total solver calls (SAT/UNSAT): 3072(3059/13)
Mar 26, 2019 5:49:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(53/1055) took 4670 ms. Total solver calls (SAT/UNSAT): 7226(7213/13)
Mar 26, 2019 5:49:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(70/1055) took 7734 ms. Total solver calls (SAT/UNSAT): 9600(9587/13)
Mar 26, 2019 5:50:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(84/1055) took 10920 ms. Total solver calls (SAT/UNSAT): 11547(11534/13)
Mar 26, 2019 5:50:03 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(102/1055) took 13959 ms. Total solver calls (SAT/UNSAT): 13620(13607/13)
Mar 26, 2019 5:50:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(124/1055) took 17142 ms. Total solver calls (SAT/UNSAT): 15133(15120/13)
Mar 26, 2019 5:50:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(133/1055) took 20783 ms. Total solver calls (SAT/UNSAT): 16602(16479/123)
Mar 26, 2019 5:50:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(135/1055) took 32962 ms. Total solver calls (SAT/UNSAT): 18441(18111/330)
Mar 26, 2019 5:50:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(136/1055) took 36014 ms. Total solver calls (SAT/UNSAT): 19359(18922/437)
Mar 26, 2019 5:50:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(137/1055) took 43128 ms. Total solver calls (SAT/UNSAT): 20276(19733/543)
Mar 26, 2019 5:50:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(138/1055) took 46680 ms. Total solver calls (SAT/UNSAT): 21192(20544/648)
Mar 26, 2019 5:50:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(140/1055) took 53033 ms. Total solver calls (SAT/UNSAT): 23021(22203/818)
Mar 26, 2019 5:50:50 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(141/1055) took 61101 ms. Total solver calls (SAT/UNSAT): 23934(23014/920)
Mar 26, 2019 5:51:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(142/1055) took 73135 ms. Total solver calls (SAT/UNSAT): 24846(23825/1021)
Mar 26, 2019 5:51:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(143/1055) took 76271 ms. Total solver calls (SAT/UNSAT): 25757(24654/1103)
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:480)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 26, 2019 5:51:17 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 89923ms conformant to PINS in folder :/home/mcc/execution
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="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
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 r192-oct2-155234409800349"
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" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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 '
echo "FORMULA_NAME $x"
done
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 ;