Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339400189.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CopsAndRobbers-PT-CRL023X004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339400189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 11K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 11:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 11:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 6 08:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 126K Jun 5 20:08 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

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

=== Now, execution of the tool begins

BK_START 1749339314143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL023X004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-07 23:35:15] [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]
[2025-06-07 23:35:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 23:35:15] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2025-06-07 23:35:15] [INFO ] Transformed 125 places.
[2025-06-07 23:35:15] [INFO ] Transformed 165 transitions.
[2025-06-07 23:35:15] [INFO ] Parsed PT model containing 125 places and 165 transitions and 768 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 165 rows 125 cols
[2025-06-07 23:35:15] [INFO ] Computed 27 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0] Max Struct:[4, 4, 1, 1, 1, 4, 1, 1, 1, 1, 4, 4, 1, 4, 1, 1]
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 27 ms. (357 steps per ms)
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (12 resets) in 72 ms. (547 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[4, 4, 4, 4]
[2025-06-07 23:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:15] [INFO ] [Real]Absence check using 26 positive place invariants in 17 ms returned sat
[2025-06-07 23:35:15] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 23:35:15] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-07 23:35:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-07 23:35:16] [INFO ] [Real]Added 46 Read/Feed constraints in 8 ms returned sat
[2025-06-07 23:35:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:16] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Nat]Added 46 Read/Feed constraints in 4 ms returned sat
[2025-06-07 23:35:16] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 16 ms.
[2025-06-07 23:35:16] [INFO ] Added : 31 causal constraints over 7 iterations in 304 ms. Result :sat
Minimization took 215 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:16] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Real]Added 46 Read/Feed constraints in 7 ms returned sat
[2025-06-07 23:35:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:16] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-07 23:35:16] [INFO ] [Nat]Added 46 Read/Feed constraints in 7 ms returned sat
[2025-06-07 23:35:16] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 12 ms.
[2025-06-07 23:35:17] [INFO ] Added : 31 causal constraints over 7 iterations in 373 ms. Result :sat
Minimization took 106 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:17] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Real]Added 46 Read/Feed constraints in 8 ms returned sat
[2025-06-07 23:35:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2025-06-07 23:35:17] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 9 ms.
[2025-06-07 23:35:17] [INFO ] Added : 6 causal constraints over 2 iterations in 53 ms. Result :sat
Minimization took 104 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:17] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Real]Added 46 Read/Feed constraints in 6 ms returned sat
[2025-06-07 23:35:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 23:35:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-07 23:35:17] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2025-06-07 23:35:17] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 9 ms.
[2025-06-07 23:35:18] [INFO ] Added : 31 causal constraints over 7 iterations in 357 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[4, 4, 4, 4]
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[4]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 165/165 transitions.
Graph (complete) has 562 edges and 125 vertex of which 103 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 103 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 102 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 101 transition count 163
Applied a total of 5 rules in 37 ms. Remains 101 /125 variables (removed 24) and now considering 163/165 (removed 2) transitions.
Running 117 sub problems to find dead transitions.
// Phase 1: matrix 163 rows 101 cols
[2025-06-07 23:35:18] [INFO ] Computed 26 invariants in 3 ms
[2025-06-07 23:35:18] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 163/263 variables, 100/126 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:24] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/264 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/264 variables, and 174 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 2/100 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 163/263 variables, 100/127 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 113/286 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/264 variables, and 286 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/101 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 113/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40142ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 40148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40199 ms. Remains : 101/125 places, 163/165 transitions.
[2025-06-07 23:35:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[4]
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 927 ms. (1077 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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 )
[2025-06-07 23:35:59] [INFO ] Flatten gal took : 45 ms
[2025-06-07 23:35:59] [INFO ] Flatten gal took : 14 ms
[2025-06-07 23:35:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9174152511083820583.gal : 8 ms
[2025-06-07 23:35:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3347221944222158784.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9174152511083820583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3347221944222158784.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 44650 ms.

BK_STOP 1749339360038

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CopsAndRobbers-PT-CRL023X004"
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-5832"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-CRL023X004, 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 r254-tall-174931339400189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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