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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716306852320

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:54:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:54:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:54:14] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-21 15:54:14] [INFO ] Transformed 624 places.
[2024-05-21 15:54:14] [INFO ] Transformed 564 transitions.
[2024-05-21 15:54:14] [INFO ] Found NUPN structural information;
[2024-05-21 15:54:14] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (268 resets) in 1944 ms. (20 steps per ms) remains 7/15 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (49 resets) in 402 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 380 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (46 resets) in 524 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (42 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
// Phase 1: matrix 556 rows 616 cols
[2024-05-21 15:54:16] [INFO ] Computed 99 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 409/510 variables, 60/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 409/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 106/616 variables, 38/609 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 106/715 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 556/1172 variables, 616/1331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 1331 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2622 ms.
Refiners :[Domain max(s): 616/616 constraints, Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 616/616 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 409/510 variables, 60/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 409/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 59 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 16 places in 1415 ms of which 3 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 4 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 12 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 15 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 16 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 20/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 3 ms to minimize.
[2024-05-21 15:54:24] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:54:24] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:54:24] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
SMT process timed out in 7888ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 610 transition count 491
Reduce places removed 64 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 73 rules applied. Total rules applied 138 place count 546 transition count 482
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 147 place count 537 transition count 482
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 147 place count 537 transition count 372
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 377 place count 417 transition count 372
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 442 place count 352 transition count 307
Iterating global reduction 3 with 65 rules applied. Total rules applied 507 place count 352 transition count 307
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 507 place count 352 transition count 305
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 512 place count 349 transition count 305
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 636 place count 287 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 637 place count 287 transition count 242
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 638 place count 287 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 639 place count 286 transition count 241
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 644 place count 286 transition count 241
Applied a total of 644 rules in 173 ms. Remains 286 /616 variables (removed 330) and now considering 241/556 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 286/616 places, 241/556 transitions.
RANDOM walk for 40000 steps (774 resets) in 1196 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (180 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (185 resets) in 244 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (180 resets) in 284 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (162 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (194 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (183 resets) in 304 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (166 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 669183 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :5 out of 7
Probabilistic random walk after 669183 steps, saw 115510 distinct states, run finished after 3005 ms. (steps per millisecond=222 ) properties seen :5
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 241 rows 286 cols
[2024-05-21 15:54:28] [INFO ] Computed 83 invariants in 26 ms
[2024-05-21 15:54:28] [INFO ] State equation strengthened by 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 192/225 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/282 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 241/524 variables, 283/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/527 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/527 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 371 constraints, problems are : Problem set: 0 solved, 2 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 286/286 constraints, ReadFeed: 2/2 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 192/225 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 5 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 1 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:54:29] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 57/282 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/283 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 241/524 variables, 283/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/527 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/527 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 5 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 10 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 1 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 2 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:54:33] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/527 variables, 12/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/527 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/527 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 405 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4908 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 286/286 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 32/32 constraints]
After SMT, in 5272ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 87 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=21 )
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 26 ms.
All properties solved without resorting to model-checking.
Total runtime 19281 ms.
ITS solved all properties within timeout

BK_STOP 1716306873912

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-14"
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-14, 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-171620398500559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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