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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717225962210

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:12:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:12:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:12:43] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-01 07:12:43] [INFO ] Transformed 638 places.
[2024-06-01 07:12:43] [INFO ] Transformed 578 transitions.
[2024-06-01 07:12:43] [INFO ] Found NUPN structural information;
[2024-06-01 07:12:43] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Support contains 125 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 78 place count 552 transition count 497
Iterating global reduction 1 with 73 rules applied. Total rules applied 151 place count 552 transition count 497
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 185 place count 518 transition count 463
Iterating global reduction 1 with 34 rules applied. Total rules applied 219 place count 518 transition count 463
Applied a total of 219 rules in 121 ms. Remains 518 /630 variables (removed 112) and now considering 463/570 (removed 107) transitions.
// Phase 1: matrix 463 rows 518 cols
[2024-06-01 07:12:43] [INFO ] Computed 95 invariants in 30 ms
[2024-06-01 07:12:44] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 07:12:44] [INFO ] Invariant cache hit.
[2024-06-01 07:12:44] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-01 07:12:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/517 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/517 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/518 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 11 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 102 places in 193 ms of which 6 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 116 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 113 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 4 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 112 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 112 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 118 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 102 places in 225 ms of which 8 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 110 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 103 places in 215 ms of which 5 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 96 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 5 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 5 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 4 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 4 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 8 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 120 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 113 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 112 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 4 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 119 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 20/195 constraints. Problems are: Problem set: 3 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/981 variables, and 195 constraints, problems are : Problem set: 3 solved, 459 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/518 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 3 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/517 variables, 37/37 constraints. Problems are: Problem set: 3 solved, 459 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/517 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 459 unsolved
At refinement iteration 2 (OVERLAPS) 1/518 variables, 57/94 constraints. Problems are: Problem set: 3 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/95 constraints. Problems are: Problem set: 3 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 100/195 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 7 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 110 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 20/215 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 20/235 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 20/255 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 113 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 107 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 20/275 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 20/295 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/518 variables, 20/315 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/518 variables, 20/335 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 60355ms, After SMT, problems are : Problem set: 3 solved, 459 unsolved
Search for dead transitions found 3 dead transitions in 60385ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 518/630 places, 460/570 transitions.
Applied a total of 0 rules in 22 ms. Remains 518 /518 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61587 ms. Remains : 518/630 places, 460/570 transitions.
Support contains 125 out of 518 places after structural reductions.
[2024-06-01 07:13:45] [INFO ] Flatten gal took : 77 ms
[2024-06-01 07:13:45] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:13:45] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 124 out of 518 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (265 resets) in 1950 ms. (20 steps per ms) remains 51/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
// Phase 1: matrix 460 rows 518 cols
[2024-06-01 07:13:46] [INFO ] Computed 95 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 283/376 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 40/416 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 93/509 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 5 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 92 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
SMT process timed out in 5185ms, After SMT, problems are : Problem set: 0 solved, 51 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (complete) has 1143 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 517 transition count 416
Reduce places removed 43 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 474 transition count 411
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 97 place count 469 transition count 411
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 97 place count 469 transition count 339
Deduced a syphon composed of 72 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 250 place count 388 transition count 339
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 260 place count 378 transition count 329
Iterating global reduction 3 with 10 rules applied. Total rules applied 270 place count 378 transition count 329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 270 place count 378 transition count 328
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 377 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 273 place count 376 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 274 place count 376 transition count 327
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 467 place count 279 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 468 place count 279 transition count 230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 470 place count 278 transition count 234
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 477 place count 278 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 478 place count 277 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 479 place count 276 transition count 233
Applied a total of 479 rules in 144 ms. Remains 276 /518 variables (removed 242) and now considering 233/460 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 276/518 places, 233/460 transitions.
RANDOM walk for 40000 steps (1516 resets) in 1380 ms. (28 steps per ms) remains 48/51 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 54 ms. (72 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (25 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (28 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (27 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (28 resets) in 102 ms. (38 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (26 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (27 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (27 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (27 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (25 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (26 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (27 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (25 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (27 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (29 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (25 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (27 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (27 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (27 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (27 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (26 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
Interrupted probabilistic random walk after 412315 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :14 out of 48
Probabilistic random walk after 412315 steps, saw 67864 distinct states, run finished after 3005 ms. (steps per millisecond=137 ) properties seen :14
// Phase 1: matrix 233 rows 276 cols
[2024-06-01 07:13:55] [INFO ] Computed 84 invariants in 3 ms
[2024-06-01 07:13:55] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 131/194 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 26/220 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 49/269 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 5 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
Problem AtomicPropp30 is UNSAT
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 3 ms to minimize.
Problem AtomicPropp31 is UNSAT
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 20/182 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
Problem AtomicPropp48 is UNSAT
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
Problem AtomicPropp54 is UNSAT
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 20/202 constraints. Problems are: Problem set: 4 solved, 30 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
Problem AtomicPropp64 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 20/222 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
Problem AtomicPropp45 is UNSAT
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 20/242 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/242 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 233/502 variables, 269/511 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/502 variables, 4/515 constraints. Problems are: Problem set: 7 solved, 27 unsolved
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/502 variables, 7/522 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/522 constraints. Problems are: Problem set: 7 solved, 27 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 19 (OVERLAPS) 7/509 variables, 7/529 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 2/531 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/531 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 0/509 variables, 0/531 constraints. Problems are: Problem set: 10 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 531 constraints, problems are : Problem set: 10 solved, 24 unsolved in 19766 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 276/276 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 167/167 constraints]
Escalating to Integer solving :Problem set: 10 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 104/142 variables, 22/22 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 2/24 constraints. Problems are: Problem set: 10 solved, 24 unsolved
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 62 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 11/35 constraints. Problems are: Problem set: 10 solved, 24 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/36 constraints. Problems are: Problem set: 10 solved, 24 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/37 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/37 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 63/205 variables, 31/68 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 4/72 constraints. Problems are: Problem set: 10 solved, 24 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 20/92 constraints. Problems are: Problem set: 10 solved, 24 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/93 constraints. Problems are: Problem set: 10 solved, 24 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 1/94 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/94 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 63/268 variables, 28/122 constraints. Problems are: Problem set: 10 solved, 24 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 131/253 constraints. Problems are: Problem set: 12 solved, 22 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 20/273 constraints. Problems are: Problem set: 12 solved, 22 unsolved
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 20/293 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/268 variables, 0/293 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 1/269 variables, 1/294 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 30/324 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/269 variables, 0/324 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 233/502 variables, 269/593 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/502 variables, 4/597 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 19/616 constraints. Problems are: Problem set: 12 solved, 22 unsolved
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 20/636 constraints. Problems are: Problem set: 12 solved, 22 unsolved
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/502 variables, 20/656 constraints. Problems are: Problem set: 12 solved, 22 unsolved
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/502 variables, 20/676 constraints. Problems are: Problem set: 12 solved, 22 unsolved
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/502 variables, 13/689 constraints. Problems are: Problem set: 12 solved, 22 unsolved
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/502 variables, 4/693 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/502 variables, 0/693 constraints. Problems are: Problem set: 12 solved, 22 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 30 (OVERLAPS) 7/509 variables, 7/700 constraints. Problems are: Problem set: 13 solved, 21 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/509 variables, 2/702 constraints. Problems are: Problem set: 13 solved, 21 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/509 variables, 2/704 constraints. Problems are: Problem set: 13 solved, 21 unsolved
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/509 variables, 5/709 constraints. Problems are: Problem set: 13 solved, 21 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/509 variables, 0/709 constraints. Problems are: Problem set: 13 solved, 21 unsolved
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
At refinement iteration 35 (OVERLAPS) 0/509 variables, 1/710 constraints. Problems are: Problem set: 13 solved, 21 unsolved
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/509 variables, 6/716 constraints. Problems are: Problem set: 13 solved, 21 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/509 variables, 0/716 constraints. Problems are: Problem set: 13 solved, 21 unsolved
At refinement iteration 38 (OVERLAPS) 0/509 variables, 0/716 constraints. Problems are: Problem set: 13 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 716 constraints, problems are : Problem set: 13 solved, 21 unsolved in 37693 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 276/276 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 21/34 constraints, Known Traps: 331/331 constraints]
After SMT, in 57495ms problems are : Problem set: 13 solved, 21 unsolved
Parikh walk visited 14 properties in 4502 ms.
Support contains 11 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 233/233 transitions.
Graph (trivial) has 72 edges and 276 vertex of which 2 / 276 are part of one of the 1 SCC in 3 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 275 transition count 220
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 264 transition count 220
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 23 place count 264 transition count 192
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 87 place count 228 transition count 192
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 96 place count 219 transition count 183
Ensure Unique test removed 1 places
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 218 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 218 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 217 transition count 182
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 73 rules applied. Total rules applied 181 place count 179 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 178 transition count 158
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 178 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 187 place count 176 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 174 transition count 154
Applied a total of 189 rules in 48 ms. Remains 174 /276 variables (removed 102) and now considering 154/233 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 174/276 places, 154/233 transitions.
RANDOM walk for 40000 steps (1495 resets) in 212 ms. (187 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (680 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 6323 steps (33 resets) in 23 ms. (263 steps per ms) remains 0/2 properties
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:14:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 38 ms
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 32 ms
[2024-06-01 07:14:58] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 67 out of 518 places (down from 87) after GAL structural reductions.
Computed a total of 142 stabilizing places and 135 stable transitions
Graph (complete) has 1143 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (trivial) has 261 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1137 edges and 513 vertex of which 512 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 511 transition count 382
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 441 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 142 place count 441 transition count 281
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 361 place count 323 transition count 281
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 396 place count 288 transition count 246
Ensure Unique test removed 1 places
Iterating global reduction 2 with 36 rules applied. Total rules applied 432 place count 287 transition count 246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 432 place count 287 transition count 242
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 440 place count 283 transition count 242
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 664 place count 169 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 665 place count 168 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 666 place count 167 transition count 131
Applied a total of 666 rules in 49 ms. Remains 167 /518 variables (removed 351) and now considering 131/460 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 167/518 places, 131/460 transitions.
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:14:58] [INFO ] Input system was already deterministic with 131 transitions.
RANDOM walk for 40000 steps (8376 resets) in 558 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2459 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6001 steps, run visited all 1 properties in 24 ms. (steps per millisecond=250 )
Probabilistic random walk after 6001 steps, saw 1831 distinct states, run finished after 27 ms. (steps per millisecond=222 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 481 transition count 423
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 481 transition count 423
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 471 transition count 413
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 471 transition count 413
Applied a total of 94 rules in 47 ms. Remains 471 /518 variables (removed 47) and now considering 413/460 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 471/518 places, 413/460 transitions.
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:14:58] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 483 transition count 425
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 483 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 474 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 474 transition count 416
Applied a total of 88 rules in 47 ms. Remains 474 /518 variables (removed 44) and now considering 416/460 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 474/518 places, 416/460 transitions.
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:14:58] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 483 transition count 425
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 483 transition count 425
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 475 transition count 417
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 475 transition count 417
Applied a total of 86 rules in 46 ms. Remains 475 /518 variables (removed 43) and now considering 417/460 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 475/518 places, 417/460 transitions.
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:14:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 484 transition count 426
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 484 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 475 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 475 transition count 417
Applied a total of 86 rules in 47 ms. Remains 475 /518 variables (removed 43) and now considering 417/460 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 475/518 places, 417/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 424
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 424
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 472 transition count 414
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 472 transition count 414
Applied a total of 92 rules in 18 ms. Remains 472 /518 variables (removed 46) and now considering 414/460 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 472/518 places, 414/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 414 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 484 transition count 426
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 484 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 475 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 475 transition count 417
Applied a total of 86 rules in 18 ms. Remains 475 /518 variables (removed 43) and now considering 417/460 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 475/518 places, 417/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (trivial) has 253 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1137 edges and 513 vertex of which 512 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 511 transition count 385
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 444 transition count 385
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 136 place count 444 transition count 288
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 345 place count 332 transition count 288
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 378 place count 299 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 2 with 34 rules applied. Total rules applied 412 place count 298 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 412 place count 298 transition count 252
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 295 transition count 252
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 642 place count 182 transition count 141
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 648 place count 182 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 649 place count 181 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 180 transition count 140
Applied a total of 650 rules in 52 ms. Remains 180 /518 variables (removed 338) and now considering 140/460 (removed 320) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 180/518 places, 140/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 424
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 473 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 473 transition count 415
Applied a total of 90 rules in 36 ms. Remains 473 /518 variables (removed 45) and now considering 415/460 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 473/518 places, 415/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 486 transition count 428
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 486 transition count 428
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 477 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 477 transition count 419
Applied a total of 82 rules in 43 ms. Remains 477 /518 variables (removed 41) and now considering 419/460 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 477/518 places, 419/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (trivial) has 261 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1137 edges and 513 vertex of which 512 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 511 transition count 381
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 440 transition count 381
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 144 place count 440 transition count 281
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 361 place count 323 transition count 281
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 394 place count 290 transition count 248
Ensure Unique test removed 1 places
Iterating global reduction 2 with 34 rules applied. Total rules applied 428 place count 289 transition count 248
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 428 place count 289 transition count 244
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 436 place count 285 transition count 244
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 664 place count 169 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 665 place count 168 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 666 place count 167 transition count 131
Applied a total of 666 rules in 38 ms. Remains 167 /518 variables (removed 351) and now considering 131/460 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 167/518 places, 131/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 131 transitions.
RANDOM walk for 40000 steps (8466 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2450 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 184 steps, run visited all 1 properties in 5 ms. (steps per millisecond=36 )
Probabilistic random walk after 184 steps, saw 124 distinct states, run finished after 6 ms. (steps per millisecond=30 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 424
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 473 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 473 transition count 415
Applied a total of 90 rules in 29 ms. Remains 473 /518 variables (removed 45) and now considering 415/460 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 473/518 places, 415/460 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:14:59] [INFO ] Input system was already deterministic with 415 transitions.
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:14:59] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:14:59] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 07:14:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 518 places, 460 transitions and 1441 arcs took 3 ms.
Total runtime 136497 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-16-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-16-CTLFireability-2023-15

BK_STOP 1717226100201

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-16-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/2350/ctl_0_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2350/ctl_1_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2350/ctl_2_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/2350/ctl_3_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/2350/ctl_4_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/2350/ctl_5_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/2350/ctl_6_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/2350/ctl_7_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/2350/ctl_8_
ctl formula name BusinessProcesses-PT-16-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/2350/ctl_9_
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-16"
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-16, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;