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.r180-tall-171640603700573.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 itstools
Input is GPUForwardProgress-PT-28b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603700573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 22:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 22:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 22:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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 GPUForwardProgress-PT-28b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-28b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716511245198

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 00:40:46] [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-24 00:40:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:40:46] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-24 00:40:46] [INFO ] Transformed 568 places.
[2024-05-24 00:40:46] [INFO ] Transformed 597 transitions.
[2024-05-24 00:40:46] [INFO ] Found NUPN structural information;
[2024-05-24 00:40:46] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 597 rows 568 cols
[2024-05-24 00:40:46] [INFO ] Computed 30 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (41 resets) in 44 ms. (222 steps per ms)
FORMULA GPUForwardProgress-PT-28b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (33 resets) in 66 ms. (1044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-24 00:40:46] [INFO ] Invariant cache hit.
[2024-05-24 00:40:47] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-24 00:40:47] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 00:40:47] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 48 ms.
[2024-05-24 00:40:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:40:47] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-24 00:40:47] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-24 00:40:48] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 35 ms.
[2024-05-24 00:40:50] [INFO ] Added : 361 causal constraints over 73 iterations in 2681 ms. Result :sat
Minimization took 502 ms.
[2024-05-24 00:40:51] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 17 ms returned sat
[2024-05-24 00:40:51] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-24 00:40:51] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 29 ms.
[2024-05-24 00:40:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:40:51] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 20 ms returned sat
[2024-05-24 00:40:51] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-24 00:40:52] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 38 ms.
[2024-05-24 00:40:54] [INFO ] Added : 296 causal constraints over 60 iterations in 2163 ms. Result :sat
Minimization took 506 ms.
[2024-05-24 00:40:54] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-24 00:40:54] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-24 00:40:54] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 31 ms.
[2024-05-24 00:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:40:55] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 17 ms returned sat
[2024-05-24 00:40:55] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-24 00:40:55] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 29 ms.
[2024-05-24 00:40:58] [INFO ] Added : 361 causal constraints over 73 iterations in 2708 ms. Result :sat
Minimization took 502 ms.
[2024-05-24 00:40:58] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 17 ms returned sat
[2024-05-24 00:40:58] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-24 00:40:58] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-24 00:40:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:40:59] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 17 ms returned sat
[2024-05-24 00:40:59] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-24 00:40:59] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 33 ms.
[2024-05-24 00:41:00] [INFO ] Added : 146 causal constraints over 30 iterations in 1046 ms. Result :sat
Minimization took 504 ms.
[2024-05-24 00:41:01] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-24 00:41:01] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-24 00:41:01] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-24 00:41:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:41:01] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-24 00:41:01] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-24 00:41:01] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-24 00:41:04] [INFO ] Added : 371 causal constraints over 75 iterations in 2828 ms. Result :sat
Minimization took 508 ms.
[2024-05-24 00:41:05] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-24 00:41:05] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-24 00:41:05] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 37 ms.
[2024-05-24 00:41:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:41:05] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 17 ms returned sat
[2024-05-24 00:41:05] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-24 00:41:05] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 30 ms.
[2024-05-24 00:41:08] [INFO ] Added : 392 causal constraints over 79 iterations in 2774 ms. Result :sat
Minimization took 507 ms.
[2024-05-24 00:41:09] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-24 00:41:09] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-24 00:41:09] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 35 ms.
[2024-05-24 00:41:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:41:09] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-24 00:41:09] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-24 00:41:09] [INFO ] Computed and/alt/rep : 591/1073/591 causal constraints (skipped 5 transitions) in 34 ms.
[2024-05-24 00:41:10] [INFO ] Added : 146 causal constraints over 30 iterations in 1048 ms. Result :sat
Minimization took 506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 597/597 transitions.
Graph (trivial) has 498 edges and 568 vertex of which 7 / 568 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 315 rules applied. Total rules applied 316 place count 561 transition count 275
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 342 rules applied. Total rules applied 658 place count 247 transition count 247
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 661 place count 246 transition count 245
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 664 place count 244 transition count 244
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 664 place count 244 transition count 188
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 776 place count 188 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 779 place count 185 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 782 place count 185 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 782 place count 185 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 784 place count 184 transition count 184
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 948 place count 102 transition count 102
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 971 place count 102 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 973 place count 101 transition count 79
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 975 place count 101 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 977 place count 99 transition count 77
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 980 place count 99 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 983 place count 99 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 984 place count 98 transition count 73
Applied a total of 984 rules in 149 ms. Remains 98 /568 variables (removed 470) and now considering 73/597 (removed 524) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 98/568 places, 73/597 transitions.
// Phase 1: matrix 73 rows 98 cols
[2024-05-24 00:41:11] [INFO ] Computed 29 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10104 resets) in 2624 ms. (380 steps per ms)
FORMULA GPUForwardProgress-PT-28b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-28b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (802 resets) in 653 ms. (1529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 00:41:15] [INFO ] Flatten gal took : 35 ms
[2024-05-24 00:41:15] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:41:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2811896990683256640.gal : 7 ms
[2024-05-24 00:41:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8618231971789439361.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2811896990683256640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8618231971789439361.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 28712 ms.

BK_STOP 1716511275166

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="GPUForwardProgress-PT-28b"
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-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-28b, 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 r180-tall-171640603700573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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