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-171620398500550.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-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716306333171

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-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:45:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:45:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:45:34] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-21 15:45:34] [INFO ] Transformed 593 places.
[2024-05-21 15:45:34] [INFO ] Transformed 536 transitions.
[2024-05-21 15:45:34] [INFO ] Found NUPN structural information;
[2024-05-21 15:45:34] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 19 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (283 resets) in 2665 ms. (15 steps per ms) remains 7/14 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (42 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (48 resets) in 193 ms. (206 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (51 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 328 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
// Phase 1: matrix 528 rows 585 cols
[2024-05-21 15:45:36] [INFO ] Computed 95 invariants in 54 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 367/426 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 367/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 46/472 variables, 10/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 46/529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 111/583 variables, 36/565 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 111/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/585 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/585 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 528/1113 variables, 585/1265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:45:37] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 30 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 15 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 4 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1113 variables, 19/1284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1113 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1113 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 1284 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4514 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 367/426 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 367/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 6 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 119 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 140 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 121 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 117 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:45:45] [INFO ] Deduced a trap composed of 112 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:45:46] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 3 ms to minimize.
SMT process timed out in 9658ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 280 edges and 585 vertex of which 4 / 585 are part of one of the 1 SCC in 3 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 1193 edges and 582 vertex of which 577 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 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 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 102 place count 577 transition count 423
Reduce places removed 100 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 113 rules applied. Total rules applied 215 place count 477 transition count 410
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 228 place count 464 transition count 410
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 228 place count 464 transition count 338
Deduced a syphon composed of 72 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 379 place count 385 transition count 338
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 445 place count 319 transition count 272
Iterating global reduction 3 with 66 rules applied. Total rules applied 511 place count 319 transition count 272
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 511 place count 319 transition count 267
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 522 place count 313 transition count 267
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 670 place count 238 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 672 place count 237 transition count 198
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 674 place count 237 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 676 place count 235 transition count 196
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 678 place count 235 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 679 place count 234 transition count 195
Applied a total of 679 rules in 141 ms. Remains 234 /585 variables (removed 351) and now considering 195/528 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 234/585 places, 195/528 transitions.
RANDOM walk for 40000 steps (1075 resets) in 1364 ms. (29 steps per ms) remains 3/6 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (216 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (222 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (209 resets) in 170 ms. (233 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 195 rows 234 cols
[2024-05-21 15:45:46] [INFO ] Computed 81 invariants in 4 ms
[2024-05-21 15:45:46] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/175 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/225 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/227 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 192/419 variables, 227/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 9/428 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/429 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/429 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 234/234 constraints, ReadFeed: 5/5 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/175 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 50/225 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/227 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/419 variables, 227/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:45:48] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:45:48] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-13-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-13-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 428/429 variables, and 332 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 53/54 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 233/234 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1410ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 13712 ms.
ITS solved all properties within timeout

BK_STOP 1716306348302

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

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