Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200502.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is GPUForwardProgress-PT-32b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.9K Mar 7 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 7 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 11:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 11:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 160K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-00
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-01
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-02
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-03
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-04
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-05
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-06
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-07
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-08
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-09
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-11
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-12
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-13
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-14
FORMULA_NAME GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779732241375

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 18:04:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 18:04:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:04:02] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-25 18:04:02] [INFO ] Transformed 644 places.
[2026-05-25 18:04:02] [INFO ] Transformed 677 transitions.
[2026-05-25 18:04:02] [INFO ] Found NUPN structural information;
[2026-05-25 18:04:02] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (145 resets) in 1576 ms. (25 steps per ms) remains 6/12 properties
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
[2026-05-25 18:04:03] [INFO ] Flatten gal took : 201 ms
BEST_FIRST walk for 40004 steps (16 resets) in 382 ms. (104 steps per ms) remains 6/6 properties
[2026-05-25 18:04:03] [INFO ] Flatten gal took : 106 ms
[2026-05-25 18:04:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18111282217226465563.gal : 32 ms
BEST_FIRST walk for 40004 steps (16 resets) in 377 ms. (105 steps per ms) remains 6/6 properties
[2026-05-25 18:04:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7997030387915137396.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18111282217226465563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7997030387915137396.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (16 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 140 ms. (283 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11360722983525180135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7882765591603368522.kers'
Loading property file /tmp/ReachabilityCardinality7997030387915137396.prop.
[2026-05-25 18:04:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11360722983525180135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7882765591603368522.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 677 rows 643 cols 1675 entries
Finished phase 1 with 609 SingleSign rule and 1 generalized
[2026-05-25 18:04:03] [INFO ] Computed 34 invariants in 6 ms
Computed 34 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7882765591603368522.kers
Total runtime 7 ms.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 97
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :97 after 33382
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :33382 after 8.74333e+09
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :8.74333e+09 after 7.51046e+19
At refinement iteration 2 (OVERLAPS) 614/642 variables, 33/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 614/675 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/643 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 677/1320 variables, 643/1320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1321 variables, 1/1321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1321 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1321 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1321 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 1322 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1089 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 614/642 variables, 33/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 614/675 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/643 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 677/1320 variables, 643/1320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 6/1326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/1321 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1321 variables, 1/1328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1321 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1321 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 1328 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5014 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6237ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 77 ms.
Support contains 11 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 677/677 transitions.
Graph (trivial) has 560 edges and 644 vertex of which 7 / 644 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) 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.2 ms
Discarding 37 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 601 transition count 314
Reduce places removed 350 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 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 380 rules applied. Total rules applied 734 place count 251 transition count 284
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 742 place count 250 transition count 277
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 751 place count 243 transition count 275
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 751 place count 243 transition count 214
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 873 place count 182 transition count 214
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 909 place count 146 transition count 178
Iterating global reduction 4 with 36 rules applied. Total rules applied 945 place count 146 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 945 place count 146 transition count 176
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 949 place count 144 transition count 176
Graph (complete) has 272 edges and 144 vertex of which 65 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.0 ms
Discarding 79 places :
Also discarding 78 output transitions
Drop transitions (Output transitions of discarded places.) removed 78 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 13 rules applied. Total rules applied 962 place count 65 transition count 86
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 47 rules applied. Total rules applied 1009 place count 53 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1012 place count 50 transition count 51
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 1012 place count 50 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1022 place count 45 transition count 46
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1025 place count 42 transition count 43
Iterating global reduction 7 with 3 rules applied. Total rules applied 1028 place count 42 transition count 43
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 1053 place count 29 transition count 31
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1054 place count 29 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1055 place count 29 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1056 place count 29 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1057 place count 29 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1058 place count 28 transition count 27
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 3 rules applied. Total rules applied 1061 place count 27 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1063 place count 25 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1063 place count 25 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1069 place count 22 transition count 22
Applied a total of 1069 rules in 91 ms. Remains 22 /644 variables (removed 622) and now considering 22/677 (removed 655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 22/644 places, 22/677 transitions.
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 7842 ms.

BK_STOP 1779732250395

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-32b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200502"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;