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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 24K 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 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 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 159K 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-16-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716307606500

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:06:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:06:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:06:48] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-21 16:06:48] [INFO ] Transformed 638 places.
[2024-05-21 16:06:48] [INFO ] Transformed 578 transitions.
[2024-05-21 16:06:48] [INFO ] Found NUPN structural information;
[2024-05-21 16:06:48] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
RANDOM walk for 40000 steps (263 resets) in 1484 ms. (26 steps per ms) remains 5/16 properties
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (46 resets) in 236 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (48 resets) in 532 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (45 resets) in 326 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (44 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (46 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
// Phase 1: matrix 570 rows 630 cols
[2024-05-21 16:06:49] [INFO ] Computed 100 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 402/470 variables, 46/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 402/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 51/521 variables, 16/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 51/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 108/629 variables, 37/620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 108/728 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/630 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/630 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 570/1200 variables, 630/1360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 1360 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1996 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BusinessProcesses-PT-16-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 402/470 variables, 46/114 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 402/516 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:06:51] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 28 ms to minimize.
[2024-05-21 16:06:51] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:06:51] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 4 ms to minimize.
[2024-05-21 16:06:52] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 4 ms to minimize.
[2024-05-21 16:06:52] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 4 ms to minimize.
[2024-05-21 16:06:52] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:06:52] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:06:52] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:06:52] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 4 ms to minimize.
[2024-05-21 16:06:52] [INFO ] Deduced a trap composed of 140 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 4 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 2 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 4 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/536 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 141 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 152 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 7158ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 624 transition count 494
Reduce places removed 75 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 83 rules applied. Total rules applied 159 place count 549 transition count 486
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 541 transition count 486
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 167 place count 541 transition count 370
Deduced a syphon composed of 116 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 411 place count 413 transition count 370
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 489 place count 335 transition count 292
Iterating global reduction 3 with 78 rules applied. Total rules applied 567 place count 335 transition count 292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 567 place count 335 transition count 291
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 569 place count 334 transition count 291
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 733 place count 251 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 734 place count 251 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 736 place count 250 transition count 213
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 740 place count 250 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 741 place count 249 transition count 212
Applied a total of 741 rules in 201 ms. Remains 249 /630 variables (removed 381) and now considering 212/570 (removed 358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 249/630 places, 212/570 transitions.
RANDOM walk for 40000 steps (1314 resets) in 1045 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (262 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (245 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (242 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (243 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 651901 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :2 out of 4
Probabilistic random walk after 651901 steps, saw 117189 distinct states, run finished after 3006 ms. (steps per millisecond=216 ) properties seen :2
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 212 rows 249 cols
[2024-05-21 16:07:00] [INFO ] Computed 81 invariants in 14 ms
[2024-05-21 16:07:00] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/192 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/208 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/240 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 212/452 variables, 240/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/461 variables, 9/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/461 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 336 constraints, problems are : Problem set: 0 solved, 2 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 249/249 constraints, ReadFeed: 6/6 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/192 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 5 ms to minimize.
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2024-05-21 16:07:00] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 2 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 2 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/208 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:07:01] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 32/240 variables, 22/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 212/452 variables, 240/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/461 variables, 9/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:07:02] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:07:02] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:07:02] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:07:02] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:07:02] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:07:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-16-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-21 16:07:02] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 7/366 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 0/366 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/461 variables, 0/366 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 366 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 249/249 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 28/28 constraints]
After SMT, in 3022ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 5101 steps, including 109 resets, run visited all 1 properties in 26 ms. (steps per millisecond=196 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 35 ms.
All properties solved without resorting to model-checking.
Total runtime 15265 ms.
ITS solved all properties within timeout

BK_STOP 1716307623168

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

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