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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716308022852

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:13:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:13:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:13:44] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 16:13:44] [INFO ] Transformed 650 places.
[2024-05-21 16:13:44] [INFO ] Transformed 580 transitions.
[2024-05-21 16:13:44] [INFO ] Found NUPN structural information;
[2024-05-21 16:13:44] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (263 resets) in 1549 ms. (25 steps per ms) remains 7/12 properties
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 290 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (45 resets) in 622 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 588 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (43 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (59 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
// Phase 1: matrix 576 rows 646 cols
[2024-05-21 16:13:45] [INFO ] Computed 108 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 395/507 variables, 60/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 395/567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/517 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 10/579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 127/644 variables, 44/623 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 127/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/646 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem BusinessProcesses-PT-17-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 576/1222 variables, 646/1400 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1222 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1222 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 1400 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2035 ms.
Refiners :[Domain max(s): 646/646 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 646/646 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 411/505 variables, 60/154 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 411/565 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 36 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 4 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 4 ms to minimize.
[2024-05-21 16:13:48] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 4 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 4 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 4 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:13:49] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 4 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:13:50] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:13:51] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:13:51] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/585 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 16:13:51] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 4 ms to minimize.
[2024-05-21 16:13:51] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:13:51] [INFO ] Deduced a trap composed of 126 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:13:51] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:13:51] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:13:52] [INFO ] Deduced a trap composed of 148 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 7240ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 271 edges and 646 vertex of which 7 / 646 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 636 transition count 481
Reduce places removed 86 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 107 rules applied. Total rules applied 195 place count 550 transition count 460
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 216 place count 529 transition count 460
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 216 place count 529 transition count 384
Deduced a syphon composed of 76 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 377 place count 444 transition count 384
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 428 place count 393 transition count 333
Iterating global reduction 3 with 51 rules applied. Total rules applied 479 place count 393 transition count 333
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 479 place count 393 transition count 329
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 487 place count 389 transition count 329
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 647 place count 309 transition count 249
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 649 place count 309 transition count 247
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 651 place count 307 transition count 247
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 654 place count 307 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 655 place count 306 transition count 246
Applied a total of 655 rules in 150 ms. Remains 306 /646 variables (removed 340) and now considering 246/576 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 306/646 places, 246/576 transitions.
RANDOM walk for 40000 steps (355 resets) in 662 ms. (60 steps per ms) remains 3/6 properties
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (68 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (101 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (63 resets) in 174 ms. (228 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 246 rows 306 cols
[2024-05-21 16:13:53] [INFO ] Computed 96 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 154/212 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/241 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 61/302 variables, 35/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/304 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 246/550 variables, 304/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/552 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/552 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 402 constraints, problems are : Problem set: 0 solved, 2 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 306/306 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 154/212 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:13:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 4 ms to minimize.
[2024-05-21 16:13:53] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-21 16:13:53] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-21 16:13:53] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/241 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 61/302 variables, 35/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:13:54] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 9 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:13:55] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 20/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:13:56] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 3 ms to minimize.
[2024-05-21 16:13:57] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 20/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 3 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:13:58] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 7/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/304 variables, 2/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 246/550 variables, 304/458 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/552 variables, 2/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 1/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:13:59] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-17-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 552/552 variables, and 469 constraints, problems are : Problem set: 2 solved, 0 unsolved in 6238 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 66/66 constraints]
After SMT, in 6539ms 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 15885 ms.
ITS solved all properties within timeout

BK_STOP 1716308040062

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

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