About the Execution of ITS-Tools for ShieldIIPt-PT-002A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.130 | 3368.00 | 7576.00 | 63.00 | TFFFFFFTTTTFFTFF | 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-159033475400234.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-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475400234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.0K May 14 00:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 07:59 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 12K 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-002A-00
FORMULA_NAME ShieldIIPt-PT-002A-01
FORMULA_NAME ShieldIIPt-PT-002A-02
FORMULA_NAME ShieldIIPt-PT-002A-03
FORMULA_NAME ShieldIIPt-PT-002A-04
FORMULA_NAME ShieldIIPt-PT-002A-05
FORMULA_NAME ShieldIIPt-PT-002A-06
FORMULA_NAME ShieldIIPt-PT-002A-07
FORMULA_NAME ShieldIIPt-PT-002A-08
FORMULA_NAME ShieldIIPt-PT-002A-09
FORMULA_NAME ShieldIIPt-PT-002A-10
FORMULA_NAME ShieldIIPt-PT-002A-11
FORMULA_NAME ShieldIIPt-PT-002A-12
FORMULA_NAME ShieldIIPt-PT-002A-13
FORMULA_NAME ShieldIIPt-PT-002A-14
FORMULA_NAME ShieldIIPt-PT-002A-15
=== Now, execution of the tool begins
BK_START 1590578641944
[2020-05-27 11:24:03] [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, -timeout, 3600]
[2020-05-27 11:24:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 11:24:04] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-05-27 11:24:04] [INFO ] Transformed 41 places.
[2020-05-27 11:24:04] [INFO ] Transformed 31 transitions.
[2020-05-27 11:24:04] [INFO ] Found NUPN structural information;
[2020-05-27 11:24:04] [INFO ] Parsed PT model containing 41 places and 31 transitions in 59 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 93 steps, including 0 resets, run visited all 45 properties in 4 ms. (steps per millisecond=23 )
[2020-05-27 11:24:04] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 11:24:04] [INFO ] Flatten gal took : 23 ms
FORMULA ShieldIIPt-PT-002A-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 11:24:04] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2020-05-27 11:24:04] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-27 11:24:04] [INFO ] Flatten gal took : 5 ms
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/graph13286140963998013148.txt, -o, /tmp/graph13286140963998013148.bin, -w, /tmp/graph13286140963998013148.weights], workingDir=null]
[2020-05-27 11:24:04] [INFO ] Input system was already deterministic with 30 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13286140963998013148.bin, -l, -1, -v, -w, /tmp/graph13286140963998013148.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 11:24:04] [INFO ] Decomposing Gal with order
[2020-05-27 11:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 11:24:04] [INFO ] Removed a total of 6 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 30 rows 41 cols
[2020-05-27 11:24:04] [INFO ] Computed 19 place invariants in 5 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p16 + p17 = 1
inv : p0 + p24 + p27 + p28 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p24 + p25 + p26 = 1
Total of 19 invariants.
[2020-05-27 11:24:04] [INFO ] Computed 19 place invariants in 7 ms
[2020-05-27 11:24:04] [INFO ] Flatten gal took : 47 ms
[2020-05-27 11:24:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 11:24:04] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 19 ms
[2020-05-27 11:24:04] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((F(!(("(((((i6.u15.p37==1)&&(i5.u16.p39==1))||(i6.u15.p37==1))||((i6.u4.p12==1)&&(i6.u15.p37==1)))||((i3.u2.p5==1)&&(i3.u6.p16==1)))")U(!(X("(i5.u16.p39==1)")))))))
Formula 0 simplified : !F!("(((((i6.u15.p37==1)&&(i5.u16.p39==1))||(i6.u15.p37==1))||((i6.u4.p12==1)&&(i6.u15.p37==1)))||((i3.u2.p5==1)&&(i3.u6.p16==1)))" U !X"(i5.u16.p39==1)")
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 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.
4 unique states visited
0 strongly connected components in search stack
3 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,0.05052,17204,1,0,1290,106,458,2336,118,370,839
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002A-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!(G(X(F(X(X(!(("((i5.u9.p23!=1)||(i5.u14.p36!=1))")U(X(F("(i0.u3.p0==1)")))))))))))))
Formula 1 simplified : !F!GXFXX!("((i5.u9.p23!=1)||(i5.u14.p36!=1))" U XF"(i0.u3.p0==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.061231,17856,1,0,1523,130,521,2718,118,404,3118
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(F(X((X(!(F("(i0.u3.p0==1)"))))&&(G("(i5.u14.p35==1)"))))))))
Formula 2 simplified : !XGFX(X!F"(i0.u3.p0==1)" & G"(i5.u14.p35==1)")
[2020-05-27 11:24:04] [INFO ] Proved 41 variables to be positive in 166 ms
[2020-05-27 11:24:04] [INFO ] Computing symmetric may disable matrix : 30 transitions.
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,0.065139,18480,1,0,1781,130,547,3111,118,410,3737
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(X(!(G((G("((i3.u2.p5==1)&&(i3.u6.p16==1))"))||(X(F("((i4.u10.p26==1)&&(i4.u10.p28==1))"))))))))&&(G(F("((i3.u2.p5!=1)||(i3.u6.p16!=1))")))))
Formula 3 simplified : !(FX!G(G"((i3.u2.p5==1)&&(i3.u6.p16==1))" | XF"((i4.u10.p26==1)&&(i4.u10.p28==1))") & GF"((i3.u2.p5!=1)||(i3.u6.p16!=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.067948,18816,1,0,1869,130,586,3211,118,414,3939
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(((G((((G(X(G("(((u12.p32==1)&&(i6.u15.p38==1))&&(i5.u16.p40==1))"))))&&("(u12.p32==1)"))&&("(i6.u15.p38==1)"))&&("(i5.u16.p40==1)")))&&("(i4.u10.p25==1)"))&&("(i4.u13.p34==1)"))))
Formula 4 simplified : !F("(i4.u10.p25==1)" & "(i4.u13.p34==1)" & G("(i5.u16.p40==1)" & "(i6.u15.p38==1)" & "(u12.p32==1)" & GXG"(((u12.p32==1)&&(i6.u15.p38==1))&&(i5.u16.p40==1))"))
[2020-05-27 11:24:04] [INFO ] Computation of disable matrix completed :0/30 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:24:04] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:24:04] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2020-05-27 11:24:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.099395,20880,1,0,6313,160,671,8890,120,685,10463
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((X(G("((i3.u2.p6==1)&&(i1.u5.p15==1))")))&&(((!(F("((i3.u2.p6==1)&&(i1.u5.p15==1))")))&&("(((i5.u14.p35!=1)||(i3.u2.p6!=1))||(i1.u5.p15!=1))"))U(X("((i3.u2.p8==1)&&(i0.u7.p19==1))"))))))
Formula 5 simplified : !X(XG"((i3.u2.p6==1)&&(i1.u5.p15==1))" & (("(((i5.u14.p35!=1)||(i3.u2.p6!=1))||(i1.u5.p15!=1))" & !F"((i3.u2.p6==1)&&(i1.u5.p15==1))") U X"((i3.u2.p8==1)&&(i0.u7.p19==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.101706,21408,1,0,6315,160,705,8890,123,685,10516
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F("((i3.u2.p5==1)&&(i3.u6.p16==1))"))&&(!(("((i0.u0.p2==1)&&(i0.u3.p10==1))")U("((i3.u2.p5==1)&&(i3.u6.p16==1))")))))
Formula 6 simplified : !(F"((i3.u2.p5==1)&&(i3.u6.p16==1))" & !("((i0.u0.p2==1)&&(i0.u3.p10==1))" U "((i3.u2.p5==1)&&(i3.u6.p16==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.106533,21408,1,0,6830,160,736,9396,123,685,11372
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((((!(X(X("(i6.u15.p37==1)"))))||(!(F("((((i1.u5.p14==1)&&(i1.u11.p29==1))||(i4.u13.p33==1))&&(i4.u13.p33==1))"))))||("(i1.u5.p14!=1)"))||("(i1.u11.p29!=1)"))))
Formula 7 simplified : !X("(i1.u5.p14!=1)" | "(i1.u11.p29!=1)" | !XX"(i6.u15.p37==1)" | !F"((((i1.u5.p14==1)&&(i1.u11.p29==1))||(i4.u13.p33==1))&&(i4.u13.p33==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.107455,21408,1,0,6830,160,760,9396,123,685,11395
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G("(u12.p31==1)"))||(F(X(("(u12.p31==1)")U("((i4.u10.p25==1)&&(i4.u13.p34==1))"))))))
Formula 8 simplified : !(G"(u12.p31==1)" | FX("(u12.p31==1)" U "((i4.u10.p25==1)&&(i4.u13.p34==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.109211,21408,1,0,7053,160,786,9690,123,688,11843
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X((F("(((((i2.u1.p3==1)&&(i2.u8.p20==1))&&(i1.u11.p30==1))&&(i4.u13.p34==1))&&(i5.u16.p40==1))"))U(G((F("((i4.u10.p27==1)&&(i6.u15.p38==1))"))||("(i1.u5.p14==1)")))))))
Formula 9 simplified : !XX(F"(((((i2.u1.p3==1)&&(i2.u8.p20==1))&&(i1.u11.p30==1))&&(i4.u13.p34==1))&&(i5.u16.p40==1))" U G("(i1.u5.p14==1)" | F"((i4.u10.p27==1)&&(i6.u15.p38==1))"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.12331,21936,1,0,9029,160,859,12043,123,700,14409
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!((F(X("((i4.u10.p24==1)&&(i5.u14.p35==1))")))U("(i4.u13.p33==1)")))&&(X(G("(i0.u7.p18!=1)")))))
Formula 10 simplified : !(!(FX"((i4.u10.p24==1)&&(i5.u14.p35==1))" U "(i4.u13.p33==1)") & XG"(i0.u7.p18!=1)")
5 unique states visited
5 strongly connected components in search stack
7 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.12839,22200,1,0,9426,160,930,12478,123,700,15289
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(X("(((i0.u3.p11==1)&&(i1.u5.p15==1))&&(i2.u8.p21==1))")))&&(((((!((X(F("((i3.u2.p8!=1)||(i0.u7.p19!=1))")))U("(i5.u16.p39==1)")))||("(i0.u3.p11!=1)"))||("(i1.u5.p15!=1)"))||("(i2.u8.p21!=1)"))U("(i5.u16.p39==1)"))))
Formula 11 simplified : !(FX"(((i0.u3.p11==1)&&(i1.u5.p15==1))&&(i2.u8.p21==1))" & (("(i0.u3.p11!=1)" | "(i1.u5.p15!=1)" | "(i2.u8.p21!=1)" | !(XF"((i3.u2.p8!=1)||(i0.u7.p19!=1))" U "(i5.u16.p39==1)")) U "(i5.u16.p39==1)"))
6 unique states visited
3 strongly connected components in search stack
6 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,0.15192,23256,1,0,13001,160,983,16322,125,721,20483
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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)
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-27 11:24:04] [INFO ] Built C files in 424ms 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 1590578645312
--------------------
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 -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 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 -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-002A"
export BK_EXAMINATION="LTLFireability"
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-002A, 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 r210-tajo-159033475400234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-002A.tgz
mv ShieldIIPt-PT-002A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;