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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 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 189K 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-19-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716308865037

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-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:27:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:27:47] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-05-21 16:27:47] [INFO ] Transformed 772 places.
[2024-05-21 16:27:47] [INFO ] Transformed 685 transitions.
[2024-05-21 16:27:47] [INFO ] Found NUPN structural information;
[2024-05-21 16:27:47] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Deduced a syphon composed of 15 places in 17 ms
Reduce places removed 15 places and 15 transitions.
Support contains 133 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 101 place count 656 transition count 577
Iterating global reduction 1 with 93 rules applied. Total rules applied 194 place count 656 transition count 577
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 235 place count 615 transition count 536
Iterating global reduction 1 with 41 rules applied. Total rules applied 276 place count 615 transition count 536
Applied a total of 276 rules in 366 ms. Remains 615 /757 variables (removed 142) and now considering 536/670 (removed 134) transitions.
// Phase 1: matrix 536 rows 615 cols
[2024-05-21 16:27:47] [INFO ] Computed 117 invariants in 93 ms
[2024-05-21 16:27:48] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-05-21 16:27:48] [INFO ] Invariant cache hit.
[2024-05-21 16:27:49] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2024-05-21 16:27:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/615 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/615 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:03] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 24 ms to minimize.
[2024-05-21 16:28:04] [INFO ] Deduced a trap composed of 95 places in 1161 ms of which 12 ms to minimize.
[2024-05-21 16:28:05] [INFO ] Deduced a trap composed of 91 places in 240 ms of which 12 ms to minimize.
[2024-05-21 16:28:05] [INFO ] Deduced a trap composed of 95 places in 275 ms of which 3 ms to minimize.
[2024-05-21 16:28:06] [INFO ] Deduced a trap composed of 87 places in 828 ms of which 3 ms to minimize.
[2024-05-21 16:28:06] [INFO ] Deduced a trap composed of 93 places in 254 ms of which 2 ms to minimize.
[2024-05-21 16:28:07] [INFO ] Deduced a trap composed of 110 places in 727 ms of which 4 ms to minimize.
[2024-05-21 16:28:07] [INFO ] Deduced a trap composed of 116 places in 237 ms of which 5 ms to minimize.
[2024-05-21 16:28:07] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 5 ms to minimize.
[2024-05-21 16:28:07] [INFO ] Deduced a trap composed of 119 places in 210 ms of which 5 ms to minimize.
[2024-05-21 16:28:08] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:28:08] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 2 ms to minimize.
[2024-05-21 16:28:08] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:28:08] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:28:08] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:28:08] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:28:09] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:28:09] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:28:09] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:28:09] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:09] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 3 ms to minimize.
[2024-05-21 16:28:10] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:28:10] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:28:10] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:28:10] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:28:10] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:28:10] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:28:10] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:28:11] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:28:11] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:28:11] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:28:11] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:28:11] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:28:11] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:28:11] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:28:12] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 2 ms to minimize.
[2024-05-21 16:28:12] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:28:12] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:28:12] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:28:12] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:13] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:28:13] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:28:13] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:28:13] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:28:13] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:28:13] [INFO ] Deduced a trap composed of 120 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:28:14] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:28:15] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:28:15] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 16 ms to minimize.
[2024-05-21 16:28:15] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:28:15] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:28:15] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:28:15] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1151 variables, and 177 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/615 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/615 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/615 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 60/177 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:25] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:28:25] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:28:25] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:28:25] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 5 ms to minimize.
[2024-05-21 16:28:25] [INFO ] Deduced a trap composed of 141 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:28:26] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:28:26] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:28:26] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:28:26] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:28:26] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:28:26] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:28:26] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:28:27] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:28:27] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:28:27] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:28:27] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:28:27] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:28:27] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:28:27] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:28:28] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:28] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:28:28] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:28:28] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:28:28] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:28:28] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:28:31] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:28:31] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:31] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:28:31] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:28:31] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 109 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:28:34] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:28:34] [INFO ] Deduced a trap composed of 114 places in 130 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:34] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:28:34] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:28:34] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 3 ms to minimize.
[2024-05-21 16:28:35] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 4 ms to minimize.
[2024-05-21 16:28:35] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:28:35] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:28:35] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:28:35] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:28:35] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:28:35] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:28:36] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:28:36] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:28:36] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:28:36] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:28:36] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:28:36] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:28:36] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:28:37] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 15 ms to minimize.
[2024-05-21 16:28:37] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:28:37] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:37] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:28:38] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 6 ms to minimize.
[2024-05-21 16:28:38] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:28:38] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:28:38] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:28:38] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:28:38] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:28:39] [INFO ] Deduced a trap composed of 119 places in 158 ms of which 7 ms to minimize.
[2024-05-21 16:28:39] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:28:39] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:28:39] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:28:39] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:28:39] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:28:40] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:28:40] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:28:40] [INFO ] Deduced a trap composed of 117 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:28:40] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:28:40] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:28:40] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:28:41] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:41] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:28:41] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:28:41] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:28:42] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:28:42] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:28:42] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:28:42] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:28:42] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:28:42] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:28:42] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:28:43] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:28:43] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:28:43] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:28:43] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:28:43] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:28:43] [INFO ] Deduced a trap composed of 113 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:28:44] [INFO ] Deduced a trap composed of 95 places in 663 ms of which 2 ms to minimize.
[2024-05-21 16:28:44] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:28:44] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:28:45] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:45] [INFO ] Deduced a trap composed of 115 places in 194 ms of which 3 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:28:47] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 2 ms to minimize.
[2024-05-21 16:28:47] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:28:47] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:28:47] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:28:47] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:28:47] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 2 ms to minimize.
[2024-05-21 16:28:47] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:28:48] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:28:48] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:28:48] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:28:48] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:28:48] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:28:48] [INFO ] Deduced a trap composed of 109 places in 136 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-21 16:28:49] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:28:49] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:28:49] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:28:50] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 60459ms, After SMT, problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Starting structural reductions in LTL mode, iteration 1 : 615/757 places, 536/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62823 ms. Remains : 615/757 places, 536/670 transitions.
Support contains 133 out of 615 places after structural reductions.
[2024-05-21 16:28:50] [INFO ] Flatten gal took : 123 ms
[2024-05-21 16:28:50] [INFO ] Flatten gal took : 47 ms
[2024-05-21 16:28:50] [INFO ] Input system was already deterministic with 536 transitions.
RANDOM walk for 40000 steps (220 resets) in 2016 ms. (19 steps per ms) remains 40/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
[2024-05-21 16:28:52] [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, 40 unsolved
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 264/345 variables, 36/36 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 135/480 variables, 34/71 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 38 unsolved
Problem AtomicPropp71 is UNSAT
At refinement iteration 6 (OVERLAPS) 121/601 variables, 46/117 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 527/1128 variables, 601/718 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1128 variables, 0/718 constraints. Problems are: Problem set: 3 solved, 37 unsolved
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 10 (OVERLAPS) 20/1148 variables, 11/729 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1148 variables, 0/729 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 3/1151 variables, 3/732 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1151 variables, 0/732 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/1151 variables, 0/732 constraints. Problems are: Problem set: 5 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 732 constraints, problems are : Problem set: 5 solved, 35 unsolved in 4035 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 615/615 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 260/321 variables, 32/32 constraints. Problems are: Problem set: 5 solved, 35 unsolved
[2024-05-21 16:28:56] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:28:56] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 106 places in 540 ms of which 8 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 0 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:28:57] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 1 ms to minimize.
[2024-05-21 16:28:58] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 4 ms to minimize.
[2024-05-21 16:28:58] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 1 ms to minimize.
[2024-05-21 16:28:58] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 4 ms to minimize.
[2024-05-21 16:28:58] [INFO ] Deduced a trap composed of 104 places in 388 ms of which 2 ms to minimize.
[2024-05-21 16:28:58] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:28:59] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:28:59] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:28:59] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:28:59] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:28:59] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 20/52 constraints. Problems are: Problem set: 5 solved, 35 unsolved
[2024-05-21 16:28:59] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:28:59] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:29:00] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:29:00] [INFO ] Deduced a trap composed of 107 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:29:00] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 1 ms to minimize.
[2024-05-21 16:29:00] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:29:00] [INFO ] Deduced a trap composed of 108 places in 159 ms of which 2 ms to minimize.
[2024-05-21 16:29:00] [INFO ] Deduced a trap composed of 110 places in 192 ms of which 2 ms to minimize.
[2024-05-21 16:29:01] [INFO ] Deduced a trap composed of 109 places in 756 ms of which 1 ms to minimize.
SMT process timed out in 9626ms, After SMT, problems are : Problem set: 5 solved, 35 unsolved
Fused 35 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (complete) has 1354 edges and 615 vertex of which 614 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 614 transition count 480
Reduce places removed 55 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 559 transition count 477
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 556 transition count 477
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 117 place count 556 transition count 359
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 371 place count 420 transition count 359
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 380 place count 411 transition count 350
Iterating global reduction 3 with 9 rules applied. Total rules applied 389 place count 411 transition count 350
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 667 place count 270 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 668 place count 270 transition count 212
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 669 place count 270 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 670 place count 269 transition count 211
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 678 place count 269 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 679 place count 268 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 680 place count 267 transition count 210
Applied a total of 680 rules in 213 ms. Remains 267 /615 variables (removed 348) and now considering 210/536 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 267/615 places, 210/536 transitions.
RANDOM walk for 40000 steps (2009 resets) in 1151 ms. (34 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4004 steps (41 resets) in 60 ms. (65 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (40 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (45 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (41 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (39 resets) in 60 ms. (65 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (46 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (44 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (35 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (41 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (42 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (42 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (42 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (39 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (44 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (39 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 230479 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :14 out of 32
Probabilistic random walk after 230479 steps, saw 53217 distinct states, run finished after 3006 ms. (steps per millisecond=76 ) properties seen :14
// Phase 1: matrix 210 rows 267 cols
[2024-05-21 16:29:05] [INFO ] Computed 94 invariants in 4 ms
[2024-05-21 16:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 100/133 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 96/229 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 33/262 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 210/472 variables, 262/356 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 5/477 variables, 5/362 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/477 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 362 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 100/133 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 2 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 18/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 5 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 0 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 13/51 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 96/229 variables, 51/102 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 3/105 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 33/262 variables, 23/128 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:10] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
Problem AtomicPropp69 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 19/147 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 2/149 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 1/150 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 2/152 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:12] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 1 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 20/172 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:29:13] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 20/192 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 20/212 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 20/232 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 16 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/262 variables, 20/252 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 5 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 64 places in 617 ms of which 2 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/262 variables, 20/272 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/262 variables, 7/279 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 3 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/262 variables, 19/298 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:29:26] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:29:27] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:29:27] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:29:27] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:29:27] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:29:27] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:29:27] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/262 variables, 15/313 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2024-05-21 16:29:28] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:29:29] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/262 variables, 20/333 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:30] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:30] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/262 variables, 2/335 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/262 variables, 5/340 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/262 variables, 4/344 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/262 variables, 0/344 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 27 (OVERLAPS) 210/472 variables, 262/606 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/472 variables, 1/607 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/472 variables, 15/622 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/472 variables, 1/623 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/472 variables, 2/625 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/472 variables, 0/625 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 33 (OVERLAPS) 5/477 variables, 5/630 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/477 variables, 1/631 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
Problem AtomicPropp15 is UNSAT
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/477 variables, 2/633 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/477 variables, 0/633 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 37 (OVERLAPS) 0/477 variables, 0/633 constraints. Problems are: Problem set: 3 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 633 constraints, problems are : Problem set: 3 solved, 15 unsolved in 33920 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/18 constraints, Known Traps: 255/255 constraints]
After SMT, in 35126ms problems are : Problem set: 3 solved, 15 unsolved
Parikh walk visited 0 properties in 5659 ms.
Support contains 24 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 210/210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 267 transition count 205
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 262 transition count 205
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 262 transition count 199
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 252 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 249 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 249 transition count 196
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 70 place count 230 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 229 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 229 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 228 transition count 187
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 228 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 227 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 226 transition count 185
Applied a total of 77 rules in 44 ms. Remains 226 /267 variables (removed 41) and now considering 185/210 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 226/267 places, 185/210 transitions.
RANDOM walk for 40000 steps (2720 resets) in 740 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (78 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (76 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (79 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (79 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (73 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (71 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (82 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (83 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (74 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (65 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (71 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (84 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (76 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (70 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 389007 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :13 out of 15
Probabilistic random walk after 389007 steps, saw 96293 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :13
// Phase 1: matrix 185 rows 226 cols
[2024-05-21 16:29:49] [INFO ] Computed 90 invariants in 2 ms
[2024-05-21 16:29:49] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:29:49] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 110/191 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 0 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/222 variables, 19/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 185/407 variables, 222/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/411 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/411 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 339 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 226/226 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 110/191 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/222 variables, 19/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 185/407 variables, 222/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/411 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/411 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 342 constraints, problems are : Problem set: 0 solved, 2 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 226/226 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 20/20 constraints]
After SMT, in 1782ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 450 ms.
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 185/185 transitions.
Graph (trivial) has 24 edges and 226 vertex of which 2 / 226 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 225 transition count 177
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 219 transition count 177
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 219 transition count 170
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 210 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 208 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 208 transition count 168
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 52 place count 198 transition count 159
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 198 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 196 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 195 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 194 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 194 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 193 transition count 155
Applied a total of 60 rules in 111 ms. Remains 193 /226 variables (removed 33) and now considering 155/185 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 193/226 places, 155/185 transitions.
RANDOM walk for 40000 steps (1242 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (375 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (415 resets) in 113 ms. (350 steps per ms) remains 1/2 properties
// Phase 1: matrix 155 rows 193 cols
[2024-05-21 16:29:52] [INFO ] Computed 86 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/140 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:29:52] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/177 variables, 33/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:29:52] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:29:52] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:29:52] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 16 ms to minimize.
[2024-05-21 16:29:52] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/189 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 155/344 variables, 189/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/348 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2024-05-21 16:29:53] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/348 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/348 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/140 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/177 variables, 33/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:29:54] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 0 ms to minimize.
[2024-05-21 16:29:54] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 16 ms to minimize.
[2024-05-21 16:29:54] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2024-05-21 16:29:54] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:29:54] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:29:54] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:29:54] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:29:55] [INFO ] Deduced a trap composed of 42 places in 622 ms of which 0 ms to minimize.
[2024-05-21 16:29:55] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:29:55] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/189 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 155/344 variables, 189/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/348 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/348 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/348 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/348 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
After SMT, in 3117ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 155/155 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 193 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 154
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 0 with 2 rules applied. Total rules applied 5 place count 190 transition count 153
Applied a total of 5 rules in 19 ms. Remains 190 /193 variables (removed 3) and now considering 153/155 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 190/193 places, 153/155 transitions.
RANDOM walk for 40000 steps (1257 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (330 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Probably explored full state space saw : 155617 states, properties seen :0
Probabilistic random walk after 473138 steps, saw 155617 distinct states, run finished after 1497 ms. (steps per millisecond=316 ) properties seen :0
Explored full state space saw : 155617 states, properties seen :0
Exhaustive walk after 473138 steps, saw 155617 distinct states, run finished after 1488 ms. (steps per millisecond=317 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:29:58] [INFO ] Flatten gal took : 45 ms
[2024-05-21 16:29:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-19-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:29:58] [INFO ] Flatten gal took : 58 ms
[2024-05-21 16:29:59] [INFO ] Input system was already deterministic with 536 transitions.
Support contains 94 out of 615 places (down from 104) after GAL structural reductions.
Computed a total of 558 stabilizing places and 489 stable transitions
Graph (complete) has 1354 edges and 615 vertex of which 614 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Applied a total of 68 rules in 63 ms. Remains 581 /615 variables (removed 34) and now considering 502/536 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 581/615 places, 502/536 transitions.
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 48 ms
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 32 ms
[2024-05-21 16:29:59] [INFO ] Input system was already deterministic with 502 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 303 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1348 edges and 610 vertex of which 609 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 608 transition count 451
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 531 transition count 451
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 156 place count 531 transition count 325
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 432 place count 381 transition count 325
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 456 place count 357 transition count 301
Iterating global reduction 2 with 24 rules applied. Total rules applied 480 place count 357 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 480 place count 357 transition count 300
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 482 place count 356 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 483 place count 355 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 484 place count 355 transition count 299
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 789 place count 200 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 790 place count 199 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 791 place count 198 transition count 148
Applied a total of 791 rules in 97 ms. Remains 198 /615 variables (removed 417) and now considering 148/536 (removed 388) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 198/615 places, 148/536 transitions.
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 20 ms
[2024-05-21 16:29:59] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 21612 steps (3702 resets) in 267 ms. (80 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 298 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1348 edges and 610 vertex of which 609 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 608 transition count 453
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 533 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 532 transition count 452
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 154 place count 532 transition count 328
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 427 place count 383 transition count 328
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 449 place count 361 transition count 306
Iterating global reduction 3 with 22 rules applied. Total rules applied 471 place count 361 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 471 place count 361 transition count 305
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 473 place count 360 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 474 place count 359 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 475 place count 359 transition count 304
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 299 rules applied. Total rules applied 774 place count 208 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 775 place count 207 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 776 place count 206 transition count 155
Applied a total of 776 rules in 111 ms. Remains 206 /615 variables (removed 409) and now considering 155/536 (removed 381) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 206/615 places, 155/536 transitions.
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:29:59] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 595 transition count 516
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 595 transition count 516
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 588 transition count 509
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 588 transition count 509
Applied a total of 54 rules in 49 ms. Remains 588 /615 variables (removed 27) and now considering 509/536 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 588/615 places, 509/536 transitions.
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:29:59] [INFO ] Flatten gal took : 29 ms
[2024-05-21 16:30:00] [INFO ] Input system was already deterministic with 509 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (complete) has 1354 edges and 615 vertex of which 614 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 614 transition count 467
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 546 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 545 transition count 466
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 139 place count 545 transition count 335
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 425 place count 390 transition count 335
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 446 place count 369 transition count 314
Iterating global reduction 3 with 21 rules applied. Total rules applied 467 place count 369 transition count 314
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 752 place count 224 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 753 place count 223 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 754 place count 223 transition count 173
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 760 place count 223 transition count 173
Applied a total of 760 rules in 77 ms. Remains 223 /615 variables (removed 392) and now considering 173/536 (removed 363) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 223/615 places, 173/536 transitions.
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 21 ms
[2024-05-21 16:30:00] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 126 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 578/615 places, 499/536 transitions.
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 28 ms
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:30:00] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 583 transition count 504
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Applied a total of 70 rules in 126 ms. Remains 580 /615 variables (removed 35) and now considering 501/536 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 580/615 places, 501/536 transitions.
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 27 ms
[2024-05-21 16:30:00] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 303 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 14 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1348 edges and 610 vertex of which 609 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 608 transition count 451
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 531 transition count 451
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 156 place count 531 transition count 323
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 436 place count 379 transition count 323
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 460 place count 355 transition count 299
Iterating global reduction 2 with 24 rules applied. Total rules applied 484 place count 355 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 485 place count 354 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 486 place count 354 transition count 298
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 299 rules applied. Total rules applied 785 place count 202 transition count 151
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 791 place count 202 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 792 place count 201 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 793 place count 200 transition count 150
Applied a total of 793 rules in 115 ms. Remains 200 /615 variables (removed 415) and now considering 150/536 (removed 386) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115 ms. Remains : 200/615 places, 150/536 transitions.
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:30:00] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 583 transition count 504
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Applied a total of 70 rules in 112 ms. Remains 580 /615 variables (removed 35) and now considering 501/536 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 580/615 places, 501/536 transitions.
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 24 ms
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:30:01] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 583 transition count 504
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Applied a total of 70 rules in 140 ms. Remains 580 /615 variables (removed 35) and now considering 501/536 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 580/615 places, 501/536 transitions.
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 41 ms
[2024-05-21 16:30:01] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 120 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 578/615 places, 499/536 transitions.
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 27 ms
[2024-05-21 16:30:01] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 582 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 582 transition count 503
Applied a total of 66 rules in 59 ms. Remains 582 /615 variables (removed 33) and now considering 503/536 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 582/615 places, 503/536 transitions.
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:30:01] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 111 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 578/615 places, 499/536 transitions.
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:30:02] [INFO ] Input system was already deterministic with 499 transitions.
[2024-05-21 16:30:02] [INFO ] Flatten gal took : 47 ms
[2024-05-21 16:30:02] [INFO ] Flatten gal took : 44 ms
[2024-05-21 16:30:02] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-21 16:30:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 615 places, 536 transitions and 1675 arcs took 7 ms.
Total runtime 135612 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-19

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 615
TRANSITIONS: 536
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 2265
MODEL NAME: /home/mcc/execution/417/model
615 places, 536 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

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

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