About the Execution of ITS-Tools for DiscoveryGPU-PT-09a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15740.500 | 7713.00 | 13550.00 | 295.80 | FTFFFFFFFTFFFFTT | 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-158922814600634.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-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814600634
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.8K Mar 31 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 23:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 23:32 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 1.9K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:37 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 32K 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-09a-00
FORMULA_NAME DiscoveryGPU-PT-09a-01
FORMULA_NAME DiscoveryGPU-PT-09a-02
FORMULA_NAME DiscoveryGPU-PT-09a-03
FORMULA_NAME DiscoveryGPU-PT-09a-04
FORMULA_NAME DiscoveryGPU-PT-09a-05
FORMULA_NAME DiscoveryGPU-PT-09a-06
FORMULA_NAME DiscoveryGPU-PT-09a-07
FORMULA_NAME DiscoveryGPU-PT-09a-08
FORMULA_NAME DiscoveryGPU-PT-09a-09
FORMULA_NAME DiscoveryGPU-PT-09a-10
FORMULA_NAME DiscoveryGPU-PT-09a-11
FORMULA_NAME DiscoveryGPU-PT-09a-12
FORMULA_NAME DiscoveryGPU-PT-09a-13
FORMULA_NAME DiscoveryGPU-PT-09a-14
FORMULA_NAME DiscoveryGPU-PT-09a-15
=== Now, execution of the tool begins
BK_START 1590130050457
[2020-05-22 06:47:32] [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:47:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:47:32] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-05-22 06:47:32] [INFO ] Transformed 93 places.
[2020-05-22 06:47:32] [INFO ] Transformed 127 transitions.
[2020-05-22 06:47:32] [INFO ] Found NUPN structural information;
[2020-05-22 06:47:32] [INFO ] Parsed PT model containing 93 places and 127 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 17907 steps, including 183 resets, run visited all 37 properties in 53 ms. (steps per millisecond=337 )
[2020-05-22 06:47:32] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 06:47:32] [INFO ] Flatten gal took : 33 ms
FORMULA DiscoveryGPU-PT-09a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:47:32] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:47:33] [INFO ] Applying decomposition
[2020-05-22 06:47:33] [INFO ] Flatten gal took : 18 ms
[2020-05-22 06:47:33] [INFO ] Input system was already deterministic with 127 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/graph7311211671945566760.txt, -o, /tmp/graph7311211671945566760.bin, -w, /tmp/graph7311211671945566760.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/graph7311211671945566760.bin, -l, -1, -v, -w, /tmp/graph7311211671945566760.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:47:33] [INFO ] Decomposing Gal with order
[2020-05-22 06:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:47:33] [INFO ] Removed a total of 74 redundant transitions.
[2020-05-22 06:47:33] [INFO ] Flatten gal took : 40 ms
[2020-05-22 06:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 14 ms.
[2020-05-22 06:47:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
[2020-05-22 06:47:33] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 118 out of 127 initially.
// Phase 1: matrix 118 rows 93 cols
[2020-05-22 06:47:33] [INFO ] Computed 2 place invariants in 5 ms
inv : p0 + p92 = 1
inv : p0 + p91 = 1
Total of 2 invariants.
[2020-05-22 06:47:33] [INFO ] Computed 2 place invariants in 5 ms
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(!(F((X(F("(i3.u9.p26==1)")))||("((i8.i1.u30.p79==1)&&(i0.u1.p91==1))")))))U("(i9.i0.u31.p81==1)"))))
Formula 0 simplified : !X(G!F("((i8.i1.u30.p79==1)&&(i0.u1.p91==1))" | XF"(i3.u9.p26==1)") U "(i9.i0.u31.p81==1)")
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-22 06:47:33] [INFO ] Proved 93 variables to be positive in 143 ms
[2020-05-22 06:47:33] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2020-05-22 06:47:33] [INFO ] Computation of disable matrix completed :0/127 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:47:33] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:47:33] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2020-05-22 06:47:33] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t118, i1.u0.t117, i1.u3.t119, i1.u7.t116, i1.u15.t114, i2.u5.t120, i3.u9.t115, i4.i0.u11.t121, i4.i1.u13.t122, i5.u17.t113, i6.u19.t123, i6.u21.t124, i7.u23.t112, i7.u25.t111, i8.i0.u27.t125, i8.i1.u29.t126, i9.i0.u31.t110, i9.i1.u33.t109, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/76/18/94
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
20 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.232961,25440,1,0,18748,230,1391,34237,166,903,27852
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(G(F("((i3.u9.p26==1)&&(i0.u1.p91==1))"))))U(X(((G("(i4.i0.u11.p31!=1)"))&&("(i1.u3.p13==1)"))&&("(i1.u3.p92==1)")))))
Formula 1 simplified : !(XGF"((i3.u9.p26==1)&&(i0.u1.p91==1))" U X("(i1.u3.p13==1)" & "(i1.u3.p92==1)" & G"(i4.i0.u11.p31!=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
3 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.257235,27868,1,0,22229,230,1441,37019,172,903,32699
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X(!(X(!(X("((i4.i1.u14.p39==1)&&(i0.u1.p91==1))"))))))U(X(F(G((X(F("((i1.u0.p3==1)&&(i1.u3.p92==1))")))||("((i1.u0.p3==1)&&(i1.u3.p92==1))")))))))
Formula 2 simplified : !(X!X!X"((i4.i1.u14.p39==1)&&(i0.u1.p91==1))" U XFG("((i1.u0.p3==1)&&(i1.u3.p92==1))" | XF"((i1.u0.p3==1)&&(i1.u3.p92==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.267762,28340,1,0,22912,230,1476,39370,172,907,34136
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X(G((X("((i9.i0.u31.p82==1)&&(i0.u1.p91==1))"))&&("((i3.u10.p29!=1)||(i0.u1.p91!=1))")))))))
Formula 3 simplified : !FGXG("((i3.u10.p29!=1)||(i0.u1.p91!=1))" & X"((i9.i0.u31.p82==1)&&(i0.u1.p91==1))")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
5 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.275762,28836,1,0,23569,230,1484,40329,173,909,35325
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G((!(X("((i5.u16.p44==1)&&(i1.u3.p92==1))")))||(X("(i1.u7.p23==1)"))))&&(F("(i1.u7.p23==1)"))))
Formula 4 simplified : !(G(!X"((i5.u16.p44==1)&&(i1.u3.p92==1))" | X"(i1.u7.p23==1)") & F"(i1.u7.p23==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
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.328232,30936,1,0,28920,237,1542,50000,173,995,44012
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(G(F(!(G("(i1.u3.p11==1)"))))))))
Formula 5 simplified : !XXGF!G"(i1.u3.p11==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
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.332563,31200,1,0,29345,237,1556,50852,173,995,44569
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((X("((i5.u17.p47!=1)||(i0.u1.p91!=1))"))&&(!(F(G("(((((i5.u17.p47==1)&&(i0.u1.p91==1))&&(i4.i0.u11.p33==1))&&(i6.u19.p52==1))&&(i0.u1.p91==1))")))))))
Formula 6 simplified : !G(X"((i5.u17.p47!=1)||(i0.u1.p91!=1))" & !FG"(((((i5.u17.p47==1)&&(i0.u1.p91==1))&&(i4.i0.u11.p33==1))&&(i6.u19.p52==1))&&(i0.u1.p91==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.33774,31452,1,0,29702,237,1621,51460,173,995,45210
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(X("((i1.u0.p2==1)&&(i0.u1.p91==1))")))&&(F("((i0.u2.p10==1)&&(i0.u1.p91==1))"))))
Formula 7 simplified : !(!X"((i1.u0.p2==1)&&(i0.u1.p91==1))" & F"((i0.u2.p10==1)&&(i0.u1.p91==1))")
Computing Next relation with stutter on 1 deadlock states
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.339236,31716,1,0,29702,237,1648,51460,173,995,45250
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X(X("((i7.u23.p63==1)&&(i1.u3.p92==1))")))||(F("((i0.u2.p8==1)&&(i1.u3.p92==1))")))))
Formula 8 simplified : !X(XX"((i7.u23.p63==1)&&(i1.u3.p92==1))" | F"((i0.u2.p8==1)&&(i1.u3.p92==1))")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.478385,38052,1,0,47045,238,1690,66633,173,1005,59335
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((X(X(G((G("((i8.i1.u30.p80!=1)||(i0.u1.p91!=1))"))&&("(i1.u3.p13==1)")))))U(!(X("((i8.i1.u30.p80==1)&&(i0.u1.p91==1))"))))))
Formula 9 simplified : !X(XXG("(i1.u3.p13==1)" & G"((i8.i1.u30.p80!=1)||(i0.u1.p91!=1))") U !X"((i8.i1.u30.p80==1)&&(i0.u1.p91==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
10 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.576424,42268,1,0,57698,241,1748,79988,173,1032,73256
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(G("((i2.u6.p18==1)&&(i1.u3.p92==1))")))U(F(X(X(G(X("(i7.u25.p66==1)"))))))))
Formula 10 simplified : !(FG"((i2.u6.p18==1)&&(i1.u3.p92==1))" U FXXGX"(i7.u25.p66==1)")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
3 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.578658,42512,1,0,57751,241,1766,80096,173,1032,73413
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X(X(G(((G("((i0.u1.p6==1)&&(i0.u1.p91==1))"))&&("(i0.u1.p6==1)"))&&("(i0.u1.p91==1)")))))U((F("((i2.u6.p20==1)&&(i0.u1.p91==1))"))||("((i0.u1.p6==1)&&(i0.u1.p91==1))"))))
Formula 11 simplified : !(XXG("(i0.u1.p6==1)" & "(i0.u1.p91==1)" & G"((i0.u1.p6==1)&&(i0.u1.p91==1))") U ("((i0.u1.p6==1)&&(i0.u1.p91==1))" | F"((i2.u6.p20==1)&&(i0.u1.p91==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.579853,42512,1,0,57751,241,1786,80096,176,1032,73446
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("((i9.i1.u34.p90==1)&&(i0.u1.p91==1))")))
Formula 12 simplified : !F"((i9.i1.u34.p90==1)&&(i0.u1.p91==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.580541,42512,1,0,57751,241,1804,80099,176,1032,73497
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 06:47:34] [INFO ] Computing symmetric co enabling matrix : 127 transitions.
[2020-05-22 06:47:36] [INFO ] Computation of co-enabling matrix(74/127) took 2124 ms. Total solver calls (SAT/UNSAT): 1338(1257/81)
[2020-05-22 06:47:37] [INFO ] Computation of Finished co-enabling matrix. took 3307 ms. Total solver calls (SAT/UNSAT): 1899(1818/81)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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:47:37] [INFO ] Built C files in 4592ms 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 1590130058170
--------------------
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-09a"
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-09a, 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-158922814600634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a 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 ;