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.r472-tajo-171620399700518.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 ltsminxred
Input is BusinessProcesses-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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 104K 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-09-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225492739

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:04:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:04:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:04:54] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-01 07:04:54] [INFO ] Transformed 403 places.
[2024-06-01 07:04:54] [INFO ] Transformed 374 transitions.
[2024-06-01 07:04:54] [INFO ] Found NUPN structural information;
[2024-06-01 07:04:54] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (422 resets) in 1508 ms. (26 steps per ms) remains 3/11 properties
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (76 resets) in 554 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (74 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (94 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
// Phase 1: matrix 374 rows 403 cols
[2024-06-01 07:04:55] [INFO ] Computed 65 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 267/311 variables, 36/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 267/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 92/403 variables, 29/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 92/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 374/777 variables, 403/871 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/777 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/777 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 871 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1104 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-09-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 267/311 variables, 36/80 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 267/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 39 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/367 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 105 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 5 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 103 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 4 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 6302ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 208 edges and 403 vertex of which 4 / 403 are part of one of the 1 SCC in 2 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 841 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 398 transition count 291
Reduce places removed 78 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 84 rules applied. Total rules applied 164 place count 320 transition count 285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 170 place count 314 transition count 285
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 170 place count 314 transition count 231
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 286 place count 252 transition count 231
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 325 place count 213 transition count 192
Iterating global reduction 3 with 39 rules applied. Total rules applied 364 place count 213 transition count 192
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 364 place count 213 transition count 188
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 372 place count 209 transition count 188
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 484 place count 152 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 486 place count 151 transition count 136
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 489 place count 151 transition count 133
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 492 place count 148 transition count 133
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 496 place count 148 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 497 place count 147 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 498 place count 146 transition count 132
Applied a total of 498 rules in 226 ms. Remains 146 /403 variables (removed 257) and now considering 132/374 (removed 242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 146/403 places, 132/374 transitions.
RANDOM walk for 40000 steps (12 resets) in 255 ms. (156 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (10 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
// Phase 1: matrix 132 rows 146 cols
[2024-06-01 07:05:02] [INFO ] Computed 53 invariants in 5 ms
[2024-06-01 07:05:02] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/96 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/100 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/136 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 130/267 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/278 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/278 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/96 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/100 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/136 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/137 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 130/267 variables, 137/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/278 variables, 9/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/278 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2743 steps, including 150 resets, run visited all 1 properties in 8 ms. (steps per millisecond=342 )
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 23 ms.
All properties solved without resorting to model-checking.
Total runtime 8908 ms.
ITS solved all properties within timeout

BK_STOP 1717225503621

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-09, 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 r472-tajo-171620399700518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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