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.r201-smll-167840347300125.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 ltsminxred
Input is GPUForwardProgress-PT-32b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347300125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 160K Mar 5 18:22 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-32b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678573284115

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 22:21:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 22:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 22:21:27] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-11 22:21:27] [INFO ] Transformed 644 places.
[2023-03-11 22:21:27] [INFO ] Transformed 677 transitions.
[2023-03-11 22:21:27] [INFO ] Found NUPN structural information;
[2023-03-11 22:21:27] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 677 rows 644 cols
[2023-03-11 22:21:27] [INFO ] Computed 34 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 37 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :7
FORMULA GPUForwardProgress-PT-32b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :1
FORMULA GPUForwardProgress-PT-32b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
[2023-03-11 22:21:27] [INFO ] Invariant cache hit.
[2023-03-11 22:21:28] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 41 ms returned sat
[2023-03-11 22:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:28] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-11 22:21:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:28] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 39 ms returned sat
[2023-03-11 22:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:29] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2023-03-11 22:21:29] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 77 ms.
[2023-03-11 22:21:31] [INFO ] Added : 181 causal constraints over 37 iterations in 1781 ms. Result :sat
Minimization took 117 ms.
[2023-03-11 22:21:31] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 22:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:31] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-11 22:21:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:31] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 33 ms returned sat
[2023-03-11 22:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:32] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-11 22:21:32] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 55 ms.
[2023-03-11 22:21:34] [INFO ] Added : 222 causal constraints over 45 iterations in 2073 ms. Result :sat
Minimization took 130 ms.
[2023-03-11 22:21:34] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 22:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:35] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2023-03-11 22:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:35] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 22:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:35] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-11 22:21:35] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 55 ms.
[2023-03-11 22:21:37] [INFO ] Added : 161 causal constraints over 33 iterations in 1543 ms. Result :sat
Minimization took 121 ms.
[2023-03-11 22:21:37] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 30 ms returned sat
[2023-03-11 22:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:37] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-11 22:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:38] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 22:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:38] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2023-03-11 22:21:38] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 57 ms.
[2023-03-11 22:21:39] [INFO ] Added : 144 causal constraints over 29 iterations in 1257 ms. Result :sat
Minimization took 104 ms.
[2023-03-11 22:21:40] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 22:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:40] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-11 22:21:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:40] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 22:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:40] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-11 22:21:41] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 53 ms.
[2023-03-11 22:21:42] [INFO ] Added : 150 causal constraints over 30 iterations in 1333 ms. Result :sat
Minimization took 126 ms.
[2023-03-11 22:21:42] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 22:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:42] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-11 22:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:43] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 22:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:43] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-11 22:21:43] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 50 ms.
[2023-03-11 22:21:44] [INFO ] Added : 154 causal constraints over 32 iterations in 1457 ms. Result :sat
Minimization took 136 ms.
[2023-03-11 22:21:45] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 31 ms returned sat
[2023-03-11 22:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:45] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2023-03-11 22:21:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:45] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 22:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:46] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-11 22:21:46] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 41 ms.
[2023-03-11 22:21:48] [INFO ] Added : 233 causal constraints over 48 iterations in 2218 ms. Result :sat
Minimization took 149 ms.
[2023-03-11 22:21:48] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 22:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:49] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-11 22:21:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:49] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 22:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:49] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2023-03-11 22:21:49] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 48 ms.
[2023-03-11 22:21:51] [INFO ] Added : 195 causal constraints over 39 iterations in 1873 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-32b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 677/677 transitions.
Graph (trivial) has 574 edges and 644 vertex of which 7 / 644 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 968 edges and 638 vertex of which 601 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Discarding 37 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 363 transitions
Trivial Post-agglo rules discarded 363 transitions
Performed 363 trivial Post agglomeration. Transition count delta: 363
Iterating post reduction 0 with 365 rules applied. Total rules applied 367 place count 601 transition count 301
Reduce places removed 363 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 395 rules applied. Total rules applied 762 place count 238 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 763 place count 237 transition count 269
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 763 place count 237 transition count 207
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 887 place count 175 transition count 207
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 922 place count 140 transition count 172
Iterating global reduction 3 with 35 rules applied. Total rules applied 957 place count 140 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 957 place count 140 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 961 place count 138 transition count 170
Graph (complete) has 266 edges and 138 vertex of which 47 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 3 with 31 rules applied. Total rules applied 992 place count 47 transition count 50
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1055 place count 17 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1055 place count 17 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1059 place count 15 transition count 15
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1061 place count 13 transition count 13
Iterating global reduction 5 with 2 rules applied. Total rules applied 1063 place count 13 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 1072 place count 8 transition count 9
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1074 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1075 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1076 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1076 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1080 place count 4 transition count 4
Applied a total of 1080 rules in 108 ms. Remains 4 /644 variables (removed 640) and now considering 4/677 (removed 673) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 4/644 places, 4/677 transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 22:21:52] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 2) seen :2
FORMULA GPUForwardProgress-PT-32b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 25887 ms.
ITS solved all properties within timeout

BK_STOP 1678573313946

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-32b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPUForwardProgress-PT-32b, 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 r201-smll-167840347300125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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