fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r153-tall-171631151300176
Last Updated
July 7, 2024

About the Execution of 2023-gold for Diffusion2D-PT-D30N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
653.607 40468.00 53083.00 278.20 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151300176.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Diffusion2D-PT-D30N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151300176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 14:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.0M May 18 16:42 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 Diffusion2D-PT-D30N100-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716417983945

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N100
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 22:46:25] [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]
[2024-05-22 22:46:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:46:25] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-22 22:46:25] [INFO ] Transformed 900 places.
[2024-05-22 22:46:25] [INFO ] Transformed 6844 transitions.
[2024-05-22 22:46:25] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 6844 rows 900 cols
[2024-05-22 22:46:25] [INFO ] Computed 1 invariants in 66 ms
Incomplete random walk after 10011 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 16) seen :100
FORMULA Diffusion2D-PT-D30N100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :0
[2024-05-22 22:46:26] [INFO ] Invariant cache hit.
[2024-05-22 22:46:26] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2024-05-22 22:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:27] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2024-05-22 22:46:28] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 456 ms.
[2024-05-22 22:46:28] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:29] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2024-05-22 22:46:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 410 ms.
[2024-05-22 22:46:30] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:31] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2024-05-22 22:46:32] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 379 ms.
[2024-05-22 22:46:32] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:33] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2024-05-22 22:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:34] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2024-05-22 22:46:34] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 364 ms.
[2024-05-22 22:46:35] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:36] [INFO ] [Real]Absence check using state equation in 1079 ms returned sat
[2024-05-22 22:46:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:37] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2024-05-22 22:46:37] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 331 ms.
[2024-05-22 22:46:38] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:39] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2024-05-22 22:46:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:40] [INFO ] [Nat]Absence check using state equation in 980 ms returned sat
[2024-05-22 22:46:40] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 320 ms.
[2024-05-22 22:46:40] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:41] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2024-05-22 22:46:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 292 ms.
[2024-05-22 22:46:42] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:43] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2024-05-22 22:46:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:45] [INFO ] [Nat]Absence check using state equation in 1161 ms returned sat
[2024-05-22 22:46:45] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 317 ms.
[2024-05-22 22:46:45] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:46] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2024-05-22 22:46:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:47] [INFO ] [Nat]Absence check using state equation in 988 ms returned sat
[2024-05-22 22:46:48] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 332 ms.
[2024-05-22 22:46:48] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:49] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2024-05-22 22:46:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 317 ms.
[2024-05-22 22:46:50] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:51] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2024-05-22 22:46:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:52] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2024-05-22 22:46:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 324 ms.
[2024-05-22 22:46:53] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:54] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2024-05-22 22:46:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:55] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2024-05-22 22:46:55] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 306 ms.
[2024-05-22 22:46:55] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:56] [INFO ] [Real]Absence check using state equation in 1015 ms returned sat
[2024-05-22 22:46:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:46:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:58] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2024-05-22 22:46:58] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 296 ms.
[2024-05-22 22:46:58] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:46:59] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2024-05-22 22:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:47:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2024-05-22 22:47:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 22:47:01] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2024-05-22 22:47:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 290 ms.
[2024-05-22 22:47:01] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 22:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 22:47:02] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2024-05-22 22:47:03] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 293 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1]
Support contains 15 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6618 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 18 ms
Free SCC test removed 884 places
Drop transitions removed 6618 transitions
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 6812 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 16 transition count 29
Applied a total of 4 rules in 49 ms. Remains 16 /900 variables (removed 884) and now considering 29/6844 (removed 6815) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 16/900 places, 29/6844 transitions.
// Phase 1: matrix 29 rows 16 cols
[2024-05-22 22:47:03] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 1000067 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 15) seen :1500
FORMULA Diffusion2D-PT-D30N100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38080 ms.

BK_STOP 1716418024413

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Diffusion2D-PT-D30N100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Diffusion2D-PT-D30N100, 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 r153-tall-171631151300176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N100.tgz
mv Diffusion2D-PT-D30N100 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;