fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r141-smll-158961510800249
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Raft-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.250 23307.00 52225.00 374.40 FFFFTFFFTFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r141-smll-158961510800249.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Raft-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510800249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 2.8K Apr 12 08:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 12 08:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 11 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 21:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 21:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 89K Mar 24 05:38 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 Raft-PT-06-00
FORMULA_NAME Raft-PT-06-01
FORMULA_NAME Raft-PT-06-02
FORMULA_NAME Raft-PT-06-03
FORMULA_NAME Raft-PT-06-04
FORMULA_NAME Raft-PT-06-05
FORMULA_NAME Raft-PT-06-06
FORMULA_NAME Raft-PT-06-07
FORMULA_NAME Raft-PT-06-08
FORMULA_NAME Raft-PT-06-09
FORMULA_NAME Raft-PT-06-10
FORMULA_NAME Raft-PT-06-11
FORMULA_NAME Raft-PT-06-12
FORMULA_NAME Raft-PT-06-13
FORMULA_NAME Raft-PT-06-14
FORMULA_NAME Raft-PT-06-15

=== Now, execution of the tool begins

BK_START 1590054113762

[2020-05-21 09:41:56] [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 09:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:41:56] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2020-05-21 09:41:57] [INFO ] Transformed 188 places.
[2020-05-21 09:41:57] [INFO ] Transformed 332 transitions.
[2020-05-21 09:41:57] [INFO ] Found NUPN structural information;
[2020-05-21 09:41:57] [INFO ] Parsed PT model containing 188 places and 332 transitions in 198 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 675 ms. (steps per millisecond=148 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-21 09:41:57] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 188 cols
[2020-05-21 09:41:57] [INFO ] Computed 36 place invariants in 14 ms
[2020-05-21 09:41:58] [INFO ] [Real]Absence check using 36 positive place invariants in 56 ms returned sat
[2020-05-21 09:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:41:58] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2020-05-21 09:41:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:41:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned unsat
[2020-05-21 09:41:58] [INFO ] [Real]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-05-21 09:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:41:58] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-21 09:41:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:41:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned unsat
[2020-05-21 09:41:59] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2020-05-21 09:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:41:59] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2020-05-21 09:41:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:41:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned unsat
[2020-05-21 09:41:59] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-05-21 09:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:41:59] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-05-21 09:41:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:41:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned unsat
[2020-05-21 09:41:59] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2020-05-21 09:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:42:00] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-21 09:42:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:42:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-21 09:42:00] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-21 09:42:00] [INFO ] Flatten gal took : 134 ms
FORMULA Raft-PT-06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-06-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:42:00] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 09:42:00] [INFO ] Applying decomposition
[2020-05-21 09:42:00] [INFO ] Flatten gal took : 43 ms
[2020-05-21 09:42:01] [INFO ] Input system was already deterministic with 306 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/graph1513022364627126954.txt, -o, /tmp/graph1513022364627126954.bin, -w, /tmp/graph1513022364627126954.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/graph1513022364627126954.bin, -l, -1, -v, -w, /tmp/graph1513022364627126954.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 09:42:01] [INFO ] Decomposing Gal with order
[2020-05-21 09:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 280 out of 306 initially.
// Phase 1: matrix 280 rows 188 cols
[2020-05-21 09:42:01] [INFO ] Computed 36 place invariants in 6 ms
inv : p0 + p56 + p57 + p58 + p59 + p60 = 1
inv : p0 + p121 + p122 + p123 + p124 + p125 = 1
inv : p0 + p146 + p147 + p148 + p149 + p150 = 1
inv : p0 + p81 + p82 + p83 + p84 + p85 = 1
inv : p0 + p171 + p172 + p173 + p174 + p175 = 1
inv : p0 + p31 + p32 + p33 + p34 + p35 = 1
inv : p0 + p161 + p162 + p163 + p164 + p165 = 1
inv : p0 + p96 + p97 + p98 + p99 + p100 = 1
inv : p0 + p21 + p22 + p23 + p24 + p25 = 1
inv : p0 + p131 + p132 + p133 + p134 + p135 = 1
inv : p0 + p151 + p152 + p153 + p154 + p155 = 1
inv : p0 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p111 + p112 + p113 + p114 + p115 = 1
inv : p0 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p136 + p137 + p138 + p139 + p140 = 1
inv : p0 + p126 + p127 + p128 + p129 + p130 = 1
inv : p0 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p76 + p77 + p78 + p79 + p80 = 1
inv : p0 + p141 + p142 + p143 + p144 + p145 = 1
inv : p0 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p51 + p52 + p53 + p54 + p55 = 1
inv : p0 + p116 + p117 + p118 + p119 + p120 = 1
inv : p0 + p26 + p27 + p28 + p29 + p30 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 = 1
inv : p0 + p91 + p92 + p93 + p94 + p95 = 1
inv : p0 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p156 + p157 + p158 + p159 + p160 = 1
inv : p0 + p166 + p167 + p168 + p169 + p170 = 1
inv : p0 + p86 + p87 + p88 + p89 + p90 = 1
inv : p0 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p46 + p47 + p48 + p49 + p50 = 1
inv : p0 + p176 + p177 + p178 + p179 + p180 = 1
inv : p0 + p71 + p72 + p73 + p74 + p75 = 1
inv : p0 + p61 + p62 + p63 + p64 + p65 = 1
inv : p0 + p66 + p67 + p68 + p69 + p70 = 1
Total of 36 invariants.
[2020-05-21 09:42:01] [INFO ] Computed 36 place invariants in 17 ms
[2020-05-21 09:42:01] [INFO ] Removed a total of 234 redundant transitions.
[2020-05-21 09:42:01] [INFO ] Flatten gal took : 170 ms
[2020-05-21 09:42:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 235 labels/synchronizations in 24 ms.
[2020-05-21 09:42:01] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 9 ms
[2020-05-21 09:42:01] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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 11 LTL properties
Checking formula 0 : !((G("((i4.u28.p15==0)||(i4.u14.p85==1))")))
Formula 0 simplified : !G"((i4.u28.p15==0)||(i4.u14.p85==1))"
built 29 ordering constraints for composite.
built 25 ordering constraints for composite.
built 25 ordering constraints for composite.
built 22 ordering constraints for composite.
built 28 ordering constraints for composite.
built 25 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-21 09:42:01] [INFO ] Proved 188 variables to be positive in 489 ms
[2020-05-21 09:42:01] [INFO ] Computing symmetric may disable matrix : 306 transitions.
[2020-05-21 09:42:01] [INFO ] Computation of disable matrix completed :0/306 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:42:01] [INFO ] Computation of Complete disable matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:42:01] [INFO ] Computing symmetric may enable matrix : 306 transitions.
[2020-05-21 09:42:02] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions i0.u26.t24, i0.u26.t25, i0.u26.t26, i0.u26.t28, i1.u30.t6, i1.u30.t7, i1.u30.t8, i1.u30.t10, i2.u24.t36, i2.u24.t37, i2.u24.t38, i2.u24.t40, i3.u25.t30, i3.u25.t31, i3.u25.t32, i3.u25.t34, i4.u27.t18, i4.u27.t19, i4.u27.t20, i4.u27.t22, i5.u29.t12, i5.u29.t13, i5.u29.t14, i5.u29.t16, i7.t331, i7.u33.t329, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/177/26/203
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
71 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.761762,29868,1,0,27867,1071,2339,65710,525,6186,34457
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-06-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("((i2.u24.p151==0)||(i7.u33.p187==1))"))U(F(X(G("((i3.u9.p58==0)||(i2.u0.p4==1))"))))))
Formula 1 simplified : !(F"((i2.u24.p151==0)||(i7.u33.p187==1))" U FXG"((i3.u9.p58==0)||(i2.u0.p4==1))")
[2020-05-21 09:42:03] [INFO ] Computing symmetric co enabling matrix : 306 transitions.
[2020-05-21 09:42:05] [INFO ] Computation of co-enabling matrix(27/306) took 1693 ms. Total solver calls (SAT/UNSAT): 1478(18/1460)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
299 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,3.75139,92448,1,0,126507,1523,2413,444571,527,16560,89175
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-06-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X(F(X(!(F(G((F("((i0.u12.p75!=0)&&(i1.u22.p143!=1))"))U("((i5.u2.p17!=0)&&(i4.u27.p167!=1))"))))))))&&(X("((i5.u2.p17==0)||(i4.u27.p167==1))"))))
Formula 2 simplified : !(XFX!FG(F"((i0.u12.p75!=0)&&(i1.u22.p143!=1))" U "((i5.u2.p17!=0)&&(i4.u27.p167!=1))") & X"((i5.u2.p17==0)||(i4.u27.p167==1))")
13 unique states visited
8 strongly connected components in search stack
16 transitions explored
12 items max in DFS search stack
166 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,5.41694,133140,1,0,202246,1544,2526,665553,533,17637,163547
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-06-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("((i1.u3.p24==0)||(i2.u24.p51==1))")))
Formula 3 simplified : !G"((i1.u3.p24==0)||(i2.u24.p51==1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
78 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,6.20339,148980,1,0,228104,2336,2610,763620,535,28546,183944
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-06-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F((X(!(X(("((i4.u28.p117!=0)&&(i0.u26.p136!=1))")U("((i4.u6.p40==0)||(i0.u1.p6==1))")))))&&("((i3.u5.p35==0)||(i5.u16.p95==1))")))&&(G("((i4.u28.p117==0)||(i0.u26.p136==1))"))))
Formula 4 simplified : !(F("((i3.u5.p35==0)||(i5.u16.p95==1))" & X!X("((i4.u28.p117!=0)&&(i0.u26.p136!=1))" U "((i4.u6.p40==0)||(i0.u1.p6==1))")) & G"((i4.u28.p117==0)||(i0.u26.p136==1))")
[2020-05-21 09:42:08] [INFO ] Computation of co-enabling matrix(86/306) took 4710 ms. Total solver calls (SAT/UNSAT): 3819(1479/2340)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
128 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,7.48758,173408,1,0,271210,2692,2688,902222,536,33879,208247
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-06-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(F("((i3.u8.p48==0)||(i3.u9.p56==1))")))))
Formula 5 simplified : !GXF"((i3.u8.p48==0)||(i3.u9.p56==1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,7.50852,174200,1,0,273021,2694,2744,905714,536,33947,209568
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-06-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("((i7.u33.p186==0)||(i4.u14.p81==1))")U(X(G(X(F((("((i5.u2.p19==0)||(i5.u7.p43==1))")U("((i7.u33.p186==0)||(i4.u14.p81==1))"))||(X(!(X("((i7.u33.p186==0)||(i4.u14.p81==1))")))))))))))
Formula 6 simplified : !("((i7.u33.p186==0)||(i4.u14.p81==1))" U XGXF(("((i5.u2.p19==0)||(i5.u7.p43==1))" U "((i7.u33.p186==0)||(i4.u14.p81==1))") | X!X"((i7.u33.p186==0)||(i4.u14.p81==1))"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,7.50945,174200,1,0,273021,2694,2744,905714,536,33947,209568
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Raft-PT-06-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(!(("((u32.p181!=0)&&(i4.u27.p169!=1))")U(X(X("((u32.p181==0)||(i4.u27.p169==1))"))))))))
Formula 7 simplified : !XG!("((u32.p181!=0)&&(i4.u27.p169!=1))" U XX"((u32.p181==0)||(i4.u27.p169==1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
59 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.09601,190548,1,0,300838,2719,2760,1.00656e+06,537,35264,236767
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-06-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((!(G(!(G("((i2.u0.p4==0)||(i5.u11.p66==1))")))))&&(F("((u32.p184==0)||(i1.u30.p180==1))")))))
Formula 8 simplified : !F(!G!G"((i2.u0.p4==0)||(i5.u11.p66==1))" & F"((u32.p184==0)||(i1.u30.p180==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
122 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,9.31753,226440,1,0,368435,2731,2831,1.22358e+06,538,35685,284336
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-06-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(!(("((i3.u8.p47!=0)&&(i3.u25.p109!=1))")U(X((((G("((i3.u8.p47==0)||(i3.u25.p109==1))"))&&("((i2.u24.p54==0)||(i2.u24.p151==1))"))&&("(i0.u10.p63!=0)"))&&("(i4.u27.p169!=1)")))))))
Formula 9 simplified : !X!("((i3.u8.p47!=0)&&(i3.u25.p109!=1))" U X("((i2.u24.p54==0)||(i2.u24.p151==1))" & "(i0.u10.p63!=0)" & "(i4.u27.p169!=1)" & G"((i3.u8.p47==0)||(i3.u25.p109==1))"))
[2020-05-21 09:42:11] [INFO ] Computation of co-enabling matrix(169/306) took 7731 ms. Total solver calls (SAT/UNSAT): 5673(3032/2641)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
52 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,9.84603,242464,1,0,397610,3971,2901,1.31141e+06,545,49699,307432
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-06-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((X(F(X("(i4.u14.p81==1)"))))||(X("(i4.u14.p81==1)")))U("((i4.u14.p81==1)&&((i4.u27.p166==0)||(i0.u12.p74==1)))")))
Formula 10 simplified : !((X"(i4.u14.p81==1)" | XFX"(i4.u14.p81==1)") U "((i4.u14.p81==1)&&((i4.u27.p166==0)||(i0.u12.p74==1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
195 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,11.7957,284440,1,0,474393,4016,2930,1.52141e+06,546,50903,353908
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-06-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 09:42:14] [INFO ] Computation of co-enabling matrix(259/306) took 10735 ms. Total solver calls (SAT/UNSAT): 7440(4596/2844)
[2020-05-21 09:42:15] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-21 09:42:15] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 0) (select s0 176) (select s0 177) (select s0 178) (select s0 179) (select s0 180)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 0) (select s0 176) (select s0 177) (select s0 178) (select s0 179) (select s0 180)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 0) (select s0 176) (select s0 177) (select s0 178) (select s0 179) (select s0 180)))), (assert (= 1 (+ (select s0 0) (select s0 71) (select s0 72) (select s0 73) (select s0 74) (select s0 75)))), (assert (and (>= (select s0 73) 1) (>= (select s0 180) 1))), (assert (>= (select s0 0) 0)), (assert (>= (select s0 71) 0)), (assert (>= (select s0 72) 0)), (assert (>= (select s0 73) 0)), (assert (>= (select s0 74) 0)), (assert (>= (select s0 75) 0)), (assert (>= (select s0 176) 0)), (assert (>= (select s0 177) 0)), (assert (>= (select s0 178) 0)), (assert (>= (select s0 179) 0)), (assert (>= (select s0 180) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@2840102d
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@2840102d
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
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: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 09:42:15] [INFO ] Built C files in 14794ms 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 1590054137069

--------------------
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="Raft-PT-06"
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 Raft-PT-06, 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 r141-smll-158961510800249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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