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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 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 192K 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-20-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717226158267

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:15:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:15:59] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 07:15:59] [INFO ] Transformed 782 places.
[2024-06-01 07:15:59] [INFO ] Transformed 697 transitions.
[2024-06-01 07:15:59] [INFO ] Found NUPN structural information;
[2024-06-01 07:15:59] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 107 place count 612 transition count 545
Iterating global reduction 1 with 93 rules applied. Total rules applied 200 place count 612 transition count 545
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 243 place count 569 transition count 502
Iterating global reduction 1 with 43 rules applied. Total rules applied 286 place count 569 transition count 502
Applied a total of 286 rules in 130 ms. Remains 569 /719 variables (removed 150) and now considering 502/638 (removed 136) transitions.
// Phase 1: matrix 502 rows 569 cols
[2024-06-01 07:16:00] [INFO ] Computed 107 invariants in 32 ms
[2024-06-01 07:16:00] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 07:16:00] [INFO ] Invariant cache hit.
[2024-06-01 07:16:00] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-06-01 07:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 62 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 99 places in 191 ms of which 5 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 4 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 4 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 100 places in 192 ms of which 5 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 85 places in 233 ms of which 10 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 101 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 95 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 108 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 100 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/1071 variables, and 174 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/569 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 67/174 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 9 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 100 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 111 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 96 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 103 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 5 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
Problem TDEAD450 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD486 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 20/254 constraints. Problems are: Problem set: 3 solved, 498 unsolved
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 105 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 20/274 constraints. Problems are: Problem set: 3 solved, 498 unsolved
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 105 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 105 places in 165 ms of which 6 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 100 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 20/294 constraints. Problems are: Problem set: 3 solved, 498 unsolved
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 103 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 104 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 112 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 4 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 4 ms to minimize.
SMT process timed out in 60265ms, After SMT, problems are : Problem set: 3 solved, 498 unsolved
Search for dead transitions found 3 dead transitions in 60294ms
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 : 569/719 places, 499/638 transitions.
Applied a total of 0 rules in 17 ms. Remains 569 /569 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61403 ms. Remains : 569/719 places, 499/638 transitions.
Support contains 95 out of 569 places after structural reductions.
[2024-06-01 07:17:01] [INFO ] Flatten gal took : 81 ms
[2024-06-01 07:17:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:17:01] [INFO ] Flatten gal took : 40 ms
[2024-06-01 07:17:01] [INFO ] Input system was already deterministic with 499 transitions.
Support contains 89 out of 569 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (199 resets) in 1732 ms. (23 steps per ms) remains 23/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 92 ms. (43 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
// Phase 1: matrix 499 rows 569 cols
[2024-06-01 07:17:02] [INFO ] Computed 107 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 397/440 variables, 65/65 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 120/560 variables, 41/106 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1/561 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 493/1054 variables, 561/668 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1054 variables, 0/668 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 9 (OVERLAPS) 13/1067 variables, 7/675 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1067 variables, 0/675 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 1/1068 variables, 1/676 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1068 variables, 0/676 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 0/1068 variables, 0/676 constraints. Problems are: Problem set: 2 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1068/1068 variables, and 676 constraints, problems are : Problem set: 2 solved, 21 unsolved in 2023 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 569/569 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 401/439 variables, 65/65 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 105 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 105 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1068 variables, and 114 constraints, problems are : Problem set: 2 solved, 21 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 0/42 constraints, State Equation: 0/569 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 49/49 constraints]
After SMT, in 7069ms problems are : Problem set: 2 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 499/499 transitions.
Graph (complete) has 1244 edges and 569 vertex of which 566 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 68 place count 566 transition count 429
Reduce places removed 67 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 72 rules applied. Total rules applied 140 place count 499 transition count 424
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 145 place count 494 transition count 424
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 145 place count 494 transition count 318
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 376 place count 369 transition count 318
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 390 place count 355 transition count 304
Iterating global reduction 3 with 14 rules applied. Total rules applied 404 place count 355 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 404 place count 355 transition count 302
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 408 place count 353 transition count 302
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 661 place count 225 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 662 place count 225 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 664 place count 224 transition count 179
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 665 place count 224 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 666 place count 223 transition count 178
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 670 place count 223 transition count 178
Applied a total of 670 rules in 137 ms. Remains 223 /569 variables (removed 346) and now considering 178/499 (removed 321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 223/569 places, 178/499 transitions.
RANDOM walk for 40000 steps (1701 resets) in 719 ms. (55 steps per ms) remains 17/21 properties
BEST_FIRST walk for 4002 steps (51 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (59 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (54 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (50 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (46 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (47 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (59 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (47 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (44 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (31 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (46 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
// Phase 1: matrix 178 rows 223 cols
[2024-06-01 07:17:10] [INFO ] Computed 85 invariants in 2 ms
[2024-06-01 07:17:10] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 146/178 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 41/219 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/221 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 178/399 variables, 221/306 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 2/401 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/401 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 313 constraints, problems are : Problem set: 0 solved, 17 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 223/223 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 146/178 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (OVERLAPS) 41/219 variables, 20/122 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/142 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/148 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 36 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 1/155 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 2/221 variables, 2/157 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 2/159 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/159 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 178/399 variables, 221/380 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/399 variables, 5/385 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/399 variables, 15/400 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/399 variables, 7/407 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/399 variables, 6/413 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/399 variables, 4/417 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 2/419 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/399 variables, 13/432 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/399 variables, 5/437 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/399 variables, 0/437 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 26 (OVERLAPS) 2/401 variables, 2/439 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/401 variables, 1/440 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/401 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 29 (OVERLAPS) 0/401 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 440 constraints, problems are : Problem set: 2 solved, 15 unsolved in 14229 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 223/223 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 112/112 constraints]
After SMT, in 14890ms problems are : Problem set: 2 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 11 properties in 6575 ms.
Support contains 8 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 178/178 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 177
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 2 place count 222 transition count 168
Deduced a syphon composed of 9 places in 12 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 23 place count 210 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 209 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 209 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 209 transition count 166
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 27 place count 208 transition count 166
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 66 place count 188 transition count 147
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 188 transition count 147
Applied a total of 68 rules in 40 ms. Remains 188 /223 variables (removed 35) and now considering 147/178 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 188/223 places, 147/178 transitions.
RANDOM walk for 40000 steps (3298 resets) in 254 ms. (156 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1078 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1037 resets) in 96 ms. (412 steps per ms) remains 1/2 properties
// Phase 1: matrix 147 rows 188 cols
[2024-06-01 07:17:31] [INFO ] Computed 81 invariants in 1 ms
[2024-06-01 07:17:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/148 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/184 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/186 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/333 variables, 186/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/335 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/335 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 188/188 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/148 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/184 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/186 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/333 variables, 186/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/335 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/335 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 188/188 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 220 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=110 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-06-01 07:17:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 24 ms
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:17:32] [INFO ] Input system was already deterministic with 499 transitions.
Support contains 65 out of 569 places (down from 80) after GAL structural reductions.
Computed a total of 496 stabilizing places and 436 stable transitions
Graph (complete) has 1244 edges and 569 vertex of which 566 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1238 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 408
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 479 transition count 408
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 164 place count 479 transition count 295
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 412 place count 344 transition count 295
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 435 place count 321 transition count 272
Iterating global reduction 2 with 23 rules applied. Total rules applied 458 place count 321 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 464 place count 318 transition count 269
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 726 place count 185 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 139
Applied a total of 728 rules in 53 ms. Remains 183 /569 variables (removed 386) and now considering 139/499 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 183/569 places, 139/499 transitions.
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:17:32] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 476
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 476
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 469
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 469
Applied a total of 60 rules in 46 ms. Remains 539 /569 variables (removed 30) and now considering 469/499 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 539/569 places, 469/499 transitions.
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:17:32] [INFO ] Input system was already deterministic with 469 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Graph (trivial) has 278 edges and 569 vertex of which 6 / 569 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 1238 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 560 transition count 409
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 480 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 479 transition count 408
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 164 place count 479 transition count 299
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 403 place count 349 transition count 299
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 424 place count 328 transition count 278
Iterating global reduction 3 with 21 rules applied. Total rules applied 445 place count 328 transition count 278
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 445 place count 328 transition count 275
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 451 place count 325 transition count 275
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 710 place count 194 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 193 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 712 place count 192 transition count 146
Applied a total of 712 rules in 67 ms. Remains 192 /569 variables (removed 377) and now considering 146/499 (removed 353) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 192/569 places, 146/499 transitions.
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:17:32] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 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 1238 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 560 transition count 407
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 478 transition count 407
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 166 place count 478 transition count 295
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 412 place count 344 transition count 295
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 435 place count 321 transition count 272
Iterating global reduction 2 with 23 rules applied. Total rules applied 458 place count 321 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 269
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 464 place count 318 transition count 269
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 726 place count 185 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 139
Applied a total of 728 rules in 56 ms. Remains 183 /569 variables (removed 386) and now considering 139/499 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 183/569 places, 139/499 transitions.
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:17:32] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 475
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 475
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 468
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 468
Applied a total of 62 rules in 60 ms. Remains 538 /569 variables (removed 31) and now considering 468/499 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 538/569 places, 468/499 transitions.
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 476
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 476
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 469
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 469
Applied a total of 60 rules in 60 ms. Remains 539 /569 variables (removed 30) and now considering 469/499 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 539/569 places, 469/499 transitions.
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 469 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 475
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 475
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 468
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 468
Applied a total of 62 rules in 23 ms. Remains 538 /569 variables (removed 31) and now considering 468/499 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 538/569 places, 468/499 transitions.
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Graph (trivial) has 276 edges and 569 vertex of which 6 / 569 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 1238 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 408
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 479 transition count 408
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 164 place count 479 transition count 302
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 397 place count 352 transition count 302
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 418 place count 331 transition count 281
Iterating global reduction 2 with 21 rules applied. Total rules applied 439 place count 331 transition count 281
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 439 place count 331 transition count 278
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 445 place count 328 transition count 278
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 711 place count 193 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 712 place count 192 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 713 place count 191 transition count 146
Applied a total of 713 rules in 44 ms. Remains 191 /569 variables (removed 378) and now considering 146/499 (removed 353) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 191/569 places, 146/499 transitions.
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Graph (trivial) has 281 edges and 569 vertex of which 6 / 569 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 1238 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 560 transition count 407
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 478 transition count 407
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 166 place count 478 transition count 297
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 408 place count 346 transition count 297
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 431 place count 323 transition count 274
Iterating global reduction 2 with 23 rules applied. Total rules applied 454 place count 323 transition count 274
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 454 place count 323 transition count 271
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 460 place count 320 transition count 271
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 726 place count 185 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 727 place count 184 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 728 place count 183 transition count 139
Applied a total of 728 rules in 35 ms. Remains 183 /569 variables (removed 386) and now considering 139/499 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 183/569 places, 139/499 transitions.
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 40000 steps (5122 resets) in 704 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1205 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1000 steps, run visited all 1 properties in 11 ms. (steps per millisecond=90 )
Probabilistic random walk after 1000 steps, saw 455 distinct states, run finished after 14 ms. (steps per millisecond=71 ) properties seen :1
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 548 transition count 478
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 548 transition count 478
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 543 transition count 473
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 543 transition count 473
Applied a total of 52 rules in 24 ms. Remains 543 /569 variables (removed 26) and now considering 473/499 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 543/569 places, 473/499 transitions.
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 473 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Graph (trivial) has 282 edges and 569 vertex of which 6 / 569 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 1238 edges and 564 vertex of which 561 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 560 transition count 408
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 479 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 478 transition count 407
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 166 place count 478 transition count 295
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 412 place count 344 transition count 295
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 435 place count 321 transition count 272
Iterating global reduction 3 with 23 rules applied. Total rules applied 458 place count 321 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 458 place count 321 transition count 269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 464 place count 318 transition count 269
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 728 place count 184 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 183 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 182 transition count 138
Applied a total of 730 rules in 40 ms. Remains 182 /569 variables (removed 387) and now considering 138/499 (removed 361) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 182/569 places, 138/499 transitions.
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:17:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:17:33] [INFO ] Input system was already deterministic with 138 transitions.
RANDOM walk for 27481 steps (3610 resets) in 166 ms. (164 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 549 transition count 479
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 549 transition count 479
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 542 transition count 472
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 542 transition count 472
Applied a total of 54 rules in 37 ms. Remains 542 /569 variables (removed 27) and now considering 472/499 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 542/569 places, 472/499 transitions.
[2024-06-01 07:17:34] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:17:34] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:17:34] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 499/499 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 547 transition count 477
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 547 transition count 477
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 540 transition count 470
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 540 transition count 470
Applied a total of 58 rules in 27 ms. Remains 540 /569 variables (removed 29) and now considering 470/499 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 540/569 places, 470/499 transitions.
[2024-06-01 07:17:34] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:17:34] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:17:34] [INFO ] Input system was already deterministic with 470 transitions.
[2024-06-01 07:17:34] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:17:34] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:17:34] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-01 07:17:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 569 places, 499 transitions and 1555 arcs took 3 ms.
Total runtime 94634 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-20-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-20-CTLFireability-2023-15

BK_STOP 1717226254486

--------------------
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-20-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1663/ctl_0_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1663/ctl_1_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1663/ctl_2_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1663/ctl_3_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1663/ctl_4_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1663/ctl_5_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1663/ctl_6_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1663/ctl_7_
ctl formula name BusinessProcesses-PT-20-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1663/ctl_8_
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-20"
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-20, 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-171620399900602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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