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.r472-tajo-171620399700534.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 ltsminxred
Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225632491

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:07:14] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-01 07:07:14] [INFO ] Transformed 567 places.
[2024-06-01 07:07:14] [INFO ] Transformed 508 transitions.
[2024-06-01 07:07:14] [INFO ] Found NUPN structural information;
[2024-06-01 07:07:14] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
RANDOM walk for 40000 steps (296 resets) in 2723 ms. (14 steps per ms) remains 10/16 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (52 resets) in 401 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (53 resets) in 406 ms. (98 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (59 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (47 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (59 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (56 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (59 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (66 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
// Phase 1: matrix 501 rows 560 cols
[2024-06-01 07:07:16] [INFO ] Computed 95 invariants in 64 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 313/431 variables, 48/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 313/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 19/450 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 19/503 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 109/559 variables, 41/544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 109/653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/559 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/560 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 501/1061 variables, 560/1215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 1215 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2983 ms.
Refiners :[Domain max(s): 560/560 constraints, Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 313/431 variables, 48/166 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 313/479 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 53 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 130 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 4 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 5 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 121 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 20/499 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
SMT process timed out in 8312ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 215 edges and 560 vertex of which 4 / 560 are part of one of the 1 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1136 edges and 557 vertex of which 552 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 552 transition count 431
Reduce places removed 65 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 85 rules applied. Total rules applied 152 place count 487 transition count 411
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 172 place count 467 transition count 411
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 172 place count 467 transition count 349
Deduced a syphon composed of 62 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 300 place count 401 transition count 349
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 340 place count 361 transition count 309
Iterating global reduction 3 with 40 rules applied. Total rules applied 380 place count 361 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 380 place count 361 transition count 307
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 384 place count 359 transition count 307
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 512 place count 295 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 514 place count 294 transition count 247
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 294 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 293 transition count 246
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 293 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 519 place count 292 transition count 245
Applied a total of 519 rules in 346 ms. Remains 292 /560 variables (removed 268) and now considering 245/501 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 292/560 places, 245/501 transitions.
RANDOM walk for 40000 steps (745 resets) in 1138 ms. (35 steps per ms) remains 4/9 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (136 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (116 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (156 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
// Phase 1: matrix 245 rows 292 cols
[2024-06-01 07:07:25] [INFO ] Computed 87 invariants in 11 ms
[2024-06-01 07:07:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 144/169 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/198 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 74/272 variables, 35/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/274 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 239/513 variables, 274/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 17/530 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/534 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/537 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/537 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 383 constraints, problems are : Problem set: 0 solved, 4 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 292/292 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 144/169 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 29/198 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 74/272 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 4 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 64 places in 2231 ms of which 27 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 4 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 11 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/274 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 239/513 variables, 274/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/513 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 4 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 4 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 5 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 4 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/513 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 4 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/513 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/513 variables, 19/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/513 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 17/530 variables, 13/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/530 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/530 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/530 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/530 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 4/534 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/534 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 3/537 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 4 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/537 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 4 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/537 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/537 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 0/537 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 558 constraints, problems are : Problem set: 0 solved, 4 unsolved in 28393 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 292/292 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 171/171 constraints]
After SMT, in 29064ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1676 ms.
Support contains 25 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 245/245 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 292 transition count 227
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 274 transition count 227
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 36 place count 274 transition count 199
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 67 rules applied. Total rules applied 103 place count 235 transition count 199
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 223 transition count 187
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 223 transition count 187
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 51 rules applied. Total rules applied 178 place count 196 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 195 transition count 174
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 183 place count 195 transition count 174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 185 place count 193 transition count 172
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 193 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 192 transition count 171
Applied a total of 188 rules in 75 ms. Remains 192 /292 variables (removed 100) and now considering 171/245 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 192/292 places, 171/245 transitions.
RANDOM walk for 40000 steps (1809 resets) in 279 ms. (142 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (493 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (412 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (616 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
// Phase 1: matrix 171 rows 192 cols
[2024-06-01 07:07:56] [INFO ] Computed 73 invariants in 3 ms
[2024-06-01 07:07:56] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/120 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/122 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 44/166 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/171 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 170/341 variables, 171/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 21/362 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/363 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/363 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 269 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1785 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/120 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/122 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 44/166 variables, 24/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/171 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 170/341 variables, 171/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/341 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/341 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/341 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 21/362 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/362 variables, 9/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/362 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/362 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/362 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1/363 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/363 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/363 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/363 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/363 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 300 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3154 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 28/28 constraints]
After SMT, in 4974ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 504 ms.
Support contains 24 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 171/171 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 171/171 transitions.
RANDOM walk for 40000 steps (1850 resets) in 341 ms. (116 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (502 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (404 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2024-06-01 07:08:02] [INFO ] Invariant cache hit.
[2024-06-01 07:08:02] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/93 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/122 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/166 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/171 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 170/341 variables, 171/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 21/362 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/363 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/363 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/93 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 29/122 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/166 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 14 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/171 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 170/341 variables, 171/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/341 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 21/362 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 9/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/362 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/362 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/363 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/363 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/363 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/363 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 288 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2014 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 2312ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 31 ms.
All properties solved without resorting to model-checking.
Total runtime 50622 ms.
ITS solved all properties within timeout

BK_STOP 1717225684924

--------------------
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 ReachabilityCardinality -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-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399700534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;