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.r042-tajo-167813696000601.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 marciexred
Input is BusinessProcesses-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678735414879

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:23:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:23:36] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-13 19:23:36] [INFO ] Transformed 782 places.
[2023-03-13 19:23:36] [INFO ] Transformed 697 transitions.
[2023-03-13 19:23:36] [INFO ] Found NUPN structural information;
[2023-03-13 19:23:36] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 63 places in 18 ms
Reduce places removed 63 places and 59 transitions.
Support contains 126 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 708 transition count 638
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 92 place count 627 transition count 557
Iterating global reduction 1 with 81 rules applied. Total rules applied 173 place count 627 transition count 557
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 206 place count 594 transition count 524
Iterating global reduction 1 with 33 rules applied. Total rules applied 239 place count 594 transition count 524
Applied a total of 239 rules in 113 ms. Remains 594 /719 variables (removed 125) and now considering 524/638 (removed 114) transitions.
// Phase 1: matrix 524 rows 594 cols
[2023-03-13 19:23:37] [INFO ] Computed 110 place invariants in 33 ms
[2023-03-13 19:23:37] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-13 19:23:37] [INFO ] Invariant cache hit.
[2023-03-13 19:23:37] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2023-03-13 19:23:37] [INFO ] Invariant cache hit.
[2023-03-13 19:23:38] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 594/719 places, 524/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1339 ms. Remains : 594/719 places, 524/638 transitions.
Support contains 126 out of 594 places after structural reductions.
[2023-03-13 19:23:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 19:23:38] [INFO ] Flatten gal took : 69 ms
FORMULA BusinessProcesses-PT-20-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:23:38] [INFO ] Flatten gal took : 33 ms
[2023-03-13 19:23:38] [INFO ] Input system was already deterministic with 524 transitions.
Support contains 110 out of 594 places (down from 126) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 65) seen :35
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-13 19:23:39] [INFO ] Invariant cache hit.
[2023-03-13 19:23:40] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-13 19:23:40] [INFO ] [Nat]Absence check using 69 positive place invariants in 20 ms returned sat
[2023-03-13 19:23:40] [INFO ] [Nat]Absence check using 69 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-13 19:23:41] [INFO ] After 910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-13 19:23:42] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 31 ms to minimize.
[2023-03-13 19:23:42] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2023-03-13 19:23:42] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2023-03-13 19:23:42] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2023-03-13 19:23:42] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2023-03-13 19:23:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 859 ms
[2023-03-13 19:23:42] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2023-03-13 19:23:43] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-13 19:23:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2023-03-13 19:23:43] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-03-13 19:23:43] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 0 ms to minimize.
[2023-03-13 19:23:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-03-13 19:23:43] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2023-03-13 19:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-13 19:23:43] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:23:44] [INFO ] Deduced a trap composed of 60 places in 304 ms of which 1 ms to minimize.
[2023-03-13 19:23:44] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 0 ms to minimize.
[2023-03-13 19:23:44] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:23:44] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 0 ms to minimize.
[2023-03-13 19:23:44] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:23:45] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 0 ms to minimize.
[2023-03-13 19:23:45] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:23:45] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 1 ms to minimize.
[2023-03-13 19:23:45] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 1 ms to minimize.
[2023-03-13 19:23:45] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2023-03-13 19:23:45] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2023-03-13 19:23:46] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 0 ms to minimize.
[2023-03-13 19:23:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2248 ms
[2023-03-13 19:23:46] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-13 19:23:46] [INFO ] Deduced a trap composed of 100 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-13 19:23:47] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 1 ms to minimize.
[2023-03-13 19:23:47] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:23:47] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 1 ms to minimize.
[2023-03-13 19:23:47] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2023-03-13 19:23:47] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2023-03-13 19:23:48] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2023-03-13 19:23:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1081 ms
[2023-03-13 19:23:48] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2023-03-13 19:23:48] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:23:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-03-13 19:23:48] [INFO ] Deduced a trap composed of 111 places in 197 ms of which 2 ms to minimize.
[2023-03-13 19:23:49] [INFO ] Deduced a trap composed of 97 places in 280 ms of which 1 ms to minimize.
[2023-03-13 19:23:49] [INFO ] Deduced a trap composed of 110 places in 236 ms of which 1 ms to minimize.
[2023-03-13 19:23:49] [INFO ] Deduced a trap composed of 110 places in 188 ms of which 1 ms to minimize.
[2023-03-13 19:23:49] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 0 ms to minimize.
[2023-03-13 19:23:49] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:23:50] [INFO ] Deduced a trap composed of 113 places in 175 ms of which 2 ms to minimize.
[2023-03-13 19:23:50] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 1 ms to minimize.
[2023-03-13 19:23:50] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 0 ms to minimize.
[2023-03-13 19:23:50] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 0 ms to minimize.
[2023-03-13 19:23:50] [INFO ] Deduced a trap composed of 108 places in 206 ms of which 1 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 1 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 92 places in 217 ms of which 1 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 110 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:23:51] [INFO ] Deduced a trap composed of 102 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:23:52] [INFO ] Deduced a trap composed of 108 places in 190 ms of which 1 ms to minimize.
[2023-03-13 19:23:52] [INFO ] Deduced a trap composed of 110 places in 168 ms of which 2 ms to minimize.
[2023-03-13 19:23:52] [INFO ] Deduced a trap composed of 111 places in 183 ms of which 0 ms to minimize.
[2023-03-13 19:23:52] [INFO ] Deduced a trap composed of 114 places in 165 ms of which 0 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 109 places in 292 ms of which 1 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 1 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 113 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:23:53] [INFO ] Deduced a trap composed of 117 places in 162 ms of which 14 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 2 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 110 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 1 ms to minimize.
[2023-03-13 19:23:54] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 0 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2023-03-13 19:23:55] [INFO ] Deduced a trap composed of 107 places in 273 ms of which 2 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 2 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 105 places in 187 ms of which 12 ms to minimize.
[2023-03-13 19:23:56] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 0 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 109 places in 257 ms of which 0 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 112 places in 220 ms of which 1 ms to minimize.
[2023-03-13 19:23:57] [INFO ] Deduced a trap composed of 115 places in 347 ms of which 2 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 106 places in 254 ms of which 1 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 116 places in 212 ms of which 1 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 0 ms to minimize.
[2023-03-13 19:23:58] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 1 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 115 places in 214 ms of which 1 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 0 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2023-03-13 19:23:59] [INFO ] Deduced a trap composed of 111 places in 209 ms of which 1 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 109 places in 229 ms of which 4 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 112 places in 255 ms of which 1 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 109 places in 215 ms of which 1 ms to minimize.
[2023-03-13 19:24:00] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 1 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 117 places in 218 ms of which 1 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2023-03-13 19:24:01] [INFO ] Deduced a trap composed of 36 places in 296 ms of which 1 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 109 places in 332 ms of which 1 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 106 places in 217 ms of which 1 ms to minimize.
[2023-03-13 19:24:02] [INFO ] Deduced a trap composed of 111 places in 289 ms of which 1 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 1 ms to minimize.
[2023-03-13 19:24:03] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 0 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 103 places in 201 ms of which 1 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 108 places in 257 ms of which 1 ms to minimize.
[2023-03-13 19:24:04] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 0 ms to minimize.
[2023-03-13 19:24:05] [INFO ] Deduced a trap composed of 111 places in 264 ms of which 3 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-13 19:24:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:24:05] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:30
Parikh walk visited 5 properties in 502 ms.
Support contains 42 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 524/524 transitions.
Graph (trivial) has 264 edges and 594 vertex of which 6 / 594 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1268 edges and 589 vertex of which 578 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 578 transition count 436
Reduce places removed 73 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 151 place count 505 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 502 transition count 433
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 154 place count 502 transition count 331
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 374 place count 384 transition count 331
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 395 place count 363 transition count 310
Ensure Unique test removed 1 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 417 place count 362 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 417 place count 362 transition count 308
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 421 place count 360 transition count 308
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 657 place count 242 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 661 place count 240 transition count 197
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 663 place count 240 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 665 place count 238 transition count 195
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 666 place count 238 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 667 place count 237 transition count 194
Applied a total of 667 rules in 199 ms. Remains 237 /594 variables (removed 357) and now considering 194/524 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 237/594 places, 194/524 transitions.
Incomplete random walk after 10000 steps, including 281 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 19:24:06] [INFO ] Flow matrix only has 193 transitions (discarded 1 similar events)
// Phase 1: matrix 193 rows 237 cols
[2023-03-13 19:24:06] [INFO ] Computed 90 place invariants in 11 ms
[2023-03-13 19:24:06] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:24:06] [INFO ] [Nat]Absence check using 63 positive place invariants in 10 ms returned sat
[2023-03-13 19:24:06] [INFO ] [Nat]Absence check using 63 positive and 27 generalized place invariants in 4 ms returned sat
[2023-03-13 19:24:06] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:24:06] [INFO ] After 14ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:06] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-13 19:24:06] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
[2023-03-13 19:24:06] [INFO ] Flatten gal took : 54 ms
[2023-03-13 19:24:06] [INFO ] Flatten gal took : 43 ms
[2023-03-13 19:24:06] [INFO ] Input system was already deterministic with 524 transitions.
Computed a total of 521 stabilizing places and 461 stable transitions
Graph (complete) has 1275 edges and 594 vertex of which 583 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.31 ms
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 43 place count 551 transition count 484
Iterating global reduction 1 with 40 rules applied. Total rules applied 83 place count 551 transition count 484
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 541 transition count 474
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 541 transition count 474
Applied a total of 103 rules in 45 ms. Remains 541 /594 variables (removed 53) and now considering 474/524 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 541/594 places, 474/524 transitions.
[2023-03-13 19:24:06] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:24:06] [INFO ] Flatten gal took : 18 ms
[2023-03-13 19:24:06] [INFO ] Input system was already deterministic with 474 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 555 transition count 488
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 555 transition count 488
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 545 transition count 478
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 545 transition count 478
Applied a total of 95 rules in 71 ms. Remains 545 /594 variables (removed 49) and now considering 478/524 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 545/594 places, 478/524 transitions.
[2023-03-13 19:24:06] [INFO ] Flatten gal took : 40 ms
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 43 ms
[2023-03-13 19:24:07] [INFO ] Input system was already deterministic with 478 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Graph (trivial) has 302 edges and 594 vertex of which 6 / 594 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 1269 edges and 589 vertex of which 578 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 577 transition count 420
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 180 place count 488 transition count 420
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 180 place count 488 transition count 309
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 243 rules applied. Total rules applied 423 place count 356 transition count 309
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 458 place count 321 transition count 274
Ensure Unique test removed 1 places
Iterating global reduction 2 with 36 rules applied. Total rules applied 494 place count 320 transition count 274
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 494 place count 320 transition count 271
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 500 place count 317 transition count 271
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 759 place count 186 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 760 place count 185 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 761 place count 184 transition count 142
Applied a total of 761 rules in 120 ms. Remains 184 /594 variables (removed 410) and now considering 142/524 (removed 382) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 120 ms. Remains : 184/594 places, 142/524 transitions.
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 20 ms
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:24:07] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 553 transition count 486
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 553 transition count 486
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 89 place count 543 transition count 476
Iterating global reduction 1 with 10 rules applied. Total rules applied 99 place count 543 transition count 476
Applied a total of 99 rules in 70 ms. Remains 543 /594 variables (removed 51) and now considering 476/524 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 543/594 places, 476/524 transitions.
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 36 ms
[2023-03-13 19:24:07] [INFO ] Input system was already deterministic with 476 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 555 transition count 488
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 555 transition count 488
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 544 transition count 477
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 544 transition count 477
Applied a total of 97 rules in 51 ms. Remains 544 /594 variables (removed 50) and now considering 477/524 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 544/594 places, 477/524 transitions.
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 21 ms
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 32 ms
[2023-03-13 19:24:07] [INFO ] Input system was already deterministic with 477 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 43 place count 551 transition count 484
Iterating global reduction 1 with 40 rules applied. Total rules applied 83 place count 551 transition count 484
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 94 place count 540 transition count 473
Iterating global reduction 1 with 11 rules applied. Total rules applied 105 place count 540 transition count 473
Applied a total of 105 rules in 52 ms. Remains 540 /594 variables (removed 54) and now considering 473/524 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 540/594 places, 473/524 transitions.
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 27 ms
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:24:07] [INFO ] Input system was already deterministic with 473 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 553 transition count 486
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 553 transition count 486
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 89 place count 543 transition count 476
Iterating global reduction 1 with 10 rules applied. Total rules applied 99 place count 543 transition count 476
Applied a total of 99 rules in 67 ms. Remains 543 /594 variables (removed 51) and now considering 476/524 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 543/594 places, 476/524 transitions.
[2023-03-13 19:24:07] [INFO ] Flatten gal took : 21 ms
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 76 ms
[2023-03-13 19:24:08] [INFO ] Input system was already deterministic with 476 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 550 transition count 483
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 550 transition count 483
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 95 place count 540 transition count 473
Iterating global reduction 1 with 10 rules applied. Total rules applied 105 place count 540 transition count 473
Applied a total of 105 rules in 57 ms. Remains 540 /594 variables (removed 54) and now considering 473/524 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 540/594 places, 473/524 transitions.
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 24 ms
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:24:08] [INFO ] Input system was already deterministic with 473 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 45 place count 549 transition count 482
Iterating global reduction 1 with 42 rules applied. Total rules applied 87 place count 549 transition count 482
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 98 place count 538 transition count 471
Iterating global reduction 1 with 11 rules applied. Total rules applied 109 place count 538 transition count 471
Applied a total of 109 rules in 52 ms. Remains 538 /594 variables (removed 56) and now considering 471/524 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 538/594 places, 471/524 transitions.
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 30 ms
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:24:08] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Graph (trivial) has 301 edges and 594 vertex of which 6 / 594 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 1269 edges and 589 vertex of which 581 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 580 transition count 424
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 176 place count 493 transition count 424
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 176 place count 493 transition count 311
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 422 place count 360 transition count 311
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 457 place count 325 transition count 276
Ensure Unique test removed 1 places
Iterating global reduction 2 with 36 rules applied. Total rules applied 493 place count 324 transition count 276
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 493 place count 324 transition count 273
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 499 place count 321 transition count 273
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 754 place count 192 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 755 place count 191 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 756 place count 190 transition count 146
Applied a total of 756 rules in 106 ms. Remains 190 /594 variables (removed 404) and now considering 146/524 (removed 378) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 107 ms. Remains : 190/594 places, 146/524 transitions.
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:08] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 592 transition count 524
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 41 place count 553 transition count 485
Iterating global reduction 1 with 39 rules applied. Total rules applied 80 place count 553 transition count 485
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 543 transition count 475
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 543 transition count 475
Applied a total of 100 rules in 109 ms. Remains 543 /594 variables (removed 51) and now considering 475/524 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 543/594 places, 475/524 transitions.
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:08] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 592 transition count 524
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 554 transition count 486
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 554 transition count 486
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 545 transition count 477
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 545 transition count 477
Applied a total of 96 rules in 118 ms. Remains 545 /594 variables (removed 49) and now considering 477/524 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 545/594 places, 477/524 transitions.
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 22 ms
[2023-03-13 19:24:08] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:24:08] [INFO ] Input system was already deterministic with 477 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 550 transition count 483
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 550 transition count 483
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 96 place count 539 transition count 472
Iterating global reduction 1 with 11 rules applied. Total rules applied 107 place count 539 transition count 472
Applied a total of 107 rules in 128 ms. Remains 539 /594 variables (removed 55) and now considering 472/524 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 539/594 places, 472/524 transitions.
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 24 ms
[2023-03-13 19:24:09] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 557 transition count 490
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 557 transition count 490
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 79 place count 549 transition count 482
Iterating global reduction 1 with 8 rules applied. Total rules applied 87 place count 549 transition count 482
Applied a total of 87 rules in 80 ms. Remains 549 /594 variables (removed 45) and now considering 482/524 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 549/594 places, 482/524 transitions.
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 9 ms
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 23 ms
[2023-03-13 19:24:09] [INFO ] Input system was already deterministic with 482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 591 transition count 524
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 45 place count 549 transition count 482
Iterating global reduction 1 with 42 rules applied. Total rules applied 87 place count 549 transition count 482
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 98 place count 538 transition count 471
Iterating global reduction 1 with 11 rules applied. Total rules applied 109 place count 538 transition count 471
Applied a total of 109 rules in 41 ms. Remains 538 /594 variables (removed 56) and now considering 471/524 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 538/594 places, 471/524 transitions.
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 9 ms
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:09] [INFO ] Input system was already deterministic with 471 transitions.
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:24:09] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:24:09] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-13 19:24:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 594 places, 524 transitions and 1618 arcs took 13 ms.
Total runtime 33005 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 594 NrTr: 524 NrArc: 1618)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.029sec

net check time: 0m 0.000sec

init dd package: 0m 3.100sec


before gc: list nodes free: 618900

after gc: idd nodes used:38940662, unused:25059338; list nodes free:105796013

RS generation: 27m12.048sec


-> last computed set: #nodes 38940246 (3.9e+07) #states 22,695,302,696,505 (13)


CANNOT_COMPUTE


BK_STOP 1678737112930

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

idd.cc:820: DD Exception: No free nodes

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-20, 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 r042-tajo-167813696000601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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