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-167813695800473.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-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:43 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 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 79K 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-04-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678727735247

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-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:15:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:15:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:15:37] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-13 17:15:37] [INFO ] Transformed 288 places.
[2023-03-13 17:15:37] [INFO ] Transformed 283 transitions.
[2023-03-13 17:15:37] [INFO ] Found NUPN structural information;
[2023-03-13 17:15:37] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 284 transition count 281
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 252 transition count 249
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 252 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 252 transition count 248
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 243 transition count 239
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 243 transition count 239
Applied a total of 85 rules in 67 ms. Remains 243 /286 variables (removed 43) and now considering 239/281 (removed 42) transitions.
// Phase 1: matrix 239 rows 243 cols
[2023-03-13 17:15:37] [INFO ] Computed 42 place invariants in 12 ms
[2023-03-13 17:15:37] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-13 17:15:37] [INFO ] Invariant cache hit.
[2023-03-13 17:15:38] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2023-03-13 17:15:38] [INFO ] Invariant cache hit.
[2023-03-13 17:15:38] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/286 places, 239/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 839 ms. Remains : 243/286 places, 239/281 transitions.
Support contains 80 out of 243 places after structural reductions.
[2023-03-13 17:15:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 17:15:38] [INFO ] Flatten gal took : 42 ms
[2023-03-13 17:15:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-04-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:15:38] [INFO ] Flatten gal took : 19 ms
[2023-03-13 17:15:38] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 68 out of 243 places (down from 80) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 46) seen :45
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 17:15:38] [INFO ] Invariant cache hit.
[2023-03-13 17:15:38] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2023-03-13 17:15:38] [INFO ] [Real]Absence check using 19 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-13 17:15:38] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-13 17:15:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 17:15:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:15:38] [INFO ] Input system was already deterministic with 239 transitions.
Computed a total of 219 stabilizing places and 216 stable transitions
Graph (complete) has 585 edges and 243 vertex of which 241 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 223 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 223 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 219 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 219 transition count 216
Applied a total of 47 rules in 16 ms. Remains 219 /243 variables (removed 24) and now considering 216/239 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 219/243 places, 216/239 transitions.
[2023-03-13 17:15:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:15:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:15:38] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Graph (trivial) has 112 edges and 243 vertex of which 6 / 243 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 578 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 235 transition count 207
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 211 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 210 transition count 206
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 52 place count 210 transition count 161
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 148 place count 159 transition count 161
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 164 place count 143 transition count 145
Iterating global reduction 3 with 16 rules applied. Total rules applied 180 place count 143 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 180 place count 143 transition count 141
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 188 place count 139 transition count 141
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 272 place count 97 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 96 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 274 place count 95 transition count 98
Applied a total of 274 rules in 56 ms. Remains 95 /243 variables (removed 148) and now considering 98/239 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 95/243 places, 98/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 224 transition count 221
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 224 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 220 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 220 transition count 217
Applied a total of 45 rules in 16 ms. Remains 220 /243 variables (removed 23) and now considering 217/239 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 220/243 places, 217/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 29 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 223 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 223 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 219 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 219 transition count 216
Applied a total of 47 rules in 33 ms. Remains 219 /243 variables (removed 24) and now considering 216/239 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 219/243 places, 216/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 224 transition count 221
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 224 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 220 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 220 transition count 217
Applied a total of 45 rules in 12 ms. Remains 220 /243 variables (removed 23) and now considering 217/239 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 220/243 places, 217/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 23 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 230 transition count 227
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 230 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 228 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 228 transition count 225
Applied a total of 29 rules in 29 ms. Remains 228 /243 variables (removed 15) and now considering 225/239 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 228/243 places, 225/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 223 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 223 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 219 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 219 transition count 216
Applied a total of 47 rules in 11 ms. Remains 219 /243 variables (removed 24) and now considering 216/239 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 219/243 places, 216/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Graph (trivial) has 103 edges and 243 vertex of which 6 / 243 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 578 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 235 transition count 211
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 215 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 214 transition count 210
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 44 place count 214 transition count 164
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 142 place count 162 transition count 164
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 156 place count 148 transition count 150
Iterating global reduction 3 with 14 rules applied. Total rules applied 170 place count 148 transition count 150
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 170 place count 148 transition count 147
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 145 transition count 147
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 256 place count 105 transition count 107
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 264 place count 105 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 104 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 103 transition count 106
Applied a total of 266 rules in 38 ms. Remains 103 /243 variables (removed 140) and now considering 106/239 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 103/243 places, 106/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 223 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 223 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 219 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 219 transition count 216
Applied a total of 47 rules in 7 ms. Remains 219 /243 variables (removed 24) and now considering 216/239 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 219/243 places, 216/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 228 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 228 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 225 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 225 transition count 221
Applied a total of 36 rules in 22 ms. Remains 225 /243 variables (removed 18) and now considering 221/239 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 225/243 places, 221/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 15 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 223 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 223 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 219 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 219 transition count 216
Applied a total of 47 rules in 22 ms. Remains 219 /243 variables (removed 24) and now considering 216/239 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 219/243 places, 216/239 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 21 ms
[2023-03-13 17:15:39] [INFO ] Input system was already deterministic with 216 transitions.
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:15:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:15:39] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 17:15:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 243 places, 239 transitions and 826 arcs took 2 ms.
Total runtime 2704 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: 243 NrTr: 239 NrArc: 826)

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

net check time: 0m 0.000sec

init dd package: 0m 3.032sec


RS generation: 0m47.053sec


-> reachability set: #nodes 1358202 (1.4e+06) #states 151,818,351,941 (11)



starting MCC model checker
--------------------------

checking: [AF [EX [EX [EX [[0<=p10 & p10<=0]]]]] & AX [1<=0]]
normalized: [~ [EG [~ [EX [EX [EX [[0<=p10 & p10<=0]]]]]]] & ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p10<=0)
states: 64,033,117,353 (10)
abstracting: (0<=p10)
states: 151,818,351,941 (11)
...........
before gc: list nodes free: 1247634

after gc: idd nodes used:4603540, unused:59396460; list nodes free:260032323
........
before gc: list nodes free: 454142

after gc: idd nodes used:3467605, unused:60532395; list nodes free:265952086
.....
before gc: list nodes free: 430762

after gc: idd nodes used:4759707, unused:59240293; list nodes free:259478027
MC time: 5m23.911sec

checking: AF [AG [EX [AG [EF [[p37<=1 & 1<=p37]]]]]]
normalized: ~ [EG [E [true U ~ [EX [~ [E [true U ~ [E [true U [p37<=1 & 1<=p37]]]]]]]]]]

abstracting: (1<=p37)
states: 6,803,989,344 (9)
abstracting: (p37<=1)
states: 151,818,351,941 (11)

before gc: list nodes free: 4736753

after gc: idd nodes used:2229005, unused:61770995; list nodes free:271473341
MC time: 4m54.046sec

checking: EF [AX [[p132<=1 & 1<=p132]]]
normalized: E [true U ~ [EX [~ [[p132<=1 & 1<=p132]]]]]

abstracting: (1<=p132)
states: 18,296,618,451 (10)
abstracting: (p132<=1)
states: 151,818,351,941 (11)
.-> the formula is TRUE

FORMULA BusinessProcesses-PT-04-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m21.465sec

checking: AG [AF [[[p69<=0 & 0<=p69] | [p45<=1 & 1<=p45]]]]
normalized: ~ [E [true U EG [~ [[[p45<=1 & 1<=p45] | [p69<=0 & 0<=p69]]]]]]

abstracting: (0<=p69)
states: 151,818,351,941 (11)
abstracting: (p69<=0)
states: 113,172,560,021 (11)
abstracting: (1<=p45)
states: 15,585,997,104 (10)
abstracting: (p45<=1)
states: 151,818,351,941 (11)
....
before gc: list nodes free: 1451265

after gc: idd nodes used:2914893, unused:61085107; list nodes free:268251683
...................................
EG iterations: 39
-> the formula is FALSE

FORMULA BusinessProcesses-PT-04-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m10.478sec

checking: AF [[EX [AX [[p150<=0 & 0<=p150]]] & EF [EG [[p119<=1 & 1<=p119]]]]]
normalized: ~ [EG [~ [[E [true U EG [[p119<=1 & 1<=p119]]] & EX [~ [EX [~ [[p150<=0 & 0<=p150]]]]]]]]]

abstracting: (0<=p150)
states: 151,818,351,941 (11)
abstracting: (p150<=0)
states: 134,484,151,082 (11)

before gc: list nodes free: 82707

after gc: idd nodes used:3278260, unused:60721740; list nodes free:266903047
..abstracting: (1<=p119)
states: 1,380,194,871 (9)
abstracting: (p119<=1)
states: 151,818,351,941 (11)
..........
before gc: list nodes free: 549052

after gc: idd nodes used:3691327, unused:60308673; list nodes free:265219658
.........................
EG iterations: 35

before gc: list nodes free: 3538714

after gc: idd nodes used:2926063, unused:61073937; list nodes free:268546422
MC time: 5m 3.313sec

checking: ~ [E [AX [1<=0] U [E [AG [[p41<=0 & 0<=p41]] U AX [[p105<=1 & 1<=p105]]] | EX [[~ [[p183<=1 & 1<=p183]] & [p123<=1 & 1<=p123]]]]]]
normalized: ~ [E [~ [EX [~ [1<=0]]] U [EX [[[p123<=1 & 1<=p123] & ~ [[p183<=1 & 1<=p183]]]] | E [~ [E [true U ~ [[p41<=0 & 0<=p41]]]] U ~ [EX [~ [[p105<=1 & 1<=p105]]]]]]]]

abstracting: (1<=p105)
states: 33,473,195,856 (10)
abstracting: (p105<=1)
states: 151,818,351,941 (11)
.abstracting: (0<=p41)
states: 151,818,351,941 (11)
abstracting: (p41<=0)
states: 134,570,863,461 (11)

before gc: list nodes free: 1699242

after gc: idd nodes used:4585060, unused:59414940; list nodes free:261348590
MC time: 4m29.066sec

checking: AX [~ [A [AG [AF [[p154<=0 & 0<=p154]]] U E [~ [[p146<=1 & 1<=p146]] U ~ [E [[p41<=1 & 1<=p41] U [p51<=0 & 0<=p51]]]]]]]
normalized: ~ [EX [[~ [EG [~ [E [~ [[p146<=1 & 1<=p146]] U ~ [E [[p41<=1 & 1<=p41] U [p51<=0 & 0<=p51]]]]]]] & ~ [E [~ [E [~ [[p146<=1 & 1<=p146]] U ~ [E [[p41<=1 & 1<=p41] U [p51<=0 & 0<=p51]]]]] U [E [true U EG [~ [[p154<=0 & 0<=p154]]]] & ~ [E [~ [[p146<=1 & 1<=p146]] U ~ [E [[p41<=1 & 1<=p41] U [p51<=0 & 0<=p51]]]]]]]]]]]

abstracting: (0<=p51)
states: 151,818,351,941 (11)
abstracting: (p51<=0)
states: 151,754,508,173 (11)
abstracting: (1<=p41)
states: 17,247,488,480 (10)
abstracting: (p41<=1)
states: 151,818,351,941 (11)
abstracting: (1<=p146)
states: 18,214,984,734 (10)
abstracting: (p146<=1)
states: 151,818,351,941 (11)
abstracting: (0<=p154)
states: 151,818,351,941 (11)
abstracting: (p154<=0)
states: 142,708,891,523 (11)
.........
before gc: list nodes free: 2557833

after gc: idd nodes used:7026761, unused:56973239; list nodes free:250348640
......MC time: 3m59.075sec

checking: E [A [~ [[p131<=1 & 1<=p131]] U E [EX [[[p126<=0 & 0<=p126] | [p206<=1 & 1<=p206]]] U AX [[[p11<=0 & 0<=p11] | [p13<=1 & 1<=p13]]]]] U [p136<=1 & 1<=p136]]
normalized: E [[~ [EG [~ [E [EX [[[p206<=1 & 1<=p206] | [p126<=0 & 0<=p126]]] U ~ [EX [~ [[[p13<=1 & 1<=p13] | [p11<=0 & 0<=p11]]]]]]]]] & ~ [E [~ [E [EX [[[p206<=1 & 1<=p206] | [p126<=0 & 0<=p126]]] U ~ [EX [~ [[[p13<=1 & 1<=p13] | [p11<=0 & 0<=p11]]]]]]] U [[p131<=1 & 1<=p131] & ~ [E [EX [[[p206<=1 & 1<=p206] | [p126<=0 & 0<=p126]]] U ~ [EX [~ [[[p13<=1 & 1<=p13] | [p11<=0 & 0<=p11]]]]]]]]]]] U [p136<=1 & 1<=p136]]

abstracting: (1<=p136)
states: 18,296,618,451 (10)
abstracting: (p136<=1)
states: 151,818,351,941 (11)
abstracting: (0<=p11)
states: 151,818,351,941 (11)
abstracting: (p11<=0)
states: 135,615,132,677 (11)
abstracting: (1<=p13)
states: 7,077,480,768 (9)
abstracting: (p13<=1)
states: 151,818,351,941 (11)
.abstracting: (0<=p126)
states: 151,818,351,941 (11)
abstracting: (p126<=0)
states: 119,783,415,998 (11)
abstracting: (1<=p206)
states: 5,484,556,512 (9)
abstracting: (p206<=1)
states: 151,818,351,941 (11)

before gc: list nodes free: 751157

after gc: idd nodes used:7790148, unused:56209852; list nodes free:249140622
.abstracting: (1<=p131)
states: 52,766,183,094 (10)
abstracting: (p131<=1)
states: 151,818,351,941 (11)
abstracting: (0<=p11)
states: 151,818,351,941 (11)
abstracting: (p11<=0)
states: 135,615,132,677 (11)
abstracting: (1<=p13)
states: 7,077,480,768 (9)
abstracting: (p13<=1)
states: 151,818,351,941 (11)
.abstracting: (0<=p126)
states: 151,818,351,941 (11)
abstracting: (p126<=0)
states: 119,783,415,998 (11)
abstracting: (1<=p206)
states: 5,484,556,512 (9)
abstracting: (p206<=1)
states: 151,818,351,941 (11)
.abstracting: (0<=p11)
states: 151,818,351,941 (11)
abstracting: (p11<=0)
states: 135,615,132,677 (11)
abstracting: (1<=p13)
states: 7,077,480,768 (9)
abstracting: (p13<=1)
states: 151,818,351,941 (11)
.abstracting: (0<=p126)
states: 151,818,351,941 (11)
abstracting: (p126<=0)
states: 119,783,415,998 (11)
abstracting: (1<=p206)
states: 5,484,556,512 (9)
abstracting: (p206<=1)
states: 151,818,351,941 (11)
...........MC time: 3m33.019sec

checking: EF [[AG [[~ [A [[[p143<=0 & 0<=p143] | [p195<=1 & 1<=p195]] U [[p81<=0 & 0<=p81] | [p181<=1 & 1<=p181]]]] & ~ [E [[p190<=1 & 1<=p190] U [[p187<=0 & 0<=p187] | [p41<=1 & 1<=p41]]]]]] | EG [[[p18<=0 & 0<=p18] & [p99<=1 & 1<=p99]]]]]
normalized: E [true U [~ [E [true U ~ [[~ [[~ [EG [~ [[[p181<=1 & 1<=p181] | [p81<=0 & 0<=p81]]]]] & ~ [E [~ [[[p181<=1 & 1<=p181] | [p81<=0 & 0<=p81]]] U [~ [[[p143<=0 & 0<=p143] | [p195<=1 & 1<=p195]]] & ~ [[[p181<=1 & 1<=p181] | [p81<=0 & 0<=p81]]]]]]]] & ~ [E [[p190<=1 & 1<=p190] U [[p41<=1 & 1<=p41] | [p187<=0 & 0<=p187]]]]]]]] | EG [[[p99<=1 & 1<=p99] & [p18<=0 & 0<=p18]]]]]

abstracting: (0<=p18)
states: 151,818,351,941 (11)
abstracting: (p18<=0)
states: 150,529,043,429 (11)
abstracting: (1<=p99)
states: 33,726,734,656 (10)
abstracting: (p99<=1)
states: 151,818,351,941 (11)

before gc: list nodes free: 2485575

after gc: idd nodes used:6844995, unused:57155005; list nodes free:253764237
.................
before gc: list nodes free: 1547273

after gc: idd nodes used:8968978, unused:55031022; list nodes free:243939337
...MC time: 3m 9.020sec

checking: E [[EF [[[[p90<=1 & 1<=p90] & ~ [[p142<=1 & 1<=p142]]] | [A [[[p42<=0 & 0<=p42] | [p128<=1 & 1<=p128]] U [p60<=1 & 1<=p60]] | AX [A [[p125<=0 & 0<=p125] U [[p124<=0 & 0<=p124] | [p38<=1 & 1<=p38]]]]]]] | [AF [[p88<=0 & 0<=p88]] | EG [~ [EX [[[p5<=0 & 0<=p5] | [p95<=1 & 1<=p95]]]]]]] U [p60<=1 & 1<=p60]]
normalized: E [[E [true U [[~ [EX [~ [[~ [EG [~ [[[p38<=1 & 1<=p38] | [p124<=0 & 0<=p124]]]]] & ~ [E [~ [[[p38<=1 & 1<=p38] | [p124<=0 & 0<=p124]]] U [~ [[p125<=0 & 0<=p125]] & ~ [[[p38<=1 & 1<=p38] | [p124<=0 & 0<=p124]]]]]]]]]] | [~ [EG [~ [[p60<=1 & 1<=p60]]]] & ~ [E [~ [[p60<=1 & 1<=p60]] U [~ [[[p128<=1 & 1<=p128] | [p42<=0 & 0<=p42]]] & ~ [[p60<=1 & 1<=p60]]]]]]] | [~ [[p142<=1 & 1<=p142]] & [p90<=1 & 1<=p90]]]] | [EG [~ [EX [[[p95<=1 & 1<=p95] | [p5<=0 & 0<=p5]]]]] | ~ [EG [~ [[p88<=0 & 0<=p88]]]]]] U [p60<=1 & 1<=p60]]

abstracting: (1<=p60)
states: 524,395,776 (8)
abstracting: (p60<=1)
states: 151,818,351,941 (11)
abstracting: (0<=p88)
states: 151,818,351,941 (11)
abstracting: (p88<=0)
states: 148,736,481,269 (11)
....................
before gc: list nodes free: 1910711

after gc: idd nodes used:7529389, unused:56470611; list nodes free:252566398
.....................
EG iterations: 41
abstracting: (0<=p5)
states: 151,818,351,941 (11)
abstracting: (p5<=0)
states: 151,814,494,087 (11)
abstracting: (1<=p95)
states: 3,853,845,472 (9)
abstracting: (p95<=1)
states: 151,818,351,941 (11)
...
EG iterations: 2
abstracting: (1<=p90)
states: 3,081,870,816 (9)
abstracting: (p90<=1)
states: 151,818,351,941 (11)
abstracting: (1<=p142)
states: 44,630,927,808 (10)
abstracting: (p142<=1)
states: 151,818,351,941 (11)
abstracting: (1<=p60)
states: 524,395,776 (8)
abstracting: (p60<=1)
states: 151,818,351,941 (11)
abstracting: (0<=p42)
states: 151,818,351,941 (11)
abstracting: (p42<=0)
states: 137,011,268,177 (11)
abstracting: (1<=p128)
states: 17,845,133,046 (10)
abstracting: (p128<=1)
states: 151,818,351,941 (11)
abstracting: (1<=p60)
states: 524,395,776 (8)
abstracting: (p60<=1)
states: 151,818,351,941 (11)
MC time: 2m48.721sec

checking: [AX [[EF [[EF [[p204<=1 & 1<=p204]] & E [[[p100<=0 & 0<=p100] | [p132<=1 & 1<=p132]] U [p185<=0 & 0<=p185]]]] | [EX [[[p93<=0 & 0<=p93] | [[p123<=0 & 0<=p123] & [p58<=1 & 1<=p58]]]] | ~ [A [EX [[[p141<=0 & 0<=p141] | [p135<=1 & 1<=p135]]] U AF [[p30<=1 & 1<=p30]]]]]]] & A [[EF [[~ [[[p192<=0 & 0<=p192] | [[p121<=1 & 1<=p121] | [p106<=1 & 1<=p106]]]] | AX [[[p172<=0 & 0<=p172] | [p208<=1 & 1<=p208]]]]] | [AF [[[p79<=0 & 0<=p79] | [[p144<=1 & 1<=p144] | [p65<=1 & 1<=p65]]]] & [A [[[p168<=0 & 0<=p168] | [p135<=1 & 1<=p135]] U [[p49<=0 & 0<=p49] | [p242<=1 & 1<=p242]]] & [p209<=0 & 0<=p209]]]] U [EG [[p158<=0 & 0<=p158]] & [AG [[p201<=0 & 0<=p201]] | ~ [A [[p159<=1 & 1<=p159] U [[p54<=0 & 0<=p54] | [p220<=1 & 1<=p220]]]]]]]]
normalized: [[~ [EG [~ [[[~ [[~ [EG [~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]]]] & ~ [E [~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]] U [~ [[p159<=1 & 1<=p159]] & ~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]]]]]]] | ~ [E [true U ~ [[p201<=0 & 0<=p201]]]]] & EG [[p158<=0 & 0<=p158]]]]]] & ~ [E [~ [[[~ [[~ [EG [~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]]]] & ~ [E [~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]] U [~ [[p159<=1 & 1<=p159]] & ~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]]]]]]] | ~ [E [true U ~ [[p201<=0 & 0<=p201]]]]] & EG [[p158<=0 & 0<=p158]]]] U [~ [[[[[p209<=0 & 0<=p209] & [~ [EG [~ [[[p242<=1 & 1<=p242] | [p49<=0 & 0<=p49]]]]] & ~ [E [~ [[[p242<=1 & 1<=p242] | [p49<=0 & 0<=p49]]] U [~ [[[p135<=1 & 1<=p135] | [p168<=0 & 0<=p168]]] & ~ [[[p242<=1 & 1<=p242] | [p49<=0 & 0<=p49]]]]]]]] & ~ [EG [~ [[[[p65<=1 & 1<=p65] | [p144<=1 & 1<=p144]] | [p79<=0 & 0<=p79]]]]]] | E [true U [~ [EX [~ [[[p208<=1 & 1<=p208] | [p172<=0 & 0<=p172]]]]] | ~ [[[[p106<=1 & 1<=p106] | [p121<=1 & 1<=p121]] | [p192<=0 & 0<=p192]]]]]]] & ~ [[[~ [[~ [EG [~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]]]] & ~ [E [~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]] U [~ [[p159<=1 & 1<=p159]] & ~ [[[p220<=1 & 1<=p220] | [p54<=0 & 0<=p54]]]]]]]] | ~ [E [true U ~ [[p201<=0 & 0<=p201]]]]] & EG [[p158<=0 & 0<=p158]]]]]]]] & ~ [EX [~ [[[~ [[~ [EG [EG [~ [[p30<=1 & 1<=p30]]]]] & ~ [E [EG [~ [[p30<=1 & 1<=p30]]] U [~ [EX [[[p135<=1 & 1<=p135] | [p141<=0 & 0<=p141]]]] & EG [~ [[p30<=1 & 1<=p30]]]]]]]] | EX [[[[p58<=1 & 1<=p58] & [p123<=0 & 0<=p123]] | [p93<=0 & 0<=p93]]]] | E [true U [E [[[p132<=1 & 1<=p132] | [p100<=0 & 0<=p100]] U [p185<=0 & 0<=p185]] & E [true U [p204<=1 & 1<=p204]]]]]]]]]

abstracting: (1<=p204)
states: 1,828,182,912 (9)
abstracting: (p204<=1)
states: 151,818,351,941 (11)

before gc: list nodes free: 4824980

after gc: idd nodes used:8167639, unused:55832361; list nodes free:250188975
abstracting: (0<=p185)
states: 151,818,351,941 (11)
abstracting: (p185<=0)
states: 141,078,686,357 (11)
abstracting: (0<=p100)
states: 151,818,351,941 (11)
abstracting: (p100<=0)
states: 118,091,617,285 (11)
abstracting: (1<=p132)
states: 18,296,618,451 (10)
abstracting: (p132<=1)
states: 151,818,351,941 (11)
MC time: 2m29.129sec

checking: [AF [EX [EX [EX [[0<=p10 & p10<=0]]]]] & AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] & ~ [EG [~ [EX [EX [EX [[0<=p10 & p10<=0]]]]]]]]

abstracting: (p10<=0)
states: 64,033,117,353 (10)
abstracting: (0<=p10)
states: 151,818,351,941 (11)
.......
before gc: list nodes free: 5947266

after gc: idd nodes used:9585176, unused:54414824; list nodes free:243499689
.........
before gc: list nodes free: 5423406

after gc: idd nodes used:10917379, unused:53082621; list nodes free:237962210
...
before gc: list nodes free: 4480820

after gc: idd nodes used:15481294, unused:48518706; list nodes free:216254803
....
before gc: list nodes free: 4455870

after gc: idd nodes used:11206797, unused:52793203; list nodes free:236910954
....
before gc: list nodes free: 5315346

after gc: idd nodes used:11938453, unused:52061547; list nodes free:232714754
........................
EG iterations: 48
abstracting: (1<=0)
states: 0

before gc: list nodes free: 6624171

after gc: idd nodes used:9398490, unused:54601510; list nodes free:244872290
.-> the formula is FALSE

FORMULA BusinessProcesses-PT-04-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 15m15.264sec

checking: AF [AG [EX [AG [EF [[p37<=1 & 1<=p37]]]]]]
normalized: ~ [EG [E [true U ~ [EX [~ [E [true U ~ [E [true U [p37<=1 & 1<=p37]]]]]]]]]]

abstracting: (1<=p37)
states: 6,803,989,344 (9)
abstracting: (p37<=1)
states: 151,818,351,941 (11)

before gc: list nodes free: 6742794

after gc: idd nodes used:8817912, unused:55182088; list nodes free:247393650
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6097568 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100972 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:
++ 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
++ sed s/.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.000sec


iterations count:24795 (103), effective:1962 (8)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 322 sec


iterations count:7070 (29), effective:310 (1)

sat_reach.icc:155: Timeout: after 293 sec


iterations count:7804 (32), effective:256 (1)

iterations count:1908 (7), effective:94 (0)

iterations count:351 (1), effective:10 (0)

net_ddint.h:600: Timeout: after 302 sec


sat_reach.icc:155: Timeout: after 268 sec


iterations count:268 (1), effective:1 (0)

iterations count:1429 (5), effective:72 (0)

net_ddint.h:600: Timeout: after 238 sec


iterations count:924 (3), effective:73 (0)

iterations count:924 (3), effective:73 (0)

iterations count:246 (1), effective:1 (0)

iterations count:924 (3), effective:73 (0)

net_ddint.h:600: Timeout: after 212 sec


net_ddint.h:600: Timeout: after 188 sec


sat_reach.icc:155: Timeout: after 167 sec


iterations count:5603 (23), effective:223 (0)

iterations count:308 (1), effective:7 (0)

sat_reach.icc:155: Timeout: after 148 sec


iterations count:7070 (29), effective:310 (1)

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-04"
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-04, 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-167813695800473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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