fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922813700001
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DLCshifumi-PT-2a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.980 6188.00 14932.00 37.80 FFTFFFTTFTTFFFTT 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.r066-tajo-158922813700001.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 DLCshifumi-PT-2a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922813700001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 2.8K Mar 30 21:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 21:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 29 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 29 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 07:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 07:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 01:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 01:35 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 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 213K 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 DLCshifumi-PT-2a-00
FORMULA_NAME DLCshifumi-PT-2a-01
FORMULA_NAME DLCshifumi-PT-2a-02
FORMULA_NAME DLCshifumi-PT-2a-03
FORMULA_NAME DLCshifumi-PT-2a-04
FORMULA_NAME DLCshifumi-PT-2a-05
FORMULA_NAME DLCshifumi-PT-2a-06
FORMULA_NAME DLCshifumi-PT-2a-07
FORMULA_NAME DLCshifumi-PT-2a-08
FORMULA_NAME DLCshifumi-PT-2a-09
FORMULA_NAME DLCshifumi-PT-2a-10
FORMULA_NAME DLCshifumi-PT-2a-11
FORMULA_NAME DLCshifumi-PT-2a-12
FORMULA_NAME DLCshifumi-PT-2a-13
FORMULA_NAME DLCshifumi-PT-2a-14
FORMULA_NAME DLCshifumi-PT-2a-15

=== Now, execution of the tool begins

BK_START 1590095999803

[2020-05-21 21:20:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 21:20:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 21:20:01] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2020-05-21 21:20:01] [INFO ] Transformed 188 places.
[2020-05-21 21:20:01] [INFO ] Transformed 888 transitions.
[2020-05-21 21:20:01] [INFO ] Found NUPN structural information;
[2020-05-21 21:20:01] [INFO ] Parsed PT model containing 188 places and 888 transitions in 144 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 505 ms. (steps per millisecond=198 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0]
[2020-05-21 21:20:02] [INFO ] Flow matrix only has 184 transitions (discarded 576 similar events)
// Phase 1: matrix 184 rows 188 cols
[2020-05-21 21:20:02] [INFO ] Computed 79 place invariants in 7 ms
[2020-05-21 21:20:02] [INFO ] [Real]Absence check using 79 positive place invariants in 47 ms returned sat
[2020-05-21 21:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:02] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-05-21 21:20:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:02] [INFO ] [Nat]Absence check using 79 positive place invariants in 10 ms returned unsat
[2020-05-21 21:20:02] [INFO ] [Real]Absence check using 79 positive place invariants in 24 ms returned sat
[2020-05-21 21:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:02] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2020-05-21 21:20:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:02] [INFO ] [Nat]Absence check using 79 positive place invariants in 7 ms returned unsat
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using 79 positive place invariants in 23 ms returned sat
[2020-05-21 21:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-05-21 21:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:03] [INFO ] [Nat]Absence check using 79 positive place invariants in 28 ms returned unsat
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using 79 positive place invariants in 29 ms returned sat
[2020-05-21 21:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-05-21 21:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:03] [INFO ] [Nat]Absence check using 79 positive place invariants in 12 ms returned unsat
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using 79 positive place invariants in 30 ms returned sat
[2020-05-21 21:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2020-05-21 21:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:03] [INFO ] [Nat]Absence check using 79 positive place invariants in 8 ms returned unsat
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using 79 positive place invariants in 25 ms returned sat
[2020-05-21 21:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-05-21 21:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:03] [INFO ] [Nat]Absence check using 79 positive place invariants in 8 ms returned unsat
[2020-05-21 21:20:03] [INFO ] [Real]Absence check using 79 positive place invariants in 24 ms returned sat
[2020-05-21 21:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:04] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-05-21 21:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:04] [INFO ] [Nat]Absence check using 79 positive place invariants in 18 ms returned unsat
[2020-05-21 21:20:04] [INFO ] [Real]Absence check using 79 positive place invariants in 24 ms returned sat
[2020-05-21 21:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:04] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-05-21 21:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:04] [INFO ] [Nat]Absence check using 79 positive place invariants in 12 ms returned unsat
[2020-05-21 21:20:04] [INFO ] [Real]Absence check using 79 positive place invariants in 29 ms returned sat
[2020-05-21 21:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:04] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-21 21:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:04] [INFO ] [Nat]Absence check using 79 positive place invariants in 8 ms returned unsat
[2020-05-21 21:20:04] [INFO ] [Real]Absence check using 79 positive place invariants in 21 ms returned sat
[2020-05-21 21:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 21:20:04] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2020-05-21 21:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 21:20:04] [INFO ] [Nat]Absence check using 79 positive place invariants in 26 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-05-21 21:20:05] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-21 21:20:05] [INFO ] Flatten gal took : 65 ms
FORMULA DLCshifumi-PT-2a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 21:20:05] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 21:20:05] [INFO ] Applying decomposition
[2020-05-21 21:20:05] [INFO ] Flatten gal took : 26 ms
[2020-05-21 21:20:05] [INFO ] Input system was already deterministic with 760 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/graph6234984221580063139.txt, -o, /tmp/graph6234984221580063139.bin, -w, /tmp/graph6234984221580063139.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/graph6234984221580063139.bin, -l, -1, -v, -w, /tmp/graph6234984221580063139.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 21:20:05] [INFO ] Decomposing Gal with order
[2020-05-21 21:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 21:20:05] [INFO ] Removed a total of 710 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 184 out of 760 initially.
// Phase 1: matrix 184 rows 188 cols
[2020-05-21 21:20:05] [INFO ] Computed 79 place invariants in 3 ms
inv : p0 + p151 = 1
inv : p0 + p159 = 1
inv : p0 + p71 + p72 + p73 + p74 + p75 + p76 + p77 = 1
inv : p0 + p135 = 1
inv : p0 + p143 = 1
inv : p0 + p184 = 1
inv : p0 + p176 = 1
inv : p0 + p127 = 1
inv : p0 + p64 + p65 + p66 + p67 + p68 + p69 + p70 = 1
inv : p0 + p160 = 1
inv : p0 + p168 = 1
inv : p0 + p150 = 1
inv : p0 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p158 = 1
inv : p0 + p134 = 1
inv : p0 + p142 = 1
inv : p0 + p78 + p79 + p80 + p81 + p82 + p83 + p84 = 1
inv : p0 + p183 = 1
inv : p0 + p126 = 1
inv : p0 + p167 = 1
inv : p0 + p175 = 1
inv : p0 + p145 = 1
inv : p0 + p153 = 1
inv : p0 + p15 + p16 + p17 + p18 + p19 + p20 + p21 = 1
inv : p0 + p129 = 1
inv : p0 + p137 = 1
inv : p0 + p186 = 1
inv : p0 + p178 = 1
inv : p0 + p57 + p58 + p59 + p60 + p61 + p62 + p63 = 1
inv : p0 + p162 = 1
inv : p0 + p170 = 1
inv : p0 + p144 = 1
inv : p0 + p152 = 1
inv : p0 + p128 = 1
inv : p0 + p136 = 1
inv : p0 + p185 = 1
inv : p0 + p177 = 1
inv : p0 + p161 = 1
inv : p0 + p85 + p86 + p87 + p88 + p89 + p90 + p91 = 1
inv : p0 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 = 1
inv : p0 + p169 = 1
inv : p0 + p147 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 + p41 + p42 = 1
inv : p0 + p155 = 1
inv : p0 + p131 = 1
inv : p0 + p139 = 1
inv : p0 + p180 = 1
inv : p0 + p164 = 1
inv : p0 + p172 = 1
inv : p0 + p146 = 1
inv : p0 + p154 = 1
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 = 1
inv : p0 + p130 = 1
inv : p0 + p138 = 1
inv : p0 + p187 = 1
inv : p0 + p179 = 1
inv : p0 + p92 + p93 + p94 + p95 + p96 + p97 + p98 = 1
inv : p0 + p163 = 1
inv : p0 + p171 = 1
inv : p0 + p43 + p44 + p45 + p46 + p47 + p48 + p49 = 1
inv : p0 + p149 = 1
inv : p0 + p157 = 1
inv : p0 + p133 = 1
inv : p0 + p141 = 1
inv : p0 + p182 = 1
inv : p0 + p166 = 1
inv : p0 + p174 = 1
inv : p0 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p148 = 1
inv : p0 + p156 = 1
inv : p0 + p132 = 1
inv : p0 + p140 = 1
inv : p0 + p99 + p100 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p181 = 1
inv : p0 + p50 + p51 + p52 + p53 + p54 + p55 + p56 = 1
inv : p0 + p165 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p173 = 1
inv : p0 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 = 1
Total of 79 invariants.
[2020-05-21 21:20:05] [INFO ] Computed 79 place invariants in 5 ms
[2020-05-21 21:20:05] [INFO ] Flatten gal took : 156 ms
[2020-05-21 21:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 11 ms.
[2020-05-21 21:20:05] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-21 21:20:05] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((X((X(F(F(G("((i8.u16.p58==0)||(i0.u0.p4==1))")))))&&("((i8.u16.p58==0)||(i0.u0.p4==1))"))))
Formula 0 simplified : !X("((i8.u16.p58==0)||(i0.u0.p4==1))" & XFG"((i8.u16.p58==0)||(i0.u0.p4==1))")
built 32 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 39 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 42 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.100857,19928,1,0,2536,1291,2121,3033,1236,2132,8025
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X(F(X(G(X(X("((i9.u19.p68==0)||(i15.u32.p115==1))")))))))))
Formula 1 simplified : XFXGXX"((i9.u19.p68==0)||(i15.u32.p115==1))"
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.107666,20384,1,0,2886,1305,2311,3458,1238,2219,9342
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("((i4.u8.p35==0)||(i13.u26.p95==1))")))
Formula 2 simplified : !G"((i4.u8.p35==0)||(i13.u26.p95==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.11098,20384,1,0,2982,1352,2354,3518,1239,2234,9806
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(((((G("((i15.u30.p138==0)||(i2.u4.p18==1))"))||("(i13.u27.p96==0)"))||("(i16.u36.p157==1)"))||("(i15.u32.p151==0)"))||("(i12.u24.p85==1)")))))
Formula 3 simplified : !XX("(i12.u24.p85==1)" | "(i13.u27.p96==0)" | "(i15.u32.p151==0)" | "(i16.u36.p157==1)" | G"((i15.u30.p138==0)||(i2.u4.p18==1))")
3 unique states visited
0 strongly connected components in search stack
2 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.112248,20648,1,0,2982,1352,2402,3518,1245,2234,9822
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DLCshifumi-PT-2a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(F(X(F(X((X(F("((i4.u8.p32==0)||(i7.u15.p55==1))")))&&(X("((i2.u5.p19==0)||(i6.u12.p43==1))")))))))))
Formula 4 simplified : FXFX(XF"((i4.u8.p32==0)||(i7.u15.p55==1))" & X"((i2.u5.p19==0)||(i6.u12.p43==1))")
8 unique states visited
8 strongly connected components in search stack
10 transitions explored
8 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.136529,21824,1,0,5889,1435,2487,7416,1247,2674,16681
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(G((!((F(G("((i1.u3.p13==0)||(i7.u14.p51==1))")))U("(i16.u36.p169==1)")))||(!(F("((i1.u3.p13==0)||(i7.u14.p51==1))"))))))))
Formula 5 simplified : !X!G(!(FG"((i1.u3.p13==0)||(i7.u14.p51==1))" U "(i16.u36.p169==1)") | !F"((i1.u3.p13==0)||(i7.u14.p51==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.138104,22128,1,0,5889,1435,2506,7416,1251,2674,16718
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DLCshifumi-PT-2a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G("((i13.u27.p96!=0)&&(i10.u20.p73!=1))"))))
Formula 6 simplified : !XG"((i13.u27.p96!=0)&&(i10.u20.p73!=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.139193,22128,1,0,5889,1435,2529,7416,1252,2674,16728
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(X("((i15.u32.p147==0)||(i16.u35.p121==1))")))))
Formula 7 simplified : !GXX"((i15.u32.p147==0)||(i16.u35.p121==1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.141417,22340,1,0,5967,1435,2550,7487,1253,2675,16922
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCshifumi-PT-2a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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-21 21:20:05] [INFO ] Built C files in 635ms 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 1590096005991

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCshifumi-PT-2a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DLCshifumi-PT-2a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922813700001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-2a.tgz
mv DLCshifumi-PT-2a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;