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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
245.436 4657.00 10230.00 350.20 TFFTTFFTTTTTFFFF 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-162124171100089.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-24a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.0K May 11 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:41 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 29K 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-24a-00
FORMULA_NAME GPUForwardProgress-PT-24a-01
FORMULA_NAME GPUForwardProgress-PT-24a-02
FORMULA_NAME GPUForwardProgress-PT-24a-03
FORMULA_NAME GPUForwardProgress-PT-24a-04
FORMULA_NAME GPUForwardProgress-PT-24a-05
FORMULA_NAME GPUForwardProgress-PT-24a-06
FORMULA_NAME GPUForwardProgress-PT-24a-07
FORMULA_NAME GPUForwardProgress-PT-24a-08
FORMULA_NAME GPUForwardProgress-PT-24a-09
FORMULA_NAME GPUForwardProgress-PT-24a-10
FORMULA_NAME GPUForwardProgress-PT-24a-11
FORMULA_NAME GPUForwardProgress-PT-24a-12
FORMULA_NAME GPUForwardProgress-PT-24a-13
FORMULA_NAME GPUForwardProgress-PT-24a-14
FORMULA_NAME GPUForwardProgress-PT-24a-15

=== Now, execution of the tool begins

BK_START 1621336949853

[2021-05-18 11:22:31] [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 11:22:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:22:31] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-18 11:22:31] [INFO ] Transformed 104 places.
[2021-05-18 11:22:31] [INFO ] Transformed 129 transitions.
[2021-05-18 11:22:31] [INFO ] Found NUPN structural information;
[2021-05-18 11:22:31] [INFO ] Parsed PT model containing 104 places and 129 transitions in 83 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 269 resets, run finished after 386 ms. (steps per millisecond=259 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 103 rows 104 cols
[2021-05-18 11:22:32] [INFO ] Computed 26 place invariants in 7 ms
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-18 11:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-18 11:22:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:32] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 10 ms returned unsat
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 10 ms returned sat
[2021-05-18 11:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-18 11:22:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:32] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 7 ms returned unsat
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 10 ms returned sat
[2021-05-18 11:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-18 11:22:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:32] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 7 ms returned unsat
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 9 ms returned sat
[2021-05-18 11:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:22:32] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-18 11:22:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:22:32] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 7 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2021-05-18 11:22:32] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2021-05-18 11:22:32] [INFO ] Flatten gal took : 43 ms
FORMULA GPUForwardProgress-PT-24a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 11:22:32] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 11:22:32] [INFO ] Applying decomposition
[2021-05-18 11:22:32] [INFO ] Flatten gal took : 19 ms
[2021-05-18 11:22:33] [INFO ] Input system was already deterministic with 103 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/graph4735939361640338137.txt, -o, /tmp/graph4735939361640338137.bin, -w, /tmp/graph4735939361640338137.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/graph4735939361640338137.bin, -l, -1, -v, -w, /tmp/graph4735939361640338137.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2021-05-18 11:22:33] [INFO ] Decomposing Gal with order
// Phase 1: matrix 103 rows 104 cols
[2021-05-18 11:22:33] [INFO ] Computed 26 place invariants in 3 ms
inv : p57 + p58 + p59 + p60 - p100 - p101 - p102 - p103 = 0
inv : p13 + p14 + p15 + p16 - p100 - p101 - p102 - p103 = 0
inv : p1 + p2 + p3 + p4 - p100 - p101 - p102 - p103 = 0
inv : p69 + p70 + p71 + p72 - p100 - p101 - p102 - p103 = 0
inv : p25 + p26 + p27 + p28 - p100 - p101 - p102 - p103 = 0
inv : p33 + p34 + p35 + p36 - p100 - p101 - p102 - p103 = 0
inv : p93 + p94 + p95 + p96 - p100 - p101 - p102 - p103 = 0
inv : p49 + p50 + p51 + p52 - p100 - p101 - p102 - p103 = 0
inv : p9 + p10 + p11 + p12 - p100 - p101 - p102 - p103 = 0
inv : p77 + p78 + p79 + p80 - p100 - p101 - p102 - p103 = 0
inv : p65 + p66 + p67 + p68 - p100 - p101 - p102 - p103 = 0
inv : p98 + p99 - p101 - p102 - p103 = 0
inv : p61 + p62 + p63 + p64 - p100 - p101 - p102 - p103 = 0
inv : p81 + p82 + p83 + p84 - p100 - p101 - p102 - p103 = 0
inv : p45 + p46 + p47 + p48 - p100 - p101 - p102 - p103 = 0
inv : p29 + p30 + p31 + p32 - p100 - p101 - p102 - p103 = 0
inv : p85 + p86 + p87 + p88 - p100 - p101 - p102 - p103 = 0
inv : p73 + p74 + p75 + p76 - p100 - p101 - p102 - p103 = 0
inv : p17 + p18 + p19 + p20 - p100 - p101 - p102 - p103 = 0
inv : p41 + p42 + p43 + p44 - p100 - p101 - p102 - p103 = 0
inv : p21 + p22 + p23 + p24 - p100 - p101 - p102 - p103 = 0
inv : p5 + p6 + p7 + p8 - p100 - p101 - p102 - p103 = 0
inv : p89 + p90 + p91 + p92 - p100 - p101 - p102 - p103 = 0
inv : p97 - p100 = 0
inv : p53 + p54 + p55 + p56 - p100 - p101 - p102 - p103 = 0
inv : p37 + p38 + p39 + p40 - p100 - p101 - p102 - p103 = 0
Total of 26 invariants.
[2021-05-18 11:22:33] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-18 11:22:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:22:33] [INFO ] Removed a total of 92 redundant transitions.
[2021-05-18 11:22:33] [INFO ] Flatten gal took : 36 ms
[2021-05-18 11:22:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-18 11:22:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2021-05-18 11:22:33] [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 5 LTL properties
Checking formula 0 : !(((X(G("(u10.p42==1)")))U("(u10.p42==1)")))
Formula 0 simplified : !(XG"(u10.p42==1)" U "(u10.p42==1)")
built 25 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t79, i24.u24.t6, i24.u25.t2, i24.u25.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/99/4/103
Computing Next relation with stutter on 1.67772e+07 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.111624,19660,1,0,7561,213,1399,7718,168,500,16839
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-24a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(G("((u5.p24!=0)&&(u7.p30!=1))")))))
Formula 1 simplified : !XG"((u5.p24!=0)&&(u7.p30!=1))"
Computing Next relation with stutter on 1.67772e+07 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.165078,22000,1,0,13976,215,1492,14938,169,536,26175
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-24a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X(G(X("((u10.p44==0)||(u19.p78==1))"))))U((X((F("((u10.p44==0)||(u19.p78==1))"))U("((u10.p44==0)||(u19.p78==1))")))U("(u19.p80==1)"))))
Formula 2 simplified : !(XGX"((u10.p44==0)||(u19.p78==1))" U (X(F"((u10.p44==0)||(u19.p78==1))" U "((u10.p44==0)||(u19.p78==1))") U "(u19.p80==1)"))
Computing Next relation with stutter on 1.67772e+07 deadlock states
[2021-05-18 11:22:33] [INFO ] Proved 104 variables to be positive in 276 ms
[2021-05-18 11:22:33] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2021-05-18 11:22:33] [INFO ] Computation of disable matrix completed :0/103 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.186308,23636,1,0,16469,215,1580,17459,172,536,29904
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-24a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X("((u18.p73!=0)&&(u21.p85!=1))"))||((!(F((X("((u18.p73==0)||(u21.p85==1))"))&&("((u1.p5==0)||(u15.p64==1))"))))&&(X("((u5.p24==0)||(u1.p0==1))")))))
Formula 3 simplified : !(X"((u18.p73!=0)&&(u21.p85!=1))" | (!F("((u1.p5==0)||(u15.p64==1))" & X"((u18.p73==0)||(u21.p85==1))") & X"((u5.p24==0)||(u1.p0==1))"))
Computing Next relation with stutter on 1.67772e+07 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.190277,25012,1,0,16469,215,1635,17459,176,536,29978
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-24a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(F(X(X(F("((u0.p4==0)||(u17.p71==1))"))))))))
Formula 4 simplified : GFXXF"((u0.p4==0)||(u17.p71==1))"
Computing Next relation with stutter on 1.67772e+07 deadlock states
[2021-05-18 11:22:33] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 11:22:33] [INFO ] Computing symmetric may enable matrix : 103 transitions.
5 unique states visited
4 strongly connected components in search stack
7 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.204385,25280,1,0,17853,217,1742,19191,177,554,32495
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-24a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 11:22:33] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
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 11:22:33] [INFO ] Built C files in 455ms 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 1621336954510

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

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