Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600278.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 ErlangenMainframeV0-PT-0505, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.6K Jun 6 09:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 11:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 485K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749352672730

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0505
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 03:17:53] [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]
[2025-06-08 03:17:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:17:54] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-08 03:17:54] [INFO ] Transformed 203 places.
[2025-06-08 03:17:54] [INFO ] Transformed 949 transitions.
[2025-06-08 03:17:54] [INFO ] Found NUPN structural information;
[2025-06-08 03:17:54] [INFO ] Parsed PT model containing 203 places and 949 transitions and 10344 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2612 ms. (15 steps per ms) remains 2/12 properties
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-08 03:17:55] [INFO ] Flatten gal took : 404 ms
[2025-06-08 03:17:55] [INFO ] Flatten gal took : 140 ms
BEST_FIRST walk for 40003 steps (8 resets) in 972 ms. (41 steps per ms) remains 2/2 properties
[2025-06-08 03:17:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality677216796995887137.gal : 107 ms
[2025-06-08 03:17:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13454363159324042349.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/ReachabilityCardinality677216796995887137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13454363159324042349.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 2/2 properties

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
// Phase 1: matrix 949 rows 203 cols
[2025-06-08 03:17:55] [INFO ] Computed 16 invariants in 40 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality13454363159324042349.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 73/154 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 73/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 49/203 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 49/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 68
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :68 after 2222
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2222 after 33898
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33898 after 34000
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :34000 after 34186
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :34186 after 34825
At refinement iteration 8 (OVERLAPS) 949/1152 variables, 203/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :34825 after 104229
At refinement iteration 10 (OVERLAPS) 0/1152 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 715 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 73/154 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 73/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :104229 after 2.32235e+06
[2025-06-08 03:17:56] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:56] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.32235e+06 after 8.87911e+06
[2025-06-08 03:17:57] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:57] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:57] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:57] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:57] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:58] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:58] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:58] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/203 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 949/1152 variables, 203/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:59] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:59] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1152 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1152 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1152 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 434 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3408 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4234ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 199 ms.
Support contains 81 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 949/949 transitions.
Graph (trivial) has 73 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 201 transition count 925
Reduce places removed 20 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 34 rules applied. Total rules applied 55 place count 181 transition count 911
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 69 place count 167 transition count 911
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 69 place count 167 transition count 906
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 79 place count 162 transition count 906
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 91 place count 150 transition count 894
Iterating global reduction 3 with 12 rules applied. Total rules applied 103 place count 150 transition count 894
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 149 transition count 813
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 149 transition count 813
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 135 place count 134 transition count 798
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 141 place count 134 transition count 792
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 147 place count 128 transition count 792
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 128 transition count 792
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 128 transition count 792
Applied a total of 150 rules in 375 ms. Remains 128 /203 variables (removed 75) and now considering 792/949 (removed 157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 128/203 places, 792/949 transitions.
RANDOM walk for 40000 steps (8 resets) in 474 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 517015 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 517015 steps, saw 294256 distinct states, run finished after 3008 ms. (steps per millisecond=171 ) properties seen :0
[2025-06-08 03:18:03] [INFO ] Flow matrix only has 546 transitions (discarded 246 similar events)
// Phase 1: matrix 546 rows 128 cols
[2025-06-08 03:18:03] [INFO ] Computed 16 invariants in 10 ms
[2025-06-08 03:18:03] [INFO ] State equation strengthened by 252 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/113 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/128 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 546/674 variables, 128/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 252/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/674 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 396 constraints, problems are : Problem set: 0 solved, 2 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 128/128 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/113 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:04] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:04] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:04] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 15/128 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:04] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:05] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 546/674 variables, 128/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 252/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/674 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 401 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 128/128 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2359ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 5212 steps, including 123 resets, run visited all 2 properties in 57 ms. (steps per millisecond=91 )
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0505-ReachabilityCardinality-2025-07 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 61 ms.
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 12106 ms.

BK_STOP 1749352686137

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

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