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-171620399800578.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-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717226007449

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:28] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-01 07:13:28] [INFO ] Transformed 650 places.
[2024-06-01 07:13:29] [INFO ] Transformed 580 transitions.
[2024-06-01 07:13:29] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:29] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Support contains 114 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 575 transition count 508
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 575 transition count 508
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 169 place count 545 transition count 478
Iterating global reduction 1 with 30 rules applied. Total rules applied 199 place count 545 transition count 478
Applied a total of 199 rules in 133 ms. Remains 545 /646 variables (removed 101) and now considering 478/576 (removed 98) transitions.
// Phase 1: matrix 478 rows 545 cols
[2024-06-01 07:13:29] [INFO ] Computed 105 invariants in 37 ms
[2024-06-01 07:13:29] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-01 07:13:29] [INFO ] Invariant cache hit.
[2024-06-01 07:13:30] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-06-01 07:13:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/545 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 91 places in 185 ms of which 33 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 115 places in 196 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 115 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 113 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 104 places in 175 ms of which 5 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 4 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 5 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 115 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 111 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 105 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 117 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 3 ms to minimize.
SMT process timed out in 30190ms, After SMT, problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Starting structural reductions in LTL mode, iteration 1 : 545/646 places, 478/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31330 ms. Remains : 545/646 places, 478/576 transitions.
Support contains 114 out of 545 places after structural reductions.
[2024-06-01 07:14:00] [INFO ] Flatten gal took : 116 ms
[2024-06-01 07:14:01] [INFO ] Flatten gal took : 57 ms
[2024-06-01 07:14:01] [INFO ] Input system was already deterministic with 478 transitions.
RANDOM walk for 40000 steps (262 resets) in 2235 ms. (17 steps per ms) remains 36/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
[2024-06-01 07:14:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 343/418 variables, 59/59 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 120/538 variables, 45/104 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1/539 variables, 1/105 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 474/1013 variables, 539/644 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1013 variables, 0/644 constraints. Problems are: Problem set: 2 solved, 34 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 9 (OVERLAPS) 9/1022 variables, 5/649 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1022 variables, 0/649 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 1/1023 variables, 1/650 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 0/650 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/1023 variables, 0/650 constraints. Problems are: Problem set: 3 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 650 constraints, problems are : Problem set: 3 solved, 33 unsolved in 3443 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 545/545 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 233/295 variables, 28/28 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 20/48 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 102 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 95 places in 422 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 5 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 10/58 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 101 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
SMT process timed out in 8492ms, After SMT, problems are : Problem set: 3 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 544 transition count 434
Reduce places removed 43 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 49 rules applied. Total rules applied 93 place count 501 transition count 428
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 99 place count 495 transition count 428
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 99 place count 495 transition count 332
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 303 place count 387 transition count 332
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 317 place count 373 transition count 318
Ensure Unique test removed 1 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 332 place count 372 transition count 318
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 549 place count 263 transition count 210
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 550 place count 263 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 551 place count 262 transition count 209
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 560 place count 262 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 561 place count 261 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 260 transition count 208
Applied a total of 562 rules in 161 ms. Remains 260 /545 variables (removed 285) and now considering 208/478 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 260/545 places, 208/478 transitions.
RANDOM walk for 40000 steps (1151 resets) in 835 ms. (47 steps per ms) remains 19/33 properties
BEST_FIRST walk for 4003 steps (17 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (18 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (19 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (19 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
// Phase 1: matrix 208 rows 260 cols
[2024-06-01 07:14:11] [INFO ] Computed 90 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 86/124 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 35/159 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 59/218 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 4/222 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2/224 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 208/432 variables, 224/297 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 36/468 variables, 36/333 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 17/350 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp52 is UNSAT
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 11/361 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/361 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/468 variables, 0/361 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 361 constraints, problems are : Problem set: 2 solved, 17 unsolved in 1855 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 89/123 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 18/37 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 35/158 variables, 21/58 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 4/62 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/63 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/63 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 60/218 variables, 28/91 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 20/111 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 20/131 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 20/171 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 3 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 20/191 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 3/194 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 20/214 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 1/215 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 1/216 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 8/224 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 3/227 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 4/231 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 5/236 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/218 variables, 20/256 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/218 variables, 2/258 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/218 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 4/222 variables, 4/262 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/222 variables, 1/263 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/222 variables, 0/263 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 2/224 variables, 2/265 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/224 variables, 11/276 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/224 variables, 2/278 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/224 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 208/432 variables, 224/502 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/432 variables, 8/510 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/432 variables, 4/514 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/432 variables, 11/525 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/432 variables, 0/525 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 38 (OVERLAPS) 36/468 variables, 36/561 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/468 variables, 17/578 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/468 variables, 9/587 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/468 variables, 5/592 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/468 variables, 1/593 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/468 variables, 4/597 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/468 variables, 1/598 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/468 variables, 1/599 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/468 variables, 0/599 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 47 (OVERLAPS) 0/468 variables, 0/599 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 599 constraints, problems are : Problem set: 2 solved, 17 unsolved in 31374 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 17/19 constraints, Known Traps: 232/232 constraints]
After SMT, in 33247ms problems are : Problem set: 2 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 596 ms.
Support contains 34 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 208/208 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 260 transition count 204
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 256 transition count 204
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 8 place count 256 transition count 192
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 35 place count 241 transition count 192
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 235 transition count 186
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 235 transition count 186
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 76 place count 219 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 218 transition count 172
Applied a total of 77 rules in 65 ms. Remains 218 /260 variables (removed 42) and now considering 172/208 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 218/260 places, 172/208 transitions.
RANDOM walk for 40000 steps (1440 resets) in 535 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (24 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (30 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 781821 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :14 out of 17
Probabilistic random walk after 781821 steps, saw 142310 distinct states, run finished after 3005 ms. (steps per millisecond=260 ) properties seen :14
// Phase 1: matrix 172 rows 218 cols
[2024-06-01 07:14:48] [INFO ] Computed 84 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/108 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/166 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/171 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/174 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 170/344 variables, 174/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 46/390 variables, 44/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/390 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 218/218 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/108 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 58/166 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/171 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/174 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 170/344 variables, 174/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 46/390 variables, 44/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/390 variables, 9/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/390 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 56 places in 433 ms of which 28 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/390 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/390 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 323 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2473 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 2757ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 344 ms.
Support contains 7 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 172/172 transitions.
Graph (trivial) has 26 edges and 218 vertex of which 5 / 218 are part of one of the 1 SCC in 2 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 214 transition count 163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 211 transition count 163
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 7 place count 211 transition count 153
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 31 place count 197 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 196 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 196 transition count 152
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 187 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 53 place count 186 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 186 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 185 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 184 transition count 158
Applied a total of 56 rules in 41 ms. Remains 184 /218 variables (removed 34) and now considering 158/172 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 184/218 places, 158/172 transitions.
RANDOM walk for 40000 steps (820 resets) in 603 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (207 resets) in 81 ms. (487 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (224 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
// Phase 1: matrix 158 rows 184 cols
[2024-06-01 07:14:51] [INFO ] Computed 80 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/57 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/79 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/83 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/119 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/124 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 148/272 variables, 124/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 66/338 variables, 56/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/338 variables, 21/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/338 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/341 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/341 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/341 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/342 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/342 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/342 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 184/184 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/57 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/79 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/83 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/119 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/124 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/124 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 148/272 variables, 124/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 66/338 variables, 56/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/338 variables, 21/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/338 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/341 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/341 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/341 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/342 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/342 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 158/158 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 184 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 181 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 179 transition count 154
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 179 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 176 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 176 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 175 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 174 transition count 150
Applied a total of 17 rules in 49 ms. Remains 174 /184 variables (removed 10) and now considering 150/158 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 174/184 places, 150/158 transitions.
RANDOM walk for 40000 steps (2302 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (539 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4244 states, properties seen :0
Probabilistic random walk after 14960 steps, saw 4244 distinct states, run finished after 43 ms. (steps per millisecond=347 ) properties seen :0
Explored full state space saw : 4244 states, properties seen :0
Exhaustive walk after 14960 steps, saw 4244 distinct states, run finished after 34 ms. (steps per millisecond=440 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:14:52] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:14:52] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:14:52] [INFO ] Input system was already deterministic with 478 transitions.
Computed a total of 229 stabilizing places and 201 stable transitions
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 514 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 503 transition count 436
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 503 transition count 436
Applied a total of 84 rules in 34 ms. Remains 503 /545 variables (removed 42) and now considering 436/478 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 503/545 places, 436/478 transitions.
[2024-06-01 07:14:52] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:14:52] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:14:52] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 515 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 515 transition count 448
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 505 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 505 transition count 438
Applied a total of 80 rules in 29 ms. Remains 505 /545 variables (removed 40) and now considering 438/478 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 505/545 places, 438/478 transitions.
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:14:53] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 515 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 515 transition count 448
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 506 transition count 439
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 506 transition count 439
Applied a total of 78 rules in 35 ms. Remains 506 /545 variables (removed 39) and now considering 439/478 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 506/545 places, 439/478 transitions.
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:14:53] [INFO ] Input system was already deterministic with 439 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 76 place count 537 transition count 395
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 463 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 414 place count 306 transition count 258
Ensure Unique test removed 1 places
Iterating global reduction 3 with 31 rules applied. Total rules applied 445 place count 305 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 445 place count 305 transition count 256
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 449 place count 303 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 693 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 694 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 695 place count 177 transition count 135
Applied a total of 695 rules in 68 ms. Remains 177 /545 variables (removed 368) and now considering 135/478 (removed 343) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 177/545 places, 135/478 transitions.
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:14:53] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 11 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 415 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 689 place count 182 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 690 place count 181 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 691 place count 180 transition count 136
Applied a total of 691 rules in 62 ms. Remains 180 /545 variables (removed 365) and now considering 136/478 (removed 342) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 180/545 places, 136/478 transitions.
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:14:53] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 32175 steps (5523 resets) in 479 ms. (67 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 152 place count 462 transition count 287
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 386 place count 335 transition count 287
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 416 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 695 place count 178 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 177 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 697 place count 176 transition count 134
Applied a total of 697 rules in 41 ms. Remains 176 /545 variables (removed 369) and now considering 134/478 (removed 344) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 176/545 places, 134/478 transitions.
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:53] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 516 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 505 transition count 438
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 505 transition count 438
Applied a total of 80 rules in 34 ms. Remains 505 /545 variables (removed 40) and now considering 438/478 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 505/545 places, 438/478 transitions.
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:14:53] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 268 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 537 transition count 396
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 464 transition count 396
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 148 place count 464 transition count 291
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 376 place count 341 transition count 291
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 407 place count 310 transition count 260
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 439 place count 309 transition count 260
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 439 place count 309 transition count 258
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 443 place count 307 transition count 258
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 687 place count 183 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 182 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 689 place count 181 transition count 137
Applied a total of 689 rules in 87 ms. Remains 181 /545 variables (removed 364) and now considering 137/478 (removed 341) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 181/545 places, 137/478 transitions.
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:53] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:14:53] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 512 transition count 445
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 512 transition count 445
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 501 transition count 434
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 501 transition count 434
Applied a total of 88 rules in 52 ms. Remains 501 /545 variables (removed 44) and now considering 434/478 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 501/545 places, 434/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 516 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 516 transition count 449
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 506 transition count 439
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 506 transition count 439
Applied a total of 78 rules in 50 ms. Remains 506 /545 variables (removed 39) and now considering 439/478 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 506/545 places, 439/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 439 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 520 transition count 453
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 520 transition count 453
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 512 transition count 445
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 512 transition count 445
Applied a total of 66 rules in 64 ms. Remains 512 /545 variables (removed 33) and now considering 445/478 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 512/545 places, 445/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 543 transition count 410
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 477 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 475 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 137 place count 475 transition count 297
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 378 place count 345 transition count 297
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 410 place count 313 transition count 265
Ensure Unique test removed 1 places
Iterating global reduction 3 with 33 rules applied. Total rules applied 443 place count 312 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 443 place count 312 transition count 263
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 447 place count 310 transition count 263
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 687 place count 188 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 688 place count 187 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 689 place count 186 transition count 144
Applied a total of 689 rules in 40 ms. Remains 186 /545 variables (removed 359) and now considering 144/478 (removed 334) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 186/545 places, 144/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 514 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 514 transition count 447
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 504 transition count 437
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 504 transition count 437
Applied a total of 82 rules in 20 ms. Remains 504 /545 variables (removed 41) and now considering 437/478 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 504/545 places, 437/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 270 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 76 place count 537 transition count 395
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 463 transition count 395
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 150 place count 463 transition count 289
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 382 place count 337 transition count 289
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 412 place count 307 transition count 259
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 443 place count 306 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 443 place count 306 transition count 257
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 693 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 694 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 695 place count 177 transition count 135
Applied a total of 695 rules in 36 ms. Remains 177 /545 variables (removed 368) and now considering 135/478 (removed 343) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 177/545 places, 135/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 543 transition count 410
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 477 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 475 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 137 place count 475 transition count 297
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 378 place count 345 transition count 297
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 408 place count 315 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 3 with 31 rules applied. Total rules applied 439 place count 314 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 439 place count 314 transition count 265
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 443 place count 312 transition count 265
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 683 place count 190 transition count 147
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 684 place count 190 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 189 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 188 transition count 146
Applied a total of 686 rules in 42 ms. Remains 188 /545 variables (removed 357) and now considering 146/478 (removed 332) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 188/545 places, 146/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 415 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 691 place count 180 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 692 place count 179 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 693 place count 178 transition count 136
Applied a total of 693 rules in 32 ms. Remains 178 /545 variables (removed 367) and now considering 136/478 (removed 342) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 178/545 places, 136/478 transitions.
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:14:54] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:14:54] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 40000 steps (6874 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1713 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 520 steps, run visited all 1 properties in 6 ms. (steps per millisecond=86 )
Probabilistic random walk after 520 steps, saw 261 distinct states, run finished after 10 ms. (steps per millisecond=52 ) properties seen :1
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 07:14:55] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:14:55] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:14:55] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 07:14:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 545 places, 478 transitions and 1502 arcs took 5 ms.
Total runtime 86339 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-17-CTLFireability-2023-14

BK_STOP 1717226095470

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1741/ctl_0_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1741/ctl_1_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1741/ctl_2_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1741/ctl_3_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1741/ctl_4_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1741/ctl_5_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1741/ctl_6_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1741/ctl_7_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1741/ctl_8_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1741/ctl_9_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1741/ctl_10_
ctl formula name BusinessProcesses-PT-17-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1741/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-17"
export BK_EXAMINATION="CTLFireability"
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-17, examination is CTLFireability"
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-171620399800578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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