Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398500570.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716307403767

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:03:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:03:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:03:25] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-21 16:03:25] [INFO ] Transformed 638 places.
[2024-05-21 16:03:25] [INFO ] Transformed 578 transitions.
[2024-05-21 16:03:25] [INFO ] Found NUPN structural information;
[2024-05-21 16:03:25] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Support contains 125 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 78 place count 552 transition count 497
Iterating global reduction 1 with 73 rules applied. Total rules applied 151 place count 552 transition count 497
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 185 place count 518 transition count 463
Iterating global reduction 1 with 34 rules applied. Total rules applied 219 place count 518 transition count 463
Applied a total of 219 rules in 121 ms. Remains 518 /630 variables (removed 112) and now considering 463/570 (removed 107) transitions.
// Phase 1: matrix 463 rows 518 cols
[2024-05-21 16:03:25] [INFO ] Computed 95 invariants in 31 ms
[2024-05-21 16:03:26] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-21 16:03:26] [INFO ] Invariant cache hit.
[2024-05-21 16:03:26] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-21 16:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/517 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/517 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/518 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 12 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 102 places in 224 ms of which 5 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 116 places in 200 ms of which 3 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 8 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 5 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 4 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 4 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 4 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 126 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 104 places in 185 ms of which 5 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 117 places in 187 ms of which 5 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 4 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 4 ms to minimize.
SMT process timed out in 30229ms, After SMT, problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
Starting structural reductions in LTL mode, iteration 1 : 518/630 places, 463/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31315 ms. Remains : 518/630 places, 463/570 transitions.
Support contains 125 out of 518 places after structural reductions.
[2024-05-21 16:03:57] [INFO ] Flatten gal took : 83 ms
[2024-05-21 16:03:57] [INFO ] Flatten gal took : 37 ms
[2024-05-21 16:03:57] [INFO ] Input system was already deterministic with 463 transitions.
Support contains 124 out of 518 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (261 resets) in 2115 ms. (18 steps per ms) remains 49/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
[2024-05-21 16:03:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 282/373 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 43/416 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 93/509 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-21 16:03:59] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 4 ms to minimize.
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 2 ms to minimize.
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:04:02] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:04:02] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:04:02] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:04:02] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 19/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-21 16:04:02] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:04:02] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:04:02] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:04:03] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:04:03] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:04:03] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:04:03] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
SMT process timed out in 5035ms, After SMT, problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 463/463 transitions.
Graph (complete) has 1149 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 517 transition count 418
Reduce places removed 44 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 473 transition count 414
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 469 transition count 414
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 97 place count 469 transition count 341
Deduced a syphon composed of 73 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 253 place count 386 transition count 341
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 262 place count 377 transition count 332
Iterating global reduction 3 with 9 rules applied. Total rules applied 271 place count 377 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 271 place count 377 transition count 331
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 376 transition count 331
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 375 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 375 transition count 330
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 472 place count 276 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 473 place count 276 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 475 place count 275 transition count 235
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 482 place count 275 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 483 place count 274 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 484 place count 273 transition count 234
Applied a total of 484 rules in 183 ms. Remains 273 /518 variables (removed 245) and now considering 234/463 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 273/518 places, 234/463 transitions.
RANDOM walk for 40000 steps (1581 resets) in 1169 ms. (34 steps per ms) remains 45/49 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (19 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (31 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (29 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (26 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (25 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (25 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (26 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (29 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (30 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (20 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (25 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
Interrupted probabilistic random walk after 399920 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :20 out of 45
Probabilistic random walk after 399920 steps, saw 66043 distinct states, run finished after 3007 ms. (steps per millisecond=132 ) properties seen :20
// Phase 1: matrix 234 rows 273 cols
[2024-05-21 16:04:07] [INFO ] Computed 83 invariants in 6 ms
[2024-05-21 16:04:07] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 128/179 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 36/215 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 49/264 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-21 16:04:07] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:04:07] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:04:07] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:04:07] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:04:08] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
Problem AtomicPropp31 is UNSAT
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:04:09] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
Problem AtomicPropp48 is UNSAT
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem AtomicPropp54 is UNSAT
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:04:10] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 3 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 20/120 constraints. Problems are: Problem set: 3 solved, 22 unsolved
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:04:11] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:04:12] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
Problem AtomicPropp45 is UNSAT
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
Problem AtomicPropp45 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 20/140 constraints. Problems are: Problem set: 4 solved, 21 unsolved
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:13] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:14] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
Problem AtomicPropp30 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 20/160 constraints. Problems are: Problem set: 5 solved, 20 unsolved
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 27 ms to minimize.
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:15] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:16] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 20/180 constraints. Problems are: Problem set: 5 solved, 20 unsolved
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:04:17] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:04:18] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
Problem AtomicPropp60 is UNSAT
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
Problem AtomicPropp64 is UNSAT
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 19/199 constraints. Problems are: Problem set: 7 solved, 18 unsolved
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:19] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 10/209 constraints. Problems are: Problem set: 7 solved, 18 unsolved
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:04:20] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:21] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 14/223 constraints. Problems are: Problem set: 7 solved, 18 unsolved
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 4 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 20/243 constraints. Problems are: Problem set: 7 solved, 18 unsolved
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 18/261 constraints. Problems are: Problem set: 7 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/261 constraints. Problems are: Problem set: 7 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 234/498 variables, 264/525 constraints. Problems are: Problem set: 7 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 4/529 constraints. Problems are: Problem set: 7 solved, 18 unsolved
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 1/530 constraints. Problems are: Problem set: 7 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/498 variables, 0/530 constraints. Problems are: Problem set: 7 solved, 18 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 21 (OVERLAPS) 9/507 variables, 9/539 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/507 variables, 3/542 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 3/545 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 0/507 variables, 0/545 constraints. Problems are: Problem set: 10 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 545 constraints, problems are : Problem set: 10 solved, 15 unsolved in 22835 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 185/185 constraints]
Escalating to Integer solving :Problem set: 10 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 97/122 variables, 15/15 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/16 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 6/22 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/24 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/25 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/25 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 78/200 variables, 37/62 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 13/75 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:04:31] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 20/95 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 2/97 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/97 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 64/264 variables, 28/125 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 171/296 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
Problem AtomicPropp10 is UNSAT
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:32] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:33] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 20/316 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 20/336 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 20/356 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 5/361 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 1 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:04:43] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 1 ms to minimize.
[2024-05-21 16:04:43] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 2 ms to minimize.
[2024-05-21 16:04:43] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:04:43] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:04:43] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:04:43] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 20/381 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 2 ms to minimize.
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:04:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 1 ms to minimize.
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 1 ms to minimize.
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 4 ms to minimize.
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 4 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 5 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/264 variables, 20/401 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/264 variables, 12/413 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/264 variables, 8/421 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/264 variables, 2/423 constraints. Problems are: Problem set: 12 solved, 13 unsolved
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/264 variables, 2/425 constraints. Problems are: Problem set: 12 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/264 variables, 0/425 constraints. Problems are: Problem set: 12 solved, 13 unsolved
At refinement iteration 25 (OVERLAPS) 234/498 variables, 264/689 constraints. Problems are: Problem set: 12 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/498 variables, 4/693 constraints. Problems are: Problem set: 12 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/498 variables, 12/705 constraints. Problems are: Problem set: 12 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/498 variables, 0/705 constraints. Problems are: Problem set: 12 solved, 13 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 29 (OVERLAPS) 9/507 variables, 9/714 constraints. Problems are: Problem set: 13 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/507 variables, 3/717 constraints. Problems are: Problem set: 13 solved, 12 unsolved
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/507 variables, 1/718 constraints. Problems are: Problem set: 13 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/507 variables, 0/718 constraints. Problems are: Problem set: 13 solved, 12 unsolved
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
At refinement iteration 33 (OVERLAPS) 0/507 variables, 1/719 constraints. Problems are: Problem set: 13 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/507 variables, 0/719 constraints. Problems are: Problem set: 13 solved, 12 unsolved
At refinement iteration 35 (OVERLAPS) 0/507 variables, 0/719 constraints. Problems are: Problem set: 13 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 719 constraints, problems are : Problem set: 13 solved, 12 unsolved in 37910 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/25 constraints, Known Traps: 347/347 constraints]
After SMT, in 60791ms problems are : Problem set: 13 solved, 12 unsolved
Parikh walk visited 7 properties in 1996 ms.
Support contains 7 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 234/234 transitions.
Graph (trivial) has 73 edges and 273 vertex of which 2 / 273 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 272 transition count 219
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 259 transition count 219
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 27 place count 259 transition count 193
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 59 rules applied. Total rules applied 86 place count 226 transition count 193
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 96 place count 216 transition count 183
Ensure Unique test removed 1 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 215 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 107 place count 215 transition count 181
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 111 place count 213 transition count 181
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 182 place count 176 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 175 transition count 158
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 175 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 173 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 171 transition count 154
Applied a total of 190 rules in 68 ms. Remains 171 /273 variables (removed 102) and now considering 154/234 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 171/273 places, 154/234 transitions.
RANDOM walk for 40000 steps (1554 resets) in 353 ms. (112 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (721 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (789 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (262 resets) in 76 ms. (519 steps per ms) remains 1/3 properties
// Phase 1: matrix 154 rows 171 cols
[2024-05-21 16:05:10] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 16:05:10] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/111 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 56/167 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/185 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 17/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/209 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/214 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 110/324 variables, 119/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/324 variables, 25/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/324 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/324 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/325 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/325 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/325 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 171/171 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/111 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/167 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/185 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 17/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 24/209 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/214 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/324 variables, 119/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/324 variables, 25/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/324 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/324 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/325 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/325 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/325 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 249 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 171/171 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 114 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:05:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 16:05:10] [INFO ] Flatten gal took : 37 ms
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:05:10] [INFO ] Flatten gal took : 23 ms
[2024-05-21 16:05:11] [INFO ] Input system was already deterministic with 463 transitions.
Support contains 67 out of 518 places (down from 87) after GAL structural reductions.
Computed a total of 142 stabilizing places and 135 stable transitions
Graph (complete) has 1149 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Graph (trivial) has 261 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1143 edges and 513 vertex of which 512 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 511 transition count 385
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 441 transition count 385
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 142 place count 441 transition count 284
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 361 place count 323 transition count 284
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 396 place count 288 transition count 249
Ensure Unique test removed 1 places
Iterating global reduction 2 with 36 rules applied. Total rules applied 432 place count 287 transition count 249
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 432 place count 287 transition count 245
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 440 place count 283 transition count 245
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 664 place count 169 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 665 place count 168 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 666 place count 167 transition count 134
Applied a total of 666 rules in 50 ms. Remains 167 /518 variables (removed 351) and now considering 134/463 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 167/518 places, 134/463 transitions.
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:05:11] [INFO ] Input system was already deterministic with 134 transitions.
RANDOM walk for 40000 steps (8411 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2402 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6001 steps, run visited all 1 properties in 23 ms. (steps per millisecond=260 )
Probabilistic random walk after 6001 steps, saw 1831 distinct states, run finished after 26 ms. (steps per millisecond=230 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 481 transition count 426
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 481 transition count 426
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 471 transition count 416
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 471 transition count 416
Applied a total of 94 rules in 46 ms. Remains 471 /518 variables (removed 47) and now considering 416/463 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 471/518 places, 416/463 transitions.
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 18 ms
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 18 ms
[2024-05-21 16:05:11] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 483 transition count 428
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 483 transition count 428
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 474 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 474 transition count 419
Applied a total of 88 rules in 48 ms. Remains 474 /518 variables (removed 44) and now considering 419/463 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 474/518 places, 419/463 transitions.
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:05:11] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 483 transition count 428
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 483 transition count 428
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 475 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 475 transition count 420
Applied a total of 86 rules in 48 ms. Remains 475 /518 variables (removed 43) and now considering 420/463 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 475/518 places, 420/463 transitions.
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:05:11] [INFO ] Input system was already deterministic with 420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 484 transition count 429
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 484 transition count 429
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 475 transition count 420
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 475 transition count 420
Applied a total of 86 rules in 48 ms. Remains 475 /518 variables (removed 43) and now considering 420/463 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 475/518 places, 420/463 transitions.
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:05:11] [INFO ] Input system was already deterministic with 420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 427
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 427
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 472 transition count 417
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 472 transition count 417
Applied a total of 92 rules in 38 ms. Remains 472 /518 variables (removed 46) and now considering 417/463 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 472/518 places, 417/463 transitions.
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:05:11] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:05:11] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 484 transition count 429
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 484 transition count 429
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 475 transition count 420
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 475 transition count 420
Applied a total of 86 rules in 38 ms. Remains 475 /518 variables (removed 43) and now considering 420/463 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 475/518 places, 420/463 transitions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:05:12] [INFO ] Input system was already deterministic with 420 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Graph (trivial) has 253 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1143 edges and 513 vertex of which 512 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 511 transition count 388
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 444 transition count 388
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 136 place count 444 transition count 291
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 345 place count 332 transition count 291
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 378 place count 299 transition count 258
Ensure Unique test removed 1 places
Iterating global reduction 2 with 34 rules applied. Total rules applied 412 place count 298 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 412 place count 298 transition count 255
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 295 transition count 255
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 642 place count 182 transition count 144
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 648 place count 182 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 649 place count 181 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 180 transition count 143
Applied a total of 650 rules in 62 ms. Remains 180 /518 variables (removed 338) and now considering 143/463 (removed 320) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 180/518 places, 143/463 transitions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:05:12] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 427
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 427
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 473 transition count 418
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 473 transition count 418
Applied a total of 90 rules in 37 ms. Remains 473 /518 variables (removed 45) and now considering 418/463 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 473/518 places, 418/463 transitions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:05:12] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 486 transition count 431
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 486 transition count 431
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 477 transition count 422
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 477 transition count 422
Applied a total of 82 rules in 28 ms. Remains 477 /518 variables (removed 41) and now considering 422/463 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 477/518 places, 422/463 transitions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:05:12] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Graph (trivial) has 261 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1143 edges and 513 vertex of which 512 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 511 transition count 384
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 440 transition count 384
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 144 place count 440 transition count 284
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 361 place count 323 transition count 284
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 394 place count 290 transition count 251
Ensure Unique test removed 1 places
Iterating global reduction 2 with 34 rules applied. Total rules applied 428 place count 289 transition count 251
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 428 place count 289 transition count 247
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 436 place count 285 transition count 247
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 664 place count 169 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 665 place count 168 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 666 place count 167 transition count 134
Applied a total of 666 rules in 44 ms. Remains 167 /518 variables (removed 351) and now considering 134/463 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 167/518 places, 134/463 transitions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:05:12] [INFO ] Input system was already deterministic with 134 transitions.
RANDOM walk for 40000 steps (8397 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2442 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 184 steps, run visited all 1 properties in 8 ms. (steps per millisecond=23 )
Probabilistic random walk after 184 steps, saw 124 distinct states, run finished after 9 ms. (steps per millisecond=20 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 463/463 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 427
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 427
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 473 transition count 418
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 473 transition count 418
Applied a total of 90 rules in 21 ms. Remains 473 /518 variables (removed 45) and now considering 418/463 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 473/518 places, 418/463 transitions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:05:12] [INFO ] Input system was already deterministic with 418 transitions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:05:12] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-21 16:05:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 518 places, 463 transitions and 1459 arcs took 5 ms.
Total runtime 107577 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 518
TRANSITIONS: 463
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.005s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1905
MODEL NAME: /home/mcc/execution/412/model
518 places, 463 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-16, examination is 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 r047-tajo-171620398500570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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