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-162124171100065.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-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.3K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 2.7K May 11 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 11 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 15K 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-12a-00
FORMULA_NAME GPUForwardProgress-PT-12a-01
FORMULA_NAME GPUForwardProgress-PT-12a-02
FORMULA_NAME GPUForwardProgress-PT-12a-03
FORMULA_NAME GPUForwardProgress-PT-12a-04
FORMULA_NAME GPUForwardProgress-PT-12a-05
FORMULA_NAME GPUForwardProgress-PT-12a-06
FORMULA_NAME GPUForwardProgress-PT-12a-07
FORMULA_NAME GPUForwardProgress-PT-12a-08
FORMULA_NAME GPUForwardProgress-PT-12a-09
FORMULA_NAME GPUForwardProgress-PT-12a-10
FORMULA_NAME GPUForwardProgress-PT-12a-11
FORMULA_NAME GPUForwardProgress-PT-12a-12
FORMULA_NAME GPUForwardProgress-PT-12a-13
FORMULA_NAME GPUForwardProgress-PT-12a-14
FORMULA_NAME GPUForwardProgress-PT-12a-15

=== Now, execution of the tool begins

BK_START 1621335484497

[2021-05-18 10:58:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:58:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:58:06] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-18 10:58:06] [INFO ] Transformed 56 places.
[2021-05-18 10:58:06] [INFO ] Transformed 69 transitions.
[2021-05-18 10:58:06] [INFO ] Found NUPN structural information;
[2021-05-18 10:58:06] [INFO ] Parsed PT model containing 56 places and 69 transitions in 76 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 545 resets, run finished after 325 ms. (steps per millisecond=307 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 55 rows 56 cols
[2021-05-18 10:58:06] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 14 ms returned sat
[2021-05-18 10:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-18 10:58:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:58:06] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 8 ms returned unsat
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-18 10:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-18 10:58:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:58:06] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned unsat
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-18 10:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-18 10:58:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:58:06] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned unsat
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-18 10:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-18 10:58:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:58:06] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned unsat
[2021-05-18 10:58:07] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-18 10:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-18 10:58:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:58:07] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned unsat
[2021-05-18 10:58:07] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-18 10:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-18 10:58:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:58:07] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-18 10:58:07] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 10:58:07] [INFO ] Flatten gal took : 31 ms
FORMULA GPUForwardProgress-PT-12a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:58:07] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:58:07] [INFO ] Applying decomposition
[2021-05-18 10:58:07] [INFO ] Flatten gal took : 12 ms
[2021-05-18 10:58:07] [INFO ] Input system was already deterministic with 55 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/graph4812884624385900960.txt, -o, /tmp/graph4812884624385900960.bin, -w, /tmp/graph4812884624385900960.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/graph4812884624385900960.bin, -l, -1, -v, -w, /tmp/graph4812884624385900960.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:58:07] [INFO ] Decomposing Gal with order
[2021-05-18 10:58:07] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 55 rows 56 cols
[2021-05-18 10:58:07] [INFO ] Computed 14 place invariants in 2 ms
inv : p25 + p26 + p27 + p28 - p52 - p53 - p54 - p55 = 0
inv : p50 + p51 - p53 - p54 - p55 = 0
inv : p37 + p38 + p39 + p40 - p52 - p53 - p54 - p55 = 0
inv : p41 + p42 + p43 + p44 - p52 - p53 - p54 - p55 = 0
inv : p1 + p2 + p3 + p4 - p52 - p53 - p54 - p55 = 0
inv : p17 + p18 + p19 + p20 - p52 - p53 - p54 - p55 = 0
inv : p9 + p10 + p11 + p12 - p52 - p53 - p54 - p55 = 0
inv : p33 + p34 + p35 + p36 - p52 - p53 - p54 - p55 = 0
inv : p45 + p46 + p47 + p48 - p52 - p53 - p54 - p55 = 0
inv : p29 + p30 + p31 + p32 - p52 - p53 - p54 - p55 = 0
inv : p21 + p22 + p23 + p24 - p52 - p53 - p54 - p55 = 0
inv : p49 - p52 = 0
inv : p13 + p14 + p15 + p16 - p52 - p53 - p54 - p55 = 0
inv : p5 + p6 + p7 + p8 - p52 - p53 - p54 - p55 = 0
Total of 14 invariants.
[2021-05-18 10:58:07] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-18 10:58:07] [INFO ] Removed a total of 44 redundant transitions.
[2021-05-18 10:58:07] [INFO ] Flatten gal took : 32 ms
[2021-05-18 10:58:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-18 10:58:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2021-05-18 10:58:07] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !((G(X(X(G("((u4.p20==0)||(u5.p21==1))"))))))
Formula 0 simplified : !GXXG"((u4.p20==0)||(u5.p21==1))"
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t43, i12.u12.t6, i12.u13.t2, i12.u13.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/51/4/55
Computing Next relation with stutter on 4096 deadlock states
[2021-05-18 10:58:07] [INFO ] Proved 56 variables to be positive in 108 ms
[2021-05-18 10:58:07] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2021-05-18 10:58:07] [INFO ] Computation of disable matrix completed :0/55 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:58:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:58:07] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2021-05-18 10:58:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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,0.068915,18424,1,0,4918,216,852,5433,165,537,9692
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(!(X(("((u5.p22==0)||(u8.p34==1))")U(F("((u5.p22==0)||(u8.p34==1))"))))))&&(("((u5.p22!=0)&&(u8.p34!=1))")U("((u3.p14==0)||(u8.p36==1))"))))
Formula 1 simplified : !(F!X("((u5.p22==0)||(u8.p34==1))" U F"((u5.p22==0)||(u8.p34==1))") & ("((u5.p22!=0)&&(u8.p34!=1))" U "((u3.p14==0)||(u8.p36==1))"))
Computing Next relation with stutter on 4096 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
27 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.335355,32196,1,0,38548,218,908,42054,170,599,42079
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G(X("(u1.p8==1)")))||("(u1.p8==1)"))U(F((F(X("(u1.p0==1)")))&&("(u1.p8==1)")))))
Formula 2 simplified : !(("(u1.p8==1)" | GX"(u1.p8==1)") U F("(u1.p8==1)" & FX"(u1.p0==1)"))
Computing Next relation with stutter on 4096 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.360347,33676,1,0,41551,218,982,45331,171,600,46753
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F("((u10.p43!=0)&&(u7.p29!=1))"))))
Formula 3 simplified : !GF"((u10.p43!=0)&&(u7.p29!=1))"
Computing Next relation with stutter on 4096 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.377588,34464,1,0,43699,219,1024,47269,173,622,49898
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(G(F(!((X(!(G("((i12.u13.p55==0)||(i12.u12.p50==1))"))))U(F("((i12.u13.p55==0)||(i12.u12.p50==1))")))))))))
Formula 4 simplified : !XXGF!(X!G"((i12.u13.p55==0)||(i12.u12.p50==1))" U F"((i12.u13.p55==0)||(i12.u12.p50==1))")
Computing Next relation with stutter on 4096 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.5092,39372,1,0,56277,220,1058,60030,173,624,63524
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(X("((i12.u12.p50==0)||(u1.p7==1))")))))
Formula 5 simplified : !FXX"((i12.u12.p50==0)||(u1.p7==1))"
Computing Next relation with stutter on 4096 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.511505,39636,1,0,56435,220,1087,60208,175,624,63999
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(!(F("((u0.p2==0)||(u0.p1==1))")))))
Formula 6 simplified : !X!F"((u0.p2==0)||(u0.p1==1))"
Computing Next relation with stutter on 4096 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.513917,39896,1,0,56446,220,1106,60219,177,624,64079
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(!(X(F("((u4.p20==0)||(u8.p33==1))")))))))
Formula 7 simplified : F!XF"((u4.p20==0)||(u8.p33==1))"
Computing Next relation with stutter on 4096 deadlock states
4 unique states visited
4 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.51636,39896,1,0,56634,220,1158,60465,177,624,64464
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(G(X(F(X(G(!(F("((u7.p30==0)||(u7.p31==1))"))))))))))
Formula 8 simplified : GXFXG!F"((u7.p30==0)||(u7.p31==1))"
Computing Next relation with stutter on 4096 deadlock states
4 unique states visited
4 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.518247,39896,1,0,56758,220,1182,60637,181,624,64749
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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:512)
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:58:08] [INFO ] Built C files in 758ms 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 1621335489008

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-12a"
export BK_EXAMINATION="LTLCardinality"
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-12a, examination is LTLCardinality"
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-162124171100065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-12a.tgz
mv GPUForwardProgress-PT-12a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;