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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.4K Mar 31 06:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 06:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 23:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 23:19 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.8K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 07:35 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 28K 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-08a-00
FORMULA_NAME DiscoveryGPU-PT-08a-01
FORMULA_NAME DiscoveryGPU-PT-08a-02
FORMULA_NAME DiscoveryGPU-PT-08a-03
FORMULA_NAME DiscoveryGPU-PT-08a-04
FORMULA_NAME DiscoveryGPU-PT-08a-05
FORMULA_NAME DiscoveryGPU-PT-08a-06
FORMULA_NAME DiscoveryGPU-PT-08a-07
FORMULA_NAME DiscoveryGPU-PT-08a-08
FORMULA_NAME DiscoveryGPU-PT-08a-09
FORMULA_NAME DiscoveryGPU-PT-08a-10
FORMULA_NAME DiscoveryGPU-PT-08a-11
FORMULA_NAME DiscoveryGPU-PT-08a-12
FORMULA_NAME DiscoveryGPU-PT-08a-13
FORMULA_NAME DiscoveryGPU-PT-08a-14
FORMULA_NAME DiscoveryGPU-PT-08a-15

=== Now, execution of the tool begins

BK_START 1590129676951

[2020-05-22 06:41:19] [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]
[2020-05-22 06:41:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:41:19] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-05-22 06:41:19] [INFO ] Transformed 83 places.
[2020-05-22 06:41:19] [INFO ] Transformed 113 transitions.
[2020-05-22 06:41:19] [INFO ] Found NUPN structural information;
[2020-05-22 06:41:19] [INFO ] Parsed PT model containing 83 places and 113 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1169 resets, run finished after 275 ms. (steps per millisecond=363 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1]
[2020-05-22 06:41:20] [INFO ] Flow matrix only has 105 transitions (discarded 8 similar events)
// Phase 1: matrix 105 rows 83 cols
[2020-05-22 06:41:20] [INFO ] Computed 2 place invariants in 5 ms
[2020-05-22 06:41:20] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-05-22 06:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:20] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-05-22 06:41:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:41:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 29 ms returned unsat
[2020-05-22 06:41:20] [INFO ] [Real]Absence check using 2 positive place invariants in 28 ms returned sat
[2020-05-22 06:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:20] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2020-05-22 06:41:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:41:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-05-22 06:41:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-22 06:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:21] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2020-05-22 06:41:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:41:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned unsat
[2020-05-22 06:41:21] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-22 06:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:21] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-05-22 06:41:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:41:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2020-05-22 06:41:21] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 06:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:21] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-22 06:41:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:41:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-22 06:41:21] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-22 06:41:21] [INFO ] Flatten gal took : 52 ms
FORMULA DiscoveryGPU-PT-08a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:41:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 06:41:21] [INFO ] Flatten gal took : 22 ms
[2020-05-22 06:41:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-08a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-22 06:41:21] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 06:41:21] [INFO ] Flatten gal took : 22 ms
[2020-05-22 06:41:21] [INFO ] Input system was already deterministic with 113 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/graph16201195872552749898.txt, -o, /tmp/graph16201195872552749898.bin, -w, /tmp/graph16201195872552749898.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/graph16201195872552749898.bin, -l, -1, -v, -w, /tmp/graph16201195872552749898.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:41:21] [INFO ] Decomposing Gal with order
[2020-05-22 06:41:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:41:21] [INFO ] Removed a total of 65 redundant transitions.
[2020-05-22 06:41:21] [INFO ] Flatten gal took : 94 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 105 out of 113 initially.
// Phase 1: matrix 105 rows 83 cols
[2020-05-22 06:41:21] [INFO ] Computed 2 place invariants in 2 ms
inv : p0 + p82 = 1
inv : p0 + p81 = 1
Total of 2 invariants.
[2020-05-22 06:41:21] [INFO ] Computed 2 place invariants in 3 ms
[2020-05-22 06:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 28 ms.
[2020-05-22 06:41:22] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 11 ms
[2020-05-22 06:41:22] [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 7 LTL properties
Checking formula 0 : !(((X("((i6.u17.p46==0)||(i4.u10.p30==1))"))U(F(X("((i2.i0.u30.p78==0)||(i6.u15.p43==1))")))))
Formula 0 simplified : !(X"((i6.u17.p46==0)||(i4.u10.p30==1))" U FX"((i2.i0.u30.p78==0)||(i6.u15.p43==1))")
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 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.
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t106, i0.u4.t104, i0.u7.t107, i1.u2.t105, i2.i0.u29.t97, i2.i1.u27.t98, i3.u5.t103, i4.u9.t108, i5.u11.t102, i5.u13.t101, i6.u15.t109, i6.u17.t110, i7.i0.u19.t100, i7.i1.u21.t99, i8.i0.u23.t111, i8.i1.u25.t112, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/70/16/86
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
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,0.086651,18360,1,0,3921,180,1075,5372,156,558,4416
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08a-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(G("((((i0.u4.p11==0)||(i8.i1.u25.p66==1))||(i4.u9.p27==0))||(i8.i1.u26.p70==1))")))))
Formula 1 simplified : !GFG"((((i0.u4.p11==0)||(i8.i1.u25.p66==1))||(i4.u9.p27==0))||(i8.i1.u26.p70==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
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.134541,20472,1,0,8735,199,1214,14980,165,755,14481
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(G(F((G((X("((i0.u7.p82==0)||(i3.u6.p17==1))"))||("((i0.u7.p82!=0)&&(i3.u6.p17!=1))")))||("((i8.i1.u25.p67!=0)&&(i3.u6.p20!=1))")))))))
Formula 2 simplified : !F!GF("((i8.i1.u25.p67!=0)&&(i3.u6.p20!=1))" | G("((i0.u7.p82!=0)&&(i3.u6.p17!=1))" | X"((i0.u7.p82==0)||(i3.u6.p17==1))"))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 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.175603,23408,1,0,14377,230,1394,21299,171,913,21966
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!((F("((i2.i0.u30.p79==0)||(i2.i0.u29.p76==1))"))U(((F("((i2.i1.u28.p75==0)||(i6.u15.p42==1))"))&&(X("((i2.i1.u28.p75==0)||(i6.u15.p42==1))")))||(G("((i2.i1.u28.p75==0)||(i6.u15.p42==1))"))))))
Formula 3 simplified : F"((i2.i0.u30.p79==0)||(i2.i0.u29.p76==1))" U ((F"((i2.i1.u28.p75==0)||(i6.u15.p42==1))" & X"((i2.i1.u28.p75==0)||(i6.u15.p42==1))") | G"((i2.i1.u28.p75==0)||(i6.u15.p42==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
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.211315,25364,1,0,17682,230,1432,25518,172,925,26739
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(F(((G("((i2.i0.u29.p76==0)||(i0.u4.p13==1))"))||("(i2.i0.u29.p76==0)"))||("(i0.u4.p13==1)"))))||(X(X("((i2.i0.u29.p76==0)||(i0.u4.p13==1))")))))
Formula 4 simplified : !(XF("(i0.u4.p13==1)" | "(i2.i0.u29.p76==0)" | G"((i2.i0.u29.p76==0)||(i0.u4.p13==1))") | XX"((i2.i0.u29.p76==0)||(i0.u4.p13==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,0.212173,25612,1,0,17682,230,1446,25518,174,925,26753
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(((G((X("(i8.i0.u24.p65==1)"))||("((i6.u15.p43!=0)&&(i6.u16.p45!=1))")))&&(G("((i5.u13.p37==0)||(i1.u2.p7==1))")))U((F("((i6.u15.p43==0)||(i6.u16.p45==1))"))&&("(i1.u3.p0==1)")))))
Formula 5 simplified : !X((G("((i6.u15.p43!=0)&&(i6.u16.p45!=1))" | X"(i8.i0.u24.p65==1)") & G"((i5.u13.p37==0)||(i1.u2.p7==1))") U ("(i1.u3.p0==1)" & F"((i6.u15.p43==0)||(i6.u16.p45==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
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.253295,27680,1,0,22745,232,1516,31269,176,929,34396
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(X("((i4.u10.p29==0)||(i5.u13.p36==1))")))))
Formula 6 simplified : GX"((i4.u10.p29==0)||(i5.u13.p36==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
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.262999,28472,1,0,24347,233,1551,33086,176,931,36978
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 06:41:22] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 06:41:22] [INFO ] Built C files in 711ms 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 1590129682724

--------------------
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="DiscoveryGPU-PT-08a"
export BK_EXAMINATION="LTLCardinality"
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-08a, 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 r066-tajo-158922814600617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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