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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717225526030

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:05:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:05:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:05:27] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-01 07:05:27] [INFO ] Transformed 518 places.
[2024-06-01 07:05:27] [INFO ] Transformed 471 transitions.
[2024-06-01 07:05:27] [INFO ] Found NUPN structural information;
[2024-06-01 07:05:27] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 111 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 464 transition count 417
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 464 transition count 417
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 132 place count 440 transition count 393
Iterating global reduction 0 with 24 rules applied. Total rules applied 156 place count 440 transition count 393
Applied a total of 156 rules in 89 ms. Remains 440 /518 variables (removed 78) and now considering 393/471 (removed 78) transitions.
// Phase 1: matrix 393 rows 440 cols
[2024-06-01 07:05:27] [INFO ] Computed 85 invariants in 27 ms
[2024-06-01 07:05:28] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 07:05:28] [INFO ] Invariant cache hit.
[2024-06-01 07:05:28] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-06-01 07:05:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 2/440 variables, 46/81 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 9 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 5 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:05:39] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 6 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 101 places in 177 ms of which 6 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 105 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
Problem TDEAD295 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 20/205 constraints. Problems are: Problem set: 10 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/833 variables, and 205 constraints, problems are : Problem set: 10 solved, 382 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/440 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 10 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 35/35 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/35 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 2/440 variables, 46/81 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/85 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 120/205 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/225 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/245 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/265 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 4 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/285 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:15] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:06:16] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 20/305 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:06:20] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 20/325 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 99 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 4 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:06:22] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 4 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:23] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 20/345 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 20/365 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:06:28] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
SMT process timed out in 60194ms, After SMT, problems are : Problem set: 10 solved, 382 unsolved
Search for dead transitions found 10 dead transitions in 60216ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 440/518 places, 383/471 transitions.
Applied a total of 0 rules in 26 ms. Remains 440 /440 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61109 ms. Remains : 440/518 places, 383/471 transitions.
Support contains 111 out of 440 places after structural reductions.
[2024-06-01 07:06:29] [INFO ] Flatten gal took : 72 ms
[2024-06-01 07:06:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:06:29] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:06:29] [INFO ] Input system was already deterministic with 383 transitions.
Support contains 78 out of 440 places (down from 111) after GAL structural reductions.
RANDOM walk for 40000 steps (329 resets) in 2181 ms. (18 steps per ms) remains 16/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
// Phase 1: matrix 383 rows 440 cols
[2024-06-01 07:06:30] [INFO ] Computed 85 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 197/223 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 102/325 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 5 (OVERLAPS) 112/437 variables, 36/82 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3/440 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 383/823 variables, 440/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/823 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 525 constraints, problems are : Problem set: 1 solved, 15 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 198/222 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 5/27 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 102/324 variables, 24/51 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 20/71 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:06:33] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 20/91 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 5975ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 188 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 954 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 432 transition count 332
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 390 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 389 transition count 331
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 88 place count 389 transition count 255
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 248 place count 305 transition count 255
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 264 place count 289 transition count 239
Iterating global reduction 3 with 16 rules applied. Total rules applied 280 place count 289 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 280 place count 289 transition count 237
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 284 place count 287 transition count 237
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 478 place count 188 transition count 142
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 3 with 2 rules applied. Total rules applied 480 place count 187 transition count 145
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 482 place count 187 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 484 place count 185 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 485 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 486 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 487 place count 183 transition count 142
Applied a total of 487 rules in 173 ms. Remains 183 /440 variables (removed 257) and now considering 142/383 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 183/440 places, 142/383 transitions.
RANDOM walk for 22810 steps (612 resets) in 393 ms. (57 steps per ms) remains 0/15 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:06:36] [INFO ] Input system was already deterministic with 383 transitions.
Computed a total of 212 stabilizing places and 206 stable transitions
Graph (complete) has 962 edges and 440 vertex of which 438 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 412 transition count 356
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 412 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 404 transition count 348
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 404 transition count 348
Applied a total of 71 rules in 60 ms. Remains 404 /440 variables (removed 36) and now considering 348/383 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 404/440 places, 348/383 transitions.
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:06:36] [INFO ] Input system was already deterministic with 348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 410 transition count 354
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 410 transition count 354
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 401 transition count 345
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 401 transition count 345
Applied a total of 77 rules in 48 ms. Remains 401 /440 variables (removed 39) and now considering 345/383 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 401/440 places, 345/383 transitions.
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:06:36] [INFO ] Input system was already deterministic with 345 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 215 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 431 transition count 320
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 110 place count 377 transition count 235
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 292 place count 280 transition count 235
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 320 place count 252 transition count 207
Iterating global reduction 2 with 28 rules applied. Total rules applied 348 place count 252 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 348 place count 252 transition count 204
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 355 place count 248 transition count 204
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 539 place count 154 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 541 place count 153 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 542 place count 152 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 543 place count 151 transition count 112
Applied a total of 543 rules in 64 ms. Remains 151 /440 variables (removed 289) and now considering 112/383 (removed 271) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 151/440 places, 112/383 transitions.
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:06:36] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 210 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 432 transition count 325
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 382 transition count 325
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 102 place count 382 transition count 239
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 285 place count 285 transition count 239
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 310 place count 260 transition count 214
Iterating global reduction 2 with 25 rules applied. Total rules applied 335 place count 260 transition count 214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 335 place count 260 transition count 211
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 342 place count 256 transition count 211
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 530 place count 160 transition count 119
Applied a total of 530 rules in 40 ms. Remains 160 /440 variables (removed 280) and now considering 119/383 (removed 264) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 160/440 places, 119/383 transitions.
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:06:36] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 215 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 431 transition count 320
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 110 place count 377 transition count 235
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 292 place count 280 transition count 235
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 319 place count 253 transition count 208
Iterating global reduction 2 with 27 rules applied. Total rules applied 346 place count 253 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 346 place count 253 transition count 206
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 351 place count 250 transition count 206
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 541 place count 153 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 543 place count 152 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 151 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 545 place count 150 transition count 111
Applied a total of 545 rules in 45 ms. Remains 150 /440 variables (removed 290) and now considering 111/383 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 150/440 places, 111/383 transitions.
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:06:36] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 409 transition count 353
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 409 transition count 353
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 400 transition count 344
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 400 transition count 344
Applied a total of 79 rules in 46 ms. Remains 400 /440 variables (removed 40) and now considering 344/383 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 400/440 places, 344/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 218 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 431 transition count 319
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 376 transition count 319
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 112 place count 376 transition count 233
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 297 place count 277 transition count 233
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 325 place count 249 transition count 205
Iterating global reduction 2 with 28 rules applied. Total rules applied 353 place count 249 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 353 place count 249 transition count 202
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 360 place count 245 transition count 202
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 544 place count 151 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 150 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 547 place count 149 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 548 place count 148 transition count 110
Applied a total of 548 rules in 43 ms. Remains 148 /440 variables (removed 292) and now considering 110/383 (removed 273) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 148/440 places, 110/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 110 transitions.
RANDOM walk for 2401 steps (491 resets) in 18 ms. (126 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 417 transition count 361
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 417 transition count 361
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 410 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 410 transition count 354
Applied a total of 59 rules in 35 ms. Remains 410 /440 variables (removed 30) and now considering 354/383 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 410/440 places, 354/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 216 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 431 transition count 320
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 110 place count 377 transition count 234
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 295 place count 278 transition count 234
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 323 place count 250 transition count 206
Iterating global reduction 2 with 28 rules applied. Total rules applied 351 place count 250 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 351 place count 250 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 246 transition count 203
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 544 place count 151 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 150 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 547 place count 149 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 548 place count 148 transition count 110
Applied a total of 548 rules in 43 ms. Remains 148 /440 variables (removed 292) and now considering 110/383 (removed 273) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 148/440 places, 110/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 412 transition count 355
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 412 transition count 355
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 404 transition count 347
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 404 transition count 347
Applied a total of 72 rules in 16 ms. Remains 404 /440 variables (removed 36) and now considering 347/383 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 404/440 places, 347/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 409 transition count 353
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 409 transition count 353
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 400 transition count 344
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 400 transition count 344
Applied a total of 79 rules in 22 ms. Remains 400 /440 variables (removed 40) and now considering 344/383 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 400/440 places, 344/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 214 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 431 transition count 321
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 378 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 110 place count 377 transition count 235
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 292 place count 280 transition count 235
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 319 place count 253 transition count 208
Iterating global reduction 3 with 27 rules applied. Total rules applied 346 place count 253 transition count 208
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 346 place count 253 transition count 205
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 353 place count 249 transition count 205
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 541 place count 153 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 543 place count 152 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 151 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 150 transition count 111
Applied a total of 545 rules in 31 ms. Remains 150 /440 variables (removed 290) and now considering 111/383 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 150/440 places, 111/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 418 transition count 362
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 418 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 412 transition count 356
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 412 transition count 356
Applied a total of 55 rules in 23 ms. Remains 412 /440 variables (removed 28) and now considering 356/383 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 412/440 places, 356/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 411 transition count 355
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 411 transition count 355
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 402 transition count 346
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 402 transition count 346
Applied a total of 75 rules in 16 ms. Remains 402 /440 variables (removed 38) and now considering 346/383 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 402/440 places, 346/383 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:37] [INFO ] Input system was already deterministic with 346 transitions.
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:06:37] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:06:37] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:06:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 440 places, 383 transitions and 1199 arcs took 3 ms.
Total runtime 70449 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-2023-15

BK_STOP 1717225598090

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1549/ctl_0_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1549/ctl_1_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1549/ctl_2_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1549/ctl_3_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1549/ctl_4_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1549/ctl_5_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1549/ctl_6_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1549/ctl_7_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1549/ctl_8_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1549/ctl_9_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1549/ctl_10_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1549/ctl_11_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1549/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-10, examination is CTLCardinality"
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-171620399700521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;