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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716308510385

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:21:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:21:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:21:51] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-21 16:21:51] [INFO ] Transformed 717 places.
[2024-05-21 16:21:51] [INFO ] Transformed 642 transitions.
[2024-05-21 16:21:51] [INFO ] Found NUPN structural information;
[2024-05-21 16:21:51] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (206 resets) in 1478 ms. (27 steps per ms) remains 9/15 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (40 resets) in 357 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (41 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (33 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (36 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 225 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (39 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (40 resets) in 1082 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
// Phase 1: matrix 627 rows 702 cols
[2024-05-21 16:21:53] [INFO ] Computed 114 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 387/583 variables, 66/262 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 387/649 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 2/651 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/651 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 22/605 variables, 7/658 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 22/680 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/680 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 97/702 variables, 39/719 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 97/816 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 0/816 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 627/1329 variables, 702/1518 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 1518 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2462 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 401/551 variables, 61/211 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 401/612 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 2/614 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 31 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:21:56] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:21:57] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:21:58] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/634 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 5 ms to minimize.
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:21:59] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 6 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:22:00] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 130 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:22:01] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 3 ms to minimize.
SMT process timed out in 7742ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (complete) has 1418 edges and 702 vertex of which 693 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 693 transition count 547
Reduce places removed 79 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 92 rules applied. Total rules applied 172 place count 614 transition count 534
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 185 place count 601 transition count 534
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 185 place count 601 transition count 403
Deduced a syphon composed of 131 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 462 place count 455 transition count 403
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 541 place count 376 transition count 324
Iterating global reduction 3 with 79 rules applied. Total rules applied 620 place count 376 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 622 place count 376 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 623 place count 375 transition count 322
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 623 place count 375 transition count 319
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 629 place count 372 transition count 319
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 5 with 172 rules applied. Total rules applied 801 place count 286 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 803 place count 285 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 804 place count 284 transition count 234
Applied a total of 804 rules in 168 ms. Remains 284 /702 variables (removed 418) and now considering 234/627 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 284/702 places, 234/627 transitions.
RANDOM walk for 40000 steps (773 resets) in 968 ms. (41 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (196 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (172 resets) in 189 ms. (210 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (172 resets) in 198 ms. (201 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (176 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (182 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
// Phase 1: matrix 234 rows 284 cols
[2024-05-21 16:22:02] [INFO ] Computed 91 invariants in 9 ms
[2024-05-21 16:22:02] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 146/212 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/216 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 43/259 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/262 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 233/495 variables, 262/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 23/518 variables, 22/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/518 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 378 constraints, problems are : Problem set: 0 solved, 3 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 284/284 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 146/212 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:22:02] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2024-05-21 16:22:03] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 10 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:22:04] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/216 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-10 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 43/259 variables, 22/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/262 variables, 3/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 233/495 variables, 262/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/495 variables, 3/376 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 23/518 variables, 22/398 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 8/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 2/408 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:22:05] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 9 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 4 ms to minimize.
[2024-05-21 16:22:06] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 6/414 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 16:22:07] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 4 ms to minimize.
[2024-05-21 16:22:07] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 5 ms to minimize.
[2024-05-21 16:22:07] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 3/417 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/518 variables, 0/417 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/518 variables, 0/417 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 417 constraints, problems are : Problem set: 2 solved, 1 unsolved in 5135 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 284/284 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 37/37 constraints]
After SMT, in 5581ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 210 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=105 )
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 31 ms.
All properties solved without resorting to model-checking.
Total runtime 15937 ms.
ITS solved all properties within timeout

BK_STOP 1716308527808

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

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