Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300094.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 BusinessProcesses-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 146K May 29 14:32 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 BusinessProcesses-PT-12-ReachabilityCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748583011786

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 05:30:14] [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-05-30 05:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 05:30:14] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2025-05-30 05:30:14] [INFO ] Transformed 586 places.
[2025-05-30 05:30:14] [INFO ] Transformed 525 transitions.
[2025-05-30 05:30:14] [INFO ] Found NUPN structural information;
[2025-05-30 05:30:14] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 24 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (294 resets) in 2333 ms. (17 steps per ms) remains 4/11 properties
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 05:30:15] [INFO ] Flatten gal took : 297 ms
BEST_FIRST walk for 40004 steps (50 resets) in 538 ms. (74 steps per ms) remains 4/4 properties
[2025-05-30 05:30:16] [INFO ] Flatten gal took : 159 ms
BEST_FIRST walk for 40003 steps (53 resets) in 330 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (38 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
[2025-05-30 05:30:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2466909568536208268.gal : 116 ms
BEST_FIRST walk for 40004 steps (49 resets) in 341 ms. (116 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-30 05:30:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4007129143990831397.prop : 3 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/ReachabilityCardinality2466909568536208268.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4007129143990831397.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 521 rows 582 cols
[2025-05-30 05:30:16] [INFO ] Computed 98 invariants in 52 ms
Loading property file /tmp/ReachabilityCardinality4007129143990831397.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 8
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :61 after 201
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :201 after 336
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :336 after 381
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :381 after 3788
Problem BusinessProcesses-PT-12-ReachabilityCardinality-2025-13 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 304/344 variables, 32/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3788 after 39961
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 304/376 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.8345e+06 after 4.54137e+06
At refinement iteration 5 (OVERLAPS) 112/456 variables, 23/399 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 112/511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 124/580 variables, 41/552 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 124/676 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/676 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/582 variables, 2/678 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 2/680 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 0/680 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.54137e+06 after 6.26726e+07
At refinement iteration 14 (OVERLAPS) 521/1103 variables, 582/1262 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 1262 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1967 ms.
Refiners :[Domain max(s): 582/582 constraints, Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 296/318 variables, 28/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 296/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:19] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:19] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:19] [INFO ] Deduced a trap composed of 140 places in 198 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:19] [INFO ] Deduced a trap composed of 140 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:19] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:20] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:20] [INFO ] Deduced a trap composed of 144 places in 292 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:20] [INFO ] Deduced a trap composed of 144 places in 261 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :6.26726e+07 after 4.23526e+10
[2025-05-30 05:30:20] [INFO ] Deduced a trap composed of 144 places in 234 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:21] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:21] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:21] [INFO ] Deduced a trap composed of 144 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:21] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:22] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:22] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:22] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:22] [INFO ] Deduced a trap composed of 141 places in 185 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:22] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:23] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:23] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 20/366 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:23] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:23] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 31 ms to minimize.
SMT process timed out in 7265ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 307 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 572 transition count 401
Reduce places removed 111 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 114 rules applied. Total rules applied 227 place count 461 transition count 398
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 230 place count 458 transition count 398
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 230 place count 458 transition count 309
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 423 place count 354 transition count 309
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 490 place count 287 transition count 242
Iterating global reduction 3 with 67 rules applied. Total rules applied 557 place count 287 transition count 242
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 557 place count 287 transition count 236
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 570 place count 280 transition count 236
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 165 rules applied. Total rules applied 735 place count 197 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 737 place count 196 transition count 158
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 739 place count 196 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 741 place count 194 transition count 156
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 742 place count 194 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 743 place count 193 transition count 155
Applied a total of 743 rules in 300 ms. Remains 193 /582 variables (removed 389) and now considering 155/521 (removed 366) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 193/582 places, 155/521 transitions.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :4.23526e+10 after 6.36148e+10
RANDOM walk for 40000 steps (897 resets) in 828 ms. (48 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (375 resets) in 481 ms. (82 steps per ms) remains 1/1 properties
// Phase 1: matrix 155 rows 193 cols
[2025-05-30 05:30:24] [INFO ] Computed 78 invariants in 5 ms
[2025-05-30 05:30:24] [INFO ] State equation strengthened by 5 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/71 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/76 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/133 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/139 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/142 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 146/288 variables, 142/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 51/339 variables, 45/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 21/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/339 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/341 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/341 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/347 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/347 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/348 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/348 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/348 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/348 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 193/193 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/71 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/76 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/133 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/139 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/142 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 146/288 variables, 142/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:24] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:25] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:25] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/288 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 51/339 variables, 45/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 21/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/339 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/339 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/339 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/341 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/341 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem BusinessProcesses-PT-12-ReachabilityCardinality-2025-08 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 347/348 variables, and 278 constraints, problems are : Problem set: 1 solved, 0 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 50/51 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 192/193 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 11282 ms.

BK_STOP 1748583025546

--------------------
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="BusinessProcesses-PT-12"
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 BusinessProcesses-PT-12, 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 r030-smll-174853813300094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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