fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694900593
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BusinessProcesses-PT-19

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3645.044 3600000.00 14312369.00 214.50 T??T???????????? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K Mar 5 18:22 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-19-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678648788797

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-19
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:19:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:19:51] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-12 19:19:51] [INFO ] Transformed 772 places.
[2023-03-12 19:19:51] [INFO ] Transformed 685 transitions.
[2023-03-12 19:19:51] [INFO ] Found NUPN structural information;
[2023-03-12 19:19:51] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 15 places in 54 ms
Reduce places removed 15 places and 15 transitions.
Support contains 101 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 96 place count 661 transition count 582
Iterating global reduction 1 with 88 rules applied. Total rules applied 184 place count 661 transition count 582
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 225 place count 620 transition count 541
Iterating global reduction 1 with 41 rules applied. Total rules applied 266 place count 620 transition count 541
Applied a total of 266 rules in 256 ms. Remains 620 /757 variables (removed 137) and now considering 541/670 (removed 129) transitions.
// Phase 1: matrix 541 rows 620 cols
[2023-03-12 19:19:52] [INFO ] Computed 117 place invariants in 53 ms
[2023-03-12 19:19:53] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-03-12 19:19:53] [INFO ] Invariant cache hit.
[2023-03-12 19:19:54] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2023-03-12 19:19:54] [INFO ] Invariant cache hit.
[2023-03-12 19:19:54] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 620/757 places, 541/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2714 ms. Remains : 620/757 places, 541/670 transitions.
Support contains 101 out of 620 places after structural reductions.
[2023-03-12 19:19:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 19:19:55] [INFO ] Flatten gal took : 135 ms
FORMULA BusinessProcesses-PT-19-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 19:19:55] [INFO ] Flatten gal took : 56 ms
[2023-03-12 19:19:55] [INFO ] Input system was already deterministic with 541 transitions.
Support contains 76 out of 620 places (down from 101) after GAL structural reductions.
FORMULA BusinessProcesses-PT-19-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 50) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-12 19:19:55] [INFO ] Invariant cache hit.
[2023-03-12 19:19:57] [INFO ] [Real]Absence check using 70 positive place invariants in 23 ms returned sat
[2023-03-12 19:19:57] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2023-03-12 19:19:57] [INFO ] After 1103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-12 19:19:57] [INFO ] [Nat]Absence check using 70 positive place invariants in 23 ms returned sat
[2023-03-12 19:19:57] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2023-03-12 19:19:58] [INFO ] After 825ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :27
[2023-03-12 19:19:58] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 20 ms to minimize.
[2023-03-12 19:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-12 19:19:59] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:19:59] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 2 ms to minimize.
[2023-03-12 19:19:59] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 2 ms to minimize.
[2023-03-12 19:19:59] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 0 ms to minimize.
[2023-03-12 19:19:59] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 1 ms to minimize.
[2023-03-12 19:20:00] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 13 ms to minimize.
[2023-03-12 19:20:00] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-12 19:20:00] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 0 ms to minimize.
[2023-03-12 19:20:00] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:20:00] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 1 ms to minimize.
[2023-03-12 19:20:01] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 0 ms to minimize.
[2023-03-12 19:20:01] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 1 ms to minimize.
[2023-03-12 19:20:01] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 1 ms to minimize.
[2023-03-12 19:20:01] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 0 ms to minimize.
[2023-03-12 19:20:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2612 ms
[2023-03-12 19:20:01] [INFO ] Deduced a trap composed of 97 places in 238 ms of which 1 ms to minimize.
[2023-03-12 19:20:02] [INFO ] Deduced a trap composed of 111 places in 199 ms of which 1 ms to minimize.
[2023-03-12 19:20:02] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 1 ms to minimize.
[2023-03-12 19:20:02] [INFO ] Deduced a trap composed of 109 places in 203 ms of which 1 ms to minimize.
[2023-03-12 19:20:02] [INFO ] Deduced a trap composed of 101 places in 198 ms of which 1 ms to minimize.
[2023-03-12 19:20:02] [INFO ] Deduced a trap composed of 115 places in 199 ms of which 1 ms to minimize.
[2023-03-12 19:20:03] [INFO ] Deduced a trap composed of 111 places in 189 ms of which 1 ms to minimize.
[2023-03-12 19:20:03] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 0 ms to minimize.
[2023-03-12 19:20:03] [INFO ] Deduced a trap composed of 114 places in 176 ms of which 0 ms to minimize.
[2023-03-12 19:20:03] [INFO ] Deduced a trap composed of 117 places in 226 ms of which 1 ms to minimize.
[2023-03-12 19:20:03] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:20:04] [INFO ] Deduced a trap composed of 116 places in 164 ms of which 0 ms to minimize.
[2023-03-12 19:20:04] [INFO ] Deduced a trap composed of 112 places in 211 ms of which 1 ms to minimize.
[2023-03-12 19:20:04] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 0 ms to minimize.
[2023-03-12 19:20:04] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2023-03-12 19:20:05] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 1 ms to minimize.
[2023-03-12 19:20:05] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 1 ms to minimize.
[2023-03-12 19:20:05] [INFO ] Deduced a trap composed of 96 places in 196 ms of which 1 ms to minimize.
[2023-03-12 19:20:05] [INFO ] Deduced a trap composed of 97 places in 213 ms of which 5 ms to minimize.
[2023-03-12 19:20:05] [INFO ] Deduced a trap composed of 96 places in 221 ms of which 0 ms to minimize.
[2023-03-12 19:20:06] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 1 ms to minimize.
[2023-03-12 19:20:06] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 0 ms to minimize.
[2023-03-12 19:20:06] [INFO ] Deduced a trap composed of 104 places in 176 ms of which 1 ms to minimize.
[2023-03-12 19:20:06] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 1 ms to minimize.
[2023-03-12 19:20:06] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 14 ms to minimize.
[2023-03-12 19:20:07] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 1 ms to minimize.
[2023-03-12 19:20:07] [INFO ] Deduced a trap composed of 103 places in 178 ms of which 1 ms to minimize.
[2023-03-12 19:20:07] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 1 ms to minimize.
[2023-03-12 19:20:07] [INFO ] Deduced a trap composed of 98 places in 169 ms of which 0 ms to minimize.
[2023-03-12 19:20:07] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:20:08] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 1 ms to minimize.
[2023-03-12 19:20:08] [INFO ] Deduced a trap composed of 124 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:20:08] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 0 ms to minimize.
[2023-03-12 19:20:08] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 1 ms to minimize.
[2023-03-12 19:20:08] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 1 ms to minimize.
[2023-03-12 19:20:09] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 1 ms to minimize.
[2023-03-12 19:20:09] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 1 ms to minimize.
[2023-03-12 19:20:09] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 0 ms to minimize.
[2023-03-12 19:20:09] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:20:09] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:20:09] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 10 ms to minimize.
[2023-03-12 19:20:10] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:20:10] [INFO ] Deduced a trap composed of 116 places in 211 ms of which 1 ms to minimize.
[2023-03-12 19:20:10] [INFO ] Deduced a trap composed of 98 places in 211 ms of which 1 ms to minimize.
[2023-03-12 19:20:12] [INFO ] Deduced a trap composed of 95 places in 1838 ms of which 26 ms to minimize.
[2023-03-12 19:20:12] [INFO ] Deduced a trap composed of 98 places in 216 ms of which 1 ms to minimize.
[2023-03-12 19:20:12] [INFO ] Deduced a trap composed of 100 places in 207 ms of which 2 ms to minimize.
[2023-03-12 19:20:13] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 0 ms to minimize.
[2023-03-12 19:20:13] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 14 ms to minimize.
[2023-03-12 19:20:13] [INFO ] Deduced a trap composed of 100 places in 174 ms of which 0 ms to minimize.
[2023-03-12 19:20:13] [INFO ] Deduced a trap composed of 120 places in 204 ms of which 2 ms to minimize.
[2023-03-12 19:20:14] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 1 ms to minimize.
[2023-03-12 19:20:14] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 4 ms to minimize.
[2023-03-12 19:20:14] [INFO ] Deduced a trap composed of 114 places in 194 ms of which 1 ms to minimize.
[2023-03-12 19:20:14] [INFO ] Deduced a trap composed of 115 places in 163 ms of which 0 ms to minimize.
[2023-03-12 19:20:14] [INFO ] Deduced a trap composed of 104 places in 186 ms of which 1 ms to minimize.
[2023-03-12 19:20:15] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 0 ms to minimize.
[2023-03-12 19:20:15] [INFO ] Deduced a trap composed of 118 places in 228 ms of which 1 ms to minimize.
[2023-03-12 19:20:15] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 1 ms to minimize.
[2023-03-12 19:20:15] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 13984 ms
[2023-03-12 19:20:15] [INFO ] Deduced a trap composed of 113 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:20:16] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 1 ms to minimize.
[2023-03-12 19:20:16] [INFO ] Deduced a trap composed of 114 places in 217 ms of which 1 ms to minimize.
[2023-03-12 19:20:16] [INFO ] Deduced a trap composed of 112 places in 208 ms of which 0 ms to minimize.
[2023-03-12 19:20:16] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:20:16] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:20:17] [INFO ] Deduced a trap composed of 124 places in 188 ms of which 13 ms to minimize.
[2023-03-12 19:20:17] [INFO ] Deduced a trap composed of 120 places in 186 ms of which 0 ms to minimize.
[2023-03-12 19:20:17] [INFO ] Deduced a trap composed of 118 places in 168 ms of which 0 ms to minimize.
[2023-03-12 19:20:17] [INFO ] Deduced a trap composed of 121 places in 205 ms of which 1 ms to minimize.
[2023-03-12 19:20:18] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 0 ms to minimize.
[2023-03-12 19:20:18] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 1 ms to minimize.
[2023-03-12 19:20:18] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 1 ms to minimize.
[2023-03-12 19:20:18] [INFO ] Deduced a trap composed of 117 places in 201 ms of which 1 ms to minimize.
[2023-03-12 19:20:18] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 1 ms to minimize.
[2023-03-12 19:20:19] [INFO ] Deduced a trap composed of 120 places in 251 ms of which 1 ms to minimize.
[2023-03-12 19:20:19] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 1 ms to minimize.
[2023-03-12 19:20:19] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 0 ms to minimize.
[2023-03-12 19:20:19] [INFO ] Deduced a trap composed of 120 places in 205 ms of which 0 ms to minimize.
[2023-03-12 19:20:20] [INFO ] Deduced a trap composed of 120 places in 216 ms of which 0 ms to minimize.
[2023-03-12 19:20:20] [INFO ] Deduced a trap composed of 120 places in 215 ms of which 1 ms to minimize.
[2023-03-12 19:20:20] [INFO ] Deduced a trap composed of 118 places in 216 ms of which 1 ms to minimize.
[2023-03-12 19:20:20] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5016 ms
[2023-03-12 19:20:21] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2023-03-12 19:20:21] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2023-03-12 19:20:21] [INFO ] Deduced a trap composed of 103 places in 192 ms of which 1 ms to minimize.
[2023-03-12 19:20:21] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2023-03-12 19:20:21] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 1 ms to minimize.
[2023-03-12 19:20:22] [INFO ] Deduced a trap composed of 108 places in 193 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 19:20:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 19:20:22] [INFO ] After 25092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:28
Fused 28 Parikh solutions to 25 different solutions.
Parikh walk visited 1 properties in 606 ms.
Support contains 37 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 541/541 transitions.
Graph (trivial) has 268 edges and 620 vertex of which 7 / 620 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1338 edges and 614 vertex of which 613 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 613 transition count 467
Reduce places removed 65 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 70 rules applied. Total rules applied 137 place count 548 transition count 462
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 142 place count 543 transition count 462
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 142 place count 543 transition count 353
Deduced a syphon composed of 109 places in 14 ms
Ensure Unique test removed 16 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 376 place count 418 transition count 353
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 392 place count 402 transition count 337
Iterating global reduction 3 with 16 rules applied. Total rules applied 408 place count 402 transition count 337
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 408 place count 402 transition count 335
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 412 place count 400 transition count 335
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 697 place count 256 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 699 place count 255 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 701 place count 255 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 703 place count 253 transition count 194
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 707 place count 253 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 708 place count 252 transition count 193
Applied a total of 708 rules in 264 ms. Remains 252 /620 variables (removed 368) and now considering 193/541 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 252/620 places, 193/541 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 26) seen :24
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 252 cols
[2023-03-12 19:20:23] [INFO ] Computed 98 place invariants in 16 ms
[2023-03-12 19:20:23] [INFO ] [Real]Absence check using 71 positive place invariants in 10 ms returned sat
[2023-03-12 19:20:23] [INFO ] [Real]Absence check using 71 positive and 27 generalized place invariants in 4 ms returned sat
[2023-03-12 19:20:23] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 19:20:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 19:20:23] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:20:23] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:20:23] [INFO ] [Nat]Absence check using 71 positive place invariants in 18 ms returned sat
[2023-03-12 19:20:23] [INFO ] [Nat]Absence check using 71 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-12 19:20:23] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:20:23] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:20:23] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:20:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 147 ms
[2023-03-12 19:20:23] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-12 19:20:23] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 51 ms
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 51 ms
[2023-03-12 19:20:24] [INFO ] Input system was already deterministic with 541 transitions.
Computed a total of 557 stabilizing places and 488 stable transitions
Graph (complete) has 1346 edges and 620 vertex of which 619 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 590 transition count 511
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 590 transition count 511
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 582 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 581 transition count 502
Applied a total of 78 rules in 63 ms. Remains 581 /620 variables (removed 39) and now considering 502/541 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 581/620 places, 502/541 transitions.
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 32 ms
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 50 ms
[2023-03-12 19:20:24] [INFO ] Input system was already deterministic with 502 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 590 transition count 511
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 590 transition count 511
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 582 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 582 transition count 503
Applied a total of 76 rules in 74 ms. Remains 582 /620 variables (removed 38) and now considering 503/541 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 582/620 places, 503/541 transitions.
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 44 ms
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 34 ms
[2023-03-12 19:20:24] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Graph (trivial) has 308 edges and 620 vertex of which 7 / 620 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1339 edges and 614 vertex of which 613 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 612 transition count 448
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 170 place count 528 transition count 448
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 170 place count 528 transition count 326
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 438 place count 382 transition count 326
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 464 place count 356 transition count 300
Iterating global reduction 2 with 26 rules applied. Total rules applied 490 place count 356 transition count 300
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 490 place count 356 transition count 297
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 497 place count 352 transition count 297
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 797 place count 200 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 798 place count 199 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 799 place count 198 transition count 148
Applied a total of 799 rules in 139 ms. Remains 198 /620 variables (removed 422) and now considering 148/541 (removed 393) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 198/620 places, 148/541 transitions.
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 10 ms
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 10 ms
[2023-03-12 19:20:24] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 589 transition count 510
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 589 transition count 510
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 581 transition count 502
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 580 transition count 501
Applied a total of 80 rules in 64 ms. Remains 580 /620 variables (removed 40) and now considering 501/541 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 580/620 places, 501/541 transitions.
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 21 ms
[2023-03-12 19:20:24] [INFO ] Flatten gal took : 19 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Graph (trivial) has 299 edges and 620 vertex of which 7 / 620 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1339 edges and 614 vertex of which 613 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 612 transition count 452
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 162 place count 532 transition count 452
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 162 place count 532 transition count 330
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 429 place count 387 transition count 330
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 454 place count 362 transition count 305
Iterating global reduction 2 with 25 rules applied. Total rules applied 479 place count 362 transition count 305
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 479 place count 362 transition count 302
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 486 place count 358 transition count 302
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 777 place count 211 transition count 158
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 783 place count 211 transition count 158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 784 place count 210 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 785 place count 209 transition count 157
Applied a total of 785 rules in 85 ms. Remains 209 /620 variables (removed 411) and now considering 157/541 (removed 384) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 85 ms. Remains : 209/620 places, 157/541 transitions.
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 9 ms
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 8 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 591 transition count 512
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 591 transition count 512
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 583 transition count 504
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 582 transition count 503
Applied a total of 76 rules in 69 ms. Remains 582 /620 variables (removed 38) and now considering 503/541 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 582/620 places, 503/541 transitions.
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 18 ms
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 19 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 588 transition count 509
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 588 transition count 509
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 579 transition count 500
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 578 transition count 499
Applied a total of 84 rules in 64 ms. Remains 578 /620 variables (removed 42) and now considering 499/541 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 578/620 places, 499/541 transitions.
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 17 ms
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 18 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 590 transition count 511
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 580 transition count 501
Applied a total of 80 rules in 59 ms. Remains 580 /620 variables (removed 40) and now considering 501/541 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 580/620 places, 501/541 transitions.
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 23 ms
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 17 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 590 transition count 511
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 580 transition count 501
Applied a total of 80 rules in 56 ms. Remains 580 /620 variables (removed 40) and now considering 501/541 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 580/620 places, 501/541 transitions.
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 589 transition count 510
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 589 transition count 510
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 580 transition count 501
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 579 transition count 500
Applied a total of 82 rules in 56 ms. Remains 579 /620 variables (removed 41) and now considering 500/541 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 579/620 places, 500/541 transitions.
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 593 transition count 514
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 593 transition count 514
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 584 transition count 505
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 583 transition count 504
Applied a total of 74 rules in 45 ms. Remains 583 /620 variables (removed 37) and now considering 504/541 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 583/620 places, 504/541 transitions.
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:20:25] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:20:25] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Graph (trivial) has 309 edges and 620 vertex of which 7 / 620 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1339 edges and 614 vertex of which 613 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 612 transition count 448
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 528 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 527 transition count 447
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 172 place count 527 transition count 324
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 442 place count 380 transition count 324
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 469 place count 353 transition count 297
Iterating global reduction 3 with 27 rules applied. Total rules applied 496 place count 353 transition count 297
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 496 place count 353 transition count 294
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 503 place count 349 transition count 294
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 795 place count 201 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 796 place count 200 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 797 place count 199 transition count 149
Applied a total of 797 rules in 53 ms. Remains 199 /620 variables (removed 421) and now considering 149/541 (removed 392) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 199/620 places, 149/541 transitions.
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 7 ms
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 6 ms
[2023-03-12 19:20:26] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 593 transition count 514
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 593 transition count 514
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 586 transition count 507
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 586 transition count 507
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 585 transition count 506
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 585 transition count 506
Applied a total of 70 rules in 46 ms. Remains 585 /620 variables (removed 35) and now considering 506/541 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 585/620 places, 506/541 transitions.
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:20:26] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 541/541 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 589 transition count 510
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 589 transition count 510
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 580 transition count 501
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 579 transition count 500
Applied a total of 82 rules in 57 ms. Remains 579 /620 variables (removed 41) and now considering 500/541 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 579/620 places, 500/541 transitions.
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 11 ms
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 12 ms
[2023-03-12 19:20:26] [INFO ] Input system was already deterministic with 500 transitions.
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:20:26] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:20:26] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-12 19:20:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 620 places, 541 transitions and 1685 arcs took 3 ms.
Total runtime 34886 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/813/ctl_0_ --ctl=/tmp/813/ctl_1_ --ctl=/tmp/813/ctl_2_ --ctl=/tmp/813/ctl_3_ --ctl=/tmp/813/ctl_4_ --ctl=/tmp/813/ctl_5_ --ctl=/tmp/813/ctl_6_ --ctl=/tmp/813/ctl_7_ --ctl=/tmp/813/ctl_8_ --ctl=/tmp/813/ctl_9_ --ctl=/tmp/813/ctl_10_ --ctl=/tmp/813/ctl_11_ --ctl=/tmp/813/ctl_12_ --ctl=/tmp/813/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12500088 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100704 kB

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:
++ 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-19"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-19, 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 r041-tajo-167813694900593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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