fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r472-tajo-171620399700522
Last Updated
July 7, 2024

About the Execution of LTSMin+red for BusinessProcesses-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
465.512 80905.00 119770.00 52.30 ??????F?T??????? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 131K 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-10-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225532335

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:05:33] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-01 07:05:33] [INFO ] Transformed 518 places.
[2024-06-01 07:05:33] [INFO ] Transformed 471 transitions.
[2024-06-01 07:05:33] [INFO ] Found NUPN structural information;
[2024-06-01 07:05:33] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 125 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 467 transition count 421
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 467 transition count 421
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 123 place count 445 transition count 399
Iterating global reduction 1 with 22 rules applied. Total rules applied 145 place count 445 transition count 399
Applied a total of 145 rules in 85 ms. Remains 445 /518 variables (removed 73) and now considering 399/471 (removed 72) transitions.
// Phase 1: matrix 399 rows 445 cols
[2024-06-01 07:05:33] [INFO ] Computed 84 invariants in 31 ms
[2024-06-01 07:05:34] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 07:05:34] [INFO ] Invariant cache hit.
[2024-06-01 07:05:34] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2024-06-01 07:05:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/445 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 41 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 102 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 3 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 99 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 102 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 101 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 5 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 110 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 9 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 121 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 5 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 20/224 constraints. Problems are: Problem set: 7 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/844 variables, and 224 constraints, problems are : Problem set: 7 solved, 391 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 7 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 35/35 constraints. Problems are: Problem set: 7 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/445 variables, 45/80 constraints. Problems are: Problem set: 7 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/84 constraints. Problems are: Problem set: 7 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 140/224 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 97 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 102 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 20/244 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 20/264 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 108 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 103 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 20/284 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 105 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 20/304 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 20/324 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 20/344 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 20/364 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:06:29] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:06:29] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:06:29] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:29] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 20/384 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 110 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 105 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 20/404 constraints. Problems are: Problem set: 7 solved, 391 unsolved
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
SMT process timed out in 60239ms, After SMT, problems are : Problem set: 7 solved, 391 unsolved
Search for dead transitions found 7 dead transitions in 60264ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 445/518 places, 392/471 transitions.
Applied a total of 0 rules in 8 ms. Remains 445 /445 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61078 ms. Remains : 445/518 places, 392/471 transitions.
Support contains 125 out of 445 places after structural reductions.
[2024-06-01 07:06:35] [INFO ] Flatten gal took : 79 ms
[2024-06-01 07:06:35] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:06:35] [INFO ] Input system was already deterministic with 392 transitions.
Support contains 122 out of 445 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (328 resets) in 1323 ms. (30 steps per ms) remains 36/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
// Phase 1: matrix 392 rows 445 cols
[2024-06-01 07:06:36] [INFO ] Computed 84 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 272/340 variables, 41/41 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 2/43 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
Problem AtomicPropp34 is UNSAT
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 4 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 2 ms to minimize.
Problem AtomicPropp48 is UNSAT
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 20/63 constraints. Problems are: Problem set: 5 solved, 31 unsolved
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 96 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
Problem AtomicPropp25 is UNSAT
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 2 ms to minimize.
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 20/83 constraints. Problems are: Problem set: 7 solved, 29 unsolved
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 20/103 constraints. Problems are: Problem set: 7 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/837 variables, and 103 constraints, problems are : Problem set: 7 solved, 29 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/49 constraints, Generalized P Invariants (flows): 2/35 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 7 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 287/337 variables, 41/41 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 39/80 constraints. Problems are: Problem set: 7 solved, 29 unsolved
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 104 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 118 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 20/100 constraints. Problems are: Problem set: 7 solved, 29 unsolved
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 102 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 20/120 constraints. Problems are: Problem set: 7 solved, 29 unsolved
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 101 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 104 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 20/140 constraints. Problems are: Problem set: 7 solved, 29 unsolved
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/837 variables, and 148 constraints, problems are : Problem set: 7 solved, 29 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 41/49 constraints, Generalized P Invariants (flows): 0/35 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 0/36 constraints, Known Traps: 107/128 constraints]
After SMT, in 10046ms problems are : Problem set: 7 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 392/392 transitions.
Graph (complete) has 977 edges and 445 vertex of which 444 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 444 transition count 356
Reduce places removed 35 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 409 transition count 353
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 406 transition count 353
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 77 place count 406 transition count 271
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 251 place count 314 transition count 271
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 268 place count 297 transition count 254
Iterating global reduction 3 with 17 rules applied. Total rules applied 285 place count 297 transition count 254
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 173 rules applied. Total rules applied 458 place count 209 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 459 place count 209 transition count 168
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 467 place count 209 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 208 transition count 167
Applied a total of 468 rules in 84 ms. Remains 208 /445 variables (removed 237) and now considering 167/392 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 208/445 places, 167/392 transitions.
RANDOM walk for 40000 steps (2080 resets) in 841 ms. (47 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (50 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (54 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (51 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (52 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (54 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (49 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (51 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (46 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (45 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (50 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (52 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (52 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (51 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (49 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (52 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (50 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (49 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (46 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 829086 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :21 out of 28
Probabilistic random walk after 829086 steps, saw 120961 distinct states, run finished after 3004 ms. (steps per millisecond=275 ) properties seen :21
// Phase 1: matrix 167 rows 208 cols
[2024-06-01 07:06:49] [INFO ] Computed 71 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 108/126 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 28/154 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 7 (OVERLAPS) 49/203 variables, 26/76 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/77 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/78 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 11 (OVERLAPS) 167/370 variables, 203/281 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/281 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/375 variables, 5/286 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 2/288 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 0/288 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/375 variables, 0/288 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 288 constraints, problems are : Problem set: 5 solved, 2 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/92 variables, 14/20 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/154 variables, 24/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/197 variables, 22/66 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 8/74 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 1/75 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/75 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/199 variables, 2/77 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 1/78 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/78 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 165/364 variables, 199/277 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 2/279 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/364 variables, 1/280 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 2/282 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 2/284 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/284 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/372 variables, 7/291 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 2/293 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 0/293 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/374 variables, 1/294 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/374 variables, 0/294 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/375 variables, 2/296 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/375 variables, 0/296 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/375 variables, 0/296 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 296 constraints, problems are : Problem set: 5 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 15/15 constraints]
After SMT, in 1222ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 167/167 transitions.
Graph (trivial) has 43 edges and 208 vertex of which 2 / 208 are part of one of the 1 SCC in 4 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 207 transition count 156
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 198 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 197 transition count 155
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 21 place count 197 transition count 143
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 48 place count 182 transition count 143
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 177 transition count 138
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 177 transition count 138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 99 place count 156 transition count 118
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 156 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 105 place count 153 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 153 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 152 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 152 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 150 transition count 112
Applied a total of 110 rules in 65 ms. Remains 150 /208 variables (removed 58) and now considering 112/167 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 150/208 places, 112/167 transitions.
RANDOM walk for 40000 steps (1238 resets) in 177 ms. (224 steps per ms) remains 1/2 properties
BEST_FIRST walk for 389 steps (1 resets) in 5 ms. (64 steps per ms) remains 0/1 properties
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 50 ms
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:06:51] [INFO ] Input system was already deterministic with 392 transitions.
Support contains 78 out of 445 places (down from 81) after GAL structural reductions.
Computed a total of 223 stabilizing places and 221 stable transitions
Graph (complete) has 977 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 360
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 360
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 401 transition count 348
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 401 transition count 348
Applied a total of 88 rules in 15 ms. Remains 401 /445 variables (removed 44) and now considering 348/392 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 401/445 places, 348/392 transitions.
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 37 ms
[2024-06-01 07:06:51] [INFO ] Input system was already deterministic with 348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 417 transition count 364
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 417 transition count 364
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 409 transition count 356
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 409 transition count 356
Applied a total of 72 rules in 27 ms. Remains 409 /445 variables (removed 36) and now considering 356/392 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 409/445 places, 356/392 transitions.
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:06:51] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 359
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 359
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 347
Applied a total of 90 rules in 29 ms. Remains 400 /445 variables (removed 45) and now considering 347/392 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 400/445 places, 347/392 transitions.
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:51] [INFO ] Input system was already deterministic with 347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 414 transition count 361
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 414 transition count 361
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 403 transition count 350
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 403 transition count 350
Applied a total of 84 rules in 54 ms. Remains 403 /445 variables (removed 42) and now considering 350/392 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 403/445 places, 350/392 transitions.
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:51] [INFO ] Input system was already deterministic with 350 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Graph (trivial) has 218 edges and 445 vertex of which 7 / 445 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 970 edges and 439 vertex of which 438 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 438 transition count 325
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 379 transition count 325
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 120 place count 379 transition count 242
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 299 place count 283 transition count 242
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 325 place count 257 transition count 216
Iterating global reduction 2 with 26 rules applied. Total rules applied 351 place count 257 transition count 216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 351 place count 257 transition count 213
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 253 transition count 213
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 550 place count 155 transition count 119
Applied a total of 550 rules in 42 ms. Remains 155 /445 variables (removed 290) and now considering 119/392 (removed 273) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 155/445 places, 119/392 transitions.
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:06:51] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:06:51] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Graph (complete) has 977 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 443 transition count 341
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 394 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 391 transition count 338
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 105 place count 391 transition count 248
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 297 place count 289 transition count 248
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 327 place count 259 transition count 218
Iterating global reduction 3 with 30 rules applied. Total rules applied 357 place count 259 transition count 218
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 357 place count 259 transition count 215
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 364 place count 255 transition count 215
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 534 place count 168 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 535 place count 167 transition count 131
Applied a total of 535 rules in 98 ms. Remains 167 /445 variables (removed 278) and now considering 131/392 (removed 261) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 98 ms. Remains : 167/445 places, 131/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 420 transition count 367
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 420 transition count 367
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 411 transition count 358
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 411 transition count 358
Applied a total of 68 rules in 49 ms. Remains 411 /445 variables (removed 34) and now considering 358/392 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 411/445 places, 358/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 358 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 359
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 359
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 347
Applied a total of 90 rules in 35 ms. Remains 400 /445 variables (removed 45) and now considering 347/392 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 400/445 places, 347/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 414 transition count 361
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 414 transition count 361
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 402 transition count 349
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 402 transition count 349
Applied a total of 86 rules in 68 ms. Remains 402 /445 variables (removed 43) and now considering 349/392 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 402/445 places, 349/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 360
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 360
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 401 transition count 348
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 401 transition count 348
Applied a total of 88 rules in 47 ms. Remains 401 /445 variables (removed 44) and now considering 348/392 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 401/445 places, 348/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 348 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Graph (trivial) has 218 edges and 445 vertex of which 4 / 445 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 974 edges and 442 vertex of which 441 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 440 transition count 327
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 380 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 378 transition count 325
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 126 place count 378 transition count 243
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 303 place count 283 transition count 243
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 330 place count 256 transition count 216
Iterating global reduction 3 with 27 rules applied. Total rules applied 357 place count 256 transition count 216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 357 place count 256 transition count 213
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 364 place count 252 transition count 213
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 550 place count 157 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 552 place count 156 transition count 121
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 553 place count 156 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 554 place count 155 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 555 place count 154 transition count 120
Applied a total of 555 rules in 69 ms. Remains 154 /445 variables (removed 291) and now considering 120/392 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 154/445 places, 120/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 360
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 360
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 402 transition count 349
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 402 transition count 349
Applied a total of 86 rules in 17 ms. Remains 402 /445 variables (removed 43) and now considering 349/392 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 402/445 places, 349/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 359
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 359
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 347
Applied a total of 90 rules in 16 ms. Remains 400 /445 variables (removed 45) and now considering 347/392 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 400/445 places, 347/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 392/392 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 416 transition count 363
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 416 transition count 363
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 407 transition count 354
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 407 transition count 354
Applied a total of 76 rules in 18 ms. Remains 407 /445 variables (removed 38) and now considering 354/392 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 407/445 places, 354/392 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:06:52] [INFO ] Input system was already deterministic with 354 transitions.
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:06:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:06:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-01 07:06:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 445 places, 392 transitions and 1228 arcs took 3 ms.
Total runtime 79396 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2023-14
Could not compute solution for formula : BusinessProcesses-PT-10-CTLFireability-2023-15

BK_STOP 1717225613240

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1984/ctl_0_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1984/ctl_1_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1984/ctl_2_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1984/ctl_3_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1984/ctl_4_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1984/ctl_5_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1984/ctl_6_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1984/ctl_7_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1984/ctl_8_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1984/ctl_9_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1984/ctl_10_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1984/ctl_11_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1984/ctl_12_
ctl formula name BusinessProcesses-PT-10-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1984/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399700522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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