Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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.7K 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 157K 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-15-ReachabilityCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748597150141

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 09:25:52] [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 09:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 09:25:53] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2025-05-30 09:25:53] [INFO ] Transformed 630 places.
[2025-05-30 09:25:53] [INFO ] Transformed 566 transitions.
[2025-05-30 09:25:53] [INFO ] Found NUPN structural information;
[2025-05-30 09:25:53] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 33 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (271 resets) in 2691 ms. (14 steps per ms) remains 5/12 properties
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 771 ms. (51 steps per ms) remains 5/5 properties
[2025-05-30 09:25:54] [INFO ] Flatten gal took : 352 ms
[2025-05-30 09:25:55] [INFO ] Flatten gal took : 260 ms
BEST_FIRST walk for 40001 steps (58 resets) in 996 ms. (40 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (57 resets) in 532 ms. (75 steps per ms) remains 5/5 properties
[2025-05-30 09:25:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7952341847544730343.gal : 125 ms
[2025-05-30 09:25:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality820416164476769561.prop : 6 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/ReachabilityCardinality7952341847544730343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality820416164476769561.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (48 resets) in 286 ms. (139 steps per ms) remains 5/5 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 ...327
BEST_FIRST walk for 40004 steps (46 resets) in 291 ms. (137 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality820416164476769561.prop.
// Phase 1: matrix 562 rows 626 cols
[2025-05-30 09:25:55] [INFO ] Computed 102 invariants in 55 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 30
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :30 after 65
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :65 after 113
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :113 after 8179
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BusinessProcesses-PT-15-ReachabilityCardinality-2025-03 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-15-ReachabilityCardinality-2025-05 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 408/474 variables, 53/119 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 408/527 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/527 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/504 variables, 8/535 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 30/565 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/565 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 120/624 variables, 39/604 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 120/724 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/624 variables, 0/724 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/626 variables, 2/726 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 2/728 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 0/728 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 562/1188 variables, 626/1354 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1188 variables, 0/1354 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1188 variables, 0/1354 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 1354 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2877 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 381/420 variables, 42/81 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 381/462 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:59] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:59] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:59] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:59] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:00] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:00] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:00] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:00] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:00] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:00] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:01] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:01] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:01] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:01] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:01] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:02] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:02] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:02] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:03] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:03] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 41 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 20/482 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1188 variables, and 482 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5008 ms.
Refiners :[Domain max(s): 420/626 constraints, Positive P Invariants (semi-flows): 42/61 constraints, Generalized P Invariants (flows): 0/41 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8087ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 314 edges and 626 vertex of which 4 / 626 are part of one of the 1 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1271 edges and 623 vertex of which 619 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 619 transition count 444
Reduce places removed 113 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 119 rules applied. Total rules applied 234 place count 506 transition count 438
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 240 place count 500 transition count 438
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 240 place count 500 transition count 339
Deduced a syphon composed of 99 places in 7 ms
Ensure Unique test removed 14 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 452 place count 387 transition count 339
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 522 place count 317 transition count 269
Iterating global reduction 3 with 70 rules applied. Total rules applied 592 place count 317 transition count 269
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 592 place count 317 transition count 266
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 598 place count 314 transition count 266
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 772 place count 226 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 774 place count 225 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 775 place count 225 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 776 place count 224 transition count 182
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 777 place count 224 transition count 182
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 782 place count 224 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 783 place count 223 transition count 181
Applied a total of 783 rules in 340 ms. Remains 223 /626 variables (removed 403) and now considering 181/562 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 223/626 places, 181/562 transitions.
RANDOM walk for 40000 steps (1153 resets) in 821 ms. (48 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (260 resets) in 389 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (289 resets) in 425 ms. (93 steps per ms) remains 2/2 properties
// Phase 1: matrix 181 rows 223 cols
[2025-05-30 09:26:04] [INFO ] Computed 83 invariants in 9 ms
[2025-05-30 09:26:04] [INFO ] State equation strengthened by 3 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/106 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/168 variables, 32/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/211 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/213 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 180/393 variables, 213/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/403 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/404 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/404 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 223/223 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/106 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 62/168 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-15-ReachabilityCardinality-2025-12 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 43/211 variables, 22/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:05] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:06] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:06] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:06] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 8/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/213 variables, 2/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 180/393 variables, 213/303 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 3/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/393 variables, 1/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/393 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/403 variables, 9/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 4/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/404 variables, 1/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:06] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:06] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 10 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 2/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/404 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 324 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 223/223 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2608ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2025-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 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 14260 ms.

BK_STOP 1748597167140

--------------------
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-15"
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-15, 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-174853813300118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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