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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717225946309

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:12:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:12:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:12:27] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-01 07:12:27] [INFO ] Transformed 638 places.
[2024-06-01 07:12:27] [INFO ] Transformed 578 transitions.
[2024-06-01 07:12:27] [INFO ] Found NUPN structural information;
[2024-06-01 07:12:27] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 134 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 627 transition count 570
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 559 transition count 502
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 559 transition count 502
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 173 place count 525 transition count 468
Iterating global reduction 1 with 34 rules applied. Total rules applied 207 place count 525 transition count 468
Applied a total of 207 rules in 124 ms. Remains 525 /630 variables (removed 105) and now considering 468/570 (removed 102) transitions.
// Phase 1: matrix 468 rows 525 cols
[2024-06-01 07:12:28] [INFO ] Computed 97 invariants in 32 ms
[2024-06-01 07:12:28] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 07:12:28] [INFO ] Invariant cache hit.
[2024-06-01 07:12:29] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-06-01 07:12:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 3/525 variables, 58/95 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 31 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 113 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 6 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 113 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 4 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 115 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 4 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
Problem TDEAD368 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/197 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 98 places in 170 ms of which 3 ms to minimize.
SMT process timed out in 30335ms, After SMT, problems are : Problem set: 3 solved, 464 unsolved
Search for dead transitions found 3 dead transitions in 30354ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 525/630 places, 465/570 transitions.
Applied a total of 0 rules in 20 ms. Remains 525 /525 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31543 ms. Remains : 525/630 places, 465/570 transitions.
Support contains 134 out of 525 places after structural reductions.
[2024-06-01 07:12:59] [INFO ] Flatten gal took : 76 ms
[2024-06-01 07:12:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:12:59] [INFO ] Flatten gal took : 40 ms
[2024-06-01 07:13:00] [INFO ] Input system was already deterministic with 465 transitions.
Support contains 117 out of 525 places (down from 134) after GAL structural reductions.
RANDOM walk for 40000 steps (265 resets) in 2215 ms. (18 steps per ms) remains 33/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
// Phase 1: matrix 465 rows 525 cols
[2024-06-01 07:13:01] [INFO ] Computed 97 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 292/346 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 58/404 variables, 17/58 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 111/515 variables, 38/96 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/516 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 459/975 variables, 516/613 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 13/988 variables, 7/620 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/988 variables, 20/640 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
SMT process timed out in 5052ms, After SMT, problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 216 edges and 525 vertex of which 6 / 525 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1144 edges and 520 vertex of which 518 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 518 transition count 405
Reduce places removed 52 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 466 transition count 397
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 458 transition count 397
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 122 place count 458 transition count 314
Deduced a syphon composed of 83 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 179 rules applied. Total rules applied 301 place count 362 transition count 314
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 318 place count 345 transition count 297
Iterating global reduction 3 with 17 rules applied. Total rules applied 335 place count 345 transition count 297
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 335 place count 345 transition count 295
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 339 place count 343 transition count 295
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 554 place count 234 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 556 place count 233 transition count 193
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 558 place count 233 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 232 transition count 192
Applied a total of 559 rules in 179 ms. Remains 232 /525 variables (removed 293) and now considering 192/465 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 232/525 places, 192/465 transitions.
RANDOM walk for 40000 steps (1879 resets) in 1291 ms. (30 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (40 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (35 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (43 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (41 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (35 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (35 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (35 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (31 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (32 resets) in 22 ms. (173 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (39 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (34 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 49 ms. (80 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (35 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 346792 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :21 out of 31
Probabilistic random walk after 346792 steps, saw 66273 distinct states, run finished after 3019 ms. (steps per millisecond=114 ) properties seen :21
// Phase 1: matrix 192 rows 232 cols
[2024-06-01 07:13:10] [INFO ] Computed 80 invariants in 3 ms
[2024-06-01 07:13:10] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 82/103 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 56/159 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/206 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/208 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/210 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 190/400 variables, 210/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 23/423 variables, 21/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 9/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1/424 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/424 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 316 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5358 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 232/232 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/103 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 21 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 7/24 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 56/159 variables, 30/54 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 47/206 variables, 20/74 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 2/76 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/208 variables, 2/78 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/210 variables, 2/80 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 190/400 variables, 210/290 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 4/294 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 7/301 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 1/302 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 0/302 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 23/423 variables, 21/323 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/423 variables, 9/332 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 1/333 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/423 variables, 1/334 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/423 variables, 0/334 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 1/424 variables, 1/335 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/424 variables, 2/337 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/424 variables, 1/338 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/424 variables, 1/339 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/424 variables, 0/339 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 0/424 variables, 0/339 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 339 constraints, problems are : Problem set: 2 solved, 8 unsolved in 2100 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 232/232 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 15/15 constraints]
After SMT, in 7471ms problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 596 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 192/192 transitions.
Graph (complete) has 724 edges and 232 vertex of which 231 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 231 transition count 180
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 219 transition count 180
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 25 place count 219 transition count 170
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 205 transition count 170
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 199 transition count 164
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 199 transition count 164
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 116 place count 170 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 169 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 169 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 168 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 168 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 167 transition count 147
Applied a total of 122 rules in 42 ms. Remains 167 /232 variables (removed 65) and now considering 147/192 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 167/232 places, 147/192 transitions.
RANDOM walk for 40000 steps (9054 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4444 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2856 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2867 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5979 steps, run visited all 3 properties in 44 ms. (steps per millisecond=135 )
Probabilistic random walk after 5979 steps, saw 2184 distinct states, run finished after 48 ms. (steps per millisecond=124 ) properties seen :3
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:13:18] [INFO ] Input system was already deterministic with 465 transitions.
Support contains 106 out of 525 places (down from 110) after GAL structural reductions.
Computed a total of 148 stabilizing places and 139 stable transitions
Graph (complete) has 1151 edges and 525 vertex of which 522 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 ms
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 483 transition count 425
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 483 transition count 425
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 472 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 472 transition count 414
Applied a total of 104 rules in 20 ms. Remains 472 /525 variables (removed 53) and now considering 414/465 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 472/525 places, 414/465 transitions.
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:13:18] [INFO ] Input system was already deterministic with 414 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 254 edges and 525 vertex of which 6 / 525 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 1145 edges and 520 vertex of which 517 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 516 transition count 389
Reduce places removed 68 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 72 rules applied. Total rules applied 142 place count 448 transition count 385
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 444 transition count 385
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 146 place count 444 transition count 285
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 361 place count 329 transition count 285
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 397 place count 293 transition count 249
Ensure Unique test removed 2 places
Iterating global reduction 3 with 38 rules applied. Total rules applied 435 place count 291 transition count 249
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 435 place count 291 transition count 245
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 443 place count 287 transition count 245
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 632 place count 192 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 633 place count 191 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 634 place count 190 transition count 150
Applied a total of 634 rules in 52 ms. Remains 190 /525 variables (removed 335) and now considering 150/465 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 190/525 places, 150/465 transitions.
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:13:18] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 524 transition count 465
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 38 place count 487 transition count 428
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 487 transition count 428
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 477 transition count 418
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 477 transition count 418
Applied a total of 95 rules in 20 ms. Remains 477 /525 variables (removed 48) and now considering 418/465 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 477/525 places, 418/465 transitions.
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:13:18] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 488 transition count 430
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 488 transition count 430
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 81 place count 479 transition count 421
Iterating global reduction 1 with 9 rules applied. Total rules applied 90 place count 479 transition count 421
Applied a total of 90 rules in 18 ms. Remains 479 /525 variables (removed 46) and now considering 421/465 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 479/525 places, 421/465 transitions.
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:13:18] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 265 edges and 525 vertex of which 6 / 525 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 1145 edges and 520 vertex of which 517 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 516 transition count 382
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 441 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 152 place count 441 transition count 281
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 371 place count 323 transition count 281
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 406 place count 288 transition count 246
Ensure Unique test removed 2 places
Iterating global reduction 2 with 37 rules applied. Total rules applied 443 place count 286 transition count 246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 443 place count 286 transition count 242
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 451 place count 282 transition count 242
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 676 place count 168 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 677 place count 167 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 678 place count 166 transition count 130
Applied a total of 678 rules in 38 ms. Remains 166 /525 variables (removed 359) and now considering 130/465 (removed 335) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 166/525 places, 130/465 transitions.
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:13:18] [INFO ] Input system was already deterministic with 130 transitions.
RANDOM walk for 315 steps (66 resets) in 13 ms. (22 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 483 transition count 425
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 483 transition count 425
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 472 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 472 transition count 414
Applied a total of 104 rules in 20 ms. Remains 472 /525 variables (removed 53) and now considering 414/465 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 472/525 places, 414/465 transitions.
[2024-06-01 07:13:18] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 414 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 258 edges and 525 vertex of which 6 / 525 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 1145 edges and 520 vertex of which 517 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 516 transition count 387
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 446 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 146 place count 444 transition count 385
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 146 place count 444 transition count 286
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 360 place count 329 transition count 286
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 394 place count 295 transition count 252
Ensure Unique test removed 2 places
Iterating global reduction 3 with 36 rules applied. Total rules applied 430 place count 293 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 430 place count 293 transition count 248
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 438 place count 289 transition count 248
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 657 place count 178 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 658 place count 177 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 659 place count 176 transition count 139
Applied a total of 659 rules in 39 ms. Remains 176 /525 variables (removed 349) and now considering 139/465 (removed 326) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 176/525 places, 139/465 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 483 transition count 425
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 483 transition count 425
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 472 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 472 transition count 414
Applied a total of 104 rules in 18 ms. Remains 472 /525 variables (removed 53) and now considering 414/465 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 472/525 places, 414/465 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 414 transitions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 493 transition count 435
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 493 transition count 435
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 70 place count 485 transition count 427
Iterating global reduction 1 with 8 rules applied. Total rules applied 78 place count 485 transition count 427
Applied a total of 78 rules in 25 ms. Remains 485 /525 variables (removed 40) and now considering 427/465 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 485/525 places, 427/465 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 262 edges and 525 vertex of which 6 / 525 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 1145 edges and 520 vertex of which 517 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 516 transition count 383
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 442 transition count 383
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 150 place count 442 transition count 284
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 364 place count 327 transition count 284
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 400 place count 291 transition count 248
Ensure Unique test removed 2 places
Iterating global reduction 2 with 38 rules applied. Total rules applied 438 place count 289 transition count 248
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 438 place count 289 transition count 244
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 446 place count 285 transition count 244
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 663 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 664 place count 174 transition count 136
Applied a total of 664 rules in 29 ms. Remains 174 /525 variables (removed 351) and now considering 136/465 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 174/525 places, 136/465 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 491 transition count 433
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 491 transition count 433
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 483 transition count 425
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 483 transition count 425
Applied a total of 82 rules in 18 ms. Remains 483 /525 variables (removed 42) and now considering 425/465 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 483/525 places, 425/465 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 43 place count 482 transition count 424
Iterating global reduction 1 with 41 rules applied. Total rules applied 84 place count 482 transition count 424
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 95 place count 471 transition count 413
Iterating global reduction 1 with 11 rules applied. Total rules applied 106 place count 471 transition count 413
Applied a total of 106 rules in 19 ms. Remains 471 /525 variables (removed 54) and now considering 413/465 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 471/525 places, 413/465 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 486 transition count 428
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 486 transition count 428
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 86 place count 476 transition count 418
Iterating global reduction 1 with 10 rules applied. Total rules applied 96 place count 476 transition count 418
Applied a total of 96 rules in 19 ms. Remains 476 /525 variables (removed 49) and now considering 418/465 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 476/525 places, 418/465 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:13:19] [INFO ] Input system was already deterministic with 418 transitions.
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:13:19] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:13:19] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:13:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 525 places, 465 transitions and 1453 arcs took 3 ms.
Total runtime 51921 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-16-CTLCardinality-2023-15

BK_STOP 1717225999930

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="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-16, 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-171620399800569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "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 ;