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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 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 146K 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-12-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225725358

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:08:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:08:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:08:46] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 07:08:46] [INFO ] Transformed 586 places.
[2024-06-01 07:08:46] [INFO ] Transformed 525 transitions.
[2024-06-01 07:08:46] [INFO ] Found NUPN structural information;
[2024-06-01 07:08:46] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
RANDOM walk for 40000 steps (289 resets) in 1294 ms. (30 steps per ms) remains 8/16 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (60 resets) in 303 ms. (131 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (57 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (53 resets) in 921 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (43 resets) in 224 ms. (177 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (36 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (53 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (64 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
// Phase 1: matrix 521 rows 582 cols
[2024-06-01 07:08:48] [INFO ] Computed 98 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 356/466 variables, 55/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 356/521 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 116/582 variables, 43/564 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 116/680 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/680 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 521/1103 variables, 582/1262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 1262 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1224 ms.
Refiners :[Domain max(s): 582/582 constraints, Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 370/460 variables, 55/145 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 370/515 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 21 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 4 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 113 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 119 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 20/535 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 119 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 125 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 122 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 124 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 126 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 122 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 122 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 121 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 3 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 120 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 6 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 123 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 125 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 121 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 20/555 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 134 places in 80 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 125 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 6410ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (complete) has 1186 edges and 582 vertex of which 578 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 578 transition count 451
Reduce places removed 69 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 77 rules applied. Total rules applied 147 place count 509 transition count 443
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 155 place count 501 transition count 443
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 155 place count 501 transition count 328
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 398 place count 373 transition count 328
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 460 place count 311 transition count 266
Iterating global reduction 3 with 62 rules applied. Total rules applied 522 place count 311 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 522 place count 311 transition count 263
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 528 place count 308 transition count 263
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 681 place count 231 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 683 place count 230 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 684 place count 230 transition count 190
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 689 place count 230 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 690 place count 229 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 691 place count 228 transition count 189
Applied a total of 691 rules in 138 ms. Remains 228 /582 variables (removed 354) and now considering 189/521 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 228/582 places, 189/521 transitions.
RANDOM walk for 40000 steps (1362 resets) in 688 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (307 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (192 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (249 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (265 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1163517 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :3 out of 4
Probabilistic random walk after 1163517 steps, saw 176559 distinct states, run finished after 3011 ms. (steps per millisecond=386 ) properties seen :3
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 189 rows 228 cols
[2024-06-01 07:08:58] [INFO ] Computed 80 invariants in 12 ms
[2024-06-01 07:08:58] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/92 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/155 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/205 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/207 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 188/395 variables, 207/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/417 variables, 21/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 9/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/417 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 228/228 constraints, ReadFeed: 5/5 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/92 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/155 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 205/417 variables, and 69 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 43/53 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/228 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 11814 ms.
ITS solved all properties within timeout

BK_STOP 1717225738464

--------------------
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 ReachabilityFireability -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-12"
export BK_EXAMINATION="ReachabilityFireability"
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-12, examination is ReachabilityFireability"
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-171620399700543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;