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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 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 192K 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-20-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716309510748

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:38:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:38:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:38:32] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-21 16:38:32] [INFO ] Transformed 782 places.
[2024-05-21 16:38:32] [INFO ] Transformed 697 transitions.
[2024-05-21 16:38:32] [INFO ] Found NUPN structural information;
[2024-05-21 16:38:32] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 15 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (200 resets) in 2967 ms. (13 steps per ms) remains 8/15 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (38 resets) in 323 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (35 resets) in 433 ms. (92 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (34 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (31 resets) in 1604 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (33 resets) in 267 ms. (149 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (35 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (36 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
// Phase 1: matrix 638 rows 719 cols
[2024-05-21 16:38:35] [INFO ] Computed 121 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 455/579 variables, 73/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 455/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/604 variables, 5/657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 25/682 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 115/719 variables, 43/725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 115/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2847 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 455/579 variables, 73/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 455/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 16:38:38] [INFO ] Deduced a trap composed of 22 places in 455 ms of which 63 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 4 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 129 places in 268 ms of which 10 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 6 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 3 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 20 places in 2271 ms of which 4 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 24 places in 1008 ms of which 5 ms to minimize.
SMT process timed out in 8675ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 698 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 698 transition count 557
Reduce places removed 74 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 91 rules applied. Total rules applied 166 place count 624 transition count 540
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 183 place count 607 transition count 540
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 183 place count 607 transition count 436
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 402 place count 492 transition count 436
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 464 place count 430 transition count 374
Iterating global reduction 3 with 62 rules applied. Total rules applied 526 place count 430 transition count 374
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 526 place count 430 transition count 373
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 529 place count 428 transition count 373
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 683 place count 350 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 687 place count 348 transition count 302
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 689 place count 348 transition count 302
Applied a total of 689 rules in 341 ms. Remains 348 /719 variables (removed 371) and now considering 302/638 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 348/719 places, 302/638 transitions.
RANDOM walk for 40000 steps (539 resets) in 1376 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (98 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (99 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (93 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (100 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (102 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 537212 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :3 out of 6
Probabilistic random walk after 537212 steps, saw 86811 distinct states, run finished after 3018 ms. (steps per millisecond=178 ) properties seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-21 16:38:48] [INFO ] Flow matrix only has 301 transitions (discarded 1 similar events)
// Phase 1: matrix 301 rows 348 cols
[2024-05-21 16:38:48] [INFO ] Computed 93 invariants in 7 ms
[2024-05-21 16:38:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 173/237 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/282 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/340 variables, 28/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 297/638 variables, 341/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 9/647 variables, 6/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/649 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/649 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 442 constraints, problems are : Problem set: 0 solved, 3 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 348/348 constraints, ReadFeed: 1/1 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 173/237 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 45/282 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 58/340 variables, 28/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 4 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 2 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 26 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 1 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 1 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 2 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 5 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 6 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:38:53] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 1 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:38:54] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 5 ms to minimize.
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:38:55] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:38:56] [INFO ] Deduced a trap composed of 74 places in 185 ms of which 2 ms to minimize.
[2024-05-21 16:38:56] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:38:56] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2024-05-21 16:38:56] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 5 ms to minimize.
[2024-05-21 16:38:56] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 6 ms to minimize.
[2024-05-21 16:38:56] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:38:56] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 1 ms to minimize.
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 6 ms to minimize.
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:38:57] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 4 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 5 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:38:58] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:38:59] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 5 ms to minimize.
[2024-05-21 16:38:59] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 4 ms to minimize.
[2024-05-21 16:38:59] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:38:59] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 3 ms to minimize.
[2024-05-21 16:38:59] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 4 ms to minimize.
[2024-05-21 16:38:59] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 4 ms to minimize.
[2024-05-21 16:39:00] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:39:00] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:39:00] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:39:01] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:39:01] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:39:01] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:39:01] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 2 ms to minimize.
[2024-05-21 16:39:01] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:39:02] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 2 ms to minimize.
[2024-05-21 16:39:02] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:39:02] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:39:02] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:39:02] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:39:02] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:39:03] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:39:03] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:39:03] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:39:03] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:39:03] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:39:03] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:39:03] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:39:07] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 4 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 4 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 77 places in 227 ms of which 3 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:39:12] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:39:14] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:39:15] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:39:15] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:39:15] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:39:15] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:39:15] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:39:15] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:39:15] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:39:16] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 5 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 5 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:39:19] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:39:19] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:39:19] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 3 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:39:24] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-20-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-21 16:39:24] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/340 variables, 8/266 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/341 variables, 1/267 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:39:24] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/341 variables, 1/268 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 297/638 variables, 341/609 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/638 variables, 1/610 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/638 variables, 1/611 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/638 variables, 0/611 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/647 variables, 6/617 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/647 variables, 1/618 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/647 variables, 11/629 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:39:31] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:39:31] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:39:31] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:39:31] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:39:31] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:39:32] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:39:32] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:39:32] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:39:32] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:39:32] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:39:33] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:39:33] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:39:33] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:39:33] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/647 variables, 20/649 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/649 variables, and 649 constraints, problems are : Problem set: 1 solved, 2 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 347/348 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 206/206 constraints]
After SMT, in 45966ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 302/302 transitions.
Graph (complete) has 981 edges and 348 vertex of which 342 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 342 transition count 288
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 334 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 333 transition count 287
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 19 place count 333 transition count 260
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 78 place count 301 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 89 place count 290 transition count 247
Iterating global reduction 3 with 11 rules applied. Total rules applied 100 place count 290 transition count 247
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 161 place count 259 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 257 transition count 219
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 257 transition count 219
Applied a total of 168 rules in 84 ms. Remains 257 /348 variables (removed 91) and now considering 219/302 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 257/348 places, 219/302 transitions.
RANDOM walk for 40000 steps (1197 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (240 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (228 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 858731 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :1 out of 2
Probabilistic random walk after 858731 steps, saw 145330 distinct states, run finished after 3002 ms. (steps per millisecond=286 ) properties seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-21 16:39:37] [INFO ] Flow matrix only has 218 transitions (discarded 1 similar events)
// Phase 1: matrix 218 rows 257 cols
[2024-05-21 16:39:37] [INFO ] Computed 87 invariants in 13 ms
[2024-05-21 16:39:37] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/199 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:39:37] [INFO ] Deduced a trap composed of 14 places in 375 ms of which 2 ms to minimize.
[2024-05-21 16:39:38] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:39:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/252 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/254 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 217/471 variables, 254/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/475 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/475 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 257/257 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/199 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:39:38] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/252 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/254 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 217/471 variables, 254/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/471 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/471 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/475 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/475 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/475 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 355 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 257/257 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1065ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 219/219 transitions.
Graph (trivial) has 54 edges and 257 vertex of which 5 / 257 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 253 transition count 201
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 241 transition count 201
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 25 place count 241 transition count 186
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 220 transition count 186
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 214 transition count 180
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 214 transition count 180
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 135 place count 183 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 183 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 139 place count 181 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 181 transition count 147
Applied a total of 140 rules in 72 ms. Remains 181 /257 variables (removed 76) and now considering 147/219 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 181/257 places, 147/219 transitions.
RANDOM walk for 40000 steps (2114 resets) in 1620 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (818 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 827291 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 1
Probabilistic random walk after 827291 steps, saw 306495 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
[2024-05-21 16:39:42] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 181 cols
[2024-05-21 16:39:42] [INFO ] Computed 81 invariants in 4 ms
[2024-05-21 16:39:42] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/142 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/177 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/179 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 146/325 variables, 179/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 15/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 181/181 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/142 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/177 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/179 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 146/325 variables, 179/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 15/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/325 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/327 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/327 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 181/181 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1025ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
All properties solved without resorting to model-checking.
Total runtime 70611 ms.
ITS solved all properties within timeout

BK_STOP 1716309583321

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
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-20, 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-171620398600607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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