Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398400534.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716305628369

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:33:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:33:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:33:49] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 15:33:49] [INFO ] Transformed 567 places.
[2024-05-21 15:33:49] [INFO ] Transformed 508 transitions.
[2024-05-21 15:33:49] [INFO ] Found NUPN structural information;
[2024-05-21 15:33:49] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
RANDOM walk for 40000 steps (303 resets) in 1737 ms. (23 steps per ms) remains 6/16 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (53 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (62 resets) in 700 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (59 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (64 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
// Phase 1: matrix 501 rows 560 cols
[2024-05-21 15:33:51] [INFO ] Computed 95 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 330/395 variables, 43/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 330/438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/439 variables, 10/448 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 44/492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 119/558 variables, 40/532 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 119/651 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/560 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 501/1061 variables, 560/1215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 1215 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1173 ms.
Refiners :[Domain max(s): 560/560 constraints, Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 330/395 variables, 43/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 330/438 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 23 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 5 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 124 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 125 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 4 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:33:53] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 4 ms to minimize.
[2024-05-21 15:33:54] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 20/458 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 127 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 124 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 137 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:33:55] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 136 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 138 places in 121 ms of which 4 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:33:56] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 6 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 122 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:33:57] [INFO ] Deduced a trap composed of 118 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 6299ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 269 edges and 560 vertex of which 4 / 560 are part of one of the 1 SCC in 4 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 1136 edges and 557 vertex of which 552 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 552 transition count 403
Reduce places removed 93 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 104 rules applied. Total rules applied 199 place count 459 transition count 392
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 210 place count 448 transition count 392
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 210 place count 448 transition count 315
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 373 place count 362 transition count 315
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 427 place count 308 transition count 261
Iterating global reduction 3 with 54 rules applied. Total rules applied 481 place count 308 transition count 261
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 481 place count 308 transition count 257
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 489 place count 304 transition count 257
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 159 rules applied. Total rules applied 648 place count 223 transition count 179
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 650 place count 222 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 222 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 221 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 653 place count 221 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 220 transition count 181
Applied a total of 654 rules in 180 ms. Remains 220 /560 variables (removed 340) and now considering 181/501 (removed 320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 220/560 places, 181/501 transitions.
RANDOM walk for 40000 steps (1414 resets) in 467 ms. (85 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (333 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (309 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (283 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (373 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
// Phase 1: matrix 181 rows 220 cols
[2024-05-21 15:33:58] [INFO ] Computed 79 invariants in 6 ms
[2024-05-21 15:33:58] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/143 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 54/197 variables, 30/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/199 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 178/377 variables, 199/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 20/397 variables, 18/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 7/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/399 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/399 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/401 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/401 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 303 constraints, problems are : Problem set: 0 solved, 4 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 220/220 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:33:58] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:33:58] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:33:58] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:33:58] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:33:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:33:58] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 11/143 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 54/197 variables, 30/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/199 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 10 ms to minimize.
[2024-05-21 15:33:59] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 178/377 variables, 199/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:34:00] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:34:01] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:34:01] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:34:01] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:34:01] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:34:01] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:34:01] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/377 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/377 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 20/397 variables, 18/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/397 variables, 7/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/397 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/397 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/399 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/399 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/401 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:34:01] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:34:02] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:34:02] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/401 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/401 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/401 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 343 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3961 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 220/220 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 36/36 constraints]
After SMT, in 4352ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 674 ms.
Support contains 25 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 181/181 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 220 transition count 177
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 216 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 216 transition count 167
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 34 place count 200 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 198 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 198 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 198 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 197 transition count 164
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 194 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 194 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 193 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 193 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 192 transition count 159
Applied a total of 50 rules in 52 ms. Remains 192 /220 variables (removed 28) and now considering 159/181 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 192/220 places, 159/181 transitions.
RANDOM walk for 40000 steps (1809 resets) in 298 ms. (133 steps per ms) remains 2/4 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (499 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (409 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
// Phase 1: matrix 159 rows 192 cols
[2024-05-21 15:34:03] [INFO ] Computed 73 invariants in 3 ms
[2024-05-21 15:34:03] [INFO ] State equation strengthened by 4 read => feed constraints.
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) 73/93 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/122 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/166 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/171 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 158/329 variables, 171/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 21/350 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/351 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/351 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 73/93 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:34:03] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:34:03] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:34:03] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/122 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:34:03] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 44/166 variables, 24/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:34:03] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/171 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 158/329 variables, 171/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/329 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 21/350 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/350 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:34:04] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/350 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/351 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:34:05] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/351 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/351 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/351 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 1811ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 20 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 159/159 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 190 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 188 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 187 transition count 154
Applied a total of 9 rules in 32 ms. Remains 187 /192 variables (removed 5) and now considering 154/159 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 187/192 places, 154/159 transitions.
RANDOM walk for 40000 steps (1925 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (520 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (463 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 29183 steps, run visited all 2 properties in 123 ms. (steps per millisecond=237 )
Probabilistic random walk after 29183 steps, saw 6877 distinct states, run finished after 128 ms. (steps per millisecond=227 ) properties seen :2
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 15999 ms.
ITS solved all properties within timeout

BK_STOP 1716305645809

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-11, 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 r047-tajo-171620398400534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;