About the Execution of ITS-Tools for DiscoveryGPU-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.410 | 3061.00 | 7721.00 | 52.90 | FFFFFFFFFFTTFFTF | 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-158922814500586.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 DiscoveryGPU-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814500586
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K Mar 31 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 23:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 22K 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 DiscoveryGPU-PT-06a-00
FORMULA_NAME DiscoveryGPU-PT-06a-01
FORMULA_NAME DiscoveryGPU-PT-06a-02
FORMULA_NAME DiscoveryGPU-PT-06a-03
FORMULA_NAME DiscoveryGPU-PT-06a-04
FORMULA_NAME DiscoveryGPU-PT-06a-05
FORMULA_NAME DiscoveryGPU-PT-06a-06
FORMULA_NAME DiscoveryGPU-PT-06a-07
FORMULA_NAME DiscoveryGPU-PT-06a-08
FORMULA_NAME DiscoveryGPU-PT-06a-09
FORMULA_NAME DiscoveryGPU-PT-06a-10
FORMULA_NAME DiscoveryGPU-PT-06a-11
FORMULA_NAME DiscoveryGPU-PT-06a-12
FORMULA_NAME DiscoveryGPU-PT-06a-13
FORMULA_NAME DiscoveryGPU-PT-06a-14
FORMULA_NAME DiscoveryGPU-PT-06a-15
=== Now, execution of the tool begins
BK_START 1590129008675
[2020-05-22 06:30:10] [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-22 06:30:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:30:10] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-05-22 06:30:10] [INFO ] Transformed 63 places.
[2020-05-22 06:30:10] [INFO ] Transformed 85 transitions.
[2020-05-22 06:30:10] [INFO ] Found NUPN structural information;
[2020-05-22 06:30:10] [INFO ] Parsed PT model containing 63 places and 85 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 199 steps, including 2 resets, run visited all 39 properties in 8 ms. (steps per millisecond=24 )
[2020-05-22 06:30:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 06:30:10] [INFO ] Flatten gal took : 32 ms
FORMULA DiscoveryGPU-PT-06a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:30:10] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 06:30:10] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 06:30:10] [INFO ] Flatten gal took : 21 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/graph16639902797672465239.txt, -o, /tmp/graph16639902797672465239.bin, -w, /tmp/graph16639902797672465239.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/graph16639902797672465239.bin, -l, -1, -v, -w, /tmp/graph16639902797672465239.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:30:10] [INFO ] Input system was already deterministic with 85 transitions.
[2020-05-22 06:30:10] [INFO ] Decomposing Gal with order
[2020-05-22 06:30:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:30:10] [INFO ] Removed a total of 47 redundant transitions.
[2020-05-22 06:30:10] [INFO ] Flatten gal took : 32 ms
[2020-05-22 06:30:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 6 ms.
[2020-05-22 06:30:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-22 06:30:10] [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 13 LTL properties
Checking formula 0 : !((!(X(G(((("(i5.u7.p23==1)")U("(i0.u0.p1==1)"))U(X("((i7.u15.p43==1)&&(i5.u11.p62==1))")))U("((i7.u15.p43!=1)||(i5.u11.p62!=1))"))))))
Formula 0 simplified : XG((("(i5.u7.p23==1)" U "(i0.u0.p1==1)") U X"((i7.u15.p43==1)&&(i5.u11.p62==1))") U "((i7.u15.p43!=1)||(i5.u11.p62!=1))")
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 79 out of 85 initially.
// Phase 1: matrix 79 rows 63 cols
[2020-05-22 06:30:10] [INFO ] Computed 2 place invariants in 5 ms
inv : p0 + p62 = 1
inv : p0 + p61 = 1
Total of 2 invariants.
[2020-05-22 06:30:10] [INFO ] Computed 2 place invariants in 7 ms
Reverse transition relation is NOT exact ! Due to transitions u4.t78, i0.u0.t80, i1.u2.t79, i3.u5.t77, i4.u9.t82, i5.u7.t81, i5.u11.t76, i5.u19.t74, i6.u13.t75, i7.u15.t83, i8.u17.t84, i9.u21.t73, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/56/12/68
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 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.107903,21460,1,0,7110,207,967,12231,163,841,12046
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(X(F(G((X(X("((i4.u9.p26==1)&&(i3.u5.p61==1))")))&&(F(X("((i9.u20.p54==1)&&(i5.u11.p62==1))"))))))))))
Formula 1 simplified : !FGXFG(XX"((i4.u9.p26==1)&&(i3.u5.p61==1))" & FX"((i9.u20.p54==1)&&(i5.u11.p62==1))")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
8 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.122815,22036,1,0,7931,215,1086,13678,164,861,14381
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(X("((i4.u8.p24==1)&&(i5.u11.p62==1))")))))
Formula 2 simplified : !GFX"((i4.u8.p24==1)&&(i5.u11.p62==1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.126976,22300,1,0,8324,215,1121,14235,165,865,15266
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G("((((i0.u1.p5!=1)||(i3.u5.p61!=1))&&(i0.u0.p1!=1))||((i0.u1.p5==1)&&(i3.u5.p61==1)))"))||(F(X(("(i0.u0.p1==1)")U("(((i0.u1.p5==1)&&(i3.u5.p61==1))&&(i5.u7.p21==1))"))))))
Formula 3 simplified : !(G"((((i0.u1.p5!=1)||(i3.u5.p61!=1))&&(i0.u0.p1!=1))||((i0.u1.p5==1)&&(i3.u5.p61==1)))" | FX("(i0.u0.p1==1)" U "(((i0.u1.p5==1)&&(i3.u5.p61==1))&&(i5.u7.p21==1))"))
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 06:30:11] [INFO ] Proved 63 variables to be positive in 125 ms
[2020-05-22 06:30:11] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2020-05-22 06:30:11] [INFO ] Computation of disable matrix completed :0/85 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:30:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:30:11] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2020-05-22 06:30:11] [INFO ] Computation of Complete enable matrix. took 2 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
11 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.240232,27316,1,0,22395,232,1188,28385,167,989,30687
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(((X(!(F("((i4.u8.p25==1)&&(i3.u5.p61==1))"))))U("((i6.u12.p34==1)&&(i5.u11.p62==1))"))||(G(!(("((i4.u8.p25==1)&&(i3.u5.p61==1))")U("((i3.u5.p15==1)&&(i3.u5.p61==1))")))))))
Formula 4 simplified : !X((X!F"((i4.u8.p25==1)&&(i3.u5.p61==1))" U "((i6.u12.p34==1)&&(i5.u11.p62==1))") | G!("((i4.u8.p25==1)&&(i3.u5.p61==1))" U "((i3.u5.p15==1)&&(i3.u5.p61==1))"))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
5 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.299654,30208,1,0,29745,237,1253,34040,170,1019,41065
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(((("((i4.u8.p24==1)&&(i5.u11.p62==1))")U("(i9.u22.p58==1)"))&&(G("(i9.u22.p58==1)")))&&("(i4.u9.p26==1)")))))
Formula 5 simplified : !GF("(i4.u9.p26==1)" & ("((i4.u8.p24==1)&&(i5.u11.p62==1))" U "(i9.u22.p58==1)") & G"(i9.u22.p58==1)")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.303759,30472,1,0,30005,237,1300,34422,170,1020,41811
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G("(((((i9.u21.p56!=1)||(i3.u5.p61!=1))||(u4.p11!=1))||((i6.u13.p36==1)&&(i3.u5.p61==1)))&&(((i6.u13.p37==1)&&(i3.u5.p61==1))||((i6.u13.p36==1)&&(i3.u5.p61==1))))"))))
Formula 6 simplified : !XG"(((((i9.u21.p56!=1)||(i3.u5.p61!=1))||(u4.p11!=1))||((i6.u13.p36==1)&&(i3.u5.p61==1)))&&(((i6.u13.p37==1)&&(i3.u5.p61==1))||((i6.u13.p36==1)&&(i3.u5.p61==1))))"
Computing Next relation with stutter on 1 deadlock states
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.306539,30472,1,0,30113,237,1338,34596,171,1020,42203
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(X(("((i3.u5.p15!=1)||(i3.u5.p61!=1))")U(X(("(i6.u14.p38==1)")U("(((i8.u18.p48==1)&&(i5.u11.p62==1))&&((i3.u5.p15!=1)||(i3.u5.p61!=1)))"))))))))
Formula 7 simplified : !XFX("((i3.u5.p15!=1)||(i3.u5.p61!=1))" U X("(i6.u14.p38==1)" U "(((i8.u18.p48==1)&&(i5.u11.p62==1))&&((i3.u5.p15!=1)||(i3.u5.p61!=1)))"))
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
14 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.450116,36808,1,0,49700,237,1369,47780,171,1044,63395
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F((((!(G("((i1.u3.p10==1)&&(i3.u5.p61==1))")))||("(i3.u5.p16!=1)"))||("(i3.u5.p61!=1)"))U("((i8.u18.p50==1)&&(i3.u5.p61==1))")))))
Formula 8 simplified : F(("(i3.u5.p16!=1)" | "(i3.u5.p61!=1)" | !G"((i1.u3.p10==1)&&(i3.u5.p61==1))") U "((i8.u18.p50==1)&&(i3.u5.p61==1))")
Computing Next relation with stutter on 1 deadlock states
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.451939,37072,1,0,49700,237,1405,47782,171,1044,63455
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((X(G("((i6.u14.p40==1)&&(i3.u5.p61==1))")))||(("((i6.u14.p40==1)&&(i3.u5.p61==1))")U(X("((i6.u14.p40==1)&&(i3.u5.p61==1))"))))||("((i3.u5.p15==1)&&(i3.u5.p61==1))"))))
Formula 9 simplified : !F("((i3.u5.p15==1)&&(i3.u5.p61==1))" | XG"((i6.u14.p40==1)&&(i3.u5.p61==1))" | ("((i6.u14.p40==1)&&(i3.u5.p61==1))" U X"((i6.u14.p40==1)&&(i3.u5.p61==1))"))
Computing Next relation with stutter on 1 deadlock states
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.452775,37072,1,0,49700,237,1432,47782,171,1044,63481
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(X((G("((i3.u6.p19==1)&&(i3.u5.p61==1))"))&&(X(X(X(("(i3.u5.p14==1)")U("(i5.u19.p51==1)")))))))))
Formula 10 simplified : !GX(G"((i3.u6.p19==1)&&(i3.u5.p61==1))" & XXX("(i3.u5.p14==1)" U "(i5.u19.p51==1)"))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.456932,37336,1,0,50150,241,1441,48177,171,1073,64254
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(((i4.u10.p30==1)&&(i3.u5.p61==1))&&(i9.u20.p55!=1))")))
Formula 11 simplified : !F"(((i4.u10.p30==1)&&(i3.u5.p61==1))&&(i9.u20.p55!=1))"
Computing Next relation with stutter on 1 deadlock states
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,0.457813,37600,1,0,50150,241,1461,48178,171,1073,64321
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06a-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(F((X(X(!(X((G(X("(i8.u18.p48==1)")))&&(X("((i8.u17.p47==1)&&(i3.u5.p61==1))")))))))&&(X("((i8.u17.p47==1)&&(i3.u5.p61==1))"))))))
Formula 12 simplified : F(X"((i8.u17.p47==1)&&(i3.u5.p61==1))" & XX!X(GX"(i8.u18.p48==1)" & X"((i8.u17.p47==1)&&(i3.u5.p61==1))"))
Computing Next relation with stutter on 1 deadlock states
9 unique states visited
9 strongly connected components in search stack
10 transitions explored
9 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.460579,37600,1,0,50304,241,1481,48319,171,1073,64786
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 06:30:11] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error
[2020-05-22 06:30:11] [WARNING] Script execution failed on command (assert (not (and (= (select s0 50) 1) (= (select s0 61) 1)))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (not (and (= (select s0 50) 1) (= (select s0 61) 1)))")
[2020-05-22 06:30:11] [WARNING] Script execution failed on command (assert (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store s0 50 (+ (select s0 50) 1)) 60 (+ (select s0 60) 1)) 20 (+ (select s0 20) 1)) 62 (+ (select s0 62) 1)) 0 (- (select s0 0) 1)) 40 (+ (select s0 40) 1)) 61 (+ (select s0 61) 1)) 30 (+ (select s0 30) 1)) 10 (+ (select s0 10) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store s0 50 (+ (select s0 50) 1)) 60 (+ (select s0 60) 1)) 20 (+ (select s0 20) 1)) 62 (+ (select s0 62) 1)) 0 (- (select s0 0) 1)) 40 (+ (select s0 40) 1)) 61 (+ (select s0 61) 1)) 30 (+ (select s0 30) 1)) 10 (+ (select s0 10) 1)) s1))")
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-22 06:30:11] [INFO ] Built C files in 718ms 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 1590129011736
--------------------
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="DiscoveryGPU-PT-06a"
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 DiscoveryGPU-PT-06a, 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 r066-tajo-158922814500586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06a.tgz
mv DiscoveryGPU-PT-06a 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 ;