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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 23K 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 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716306439464

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:47:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:47:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:47:21] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-21 15:47:21] [INFO ] Transformed 624 places.
[2024-05-21 15:47:21] [INFO ] Transformed 564 transitions.
[2024-05-21 15:47:21] [INFO ] Found NUPN structural information;
[2024-05-21 15:47:21] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
Deduced a syphon composed of 8 places in 23 ms
Reduce places removed 8 places and 8 transitions.
Support contains 135 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 73 place count 543 transition count 488
Iterating global reduction 1 with 68 rules applied. Total rules applied 141 place count 543 transition count 488
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 175 place count 509 transition count 454
Iterating global reduction 1 with 34 rules applied. Total rules applied 209 place count 509 transition count 454
Applied a total of 209 rules in 200 ms. Remains 509 /616 variables (removed 107) and now considering 454/556 (removed 102) transitions.
// Phase 1: matrix 454 rows 509 cols
[2024-05-21 15:47:22] [INFO ] Computed 94 invariants in 31 ms
[2024-05-21 15:47:22] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-21 15:47:22] [INFO ] Invariant cache hit.
[2024-05-21 15:47:23] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-05-21 15:47:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/509 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:47:34] [INFO ] Deduced a trap composed of 107 places in 283 ms of which 26 ms to minimize.
[2024-05-21 15:47:35] [INFO ] Deduced a trap composed of 114 places in 259 ms of which 6 ms to minimize.
[2024-05-21 15:47:35] [INFO ] Deduced a trap composed of 116 places in 289 ms of which 4 ms to minimize.
[2024-05-21 15:47:35] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 3 ms to minimize.
[2024-05-21 15:47:35] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 3 ms to minimize.
[2024-05-21 15:47:36] [INFO ] Deduced a trap composed of 115 places in 195 ms of which 3 ms to minimize.
[2024-05-21 15:47:36] [INFO ] Deduced a trap composed of 121 places in 237 ms of which 3 ms to minimize.
[2024-05-21 15:47:36] [INFO ] Deduced a trap composed of 111 places in 205 ms of which 3 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 128 places in 835 ms of which 3 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 103 places in 195 ms of which 3 ms to minimize.
[2024-05-21 15:47:37] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 118 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:47:38] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 109 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 4 ms to minimize.
[2024-05-21 15:47:39] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 112 places in 188 ms of which 3 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 3 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 112 places in 210 ms of which 28 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 100 places in 191 ms of which 2 ms to minimize.
[2024-05-21 15:47:40] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 103 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:47:41] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 9 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:47:42] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 7 ms to minimize.
[2024-05-21 15:47:43] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 114 places in 190 ms of which 5 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 112 places in 126 ms of which 7 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 2 ms to minimize.
[2024-05-21 15:47:44] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:47:45] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 13 ms to minimize.
[2024-05-21 15:47:46] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:47:46] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:47:46] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:47:46] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:47:50] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:47:50] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:47:50] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:47:51] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:47:51] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:47:51] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:47:51] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:47:51] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:47:51] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:47:51] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:47:52] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 5 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:47:53] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/963 variables, and 174 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/509 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/509 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 80/174 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:47:57] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:47:57] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:47:57] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:47:57] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 120 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 120 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:47:58] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:47:59] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 4 ms to minimize.
[2024-05-21 15:47:59] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:47:59] [INFO ] Deduced a trap composed of 120 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:47:59] [INFO ] Deduced a trap composed of 115 places in 177 ms of which 4 ms to minimize.
[2024-05-21 15:47:59] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:47:59] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:48:00] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:48:00] [INFO ] Deduced a trap composed of 107 places in 186 ms of which 3 ms to minimize.
[2024-05-21 15:48:00] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:48:01] [INFO ] Deduced a trap composed of 80 places in 180 ms of which 3 ms to minimize.
[2024-05-21 15:48:01] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:48:01] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:48:01] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:48:01] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:48:01] [INFO ] Deduced a trap composed of 115 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:48:02] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:48:02] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:48:02] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:48:02] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:48:02] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:48:02] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:48:02] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:48:03] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:48:03] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:48:03] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:48:03] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:48:03] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:48:03] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:48:04] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:48:04] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:48:04] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:48:04] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 116 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:48:05] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:48:06] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:48:06] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:48:06] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:48:06] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:48:06] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:48:06] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:48:06] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:48:07] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:48:07] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:48:07] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:48:07] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:48:08] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 4 ms to minimize.
[2024-05-21 15:48:08] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:48:08] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:48:08] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:48:08] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:48:09] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:48:09] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:48:09] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:48:09] [INFO ] Deduced a trap composed of 115 places in 154 ms of which 4 ms to minimize.
[2024-05-21 15:48:09] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:48:10] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 3 ms to minimize.
[2024-05-21 15:48:10] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:48:10] [INFO ] Deduced a trap composed of 110 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:48:10] [INFO ] Deduced a trap composed of 93 places in 175 ms of which 3 ms to minimize.
[2024-05-21 15:48:10] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:48:10] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 4 ms to minimize.
[2024-05-21 15:48:11] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:48:11] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:48:11] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:48:12] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:48:12] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:48:12] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 4 ms to minimize.
[2024-05-21 15:48:12] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 4 ms to minimize.
[2024-05-21 15:48:12] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:48:12] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 4 ms to minimize.
[2024-05-21 15:48:13] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:48:13] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:48:13] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:48:13] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:48:13] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 4 ms to minimize.
[2024-05-21 15:48:13] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 4 ms to minimize.
[2024-05-21 15:48:14] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:48:14] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:48:14] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:48:14] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:48:14] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 4 ms to minimize.
[2024-05-21 15:48:14] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:48:15] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:48:15] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:48:15] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:48:16] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:48:16] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:48:16] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:48:16] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:48:16] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:48:16] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 4 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 4 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:48:17] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 121 places in 239 ms of which 5 ms to minimize.
[2024-05-21 15:48:18] [INFO ] Deduced a trap composed of 95 places in 227 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:48:19] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 113 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:48:20] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 109 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:48:21] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:48:22] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:48:23] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 4 ms to minimize.
SMT process timed out in 60313ms, After SMT, problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 509/616 places, 454/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61670 ms. Remains : 509/616 places, 454/556 transitions.
Support contains 135 out of 509 places after structural reductions.
[2024-05-21 15:48:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 15:48:23] [INFO ] Flatten gal took : 90 ms
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:48:23] [INFO ] Flatten gal took : 36 ms
[2024-05-21 15:48:23] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 129 out of 509 places (down from 135) after GAL structural reductions.
RANDOM walk for 40000 steps (271 resets) in 1983 ms. (20 steps per ms) remains 42/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
[2024-05-21 15:48:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 296/377 variables, 48/48 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 25/402 variables, 7/55 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 40 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 5 (OVERLAPS) 99/501 variables, 39/94 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 92 places in 198 ms of which 3 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 4 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 4 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:48:26] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 4 ms to minimize.
[2024-05-21 15:48:27] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:48:28] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/114 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:48:29] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:48:30] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
SMT process timed out in 5081ms, After SMT, problems are : Problem set: 3 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (complete) has 1124 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 508 transition count 405
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 103 place count 460 transition count 399
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 454 transition count 399
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 109 place count 454 transition count 319
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 280 place count 363 transition count 319
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 293 place count 350 transition count 306
Ensure Unique test removed 1 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 307 place count 349 transition count 306
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 509 place count 246 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 510 place count 246 transition count 206
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 246 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 245 transition count 205
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 520 place count 245 transition count 205
Applied a total of 520 rules in 102 ms. Remains 245 /509 variables (removed 264) and now considering 205/454 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 245/509 places, 205/454 transitions.
RANDOM walk for 40000 steps (1294 resets) in 1620 ms. (24 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (25 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (24 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (26 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (22 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (26 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (25 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (24 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (22 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (24 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (25 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (25 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (25 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (22 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (25 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (23 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (25 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 37/39 properties
Interrupted probabilistic random walk after 354054 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :24 out of 37
Probabilistic random walk after 354054 steps, saw 68169 distinct states, run finished after 3006 ms. (steps per millisecond=117 ) properties seen :24
// Phase 1: matrix 205 rows 245 cols
[2024-05-21 15:48:34] [INFO ] Computed 78 invariants in 5 ms
[2024-05-21 15:48:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 131/161 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 30/191 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 50/241 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
Problem AtomicPropp46 is UNSAT
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:48:34] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 20/98 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-21 15:48:35] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:48:36] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 20/118 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:48:37] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
Problem AtomicPropp27 is UNSAT
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:48:38] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
Problem AtomicPropp58 is UNSAT
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 20/138 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 1/139 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:48:39] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 7/146 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/146 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 204/445 variables, 241/387 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 1/388 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:40] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 3/391 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 2/393 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 0/393 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 5/450 variables, 4/397 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:48:41] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 7/404 constraints. Problems are: Problem set: 7 solved, 6 unsolved
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 1/405 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/450 variables, 0/405 constraints. Problems are: Problem set: 7 solved, 6 unsolved
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:48:42] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/450 variables, 2/407 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/450 variables, 0/407 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/450 variables, 0/407 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 407 constraints, problems are : Problem set: 7 solved, 6 unsolved in 9364 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 7 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/74 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/185 variables, 51/55 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 12/67 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/68 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/68 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 56/241 variables, 23/91 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 70/161 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:48:43] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 9/170 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/170 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 204/445 variables, 241/411 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 1/412 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 5/417 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:48:44] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:45] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:48:46] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 20/437 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 4 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:48:47] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:48:48] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:48:49] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 20/457 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 0/457 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 5/450 variables, 4/461 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 1/462 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/462 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/450 variables, 0/462 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 462 constraints, problems are : Problem set: 8 solved, 5 unsolved in 6564 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/13 constraints, Known Traps: 133/133 constraints]
After SMT, in 15942ms problems are : Problem set: 8 solved, 5 unsolved
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 245 ms.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:48:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 29 ms
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 30 ms
[2024-05-21 15:48:50] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 81 out of 509 places (down from 90) after GAL structural reductions.
Computed a total of 141 stabilizing places and 134 stable transitions
Graph (complete) has 1124 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 252 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 501 transition count 374
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 430 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 146 place count 429 transition count 278
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 352 place count 318 transition count 278
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 378 place count 292 transition count 252
Ensure Unique test removed 1 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 405 place count 291 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 405 place count 291 transition count 249
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 411 place count 288 transition count 249
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 3 with 228 rules applied. Total rules applied 639 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 641 place count 171 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 170 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 643 place count 169 transition count 135
Applied a total of 643 rules in 90 ms. Remains 169 /509 variables (removed 340) and now considering 135/454 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 90 ms. Remains : 169/509 places, 135/454 transitions.
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:48:50] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 479 transition count 424
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 479 transition count 424
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 468 transition count 413
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 468 transition count 413
Applied a total of 82 rules in 43 ms. Remains 468 /509 variables (removed 41) and now considering 413/454 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 468/509 places, 413/454 transitions.
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:48:50] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 479 transition count 424
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 479 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 470 transition count 415
Applied a total of 78 rules in 69 ms. Remains 470 /509 variables (removed 39) and now considering 415/454 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 470/509 places, 415/454 transitions.
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 19 ms
[2024-05-21 15:48:50] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 471 transition count 416
Applied a total of 76 rules in 36 ms. Remains 471 /509 variables (removed 38) and now considering 416/454 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 471/509 places, 416/454 transitions.
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:48:50] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 471 transition count 416
Applied a total of 76 rules in 36 ms. Remains 471 /509 variables (removed 38) and now considering 416/454 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 471/509 places, 416/454 transitions.
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:48:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 250 edges and 509 vertex of which 4 / 509 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1121 edges and 506 vertex of which 505 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 504 transition count 378
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 433 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 432 transition count 377
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 146 place count 432 transition count 281
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 354 place count 320 transition count 281
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 382 place count 292 transition count 253
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 411 place count 291 transition count 253
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 411 place count 291 transition count 250
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 417 place count 288 transition count 250
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 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 643 place count 173 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 645 place count 172 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 171 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 647 place count 170 transition count 137
Applied a total of 647 rules in 59 ms. Remains 170 /509 variables (removed 339) and now considering 137/454 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 170/509 places, 137/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 483 transition count 428
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 483 transition count 428
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 473 transition count 418
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 473 transition count 418
Applied a total of 72 rules in 23 ms. Remains 473 /509 variables (removed 36) and now considering 418/454 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 473/509 places, 418/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 478 transition count 423
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 478 transition count 423
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 467 transition count 412
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 467 transition count 412
Applied a total of 84 rules in 24 ms. Remains 467 /509 variables (removed 42) and now considering 412/454 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 467/509 places, 412/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 470 transition count 415
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 470 transition count 415
Applied a total of 78 rules in 22 ms. Remains 470 /509 variables (removed 39) and now considering 415/454 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 470/509 places, 415/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 478 transition count 423
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 478 transition count 423
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 468 transition count 413
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 468 transition count 413
Applied a total of 82 rules in 21 ms. Remains 468 /509 variables (removed 41) and now considering 413/454 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 468/509 places, 413/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 257 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 501 transition count 373
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 146 place count 429 transition count 275
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 359 place count 314 transition count 275
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 388 place count 285 transition count 246
Ensure Unique test removed 1 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 418 place count 284 transition count 246
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 418 place count 284 transition count 243
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 424 place count 281 transition count 243
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 646 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 648 place count 167 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 649 place count 166 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 165 transition count 132
Applied a total of 650 rules in 43 ms. Remains 165 /509 variables (removed 344) and now considering 132/454 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 165/509 places, 132/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 477 transition count 422
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 477 transition count 422
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 466 transition count 411
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 466 transition count 411
Applied a total of 86 rules in 22 ms. Remains 466 /509 variables (removed 43) and now considering 411/454 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 466/509 places, 411/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 255 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 501 transition count 374
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 430 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 146 place count 429 transition count 276
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 357 place count 315 transition count 276
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 386 place count 286 transition count 247
Ensure Unique test removed 1 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 416 place count 285 transition count 247
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 416 place count 285 transition count 244
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 422 place count 282 transition count 244
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 3 with 224 rules applied. Total rules applied 646 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 648 place count 167 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 649 place count 166 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 650 place count 165 transition count 132
Applied a total of 650 rules in 46 ms. Remains 165 /509 variables (removed 344) and now considering 132/454 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 165/509 places, 132/454 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:48:51] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:48:51] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:48:51] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-21 15:48:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 509 places, 454 transitions and 1432 arcs took 3 ms.
Total runtime 90505 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-14

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/425/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 509
TRANSITIONS: 454
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.004s]


SAVING FILE /home/mcc/execution/425/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: 1741
MODEL NAME: /home/mcc/execution/425/model
509 places, 454 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...
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716309003005

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

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