fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171100058
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for GPUForwardProgress-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
234.743 3771.00 7328.00 97.10 FFFFFFFFTTFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171100058.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is GPUForwardProgress-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 126K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.1K May 11 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 11K May 12 08:13 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 GPUForwardProgress-PT-08a-00
FORMULA_NAME GPUForwardProgress-PT-08a-01
FORMULA_NAME GPUForwardProgress-PT-08a-02
FORMULA_NAME GPUForwardProgress-PT-08a-03
FORMULA_NAME GPUForwardProgress-PT-08a-04
FORMULA_NAME GPUForwardProgress-PT-08a-05
FORMULA_NAME GPUForwardProgress-PT-08a-06
FORMULA_NAME GPUForwardProgress-PT-08a-07
FORMULA_NAME GPUForwardProgress-PT-08a-08
FORMULA_NAME GPUForwardProgress-PT-08a-09
FORMULA_NAME GPUForwardProgress-PT-08a-10
FORMULA_NAME GPUForwardProgress-PT-08a-11
FORMULA_NAME GPUForwardProgress-PT-08a-12
FORMULA_NAME GPUForwardProgress-PT-08a-13
FORMULA_NAME GPUForwardProgress-PT-08a-14
FORMULA_NAME GPUForwardProgress-PT-08a-15

=== Now, execution of the tool begins

BK_START 1621335424987

[2021-05-18 10:57:06] [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]
[2021-05-18 10:57:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:57:06] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-18 10:57:06] [INFO ] Transformed 40 places.
[2021-05-18 10:57:06] [INFO ] Transformed 49 transitions.
[2021-05-18 10:57:06] [INFO ] Found NUPN structural information;
[2021-05-18 10:57:06] [INFO ] Parsed PT model containing 40 places and 49 transitions in 67 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 764 resets, run finished after 281 ms. (steps per millisecond=355 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 39 rows 40 cols
[2021-05-18 10:57:07] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-18 10:57:07] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 13 ms returned sat
[2021-05-18 10:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:57:07] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-18 10:57:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 10:57:07] [INFO ] Flatten gal took : 28 ms
FORMULA GPUForwardProgress-PT-08a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:57:07] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:57:07] [INFO ] Applying decomposition
[2021-05-18 10:57:07] [INFO ] Flatten gal took : 19 ms
[2021-05-18 10:57:07] [INFO ] Input system was already deterministic with 39 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/graph16225050007744057131.txt, -o, /tmp/graph16225050007744057131.bin, -w, /tmp/graph16225050007744057131.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/graph16225050007744057131.bin, -l, -1, -v, -w, /tmp/graph16225050007744057131.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:57:07] [INFO ] Decomposing Gal with order
[2021-05-18 10:57:07] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2021-05-18 10:57:07] [INFO ] Removed a total of 28 redundant transitions.
// Phase 1: matrix 39 rows 40 cols
[2021-05-18 10:57:07] [INFO ] Computed 10 place invariants in 2 ms
inv : p5 + p6 + p7 + p8 - p36 - p37 - p38 - p39 = 0
inv : p29 + p30 + p31 + p32 - p36 - p37 - p38 - p39 = 0
inv : p21 + p22 + p23 + p24 - p36 - p37 - p38 - p39 = 0
inv : p13 + p14 + p15 + p16 - p36 - p37 - p38 - p39 = 0
inv : p9 + p10 + p11 + p12 - p36 - p37 - p38 - p39 = 0
inv : p33 - p36 = 0
inv : p1 + p2 + p3 + p4 - p36 - p37 - p38 - p39 = 0
inv : p25 + p26 + p27 + p28 - p36 - p37 - p38 - p39 = 0
inv : p17 + p18 + p19 + p20 - p36 - p37 - p38 - p39 = 0
inv : p34 + p35 - p37 - p38 - p39 = 0
Total of 10 invariants.
[2021-05-18 10:57:07] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-18 10:57:07] [INFO ] Flatten gal took : 32 ms
[2021-05-18 10:57:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-18 10:57:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2021-05-18 10:57:07] [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 : !(((("(((u6.p26==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))")U("(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))U((F(X(G("(u0.p0==1)"))))U(G("(((u6.p26==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))")))))
Formula 0 simplified : !(("(((u6.p26==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))" U "(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))") U (FXG"(u0.p0==1)" U G"(((u6.p26==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
[2021-05-18 10:57:07] [INFO ] Proved 40 variables to be positive in 96 ms
[2021-05-18 10:57:07] [INFO ] Computing symmetric may disable matrix : 39 transitions.
[2021-05-18 10:57:07] [INFO ] Computation of disable matrix completed :0/39 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:57:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:57:07] [INFO ] Computing symmetric may enable matrix : 39 transitions.
[2021-05-18 10:57:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t31, i8.u8.t6, i8.u9.t2, i8.u9.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/35/4/39
Computing Next relation with stutter on 256 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.044581,18764,1,0,1546,213,662,1762,166,468,3652
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(((!(("(u1.p7==1)")U(F("(u1.p7==1)"))))&&(!(F("(u5.p23==1)"))))&&(!(G("(u7.p31==1)"))))))
Formula 1 simplified : !X(!("(u1.p7==1)" U F"(u1.p7==1)") & !F"(u5.p23==1)" & !G"(u7.p31==1)")
Computing Next relation with stutter on 256 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.050841,19496,1,0,2063,213,742,2317,168,475,4830
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(G((((!(X((F(X("(u5.p23==1)")))U(!(X(G("(u5.p23==1)")))))))||("(u1.p6!=1)"))||("(i8.u8.p35!=1)"))||("(i8.u9.p39!=1)"))))))
Formula 2 simplified : !XXG("(i8.u8.p35!=1)" | "(i8.u9.p39!=1)" | "(u1.p6!=1)" | !X(FX"(u5.p23==1)" U !XG"(u5.p23==1)"))
Computing Next relation with stutter on 256 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.084386,20840,1,0,6333,218,805,6907,168,542,11532
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((G(X("(i8.u8.p34==1)")))&&(F("(i8.u8.p34==1)")))))
Formula 3 simplified : !G(GX"(i8.u8.p34==1)" & F"(i8.u8.p34==1)")
Computing Next relation with stutter on 256 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.085854,21096,1,0,6333,218,825,6907,170,542,11550
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((!(X(G(X((!(F("(((u4.p18==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))")))||("(u3.p15==1)"))))))&&("(u3.p15!=1)"))))
Formula 4 simplified : !F("(u3.p15!=1)" & !XGX("(u3.p15==1)" | !F"(((u4.p18==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))
Computing Next relation with stutter on 256 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.116295,22416,1,0,10676,218,892,11080,170,550,18091
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F("(i8.u8.p34==1)")))
Formula 5 simplified : !F"(i8.u8.p34==1)"
Computing Next relation with stutter on 256 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.117611,22680,1,0,10683,219,904,11094,170,552,18178
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-08a-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(X(G(X("(u7.p30==1)")))))))
Formula 6 simplified : GXGX"(u7.p30==1)"
Computing Next relation with stutter on 256 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.118164,22680,1,0,10683,219,919,11094,170,552,18185
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-08a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X((("(u3.p14==1)")U("(u0.p0==1)"))||((!(G((F("(u6.p26==1)"))||("(u6.p26==1)"))))U(X("(u6.p26==1)")))))))
Formula 7 simplified : !GX(("(u3.p14==1)" U "(u0.p0==1)") | (!G("(u6.p26==1)" | F"(u6.p26==1)") U X"(u6.p26==1)"))
Computing Next relation with stutter on 256 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.125425,22880,1,0,11241,220,945,11688,170,573,19329
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G("(u6.p27!=1)")))||(F((F("(u0.p2==1)"))U(X("(((u4.p18==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))))))
Formula 8 simplified : !(XG"(u6.p27!=1)" | F(F"(u0.p2==1)" U X"(((u4.p18==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))
Computing Next relation with stutter on 256 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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.132625,23144,1,0,12204,220,966,12567,170,573,21708
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((G("(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))U("(u4.p19==1)"))||(X(((F("(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))&&(F("(u2.p11==1)")))&&("(u4.p19==1)")))))
Formula 9 simplified : !((G"(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))" U "(u4.p19==1)") | X("(u4.p19==1)" & F"(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))" & F"(u2.p11==1)"))
Computing Next relation with stutter on 256 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.135052,23396,1,0,12204,220,989,12567,170,573,21749
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(((F("(((u6.p28==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))U(G(X("(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))"))))&&(F("(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))")))))
Formula 10 simplified : !F((F"(((u6.p28==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))" U GX"(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))") & F"(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))")
Computing Next relation with stutter on 256 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 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.13779,23396,1,0,12309,220,1009,12726,170,576,21982
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G(F("(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))")))||(F(X((F("(u4.p18!=1)"))&&(G("(i8.u8.p34==1)")))))))
Formula 11 simplified : !(GF"(((u2.p12==1)&&(i8.u8.p35==1))&&(i8.u9.p39==1))" | FX(F"(u4.p18!=1)" & G"(i8.u8.p34==1)"))
Computing Next relation with stutter on 256 deadlock states
11 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 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.158032,23656,1,0,13583,220,1042,13704,170,577,25086
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(F(G("(u4.p19==1)")))))
Formula 12 simplified : FG"(u4.p19==1)"
Computing Next relation with stutter on 256 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.159888,23920,1,0,13668,220,1073,13798,170,577,25308
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2021-05-18 10:57:07] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2021-05-18 10:57:07] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2021-05-18 10:57:07] [WARNING] Script execution failed on command (assert (and (>= (select s0 23) 1) (= (store (store s0 22 (+ (select s0 22) 1)) 23 (- (select s0 23) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 23) 1) (= (store (store s0 22 (+ (select s0 22) 1)) 23 (- (select s0 23) 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)
[2021-05-18 10:57:07] [INFO ] Built C files in 399ms 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 1621335428758

--------------------
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="GPUForwardProgress-PT-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is GPUForwardProgress-PT-08a, 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 r303-tall-162124171100058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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