Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 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 85K 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-06-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716303656473

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:00:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:00:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:00:58] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 15:00:58] [INFO ] Transformed 376 places.
[2024-05-21 15:00:58] [INFO ] Transformed 297 transitions.
[2024-05-21 15:00:58] [INFO ] Found NUPN structural information;
[2024-05-21 15:00:58] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 118 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 348 transition count 269
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 348 transition count 269
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 338 transition count 259
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 338 transition count 259
Applied a total of 74 rules in 78 ms. Remains 338 /375 variables (removed 37) and now considering 259/296 (removed 37) transitions.
// Phase 1: matrix 259 rows 338 cols
[2024-05-21 15:00:58] [INFO ] Computed 81 invariants in 13 ms
[2024-05-21 15:00:58] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-21 15:00:58] [INFO ] Invariant cache hit.
[2024-05-21 15:00:59] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-21 15:00:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 3/338 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:12] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 17 ms to minimize.
[2024-05-21 15:01:12] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:01:12] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 19 ms to minimize.
[2024-05-21 15:01:12] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:01:12] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 27 ms to minimize.
[2024-05-21 15:01:13] [INFO ] Deduced a trap composed of 63 places in 527 ms of which 6 ms to minimize.
[2024-05-21 15:01:13] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 1 ms to minimize.
[2024-05-21 15:01:13] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 8 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 63 places in 4870 ms of which 27 ms to minimize.
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 56 places in 313 ms of which 1 ms to minimize.
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 1 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 5 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 9 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 2 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 61 places in 1205 ms of which 3 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 3 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:01:24] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 4 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 10 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 3 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:01:27] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 4 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 13 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 6 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/597 variables, and 141 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/338 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 3/338 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 60/141 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:31] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:01:31] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:01:31] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:01:32] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:01:36] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:01:36] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:01:36] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:01:36] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:01:36] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:36] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:01:36] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 4 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 3 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 3 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:39] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:01:39] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:01:39] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 5 ms to minimize.
[2024-05-21 15:01:39] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:01:39] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:01:40] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:01:40] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:01:40] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 5 ms to minimize.
[2024-05-21 15:01:40] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 5 ms to minimize.
[2024-05-21 15:01:40] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 5 ms to minimize.
[2024-05-21 15:01:40] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 5 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 3 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:01:42] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 2 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 4 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:01:44] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:01:45] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:01:46] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:01:46] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:01:46] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 4 ms to minimize.
[2024-05-21 15:01:46] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-05-21 15:01:46] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 5 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 5 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 2 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 2 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:01:47] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 15 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:52] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:01:52] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:01:52] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 4 ms to minimize.
[2024-05-21 15:01:52] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:01:52] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 4 ms to minimize.
[2024-05-21 15:01:52] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 5 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 4 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:01:53] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 4 ms to minimize.
[2024-05-21 15:01:54] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:01:54] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:01:54] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:01:54] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:01:54] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:01:54] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:01:55] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 5 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 3 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 4 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 4 ms to minimize.
[2024-05-21 15:01:56] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 4 ms to minimize.
[2024-05-21 15:01:57] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:01:57] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:01:57] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:01:57] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 15:01:58] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:01:58] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:01:58] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 6 ms to minimize.
[2024-05-21 15:01:59] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:01:59] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:01:59] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
SMT process timed out in 60233ms, After SMT, problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 338/375 places, 259/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61181 ms. Remains : 338/375 places, 259/296 transitions.
Support contains 118 out of 338 places after structural reductions.
[2024-05-21 15:01:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 15:01:59] [INFO ] Flatten gal took : 68 ms
FORMULA BusinessProcesses-PT-06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:01:59] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:01:59] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 111 out of 338 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (411 resets) in 3144 ms. (12 steps per ms) remains 10/73 properties
BEST_FIRST walk for 40004 steps (78 resets) in 269 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (72 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (70 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (73 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (75 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (74 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (69 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (61 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
[2024-05-21 15:02:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 190/214 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 44/258 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 80/338 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 259/597 variables, 338/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 15:02:02] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:02:02] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
Problem AtomicPropp71 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 2/421 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/421 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/597 variables, 0/421 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 421 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 188/209 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:02:03] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:02:05] [INFO ] Deduced a trap composed of 14 places in 1408 ms of which 26 ms to minimize.
[2024-05-21 15:02:05] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-21 15:02:05] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 5/34 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 48/257 variables, 13/47 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 15:02:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:02:06] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
[2024-05-21 15:02:06] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 6 ms to minimize.
[2024-05-21 15:02:06] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:02:06] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 5/54 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SMT process timed out in 6188ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 141 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 642 edges and 333 vertex of which 331 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 331 transition count 216
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 296 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 295 transition count 215
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 74 place count 295 transition count 157
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 195 place count 232 transition count 157
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 212 place count 215 transition count 140
Iterating global reduction 3 with 17 rules applied. Total rules applied 229 place count 215 transition count 140
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 370 place count 143 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 143 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 372 place count 142 transition count 70
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 373 place count 142 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 374 place count 141 transition count 69
Applied a total of 374 rules in 221 ms. Remains 141 /338 variables (removed 197) and now considering 69/259 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 141/338 places, 69/259 transitions.
RANDOM walk for 40000 steps (4789 resets) in 1040 ms. (38 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40001 steps (3195 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1885 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
// Phase 1: matrix 69 rows 141 cols
[2024-05-21 15:02:08] [INFO ] Computed 72 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/106 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/140 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/209 variables, 140/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/210 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/106 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 140/210 variables, and 75 constraints, problems are : Problem set: 2 solved, 0 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 456ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-05-21 15:02:08] [INFO ] Flatten gal took : 38 ms
[2024-05-21 15:02:08] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 259 transitions.
Computed a total of 330 stabilizing places and 250 stable transitions
Graph (complete) has 649 edges and 338 vertex of which 335 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.20 ms
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 315 transition count 238
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 309 transition count 232
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 309 transition count 232
Applied a total of 56 rules in 51 ms. Remains 309 /338 variables (removed 29) and now considering 232/259 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 309/338 places, 232/259 transitions.
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 317 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 311 transition count 234
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 311 transition count 234
Applied a total of 52 rules in 59 ms. Remains 311 /338 variables (removed 27) and now considering 234/259 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 311/338 places, 234/259 transitions.
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 36 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 317 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 311 transition count 234
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 311 transition count 234
Applied a total of 52 rules in 47 ms. Remains 311 /338 variables (removed 27) and now considering 234/259 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 311/338 places, 234/259 transitions.
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 23 ms
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 315 transition count 238
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 309 transition count 232
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 309 transition count 232
Applied a total of 56 rules in 24 ms. Remains 309 /338 variables (removed 29) and now considering 232/259 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 309/338 places, 232/259 transitions.
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 337 transition count 259
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 320 transition count 242
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 320 transition count 242
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 315 transition count 237
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 315 transition count 237
Applied a total of 45 rules in 54 ms. Remains 315 /338 variables (removed 23) and now considering 237/259 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 315/338 places, 237/259 transitions.
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 23 ms
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 237 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 157 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 331 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 330 transition count 211
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 289 transition count 211
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 84 place count 289 transition count 146
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 224 place count 214 transition count 146
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 245 place count 193 transition count 125
Iterating global reduction 2 with 21 rules applied. Total rules applied 266 place count 193 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 420 place count 112 transition count 52
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 422 place count 111 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 110 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 424 place count 109 transition count 50
Applied a total of 424 rules in 74 ms. Remains 109 /338 variables (removed 229) and now considering 50/259 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 109/338 places, 50/259 transitions.
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 16 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 155 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 330 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Discarding 3 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 329 transition count 212
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 290 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 288 transition count 210
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 84 place count 288 transition count 147
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 218 place count 217 transition count 147
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 239 place count 196 transition count 126
Iterating global reduction 3 with 21 rules applied. Total rules applied 260 place count 196 transition count 126
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 390 place count 131 transition count 61
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 392 place count 130 transition count 60
Applied a total of 392 rules in 67 ms. Remains 130 /338 variables (removed 208) and now considering 60/259 (removed 199) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 130/338 places, 60/259 transitions.
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:02:09] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 148 edges and 338 vertex of which 4 / 338 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 646 edges and 335 vertex of which 332 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 332 transition count 217
Reduce places removed 38 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 294 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 291 transition count 214
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 84 place count 291 transition count 152
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 218 place count 219 transition count 152
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 235 place count 202 transition count 135
Iterating global reduction 3 with 17 rules applied. Total rules applied 252 place count 202 transition count 135
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 399 place count 127 transition count 63
Applied a total of 399 rules in 44 ms. Remains 127 /338 variables (removed 211) and now considering 63/259 (removed 196) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 127/338 places, 63/259 transitions.
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 17 ms
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:02:10] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 316 transition count 239
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 316 transition count 239
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 310 transition count 233
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 310 transition count 233
Applied a total of 54 rules in 25 ms. Remains 310 /338 variables (removed 28) and now considering 233/259 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 310/338 places, 233/259 transitions.
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:02:10] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 154 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 330 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 329 transition count 212
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 290 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 289 transition count 211
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 82 place count 289 transition count 148
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 218 place count 216 transition count 148
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 236 place count 198 transition count 130
Iterating global reduction 3 with 18 rules applied. Total rules applied 254 place count 198 transition count 130
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 410 place count 116 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 412 place count 115 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 114 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 113 transition count 54
Applied a total of 414 rules in 59 ms. Remains 113 /338 variables (removed 225) and now considering 54/259 (removed 205) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 113/338 places, 54/259 transitions.
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:10] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 317 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 317 transition count 240
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 312 transition count 235
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 312 transition count 235
Applied a total of 50 rules in 24 ms. Remains 312 /338 variables (removed 26) and now considering 235/259 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 312/338 places, 235/259 transitions.
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:02:10] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 337 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 318 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 318 transition count 240
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 313 transition count 235
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 313 transition count 235
Applied a total of 49 rules in 23 ms. Remains 313 /338 variables (removed 25) and now considering 235/259 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 313/338 places, 235/259 transitions.
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:02:10] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 159 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 330 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 329 transition count 210
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 288 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 287 transition count 209
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 86 place count 287 transition count 144
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 226 place count 212 transition count 144
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 246 place count 192 transition count 124
Iterating global reduction 3 with 20 rules applied. Total rules applied 266 place count 192 transition count 124
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 417 place count 114 transition count 51
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 419 place count 113 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 420 place count 112 transition count 49
Applied a total of 420 rules in 37 ms. Remains 112 /338 variables (removed 226) and now considering 49/259 (removed 210) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 112/338 places, 49/259 transitions.
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:02:10] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:02:10] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:02:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 15:02:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 338 places, 259 transitions and 754 arcs took 16 ms.
Total runtime 72657 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-06

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1380
MODEL NAME: /home/mcc/execution/422/model
338 places, 259 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-06, 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 r047-tajo-171620398300489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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