fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r192-oct2-155234409700331
Last Updated
Apr 15, 2019

About the Execution of ITS-Tools.M for DLCround-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1122.450 34983.00 90229.00 192.40 FTFFFFFFFFFFFFFF 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-155234409700331.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-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r192-oct2-155234409700331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.2K Feb 10 05:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 05:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 6 04:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 6 04:24 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.5K Feb 4 23:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 2 22:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 2 22:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 30 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 30 12:05 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 200K 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-04a-LTLFireability-00
FORMULA_NAME DLCround-PT-04a-LTLFireability-01
FORMULA_NAME DLCround-PT-04a-LTLFireability-02
FORMULA_NAME DLCround-PT-04a-LTLFireability-03
FORMULA_NAME DLCround-PT-04a-LTLFireability-04
FORMULA_NAME DLCround-PT-04a-LTLFireability-05
FORMULA_NAME DLCround-PT-04a-LTLFireability-06
FORMULA_NAME DLCround-PT-04a-LTLFireability-07
FORMULA_NAME DLCround-PT-04a-LTLFireability-08
FORMULA_NAME DLCround-PT-04a-LTLFireability-09
FORMULA_NAME DLCround-PT-04a-LTLFireability-10
FORMULA_NAME DLCround-PT-04a-LTLFireability-11
FORMULA_NAME DLCround-PT-04a-LTLFireability-12
FORMULA_NAME DLCround-PT-04a-LTLFireability-13
FORMULA_NAME DLCround-PT-04a-LTLFireability-14
FORMULA_NAME DLCround-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553578366727

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 : !((("(p78>=1)")U(G(F(G("((p46>=1)&&(p123>=1))"))))))
Formula 0 simplified : !("(p78>=1)" U GFG"((p46>=1)&&(p123>=1))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 122
// Phase 1: matrix 122 rows 139 cols
invariant :p94 + -1'p138 = 0
invariant :p115 + -1'p138 = 0
invariant :p104 + -1'p138 = 0
invariant :p118 + -1'p138 = 0
invariant :p133 + -1'p138 = 0
invariant :p84 + -1'p138 = 0
invariant :p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + -1'p138 = 0
invariant :p109 + -1'p138 = 0
invariant :p1 + p2 + p3 + p4 + p5 + p6 + p7 + -1'p138 = 0
invariant :p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + -1'p138 = 0
invariant :p131 + -1'p138 = 0
invariant :p105 + -1'p138 = 0
invariant :p136 + -1'p138 = 0
invariant :p92 + -1'p138 = 0
invariant :p114 + -1'p138 = 0
invariant :p91 + -1'p138 = 0
invariant :p102 + -1'p138 = 0
invariant :p128 + -1'p138 = 0
invariant :p117 + -1'p138 = 0
invariant :p137 + -1'p138 = 0
invariant :p93 + -1'p138 = 0
invariant :p106 + -1'p138 = 0
invariant :p83 + -1'p138 = 0
invariant :p107 + -1'p138 = 0
invariant :p110 + -1'p138 = 0
invariant :p127 + -1'p138 = 0
invariant :p81 + -1'p138 = 0
invariant :p126 + -1'p138 = 0
invariant :p96 + -1'p138 = 0
invariant :p119 + -1'p138 = 0
invariant :p99 + -1'p138 = 0
invariant :p113 + -1'p138 = 0
invariant :p101 + -1'p138 = 0
invariant :p135 + -1'p138 = 0
invariant :p98 + -1'p138 = 0
invariant :p124 + -1'p138 = 0
invariant :p82 + -1'p138 = 0
invariant :p112 + -1'p138 = 0
invariant :p95 + -1'p138 = 0
invariant :p134 + -1'p138 = 0
invariant :p90 + -1'p138 = 0
invariant :p89 + -1'p138 = 0
invariant :p100 + -1'p138 = 0
invariant :p85 + -1'p138 = 0
invariant :p86 + -1'p138 = 0
invariant :p87 + -1'p138 = 0
invariant :p22 + p23 + p24 + p25 + p26 + p27 + p28 + -1'p138 = 0
invariant :p111 + -1'p138 = 0
invariant :p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + -1'p138 = 0
invariant :p121 + -1'p138 = 0
invariant :p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + -1'p138 = 0
invariant :p122 + -1'p138 = 0
invariant :p108 + -1'p138 = 0
invariant :p15 + p16 + p17 + p18 + p19 + p20 + p21 + -1'p138 = 0
invariant :p132 + -1'p138 = 0
invariant :p103 + -1'p138 = 0
invariant :p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + -1'p138 = 0
invariant :p0 + p138 = 1
invariant :p88 + -1'p138 = 0
invariant :p97 + -1'p138 = 0
invariant :p130 + -1'p138 = 0
invariant :p8 + p9 + p10 + p11 + p12 + p13 + p14 + -1'p138 = 0
invariant :p125 + -1'p138 = 0
invariant :p80 + -1'p138 = 0
invariant :p116 + -1'p138 = 0
invariant :p123 + -1'p138 = 0
invariant :p120 + -1'p138 = 0
invariant :p129 + -1'p138 = 0
invariant :p79 + -1'p138 = 0
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
837 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,8.48332,232396,1,0,161,730661,24,56,4878,1.03701e+06,296
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F((X("((p29>=1)&&(p86>=1))"))U(F("((p7>=1)&&(p88>=1))"))))))
Formula 1 simplified : !F(X"((p29>=1)&&(p86>=1))" U F"((p7>=1)&&(p88>=1))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,8.48422,232756,1,0,161,730661,33,57,4881,1.03701e+06,304
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(("((p72>=1)&&(p114>=1))")U("((p28>=1)&&(p118>=1))")))U(X(("((p28>=1)&&(p94>=1))")U("((p67>=1)&&(p125>=1))")))))
Formula 2 simplified : !(G("((p72>=1)&&(p114>=1))" U "((p28>=1)&&(p118>=1))") U X("((p28>=1)&&(p94>=1))" U "((p67>=1)&&(p125>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
219 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.688,292328,1,0,209,899631,56,80,4901,1.34062e+06,439
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(X(G(X("((p79>=1)&&(p37>=1))")))))))
Formula 3 simplified : !XGXGX"((p79>=1)&&(p37>=1))"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
309 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,13.7831,363112,1,0,283,1.11677e+06,68,105,5123,1.71152e+06,583
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(X(F(X("(p5>=1)")))))))
Formula 4 simplified : !FXXFX"(p5>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
443 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,18.2088,471088,1,0,335,1.4266e+06,77,131,5124,2.28262e+06,723
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G(G("((p7>=1)&&(p104>=1))")))))
Formula 5 simplified : !G"((p7>=1)&&(p104>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,18.2793,472672,1,0,335,1.43247e+06,83,131,5126,2.28684e+06,730
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(("((p14>=1)&&(p82>=1))")U(G("((p63>=1)&&(p132>=1))")))))
Formula 6 simplified : !G("((p14>=1)&&(p82>=1))" U G"((p63>=1)&&(p132>=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,18.2812,473196,1,0,335,1.43247e+06,101,131,5143,2.28684e+06,739
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((G(X("((p2>=1)&&(p79>=1))")))U(F(F("((p46>=1)&&(p126>=1))"))))))
Formula 7 simplified : !G(GX"((p2>=1)&&(p79>=1))" U F"((p46>=1)&&(p126>=1))")
4 unique states visited
4 strongly connected components in search stack
5 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,18.2862,473196,1,0,335,1.43247e+06,110,131,5146,2.2869e+06,754
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(X(X(X("((p15>=1)&&(p115>=1))")))))))
Formula 8 simplified : !GXXXX"((p15>=1)&&(p115>=1))"
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
506 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.345,598320,1,0,415,1.78939e+06,116,158,5149,2.89323e+06,900
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((false))
Formula 9 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,23.3453,598320,1,0,415,1.78939e+06,116,158,5149,2.89323e+06,901
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((false))
Formula 10 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,23.3454,598320,1,0,415,1.78939e+06,116,158,5149,2.89323e+06,901
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G(X(X(F("(p63>=1)")))))))
Formula 11 simplified : !XGXXF"(p63>=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,23.3523,598584,1,0,416,1.79049e+06,125,158,5149,2.89401e+06,910
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("(p52>=1)")U((G("((p4>=1)&&(p87>=1))"))U(X("(p44>=1)")))))
Formula 12 simplified : !("(p52>=1)" U (G"((p4>=1)&&(p87>=1))" U X"(p44>=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,23.3626,599080,1,0,416,1.79126e+06,139,158,5158,2.89457e+06,920
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X("((p74>=1)&&(p116>=1))"))U(G(G(F("((p25>=1)&&(p93>=1))"))))))
Formula 13 simplified : !(X"((p74>=1)&&(p116>=1))" U GF"((p25>=1)&&(p93>=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
31 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.6732,610960,1,0,418,1.82199e+06,148,158,5161,2.92415e+06,934
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F(F("((p47>=1)&&(p119>=1))")))))
Formula 14 simplified : !F"((p47>=1)&&(p119>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
289 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,26.5589,664288,1,0,492,1.98997e+06,157,183,5164,3.19022e+06,1074
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((("((p34>=1)&&(p119>=1))")U((G("((p76>=1)&&(p112>=1))"))U("((p77>=1)&&(p134>=1))"))))
Formula 15 simplified : !("((p34>=1)&&(p119>=1))" U (G"((p76>=1)&&(p112>=1))" U "((p77>=1)&&(p134>=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,26.5611,664544,1,0,492,1.98997e+06,176,183,5185,3.19022e+06,1080
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1553578401710

--------------------
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:32:48 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:32:48 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 5:32:48 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 161 ms
Mar 26, 2019 5:32:48 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 139 places.
Mar 26, 2019 5:32:49 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 823 transitions.
Mar 26, 2019 5:32:49 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 26, 2019 5:32:49 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 33 ms
Mar 26, 2019 5:32:49 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 139 ms
Mar 26, 2019 5:32:49 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 91 ms
Mar 26, 2019 5:32:49 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 823 transitions.
Mar 26, 2019 5:32:49 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 139 places.
Mar 26, 2019 5:32:49 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 823 transitions.
Mar 26, 2019 5:32:49 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 26, 2019 5:32:49 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 26, 2019 5:32:50 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 823 transitions.
Mar 26, 2019 5:32:50 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 69 place invariants in 41 ms
Mar 26, 2019 5:32:51 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 139 variables to be positive in 640 ms
Mar 26, 2019 5:32:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 823 transitions.
Mar 26, 2019 5:32:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/823 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 5:32:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 101 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 5:32:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 823 transitions.
Mar 26, 2019 5:32:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 5:32:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 823 transitions.
Mar 26, 2019 5:32:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/823) took 13 ms. Total solver calls (SAT/UNSAT): 13(0/13)
Mar 26, 2019 5:32:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(15/823) took 3057 ms. Total solver calls (SAT/UNSAT): 1768(1755/13)
Mar 26, 2019 5:33:03 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(30/823) took 8621 ms. Total solver calls (SAT/UNSAT): 3620(3607/13)
Mar 26, 2019 5:33:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(33/823) took 13243 ms. Total solver calls (SAT/UNSAT): 3987(3974/13)
Mar 26, 2019 5:33:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(38/823) took 16669 ms. Total solver calls (SAT/UNSAT): 4642(4629/13)
Mar 26, 2019 5:33:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(61/823) took 19753 ms. Total solver calls (SAT/UNSAT): 7541(7528/13)
Mar 26, 2019 5:33:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(80/823) took 22842 ms. Total solver calls (SAT/UNSAT): 9925(9912/13)
Mar 26, 2019 5:33:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(98/823) took 25880 ms. Total solver calls (SAT/UNSAT): 11023(11010/13)
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:33:21 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 31328ms 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-04a"
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-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 r192-oct2-155234409700331"
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" = "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;