About the Execution of ITS-Tools for NeighborGrid-PT-d4n3m2c23
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r261-smll-167863535900101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is NeighborGrid-PT-d4n3m2c23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863535900101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 8.3K Feb 26 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 26 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 469K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678731456430
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d4n3m2c23
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-13 18:17:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 18:17:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:17:39] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-13 18:17:39] [INFO ] Transformed 81 places.
[2023-03-13 18:17:39] [INFO ] Transformed 1632 transitions.
[2023-03-13 18:17:39] [INFO ] Parsed PT model containing 81 places and 1632 transitions and 3264 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 1632 rows 81 cols
[2023-03-13 18:17:40] [INFO ] Computed 1 place invariants in 54 ms
Incomplete random walk after 10013 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 16) seen :796
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :35
[2023-03-13 18:17:40] [INFO ] Invariant cache hit.
[2023-03-13 18:17:40] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-13 18:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:41] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-13 18:17:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 130 ms.
[2023-03-13 18:17:41] [INFO ] Added : 0 causal constraints over 0 iterations in 305 ms. Result :sat
Minimization took 207 ms.
[2023-03-13 18:17:42] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:42] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-13 18:17:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 143 ms.
[2023-03-13 18:17:43] [INFO ] Added : 0 causal constraints over 0 iterations in 322 ms. Result :sat
Minimization took 115 ms.
[2023-03-13 18:17:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:43] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2023-03-13 18:17:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 18:17:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:44] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-13 18:17:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 146 ms.
[2023-03-13 18:17:44] [INFO ] Added : 0 causal constraints over 0 iterations in 314 ms. Result :sat
Minimization took 95 ms.
[2023-03-13 18:17:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:45] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-13 18:17:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 123 ms.
[2023-03-13 18:17:45] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 192 ms.
[2023-03-13 18:17:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:46] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-13 18:17:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-13 18:17:46] [INFO ] Added : 0 causal constraints over 0 iterations in 259 ms. Result :sat
Minimization took 192 ms.
[2023-03-13 18:17:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:47] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-13 18:17:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 18:17:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:48] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-13 18:17:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 117 ms.
[2023-03-13 18:17:48] [INFO ] Added : 0 causal constraints over 0 iterations in 255 ms. Result :sat
Minimization took 146 ms.
[2023-03-13 18:17:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:49] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-13 18:17:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 142 ms.
[2023-03-13 18:17:49] [INFO ] Added : 0 causal constraints over 0 iterations in 294 ms. Result :sat
Minimization took 178 ms.
[2023-03-13 18:17:49] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:50] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-13 18:17:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 117 ms.
[2023-03-13 18:17:50] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 181 ms.
[2023-03-13 18:17:50] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:51] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-13 18:17:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 94 ms.
[2023-03-13 18:17:51] [INFO ] Added : 0 causal constraints over 0 iterations in 202 ms. Result :sat
Minimization took 116 ms.
[2023-03-13 18:17:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:52] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-13 18:17:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-13 18:17:52] [INFO ] Added : 0 causal constraints over 0 iterations in 255 ms. Result :sat
Minimization took 115 ms.
[2023-03-13 18:17:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:53] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2023-03-13 18:17:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-13 18:17:53] [INFO ] Added : 0 causal constraints over 0 iterations in 256 ms. Result :sat
Minimization took 174 ms.
[2023-03-13 18:17:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:54] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-13 18:17:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-13 18:17:54] [INFO ] Added : 0 causal constraints over 0 iterations in 252 ms. Result :sat
Minimization took 186 ms.
[2023-03-13 18:17:54] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:55] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-13 18:17:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 91 ms.
[2023-03-13 18:17:55] [INFO ] Added : 0 causal constraints over 0 iterations in 197 ms. Result :sat
Minimization took 110 ms.
[2023-03-13 18:17:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:56] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-13 18:17:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 18:17:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-13 18:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:56] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2023-03-13 18:17:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 109 ms.
[2023-03-13 18:17:56] [INFO ] Added : 0 causal constraints over 0 iterations in 245 ms. Result :sat
Minimization took 147 ms.
[2023-03-13 18:17:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:57] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-13 18:17:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 95 ms.
[2023-03-13 18:17:57] [INFO ] Added : 0 causal constraints over 0 iterations in 200 ms. Result :sat
Minimization took 112 ms.
[2023-03-13 18:17:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 18:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:17:58] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-13 18:17:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 110 ms.
[2023-03-13 18:17:58] [INFO ] Added : 0 causal constraints over 0 iterations in 238 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : [162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162] Max seen :[20, 67, 25, 85, 84, 67, 16, 22, 84, 18, 61, 62, 16, 63, 62, 44]
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-15 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-14 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-13 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-12 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-11 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-10 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-09 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-08 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-07 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-06 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-05 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-04 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-03 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-02 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-01 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-00 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 28526 ms.
BK_STOP 1678731488838
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="UpperBounds"
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-5348"
echo " Executing tool itstools"
echo " Input is NeighborGrid-PT-d4n3m2c23, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863535900101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;