Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398300487.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300487
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716303622555

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:00:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:00:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:00:24] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-21 15:00:24] [INFO ] Transformed 368 places.
[2024-05-21 15:00:24] [INFO ] Transformed 319 transitions.
[2024-05-21 15:00:24] [INFO ] Found NUPN structural information;
[2024-05-21 15:00:24] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (379 resets) in 1152 ms. (34 steps per ms) remains 9/16 properties
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (66 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (75 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (65 resets) in 498 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (63 resets) in 132 ms. (300 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (79 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (68 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (66 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (67 resets) in 741 ms. (53 steps per ms) remains 8/8 properties
// Phase 1: matrix 318 rows 367 cols
[2024-05-21 15:00:25] [INFO ] Computed 57 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 182/338 variables, 39/195 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 182/377 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 2/379 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/345 variables, 2/381 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 7/388 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 22/367 variables, 14/402 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 22/424 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/424 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 318/685 variables, 367/791 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 0/791 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/685 variables, 0/791 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 791 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1107 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: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 231/319 variables, 37/125 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 231/356 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 16 ms to minimize.
[2024-05-21 15:00:26] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 28 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 3 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:00:27] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/376 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:00:28] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 4 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:00:29] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/396 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:00:30] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 4 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/416 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:00:31] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 3 ms to minimize.
SMT process timed out in 6316ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (complete) has 710 edges and 367 vertex of which 364 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 364 transition count 276
Reduce places removed 40 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 51 rules applied. Total rules applied 93 place count 324 transition count 265
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 104 place count 313 transition count 265
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 104 place count 313 transition count 218
Deduced a syphon composed of 47 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 206 place count 258 transition count 218
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 243 place count 221 transition count 181
Iterating global reduction 3 with 37 rules applied. Total rules applied 280 place count 221 transition count 181
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 390 place count 166 transition count 126
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 166 transition count 126
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 392 place count 166 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 393 place count 165 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 394 place count 164 transition count 124
Applied a total of 394 rules in 128 ms. Remains 164 /367 variables (removed 203) and now considering 124/318 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 164/367 places, 124/318 transitions.
RANDOM walk for 40000 steps (8 resets) in 564 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1306698 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :1 out of 3
Probabilistic random walk after 1306698 steps, saw 174156 distinct states, run finished after 3004 ms. (steps per millisecond=434 ) properties seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 124 rows 164 cols
[2024-05-21 15:00:35] [INFO ] Computed 47 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/142 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/149 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/163 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/287 variables, 163/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/288 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/288 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/142 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:00:35] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 2 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:36] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/149 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/163 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:00:37] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:00:38] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:00:38] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 124/287 variables, 163/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/288 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:00:38] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:00:38] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:00:38] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:00:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 288/288 variables, and 279 constraints, problems are : Problem set: 2 solved, 0 unsolved in 2945 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 66/66 constraints]
After SMT, in 3218ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 14581 ms.
ITS solved all properties within timeout

BK_STOP 1716303638508

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-05, 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 r047-tajo-171620398300487"
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 [ "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 ;