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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.8K Mar 31 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 30 00:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 30 00:00 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.3K 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.5K Mar 28 14:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 07:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:41 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 43K 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-12a-00
FORMULA_NAME DiscoveryGPU-PT-12a-01
FORMULA_NAME DiscoveryGPU-PT-12a-02
FORMULA_NAME DiscoveryGPU-PT-12a-03
FORMULA_NAME DiscoveryGPU-PT-12a-04
FORMULA_NAME DiscoveryGPU-PT-12a-05
FORMULA_NAME DiscoveryGPU-PT-12a-06
FORMULA_NAME DiscoveryGPU-PT-12a-07
FORMULA_NAME DiscoveryGPU-PT-12a-08
FORMULA_NAME DiscoveryGPU-PT-12a-09
FORMULA_NAME DiscoveryGPU-PT-12a-10
FORMULA_NAME DiscoveryGPU-PT-12a-11
FORMULA_NAME DiscoveryGPU-PT-12a-12
FORMULA_NAME DiscoveryGPU-PT-12a-13
FORMULA_NAME DiscoveryGPU-PT-12a-14
FORMULA_NAME DiscoveryGPU-PT-12a-15

=== Now, execution of the tool begins

BK_START 1590131363047

[2020-05-22 07:09:24] [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:09:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:09:24] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-05-22 07:09:24] [INFO ] Transformed 123 places.
[2020-05-22 07:09:24] [INFO ] Transformed 169 transitions.
[2020-05-22 07:09:24] [INFO ] Found NUPN structural information;
[2020-05-22 07:09:24] [INFO ] Parsed PT model containing 123 places and 169 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 784 resets, run finished after 164 ms. (steps per millisecond=609 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 07:09:24] [INFO ] Flow matrix only has 157 transitions (discarded 12 similar events)
// Phase 1: matrix 157 rows 123 cols
[2020-05-22 07:09:24] [INFO ] Computed 2 place invariants in 5 ms
[2020-05-22 07:09:25] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-05-22 07:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:09:25] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-22 07:09:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 07:09:25] [INFO ] Flatten gal took : 49 ms
FORMULA DiscoveryGPU-PT-12a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:09:25] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 07:09:25] [INFO ] Applying decomposition
[2020-05-22 07:09:25] [INFO ] Flatten gal took : 10 ms
[2020-05-22 07:09:25] [INFO ] Input system was already deterministic with 169 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/graph14652968570099605314.txt, -o, /tmp/graph14652968570099605314.bin, -w, /tmp/graph14652968570099605314.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/graph14652968570099605314.bin, -l, -1, -v, -w, /tmp/graph14652968570099605314.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 157 out of 169 initially.
// Phase 1: matrix 157 rows 123 cols
[2020-05-22 07:09:25] [INFO ] Computed 2 place invariants in 2 ms
inv : p0 + p122 = 1
inv : p0 + p121 = 1
Total of 2 invariants.
[2020-05-22 07:09:25] [INFO ] Computed 2 place invariants in 4 ms
[2020-05-22 07:09:25] [INFO ] Decomposing Gal with order
[2020-05-22 07:09:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:09:25] [INFO ] Removed a total of 101 redundant transitions.
[2020-05-22 07:09:25] [INFO ] Flatten gal took : 68 ms
[2020-05-22 07:09:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 14 ms.
[2020-05-22 07:09:25] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-22 07:09:25] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 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(((X("((i3.i1.u14.p40==1)&&(i2.u1.p121==1))"))U("(i3.i1.u13.p36==1)"))&&(F(X(G(X(X("(i3.i1.u13.p36==1)")))))))))
Formula 0 simplified : !F((X"((i3.i1.u14.p40==1)&&(i2.u1.p121==1))" U "(i3.i1.u13.p36==1)") & FXGXX"(i3.i1.u13.p36==1)")
built 22 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 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 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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.
[2020-05-22 07:09:25] [INFO ] Proved 123 variables to be positive in 218 ms
[2020-05-22 07:09:25] [INFO ] Computing symmetric may disable matrix : 169 transitions.
[2020-05-22 07:09:25] [INFO ] Computation of disable matrix completed :0/169 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:09:25] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:09:25] [INFO ] Computing symmetric may enable matrix : 169 transitions.
[2020-05-22 07:09:25] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t156, i0.i1.u5.t155, i1.u0.t158, i1.u7.t159, i1.u15.t161, i1.u23.t163, i2.u1.t157, i2.u9.t160, i3.i0.u11.t154, i3.i1.u13.t153, i4.u17.t162, i5.u19.t152, i5.u21.t151, i6.u25.t164, i7.u27.t150, i7.u29.t149, i8.i0.u31.t165, i8.i1.u33.t166, i9.i0.u35.t148, i9.i1.u37.t147, i10.u39.t167, i10.u41.t168, i11.u43.t146, i11.u45.t145, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/105/24/129
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
24 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.284291,25884,1,0,21062,228,1729,28665,162,903,29805
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((F("((i4.u18.p48==1)&&(i1.u7.p122==1))"))||(X("((i4.u18.p48==1)&&(i1.u7.p122==1))")))))
Formula 1 simplified : !G(F"((i4.u18.p48==1)&&(i1.u7.p122==1))" | X"((i4.u18.p48==1)&&(i1.u7.p122==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
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.300394,26436,1,0,22222,228,1783,30705,163,910,32002
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G("(i3.i1.u13.p36==1)"))))
Formula 2 simplified : !FG"(i3.i1.u13.p36==1)"
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 07:09:26] [INFO ] Computing symmetric co enabling matrix : 169 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
134 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.63252,71312,1,0,128921,254,1798,156543,163,1138,90187
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X((G(!(X("(((i6.u25.p67==1)&&(i2.u1.p121==1))||((i2.u2.p7==1)&&(i2.u1.p121==1)))"))))&&((F("((i8.i0.u32.p85==1)&&(i2.u1.p121==1))"))||("((((i8.i0.u32.p85==1)&&(i2.u1.p121==1))&&(i2.u2.p7==1))&&(i2.u1.p121==1))"))))))
Formula 3 simplified : X(G!X"(((i6.u25.p67==1)&&(i2.u1.p121==1))||((i2.u2.p7==1)&&(i2.u1.p121==1)))" & ("((((i8.i0.u32.p85==1)&&(i2.u1.p121==1))&&(i2.u2.p7==1))&&(i2.u1.p121==1))" | F"((i8.i0.u32.p85==1)&&(i2.u1.p121==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
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,1.69657,74932,1,0,137796,254,1891,166427,164,1140,102001
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(G("(i5.u21.p56==1)")))))
Formula 4 simplified : !G!G"(i5.u21.p56==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.70042,74932,1,0,138132,254,1929,166787,164,1140,102595
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(((("((i11.u46.p118==1)&&(i1.u7.p122==1))")U("((i10.u39.p103==1)&&(i1.u7.p122==1))"))&&("(i10.u39.p103==1)"))&&("(i1.u7.p122==1)")))))
Formula 5 simplified : !XG("(i1.u7.p122==1)" & "(i10.u39.p103==1)" & ("((i11.u46.p118==1)&&(i1.u7.p122==1))" U "((i10.u39.p103==1)&&(i1.u7.p122==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,1.71276,75772,1,0,138827,254,2000,167818,166,1140,104059
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(X("((i10.u40.p105==1)&&(i2.u1.p121==1))")))||(G("(i3.i1.u14.p38==1)"))))
Formula 6 simplified : !(!X"((i10.u40.p105==1)&&(i2.u1.p121==1))" | G"(i3.i1.u14.p38==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.71366,76008,1,0,138827,254,2014,167818,166,1140,104094
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-12a-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X("(((i1.u23.p63!=1)||(i1.u7.p122!=1))&&((i3.i1.u14.p40!=1)||(i2.u1.p121!=1)))"))))
Formula 7 simplified : !FX"(((i1.u23.p63!=1)||(i1.u7.p122!=1))&&((i3.i1.u14.p40!=1)||(i2.u1.p121!=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
68 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,2.39599,100296,1,0,195968,254,2064,259866,166,1151,132813
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(X((G("((((i10.u42.p109==1)&&(i2.u1.p121==1))&&(i7.u29.p76==1))&&(i8.i0.u31.p83==1))"))U("((i7.u29.p76==1)&&(i2.u1.p121==1))"))))))
Formula 8 simplified : !GXX(G"((((i10.u42.p109==1)&&(i2.u1.p121==1))&&(i7.u29.p76==1))&&(i8.i0.u31.p83==1))" U "((i7.u29.p76==1)&&(i2.u1.p121==1))")
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,2.3984,100764,1,0,196041,254,2096,259969,166,1151,133028
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(G(X(F("((i10.u39.p102==1)&&(i2.u1.p121==1))"))))))
Formula 9 simplified : GXF"((i10.u39.p102==1)&&(i2.u1.p121==1))"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.4582,103668,1,0,204790,254,2135,268671,166,1151,141834
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((G((((G("((i2.u2.p7==1)&&(i2.u1.p121==1))"))||("(i8.i1.u34.p89!=1)"))||("(i2.u1.p121!=1)"))U("((i2.u2.p7==1)&&(i2.u1.p121==1))")))U(((G(X("((i10.u39.p103==1)&&(i1.u7.p122==1))")))&&("(i4.u18.p49==1)"))&&("(i2.u1.p121==1)")))))
Formula 10 simplified : !G(G(("(i2.u1.p121!=1)" | "(i8.i1.u34.p89!=1)" | G"((i2.u2.p7==1)&&(i2.u1.p121==1))") U "((i2.u2.p7==1)&&(i2.u1.p121==1))") U ("(i2.u1.p121==1)" & "(i4.u18.p49==1)" & GX"((i10.u39.p103==1)&&(i1.u7.p122==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
31 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,2.79384,114480,1,0,230233,261,2221,310966,167,1236,165190
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X(X("((i7.u28.p75==1)&&(i2.u1.p121==1))")))))
Formula 11 simplified : !FXX"((i7.u28.p75==1)&&(i2.u1.p121==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
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,2.83711,116856,1,0,236398,261,2250,315938,167,1237,173102
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 07:09:28] [INFO ] Computation of co-enabling matrix(98/169) took 2293 ms. Total solver calls (SAT/UNSAT): 2307(2199/108)
[2020-05-22 07:09:29] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-22 07:09:29] [WARNING] Script execution failed on command (assert (= 1 (+ (select s0 0) (select s0 121)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 0) (select s0 121)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 0) (select s0 121)))), (assert (and (>= (select s0 15) 1) (>= (select s0 121) 1))), (assert (>= (select s0 0) 0)), (assert (>= (select s0 15) 0)), (assert (>= (select s0 121) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@4e21c322
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@4e21c322
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
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:09:29] [INFO ] Built C files in 3731ms 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 1590131369278

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12a.tgz
mv DiscoveryGPU-PT-12a 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 ;