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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 24K 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 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 85K 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-05-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225135488

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:58:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:58:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:58:57] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-01 06:58:57] [INFO ] Transformed 368 places.
[2024-06-01 06:58:57] [INFO ] Transformed 319 transitions.
[2024-06-01 06:58:57] [INFO ] Found NUPN structural information;
[2024-06-01 06:58:57] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (371 resets) in 2757 ms. (14 steps per ms) remains 8/16 properties
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (59 resets) in 542 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (90 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (64 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (83 resets) in 1317 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (67 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (73 resets) in 221 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (75 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
// Phase 1: matrix 318 rows 367 cols
[2024-06-01 06:58:59] [INFO ] Computed 57 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 234/336 variables, 41/143 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 234/377 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 1/378 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 31/367 variables, 15/393 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 31/424 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/424 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 318/685 variables, 367/791 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/685 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/685 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 791 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1922 ms.
Refiners :[Domain max(s): 367/367 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 241/333 variables, 41/133 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 241/374 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 61 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 21 places in 828 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 3 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 20/394 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 3 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 3 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 3 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 3 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 3 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 5 ms to minimize.
SMT process timed out in 7086ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 142 edges and 367 vertex of which 4 / 367 are part of one of the 1 SCC in 8 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 706 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 361 transition count 271
Reduce places removed 41 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 54 rules applied. Total rules applied 98 place count 320 transition count 258
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 111 place count 307 transition count 258
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 111 place count 307 transition count 223
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 187 place count 266 transition count 223
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 216 place count 237 transition count 194
Iterating global reduction 3 with 29 rules applied. Total rules applied 245 place count 237 transition count 194
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 321 place count 199 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 322 place count 199 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 198 transition count 155
Applied a total of 323 rules in 106 ms. Remains 198 /367 variables (removed 169) and now considering 155/318 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 198/367 places, 155/318 transitions.
RANDOM walk for 40000 steps (8 resets) in 737 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/5 properties
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
// Phase 1: matrix 155 rows 198 cols
[2024-06-01 06:59:07] [INFO ] Computed 50 invariants in 6 ms
[2024-06-01 06:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 148/181 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/197 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 155/352 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 249 constraints, problems are : Problem set: 0 solved, 3 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 148/181 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 9 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 16/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 4/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/197 variables, 10/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/352 variables, 197/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 1/350 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/350 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 1/353 variables, 1/351 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 1/352 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/353 variables, 0/352 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/353 variables, 0/352 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 352 constraints, problems are : Problem set: 2 solved, 1 unsolved in 5840 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 101/101 constraints]
After SMT, in 6053ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
All properties solved without resorting to model-checking.
Total runtime 16175 ms.
ITS solved all properties within timeout

BK_STOP 1717225153674

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

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