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-158922814700730.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-15a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814700730
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.2K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 30 00:27 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.4K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 07:45 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 53K 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-15a-00
FORMULA_NAME DiscoveryGPU-PT-15a-01
FORMULA_NAME DiscoveryGPU-PT-15a-02
FORMULA_NAME DiscoveryGPU-PT-15a-03
FORMULA_NAME DiscoveryGPU-PT-15a-04
FORMULA_NAME DiscoveryGPU-PT-15a-05
FORMULA_NAME DiscoveryGPU-PT-15a-06
FORMULA_NAME DiscoveryGPU-PT-15a-07
FORMULA_NAME DiscoveryGPU-PT-15a-08
FORMULA_NAME DiscoveryGPU-PT-15a-09
FORMULA_NAME DiscoveryGPU-PT-15a-10
FORMULA_NAME DiscoveryGPU-PT-15a-11
FORMULA_NAME DiscoveryGPU-PT-15a-12
FORMULA_NAME DiscoveryGPU-PT-15a-13
FORMULA_NAME DiscoveryGPU-PT-15a-14
FORMULA_NAME DiscoveryGPU-PT-15a-15

=== Now, execution of the tool begins

BK_START 1590132666385

[2020-05-22 07:31:07] [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 07:31:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:31:07] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-05-22 07:31:07] [INFO ] Transformed 153 places.
[2020-05-22 07:31:07] [INFO ] Transformed 211 transitions.
[2020-05-22 07:31:07] [INFO ] Found NUPN structural information;
[2020-05-22 07:31:07] [INFO ] Parsed PT model containing 153 places and 211 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 899 steps, including 5 resets, run visited all 52 properties in 14 ms. (steps per millisecond=64 )
[2020-05-22 07:31:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 07:31:08] [INFO ] Flatten gal took : 40 ms
FORMULA DiscoveryGPU-PT-15a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:31:08] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 07:31:08] [INFO ] Applying decomposition
[2020-05-22 07:31:08] [INFO ] Flatten gal took : 23 ms
[2020-05-22 07:31:08] [INFO ] Input system was already deterministic with 211 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/graph2473840407198720729.txt, -o, /tmp/graph2473840407198720729.bin, -w, /tmp/graph2473840407198720729.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/graph2473840407198720729.bin, -l, -1, -v, -w, /tmp/graph2473840407198720729.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:31:08] [INFO ] Decomposing Gal with order
[2020-05-22 07:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:31:08] [INFO ] Removed a total of 128 redundant transitions.
[2020-05-22 07:31:08] [INFO ] Flatten gal took : 43 ms
[2020-05-22 07:31:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 16 ms.
[2020-05-22 07:31:08] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-22 07:31:08] [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]

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 14 LTL properties
Checking formula 0 : !(((X((G("((i9.i1.u34.p86==1)&&(i2.u37.p151==1))"))||("(i8.u28.p73==1)")))&&(F("((i2.u37.p95==1)&&(i2.u37.p151==1))"))))
Formula 0 simplified : !(X("(i8.u28.p73==1)" | G"((i9.i1.u34.p86==1)&&(i2.u37.p151==1))") & F"((i2.u37.p95==1)&&(i2.u37.p151==1))")
built 28 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 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.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 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 196 out of 211 initially.
// Phase 1: matrix 196 rows 153 cols
[2020-05-22 07:31:08] [INFO ] Computed 2 place invariants in 10 ms
inv : p0 + p151 = 1
inv : p0 + p152 = 1
Total of 2 invariants.
[2020-05-22 07:31:08] [INFO ] Computed 2 place invariants in 12 ms
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t195, i0.i1.u2.t196, i1.u4.t197, i1.u36.t205, i1.u51.t209, i1.u55.t182, i2.u6.t198, i2.u37.t206, i3.u8.t194, i3.u10.t193, i4.u12.t199, i4.u14.t200, i5.u16.t192, i5.u18.t191, i6.i0.u20.t201, i6.i1.u22.t202, i7.u24.t190, i7.u26.t189, i8.u28.t203, i8.u30.t204, i9.i0.u32.t188, i9.i1.u34.t187, i10.i0.u39.t186, i10.i1.u41.t185, i11.u43.t207, i11.u45.t208, i12.u47.t184, i12.u49.t183, i13.u53.t210, i14.u57.t181, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/131/30/161
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
19 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.212175,24064,1,0,19000,197,1907,21757,170,739,29587
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(("(i9.i1.u34.p86==1)")U(X(X("((i9.i0.u32.p82==1)&&(i2.u37.p151==1))")))))&&(X(X(G("((i14.u56.p144==1)&&(i1.u4.p152==1))"))))))
Formula 1 simplified : !(F("(i9.i1.u34.p86==1)" U XX"((i9.i0.u32.p82==1)&&(i2.u37.p151==1))") & XXG"((i14.u56.p144==1)&&(i1.u4.p152==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
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.216557,24616,1,0,19266,197,1935,21967,171,742,30080
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(G((("((i2.u37.p94==1)&&(i1.u4.p152==1))")U(G(X(F("((i10.i0.u39.p102!=1)||(i2.u37.p151!=1))")))))U("((i2.u37.p94!=1)||(i1.u4.p152!=1))"))))))
Formula 2 simplified : !XFG(("((i2.u37.p94==1)&&(i1.u4.p152==1))" U GXF"((i10.i0.u39.p102!=1)||(i2.u37.p151!=1))") U "((i2.u37.p94!=1)||(i1.u4.p152!=1))")
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 07:31:08] [INFO ] Proved 153 variables to be positive in 277 ms
[2020-05-22 07:31:08] [INFO ] Computing symmetric may disable matrix : 211 transitions.
[2020-05-22 07:31:08] [INFO ] Computation of disable matrix completed :0/211 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:31:08] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:31:08] [INFO ] Computing symmetric may enable matrix : 211 transitions.
[2020-05-22 07:31:08] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
4 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.263502,26864,1,0,23359,205,2006,29030,173,788,36633
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(G(!(F(!(F((((X(X("((i8.u28.p72==1)&&(i2.u37.p151==1))")))&&(G("((i8.u28.p72==1)&&(i2.u37.p151==1))")))&&("(i4.u14.p36==1)"))&&("(i2.u37.p151==1)"))))))))))
Formula 3 simplified : !F!G!F!F("(i2.u37.p151==1)" & "(i4.u14.p36==1)" & XX"((i8.u28.p72==1)&&(i2.u37.p151==1))" & G"((i8.u28.p72==1)&&(i2.u37.p151==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
6 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.320939,29608,1,0,30446,205,2093,37904,173,811,46824
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(G((G(F("(i11.u43.p113==1)")))U((X("((i14.u58.p150==1)&&(i2.u37.p151==1))"))&&("(i7.u27.p68==1)")))))))
Formula 4 simplified : !F!G(GF"(i11.u43.p113==1)" U ("(i7.u27.p68==1)" & X"((i14.u58.p150==1)&&(i2.u37.p151==1))"))
Computing Next relation with stutter on 1 deadlock states
21 unique states visited
6 strongly connected components in search stack
44 transitions explored
18 items max in DFS search stack
4 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.359762,31276,1,0,33580,205,2212,41136,173,815,54953
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F(G("((i9.i0.u33.p85!=1)||(i2.u37.p151!=1))")))||(X("(i3.u10.p26==1)")))))
Formula 5 simplified : !X(FG"((i9.i0.u33.p85!=1)||(i2.u37.p151!=1))" | X"(i3.u10.p26==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
35 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.711459,48428,1,0,81294,230,2258,87096,173,1034,102558
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F(X(F("(i2.u6.p16==1)"))))))
Formula 6 simplified : FXF"(i2.u6.p16==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
9 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.799093,52388,1,0,92219,230,2289,97865,173,1035,115846
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(!((G(((("(i8.u31.p78==1)")U("(((i5.u16.p42==1)&&(i2.u37.p151==1))||((i14.u56.p144==1)&&(i1.u4.p152==1)))"))&&("(i14.u56.p144==1)"))&&("(i1.u4.p152==1)")))U(X(F("(i10.i0.u40.p104==1)"))))))))
Formula 7 simplified : !GX!(G("(i1.u4.p152==1)" & "(i14.u56.p144==1)" & ("(i8.u31.p78==1)" U "(((i5.u16.p42==1)&&(i2.u37.p151==1))||((i14.u56.p144==1)&&(i1.u4.p152==1)))")) U XF"(i10.i0.u40.p104==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
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.810593,53020,1,0,93298,230,2312,98945,173,1035,118333
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((!(G(((F("((i11.u46.p120==1)&&(i2.u37.p151==1))"))&&("(i2.u6.p17==1)"))&&("(i2.u37.p151==1)"))))U((F("((i2.u6.p17==1)&&(i2.u37.p151==1))"))||("((i2.u6.p17==1)&&(i2.u37.p151==1))")))&&("((i11.u46.p120!=1)||(i2.u37.p151!=1))"))))
Formula 8 simplified : !X("((i11.u46.p120!=1)||(i2.u37.p151!=1))" & (!G("(i2.u6.p17==1)" & "(i2.u37.p151==1)" & F"((i11.u46.p120==1)&&(i2.u37.p151==1))") U ("((i2.u6.p17==1)&&(i2.u37.p151==1))" | F"((i2.u6.p17==1)&&(i2.u37.p151==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.812875,53252,1,0,93298,230,2328,98945,173,1035,118348
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X("(((i5.u18.p47==1)&&(i2.u37.p151==1))||(i3.u8.p21==1))"))||(F("(i1.u51.p133==1)"))))
Formula 9 simplified : !(X"(((i5.u18.p47==1)&&(i2.u37.p151==1))||(i3.u8.p21==1))" | F"(i1.u51.p133==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
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,1.01099,58532,1,0,107494,231,2389,118030,173,1058,135027
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((!(F("((i1.u55.p142!=1)||(i2.u37.p151!=1))")))||("(i8.u30.p76!=1)"))))
Formula 10 simplified : !X("(i8.u30.p76!=1)" | !F"((i1.u55.p142!=1)||(i2.u37.p151!=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,1.01266,59060,1,0,107494,231,2402,118030,173,1058,135045
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-15a-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!((X(!(G((F("(i7.u25.p64==1)"))U("(i2.u38.p98==1)")))))U(G(F(X(X(F("((i4.u14.p37==1)&&(i2.u37.p151==1))")))))))))
Formula 11 simplified : X!G(F"(i7.u25.p64==1)" U "(i2.u38.p98==1)") U GFXXF"((i4.u14.p37==1)&&(i2.u37.p151==1))"
Computing Next relation with stutter on 1 deadlock states
12 unique states visited
8 strongly connected components in search stack
16 transitions explored
10 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,1.05313,60364,1,0,112559,231,2437,123549,173,1058,143966
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G((((!(F(G("(i1.u51.p131==1)"))))&&("(i9.i0.u32.p81!=1)"))&&("(i14.u57.p146==1)"))&&("(i2.u37.p151==1)")))U(G(F("((i6.i1.u23.p60==1)&&(i2.u37.p151==1))")))))
Formula 12 simplified : !(G("(i2.u37.p151==1)" & "(i9.i0.u32.p81!=1)" & "(i14.u57.p146==1)" & !FG"(i1.u51.p131==1)") U GF"((i6.i1.u23.p60==1)&&(i2.u37.p151==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,1.05966,60628,1,0,112839,231,2480,123850,173,1058,144868
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(((F(X(((!(X(G(X(G("(i6.i0.u20.p51==1)"))))))&&("(i11.u45.p117==1)"))&&("(i2.u37.p151==1)"))))||("((i4.u12.p32==1)&&(i2.u37.p151==1))"))||("((i11.u45.p116==1)&&(i2.u37.p151==1))"))))
Formula 13 simplified : !F("((i4.u12.p32==1)&&(i2.u37.p151==1))" | "((i11.u45.p116==1)&&(i2.u37.p151==1))" | FX("(i2.u37.p151==1)" & "(i11.u45.p117==1)" & !XGXG"(i6.i0.u20.p51==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
17 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,1.22828,69076,1,0,135960,231,2580,145043,173,1068,172821
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 07:31:10] [INFO ] Computing symmetric co enabling matrix : 211 transitions.
[2020-05-22 07:31:10] [WARNING] Script execution failed on command (assert (and (>= (select s0 127) 1) (>= (select s0 151) 1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 127) 1) (>= (select s0 151) 1))")
[(assert (and (>= (select s0 127) 1) (>= (select s0 151) 1)))]
Skipping mayMatrices nes/nds SMT solver raised an exception.
java.lang.RuntimeException: SMT solver raised an exception.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:477)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 07:31:10] [INFO ] Built C files in 1960ms 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 1590132670537

--------------------
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-15a"
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-15a, 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-158922814700730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15a.tgz
mv DiscoveryGPU-PT-15a 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;