About the Execution of ITS-Tools for ShieldIIPt-PT-010A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.660 | 4160.00 | 10597.00 | 38.20 | FFTFFFTFFTFTTFFF | 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.r210-tajo-159033475500297.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 ShieldIIPt-PT-010A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500297
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.5K May 14 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 53K May 12 20:42 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 ShieldIIPt-PT-010A-00
FORMULA_NAME ShieldIIPt-PT-010A-01
FORMULA_NAME ShieldIIPt-PT-010A-02
FORMULA_NAME ShieldIIPt-PT-010A-03
FORMULA_NAME ShieldIIPt-PT-010A-04
FORMULA_NAME ShieldIIPt-PT-010A-05
FORMULA_NAME ShieldIIPt-PT-010A-06
FORMULA_NAME ShieldIIPt-PT-010A-07
FORMULA_NAME ShieldIIPt-PT-010A-08
FORMULA_NAME ShieldIIPt-PT-010A-09
FORMULA_NAME ShieldIIPt-PT-010A-10
FORMULA_NAME ShieldIIPt-PT-010A-11
FORMULA_NAME ShieldIIPt-PT-010A-12
FORMULA_NAME ShieldIIPt-PT-010A-13
FORMULA_NAME ShieldIIPt-PT-010A-14
FORMULA_NAME ShieldIIPt-PT-010A-15
=== Now, execution of the tool begins
BK_START 1590580120920
[2020-05-27 11:48:42] [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-27 11:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 11:48:42] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-05-27 11:48:42] [INFO ] Transformed 193 places.
[2020-05-27 11:48:42] [INFO ] Transformed 143 transitions.
[2020-05-27 11:48:42] [INFO ] Found NUPN structural information;
[2020-05-27 11:48:42] [INFO ] Parsed PT model containing 193 places and 143 transitions in 82 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 320 ms. (steps per millisecond=312 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 142 rows 193 cols
[2020-05-27 11:48:42] [INFO ] Computed 91 place invariants in 6 ms
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using 91 positive place invariants in 47 ms returned sat
[2020-05-27 11:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-27 11:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 11:48:43] [INFO ] [Nat]Absence check using 91 positive place invariants in 8 ms returned unsat
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using 91 positive place invariants in 26 ms returned sat
[2020-05-27 11:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-05-27 11:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 11:48:43] [INFO ] [Nat]Absence check using 91 positive place invariants in 6 ms returned unsat
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using 91 positive place invariants in 23 ms returned sat
[2020-05-27 11:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-05-27 11:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 11:48:43] [INFO ] [Nat]Absence check using 91 positive place invariants in 6 ms returned unsat
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using 91 positive place invariants in 21 ms returned sat
[2020-05-27 11:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:48:43] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-05-27 11:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 11:48:43] [INFO ] [Nat]Absence check using 91 positive place invariants in 8 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2020-05-27 11:48:44] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-27 11:48:44] [INFO ] Flatten gal took : 55 ms
FORMULA ShieldIIPt-PT-010A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 11:48:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 11:48:44] [INFO ] Flatten gal took : 18 ms
[2020-05-27 11:48:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-010A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 11:48:44] [INFO ] Applying decomposition
[2020-05-27 11:48:44] [INFO ] Flatten gal took : 25 ms
[2020-05-27 11:48:44] [INFO ] Input system was already deterministic with 142 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/graph4787265154793859027.txt, -o, /tmp/graph4787265154793859027.bin, -w, /tmp/graph4787265154793859027.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 142 rows 193 cols
[2020-05-27 11:48:44] [INFO ] Computed 91 place invariants in 4 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p168 + p169 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p176 + p177 + p178 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p50 + p51 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p90 + p91 = 1
inv : p0 + p98 + p99 = 1
inv : p0 + p100 + p101 + p102 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p24 + p27 + p28 = 1
inv : p0 + p88 + p89 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p81 + p82 + p83 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p176 + p179 + p180 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p81 + p84 + p85 = 1
inv : p0 + p62 + p63 + p64 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p52 + p53 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p58 + p59 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p138 + p141 + p142 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p119 + p122 + p123 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p100 + p103 + p104 = 1
inv : p0 + p166 + p167 = 1
inv : p0 + p134 + p135 = 1
inv : p0 + p24 + p25 + p26 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p62 + p65 + p66 = 1
inv : p0 + p43 + p44 + p45 = 1
inv : p0 + p138 + p139 + p140 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p119 + p120 + p121 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p164 + p165 = 1
inv : p0 + p56 + p57 = 1
inv : p0 + p157 + p160 + p161 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p43 + p46 + p47 = 1
inv : p0 + p136 + p137 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p92 + p93 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p130 + p131 = 1
inv : p0 + p162 + p163 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p16 + p17 = 1
inv : p0 + p48 + p49 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p54 + p55 = 1
inv : p0 + p157 + p158 + p159 = 1
inv : p0 + p86 + p87 = 1
Total of 91 invariants.
[2020-05-27 11:48:44] [INFO ] Computed 91 place invariants in 12 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4787265154793859027.bin, -l, -1, -v, -w, /tmp/graph4787265154793859027.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 11:48:44] [INFO ] Decomposing Gal with order
[2020-05-27 11:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 11:48:44] [INFO ] Removed a total of 30 redundant transitions.
[2020-05-27 11:48:44] [INFO ] Flatten gal took : 77 ms
[2020-05-27 11:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-27 11:48:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-27 11:48:44] [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 7 LTL properties
Checking formula 0 : !((G(!((G("((i2.i2.u18.p46==0)||(i4.i0.u32.p77==1))"))U(X("((i4.i2.u26.p66==0)||(i0.i2.u6.p17==1))"))))))
Formula 0 simplified : !G!(G"((i2.i2.u18.p46==0)||(i4.i0.u32.p77==1))" U X"((i4.i2.u26.p66==0)||(i0.i2.u6.p17==1))")
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-27 11:48:44] [INFO ] Proved 193 variables to be positive in 370 ms
[2020-05-27 11:48:44] [INFO ] Computing symmetric may disable matrix : 142 transitions.
[2020-05-27 11:48:44] [INFO ] Computation of disable matrix completed :0/142 took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:48:44] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:48:44] [INFO ] Computing symmetric may enable matrix : 142 transitions.
[2020-05-27 11:48:44] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
23 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.27078,23780,1,0,13727,301,1232,31026,120,1408,20065
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(((G(!(G("((i8.i2.u72.p172==0)||(i7.i2.u63.p151==1))"))))&&("((i8.i2.u72.p172==0)||(i7.i2.u63.p151==1))"))&&("((i0.i0.u3.p10==0)||(i8.i0.u60.p145==1))")))))
Formula 1 simplified : !XG("((i0.i0.u3.p10==0)||(i8.i0.u60.p145==1))" & "((i8.i2.u72.p172==0)||(i7.i2.u63.p151==1))" & G!G"((i8.i2.u72.p172==0)||(i7.i2.u63.p151==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,0.274856,24320,1,0,13744,301,1232,31070,120,1411,20413
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((i0.i0.u3.p10==0)||(i0.i0.u0.p1==1))||(i1.i2.u10.p24==0))||(i8.i2.u70.p168==1))")U(F(G((G("((i1.i2.u10.p24==0)||(i8.i2.u70.p168==1))"))&&("((i6.i1.u59.p143==0)||(i3.i3.u39.p95==1))"))))))
Formula 2 simplified : !("((((i0.i0.u3.p10==0)||(i0.i0.u0.p1==1))||(i1.i2.u10.p24==0))||(i8.i2.u70.p168==1))" U FG("((i6.i1.u59.p143==0)||(i3.i3.u39.p95==1))" & G"((i1.i2.u10.p24==0)||(i8.i2.u70.p168==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.289026,25284,1,0,15398,301,1298,35053,122,1418,21757
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((i5.i0.u46.p112==0)||(i9.i1.u74.p180==1))")U("(((i2.i2.u21.p53!=0)&&(i4.i1.u20.p50!=1))||((i5.i0.u46.p112!=0)&&(i9.i1.u74.p180!=1)))"))U(!(X("((i4.i2.u29.p72==0)||(i3.i1.u34.p85==1))")))))
Formula 3 simplified : !(("((i5.i0.u46.p112==0)||(i9.i1.u74.p180==1))" U "(((i2.i2.u21.p53!=0)&&(i4.i1.u20.p50!=1))||((i5.i0.u46.p112!=0)&&(i9.i1.u74.p180!=1)))") U !X"((i4.i2.u29.p72==0)||(i3.i1.u34.p85==1))")
3 unique states visited
0 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,0.292239,26068,1,0,15398,301,1379,35053,127,1419,21900
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-010A-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(("((i4.i1.u20.p51==0)||(i1.i2.u19.p48==1))")U(X("((i0.i0.u3.p11==0)||(i8.i2.u72.p172==1))")))))
Formula 4 simplified : !G("((i4.i1.u20.p51==0)||(i1.i2.u19.p48==1))" U X"((i0.i0.u3.p11==0)||(i8.i2.u72.p172==1))")
5 unique states visited
5 strongly connected components in search stack
6 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.297775,26068,1,0,16100,301,1393,36317,127,1424,22868
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(X(F("((i3.i1.u34.p81==0)||(i9.i2.u79.p190==1))"))))&&(!(G(X("((i8.i1.u75.p181==0)||(i9.i2.u79.p190==1))"))))))
Formula 5 simplified : !(!XF"((i3.i1.u34.p81==0)||(i9.i2.u79.p190==1))" & !GX"((i8.i1.u75.p181==0)||(i9.i2.u79.p190==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.298702,26284,1,0,16100,301,1414,36317,127,1424,22895
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(X("(i2.i2.u18.p43==1)")))&&(!(G(X((X("((i0.i0.u3.p10==0)||(i0.i1.u1.p4==1))"))&&(G("(i1.i0.u9.p23==1)"))))))))
Formula 6 simplified : !(!X"(i2.i2.u18.p43==1)" & !GX(X"((i0.i0.u3.p10==0)||(i0.i1.u1.p4==1))" & G"(i1.i0.u9.p23==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.299328,26284,1,0,16100,301,1431,36317,128,1424,22924
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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-27 11:48:44] [INFO ] Built C files in 721ms 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 1590580125080
--------------------
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="ShieldIIPt-PT-010A"
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 ShieldIIPt-PT-010A, 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 r210-tajo-159033475500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010A.tgz
mv ShieldIIPt-PT-010A 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 '
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 ;