About the Execution of ITS-Tools for GPUForwardProgress-PT-08b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
376.119 | 17763.00 | 28831.00 | 115.00 | FFTTTTFTTTFTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576100326.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576100326
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.0K Apr 29 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 29 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 29 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 46K May 10 09:34 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-08b-ReachabilityCardinality-00
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-01
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-02
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-03
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-04
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-05
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-06
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-07
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-08
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-09
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-10
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-11
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-12
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-13
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-14
FORMULA_NAME GPUForwardProgress-PT-08b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654183976939
Running Version 202205111006
[2022-06-02 15:32:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 15:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 15:32:59] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2022-06-02 15:32:59] [INFO ] Transformed 188 places.
[2022-06-02 15:32:59] [INFO ] Transformed 197 transitions.
[2022-06-02 15:32:59] [INFO ] Found NUPN structural information;
[2022-06-02 15:32:59] [INFO ] Parsed PT model containing 188 places and 197 transitions in 289 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 129 resets, run finished after 912 ms. (steps per millisecond=10 ) properties (out of 14) seen :5
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :1
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 197 rows 188 cols
[2022-06-02 15:33:00] [INFO ] Computed 10 place invariants in 14 ms
[2022-06-02 15:33:01] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 15:33:01] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 12 ms returned sat
[2022-06-02 15:33:02] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2022-06-02 15:33:02] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-06-02 15:33:02] [INFO ] After 839ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 194 ms.
Support contains 41 out of 188 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 188/188 places, 197/197 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 188 transition count 152
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 64 rules applied. Total rules applied 109 place count 143 transition count 133
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 126 place count 126 transition count 133
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 126 place count 126 transition count 122
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 148 place count 115 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 112 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 112 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 112 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 155 place count 112 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 111 transition count 117
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 175 place count 102 transition count 108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 185 place count 97 transition count 114
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 188 place count 97 transition count 111
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 193 place count 97 transition count 106
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 198 place count 92 transition count 106
Applied a total of 198 rules in 81 ms. Remains 92 /188 variables (removed 96) and now considering 106/197 (removed 91) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/188 places, 106/197 transitions.
Incomplete random walk after 1000000 steps, including 5225 resets, run finished after 1471 ms. (steps per millisecond=679 ) properties (out of 2) seen :1
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1038 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 92 cols
[2022-06-02 15:33:05] [INFO ] Computed 10 place invariants in 7 ms
[2022-06-02 15:33:05] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:33:05] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 6 ms returned sat
[2022-06-02 15:33:05] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:33:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-02 15:33:05] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:33:05] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-02 15:33:05] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 16 out of 92 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 92/92 places, 106/106 transitions.
Graph (trivial) has 41 edges and 92 vertex of which 6 / 92 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 175 edges and 87 vertex of which 76 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 76 transition count 87
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 place count 66 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 65 transition count 86
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 25 place count 65 transition count 78
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 41 place count 57 transition count 78
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 47 place count 51 transition count 66
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 51 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 65 place count 45 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 96 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 44 transition count 58
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 71 place count 44 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 43 transition count 54
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 78 place count 43 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 43 transition count 48
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 42 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 42 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 41 transition count 47
Applied a total of 82 rules in 53 ms. Remains 41 /92 variables (removed 51) and now considering 47/106 (removed 59) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/92 places, 47/106 transitions.
Incomplete random walk after 1000000 steps, including 18613 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4404 resets, run finished after 1021 ms. (steps per millisecond=979 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7181003 steps, run timeout after 6001 ms. (steps per millisecond=1196 ) properties seen :{}
Probabilistic random walk after 7181003 steps, saw 974882 distinct states, run finished after 6007 ms. (steps per millisecond=1195 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 15:33:14] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 41 cols
[2022-06-02 15:33:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-02 15:33:14] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:33:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-02 15:33:14] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:33:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 15:33:14] [INFO ] After 12ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:33:14] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2022-06-02 15:33:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
[2022-06-02 15:33:14] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2022-06-02 15:33:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-06-02 15:33:14] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-06-02 15:33:14] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2022-06-02 15:33:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 225 ms
[2022-06-02 15:33:14] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-02 15:33:14] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA GPUForwardProgress-PT-08b-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 15827 ms.
BK_STOP 1654183994702
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is GPUForwardProgress-PT-08b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260576100326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-08b.tgz
mv GPUForwardProgress-PT-08b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;