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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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.7K 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 59K 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-02-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678726823322

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-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:00:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:00:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:00:25] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-13 17:00:25] [INFO ] Transformed 262 places.
[2023-03-13 17:00:25] [INFO ] Transformed 219 transitions.
[2023-03-13 17:00:25] [INFO ] Found NUPN structural information;
[2023-03-13 17:00:25] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 15 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-02-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 241 transition count 204
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 25 place count 220 transition count 183
Iterating global reduction 1 with 21 rules applied. Total rules applied 46 place count 220 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 215 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 215 transition count 178
Applied a total of 56 rules in 67 ms. Remains 215 /245 variables (removed 30) and now considering 178/204 (removed 26) transitions.
// Phase 1: matrix 178 rows 215 cols
[2023-03-13 17:00:25] [INFO ] Computed 39 place invariants in 10 ms
[2023-03-13 17:00:25] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-13 17:00:25] [INFO ] Invariant cache hit.
[2023-03-13 17:00:25] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-13 17:00:25] [INFO ] Invariant cache hit.
[2023-03-13 17:00:25] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 215/245 places, 178/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 215/245 places, 178/204 transitions.
Support contains 76 out of 215 places after structural reductions.
[2023-03-13 17:00:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 17:00:26] [INFO ] Flatten gal took : 36 ms
[2023-03-13 17:00:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-02-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:00:26] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:00:26] [INFO ] Input system was already deterministic with 178 transitions.
Support contains 68 out of 215 places (down from 76) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 49) seen :32
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-13 17:00:26] [INFO ] Invariant cache hit.
[2023-03-13 17:00:26] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-13 17:00:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-13 17:00:26] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-13 17:00:27] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 9 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2023-03-13 17:00:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 423 ms
[2023-03-13 17:00:27] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-13 17:00:27] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 23 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 178/178 transitions.
Graph (trivial) has 97 edges and 215 vertex of which 6 / 215 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 405 edges and 210 vertex of which 204 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 204 transition count 138
Reduce places removed 28 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 176 transition count 133
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 171 transition count 133
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 68 place count 171 transition count 105
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 128 place count 139 transition count 105
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 130 transition count 96
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 130 transition count 96
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 236 place count 84 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 84 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 83 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 82 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 81 transition count 50
Applied a total of 240 rules in 30 ms. Remains 81 /215 variables (removed 134) and now considering 50/178 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 81/215 places, 50/178 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :15
Finished Best-First random walk after 339 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=169 )
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-13 17:00:27] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:00:27] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 178 transitions.
Computed a total of 208 stabilizing places and 169 stable transitions
Graph (complete) has 412 edges and 215 vertex of which 209 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 194 transition count 159
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 194 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 188 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 188 transition count 153
Applied a total of 52 rules in 16 ms. Remains 188 /215 variables (removed 27) and now considering 153/178 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 188/215 places, 153/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 195 transition count 160
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 195 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 191 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 191 transition count 156
Applied a total of 46 rules in 13 ms. Remains 191 /215 variables (removed 24) and now considering 156/178 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 191/215 places, 156/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 198 transition count 163
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 198 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 193 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 193 transition count 158
Applied a total of 42 rules in 11 ms. Remains 193 /215 variables (removed 22) and now considering 158/178 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 193/215 places, 158/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 195 transition count 160
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 195 transition count 160
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 189 transition count 154
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 189 transition count 154
Applied a total of 50 rules in 12 ms. Remains 189 /215 variables (removed 26) and now considering 154/178 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 189/215 places, 154/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 195 transition count 160
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 195 transition count 160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 190 transition count 155
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 190 transition count 155
Applied a total of 48 rules in 11 ms. Remains 190 /215 variables (removed 25) and now considering 155/178 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 190/215 places, 155/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 197 transition count 162
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 197 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 191 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 191 transition count 156
Applied a total of 46 rules in 11 ms. Remains 191 /215 variables (removed 24) and now considering 156/178 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 191/215 places, 156/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Graph (trivial) has 109 edges and 215 vertex of which 6 / 215 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 406 edges and 210 vertex of which 206 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 205 transition count 136
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 173 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 172 transition count 135
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 68 place count 172 transition count 98
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 149 place count 128 transition count 98
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 165 place count 112 transition count 82
Iterating global reduction 3 with 16 rules applied. Total rules applied 181 place count 112 transition count 82
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 263 place count 70 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 69 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 68 transition count 41
Applied a total of 265 rules in 21 ms. Remains 68 /215 variables (removed 147) and now considering 41/178 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 68/215 places, 41/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 198 transition count 163
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 198 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 193 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 193 transition count 158
Applied a total of 42 rules in 10 ms. Remains 193 /215 variables (removed 22) and now considering 158/178 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 193/215 places, 158/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Graph (trivial) has 114 edges and 215 vertex of which 6 / 215 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 406 edges and 210 vertex of which 204 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 203 transition count 133
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 169 transition count 133
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 70 place count 169 transition count 96
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 150 place count 126 transition count 96
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 168 place count 108 transition count 78
Iterating global reduction 2 with 18 rules applied. Total rules applied 186 place count 108 transition count 78
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 276 place count 62 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 277 place count 61 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 60 transition count 33
Applied a total of 278 rules in 16 ms. Remains 60 /215 variables (removed 155) and now considering 33/178 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 60/215 places, 33/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA BusinessProcesses-PT-02-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Graph (trivial) has 114 edges and 215 vertex of which 6 / 215 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 406 edges and 210 vertex of which 204 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 203 transition count 133
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 169 transition count 133
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 70 place count 169 transition count 96
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 152 place count 124 transition count 96
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 170 place count 106 transition count 78
Iterating global reduction 2 with 18 rules applied. Total rules applied 188 place count 106 transition count 78
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 278 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 58 transition count 33
Applied a total of 280 rules in 15 ms. Remains 58 /215 variables (removed 157) and now considering 33/178 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 58/215 places, 33/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 194 transition count 159
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 194 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 188 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 188 transition count 153
Applied a total of 52 rules in 11 ms. Remains 188 /215 variables (removed 27) and now considering 153/178 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 188/215 places, 153/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 178/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 178
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 198 transition count 163
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 198 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 194 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 194 transition count 159
Applied a total of 40 rules in 9 ms. Remains 194 /215 variables (removed 21) and now considering 159/178 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 194/215 places, 159/178 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:28] [INFO ] Input system was already deterministic with 159 transitions.
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:28] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 17:00:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 178 transitions and 490 arcs took 1 ms.
Total runtime 3531 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: 215 NrTr: 178 NrArc: 490)

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

net check time: 0m 0.000sec

init dd package: 0m 3.429sec


RS generation: 13m10.355sec


-> reachability set: #nodes 26945409 (2.7e+07) #states 1,902,533,481,217 (12)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 1,902,533,481,217 (12)

before gc: list nodes free: 1625292

after gc: idd nodes used:39139538, unused:24860462; list nodes free:106323840

before gc: list nodes free: 3425325

after gc: idd nodes used:46027575, unused:17972425; list nodes free:77692335

before gc: list nodes free: 3239057

after gc: idd nodes used:49559317, unused:14440683; list nodes free:62992829

before gc: list nodes free: 3136302

after gc: idd nodes used:51627943, unused:12372057; list nodes free:54332885

FORMULA BusinessProcesses-PT-02-CTLCardinality-00 CANNOT_COMPUTE

MC time: 3m28.594sec

checking: AG [EF [[p121<=0 & 0<=p121]]]
normalized: ~ [E [true U ~ [E [true U [p121<=0 & 0<=p121]]]]]

abstracting: (0<=p121)
states: 1,902,533,481,217 (12)
abstracting: (p121<=0)

before gc: list nodes free: 2959128

after gc: idd nodes used:26945623, unused:37054377; list nodes free:156582003
states: 1,301,512,866,265 (12)
MC time: 4m21.712sec

checking: [E [EX [0<=0] U EX [[p128<=0 & 0<=p128]]] & AG [~ [A [[[p108<=0 & 0<=p108] | [p49<=1 & 1<=p49]] U [p42<=1 & 1<=p42]]]]]
normalized: [~ [E [true U [~ [EG [~ [[p42<=1 & 1<=p42]]]] & ~ [E [~ [[p42<=1 & 1<=p42]] U [~ [[[p49<=1 & 1<=p49] | [p108<=0 & 0<=p108]]] & ~ [[p42<=1 & 1<=p42]]]]]]]] & E [EX [0<=0] U EX [[p128<=0 & 0<=p128]]]]

abstracting: (0<=p128)
states: 1,902,533,481,217 (12)
abstracting: (p128<=0)
states: 1,853,569,315,585 (12)

before gc: list nodes free: 3385564

after gc: idd nodes used:52616262, unused:11383738; list nodes free:50410752

FORMULA BusinessProcesses-PT-02-CTLCardinality-12 CANNOT_COMPUTE

MC time: 1m28.737sec

checking: E [A [[EF [[p180<=1 & 1<=p180]] | [[p14<=0 & 0<=p14] | [p147<=1 & 1<=p147]]] U EX [~ [[p211<=0 & 0<=p211]]]] U EG [EF [~ [[[p142<=0 & 0<=p142] | [p131<=1 & 1<=p131]]]]]]
normalized: E [[~ [EG [~ [EX [~ [[p211<=0 & 0<=p211]]]]]] & ~ [E [~ [EX [~ [[p211<=0 & 0<=p211]]]] U [~ [EX [~ [[p211<=0 & 0<=p211]]]] & ~ [[[[p147<=1 & 1<=p147] | [p14<=0 & 0<=p14]] | E [true U [p180<=1 & 1<=p180]]]]]]]] U EG [E [true U ~ [[[p131<=1 & 1<=p131] | [p142<=0 & 0<=p142]]]]]]

abstracting: (0<=p142)
states: 1,902,533,481,217 (12)
abstracting: (p142<=0)

before gc: list nodes free: 3295294

after gc: idd nodes used:40422347, unused:23577653; list nodes free:100668915
states: 1,001,224,717,165 (12)
abstracting: (1<=p131)
states: 586,776,213,504 (11)
abstracting: (p131<=1)
states: 1,902,533,481,217 (12)
MC time: 4m 8.580sec

checking: EX [EG [[[AF [AX [[p16<=1 & 1<=p16]]] | EF [[[p154<=0 & 0<=p154] & [p131<=1 & 1<=p131]]]] | [[p197<=1 & 1<=p197] | [[p106<=0 & 0<=p106] & [p121<=1 & 1<=p121]]]]]]
normalized: EX [EG [[[~ [EG [EX [~ [[p16<=1 & 1<=p16]]]]] | E [true U [[p131<=1 & 1<=p131] & [p154<=0 & 0<=p154]]]] | [[[p121<=1 & 1<=p121] & [p106<=0 & 0<=p106]] | [p197<=1 & 1<=p197]]]]]

abstracting: (1<=p197)
states: 10,803,290,112 (10)
abstracting: (p197<=1)
states: 1,902,533,481,217 (12)
abstracting: (0<=p106)
states: 1,902,533,481,217 (12)
abstracting: (p106<=0)

before gc: list nodes free: 1567735

after gc: idd nodes used:40556604, unused:23443396; list nodes free:106381524
states: 1,565,452,264,717 (12)
abstracting: (1<=p121)

before gc: list nodes free: 9050797

after gc: idd nodes used:53805931, unused:10194069; list nodes free:51298023

FORMULA BusinessProcesses-PT-02-CTLCardinality-05 CANNOT_COMPUTE

MC time: 1m13.321sec

checking: AF [AX [[[EF [[[0<=p119 & p119<=0] & [p203<=1 & 1<=p203]]] | [[p189<=0 & 0<=p189] & [p128<=1 & 1<=p128]]] | ~ [A [[p202<=0 & 0<=p202] U [[p55<=0 & 0<=p55] | [p189<=1 & 1<=p189]]]]]]]
normalized: ~ [EG [EX [~ [[~ [[~ [EG [~ [[[p189<=1 & 1<=p189] | [p55<=0 & 0<=p55]]]]] & ~ [E [~ [[[p189<=1 & 1<=p189] | [p55<=0 & 0<=p55]]] U [~ [[p202<=0 & 0<=p202]] & ~ [[[p189<=1 & 1<=p189] | [p55<=0 & 0<=p55]]]]]]]] | [[[p128<=1 & 1<=p128] & [p189<=0 & 0<=p189]] | E [true U [[p203<=1 & 1<=p203] & [0<=p119 & p119<=0]]]]]]]]]

abstracting: (p119<=0)

before gc: list nodes free: 9050790

after gc: idd nodes used:53805930, unused:10194070; list nodes free:51298020

before gc: list nodes free: 9072709

after gc: idd nodes used:53805931, unused:10194069; list nodes free:51298026

FORMULA BusinessProcesses-PT-02-CTLCardinality-01 CANNOT_COMPUTE

MC time: 0m43.390sec

checking: [AG [AX [[~ [A [[p74<=1 & 1<=p74] U [p152<=1 & 1<=p152]]] | [[p187<=0 & 0<=p187] | [p213<=1 & 1<=p213]]]]] & [EG [AF [[[p93<=0 & 0<=p93] | [p102<=1 & 1<=p102]]]] | EF [[p40<=0 & 0<=p40]]]]
normalized: [~ [E [true U EX [~ [[~ [[~ [EG [~ [[p152<=1 & 1<=p152]]]] & ~ [E [~ [[p152<=1 & 1<=p152]] U [~ [[p74<=1 & 1<=p74]] & ~ [[p152<=1 & 1<=p152]]]]]]] | [[p213<=1 & 1<=p213] | [p187<=0 & 0<=p187]]]]]]] & [E [true U [p40<=0 & 0<=p40]] | EG [~ [EG [~ [[[p102<=1 & 1<=p102] | [p93<=0 & 0<=p93]]]]]]]]

abstracting: (0<=p93)
states: 1,902,533,481,217 (12)
abstracting: (p93<=0)

before gc: list nodes free: 9072702

after gc: idd nodes used:53805930, unused:10194070; list nodes free:51298023
states: 1,902,533,388,733 (12)
abstracting: (1<=p102)
states: 48,154,459,500 (10)
abstracting: (p102<=1)
states: 1,902,533,481,217 (12)
.
before gc: list nodes free: 9043803

after gc: idd nodes used:62064788, unused:1935212; list nodes free:17032907

FORMULA BusinessProcesses-PT-02-CTLCardinality-03 CANNOT_COMPUTE

MC time: 2m 2.850sec

checking: EF [[A [[p195<=1 & 1<=p195] U ~ [[[p188<=0 & 0<=p188] | [p46<=1 & 1<=p46]]]] | E [[[p86<=0 & 0<=p86] | [p128<=1 & 1<=p128]] U AG [[[[p13<=0 & 0<=p13] | [p99<=1 & 1<=p99]] & [p176<=1 & 1<=p176]]]]]]
normalized: E [true U [E [[[p128<=1 & 1<=p128] | [p86<=0 & 0<=p86]] U ~ [E [true U ~ [[[p176<=1 & 1<=p176] & [[p99<=1 & 1<=p99] | [p13<=0 & 0<=p13]]]]]]] | [~ [EG [[[p46<=1 & 1<=p46] | [p188<=0 & 0<=p188]]]] & ~ [E [[[p46<=1 & 1<=p46] | [p188<=0 & 0<=p188]] U [~ [[p195<=1 & 1<=p195]] & [[p46<=1 & 1<=p46] | [p188<=0 & 0<=p188]]]]]]]]

abstracting: (0<=p188)
states: 1,902,533,481,217 (12)
abstracting: (p188<=0)

before gc: list nodes free: 9055744

after gc: idd nodes used:60497439, unused:3502561; list nodes free:23400166
states: 1,882,636,532,353 (12)
abstracting: (1<=p46)
states: 626,328,443,952 (11)
abstracting: (p46<=1)
states: 1,902,533,481,217 (12)
abstracting: (1<=p195)
states: 17,218,636,128 (10)
abstracting: (p195<=1)
states: 1,902,533,481,217 (12)
abstracting: (0<=p188)
states: 1,902,533,481,217 (12)
abstracting: (p188<=0)
states: 1,882,636,532,353 (12)
abstracting: (1<=p46)
states: 626,328,443,952 (11)
abstracting: (p46<=1)
states: 1,902,533,481,217 (12)
MC time: 5m 0.380sec

checking: [EX [EF [EG [[p76<=1 & 1<=p76]]]] & EF [[[AX [~ [A [[p197<=0 & 0<=p197] U [p44<=0 & 0<=p44]]]] | [[[p107<=0 & 0<=p107] | [p14<=0 & 0<=p14]] & EF [[p142<=1 & 1<=p142]]]] | [AX [[p163<=0 & 0<=p163]] | EF [[[p75<=0 & 0<=p75] | [[p35<=1 & 1<=p35] & [p179<=1 & 1<=p179]]]]]]]]
normalized: [E [true U [[E [true U [[[p179<=1 & 1<=p179] & [p35<=1 & 1<=p35]] | [p75<=0 & 0<=p75]]] | ~ [EX [~ [[p163<=0 & 0<=p163]]]]] | [[E [true U [p142<=1 & 1<=p142]] & [[p14<=0 & 0<=p14] | [p107<=0 & 0<=p107]]] | ~ [EX [[~ [EG [~ [[p44<=0 & 0<=p44]]]] & ~ [E [~ [[p44<=0 & 0<=p44]] U [~ [[p197<=0 & 0<=p197]] & ~ [[p44<=0 & 0<=p44]]]]]]]]]]] & EX [E [true U EG [[p76<=1 & 1<=p76]]]]]

abstracting: (1<=p76)
states: 603,051,512,256 (11)
abstracting: (p76<=1)
states: 1,902,533,481,217 (12)

before gc: list nodes free: 8101889

after gc: idd nodes used:61933586, unused:2066414; list nodes free:17067008

before gc: list nodes free: 8100546

after gc: idd nodes used:61975226, unused:2024774; list nodes free:16837904

before gc: list nodes free: 7999480

after gc: idd nodes used:62046577, unused:1953423; list nodes free:16441589

before gc: list nodes free: 7936293

after gc: idd nodes used:62996945, unused:1003055; list nodes free:12282529

before gc: list nodes free: 7914560

after gc: idd nodes used:63634746, unused:365254; list nodes free:9507763

FORMULA BusinessProcesses-PT-02-CTLCardinality-02 CANNOT_COMPUTE

MC time: 1m24.788sec

checking: E [[EF [[p208<=1 & 1<=p208]] | A [[EG [[p173<=0 & 0<=p173]] | [p36<=0 & 0<=p36]] U [AF [~ [[[p0<=0 & 0<=p0] | [p38<=1 & 1<=p38]]]] & EF [[p188<=1 & 1<=p188]]]]] U EX [A [[~ [AF [[p147<=1 & 1<=p147]]] & [[[p177<=1 & 1<=p177] & [[p168<=0 & 0<=p168] | [p109<=1 & 1<=p109]]] | [[p207<=1 & 1<=p207] & [[p91<=0 & 0<=p91] | [p84<=1 & 1<=p84]]]]] U [AX [[p55<=0 & 0<=p55]] & [[p14<=1 & 1<=p14] & [p194<=0 & 0<=p194]]]]]]
normalized: E [[[~ [EG [~ [[E [true U [p188<=1 & 1<=p188]] & ~ [EG [[[p38<=1 & 1<=p38] | [p0<=0 & 0<=p0]]]]]]]] & ~ [E [~ [[E [true U [p188<=1 & 1<=p188]] & ~ [EG [[[p38<=1 & 1<=p38] | [p0<=0 & 0<=p0]]]]]] U [~ [[[p36<=0 & 0<=p36] | EG [[p173<=0 & 0<=p173]]]] & ~ [[E [true U [p188<=1 & 1<=p188]] & ~ [EG [[[p38<=1 & 1<=p38] | [p0<=0 & 0<=p0]]]]]]]]]] | E [true U [p208<=1 & 1<=p208]]] U EX [[~ [EG [~ [[[[p194<=0 & 0<=p194] & [p14<=1 & 1<=p14]] & ~ [EX [~ [[p55<=0 & 0<=p55]]]]]]]] & ~ [E [~ [[[[p194<=0 & 0<=p194] & [p14<=1 & 1<=p14]] & ~ [EX [~ [[p55<=0 & 0<=p55]]]]]] U [~ [[[[[[p84<=1 & 1<=p84] | [p91<=0 & 0<=p91]] & [p207<=1 & 1<=p207]] | [[[p109<=1 & 1<=p109] | [p168<=0 & 0<=p168]] & [p177<=1 & 1<=p177]]] & EG [~ [[p147<=1 & 1<=p147]]]]] & ~ [[[[p194<=0 & 0<=p194] & [p14<=1 & 1<=p14]] & ~ [EX [~ [[p55<=0 & 0<=p55]]]]]]]]]]]]

abstracting: (0<=p55)
states: 1,902,533,481,217 (12)
abstracting: (p55<=0)

before gc: list nodes free: 7909231

after gc: idd nodes used:61471367, unused:2528633; list nodes free:19122304
states: 1,901,768,206,209 (12)

before gc: list nodes free: 8480530

after gc: idd nodes used:62762303, unused:1237697; list nodes free:13676226

FORMULA BusinessProcesses-PT-02-CTLCardinality-13 CANNOT_COMPUTE

MC time: 1m 0.806sec

checking: [A [E [E [AX [[[p81<=0 & 0<=p81] | [p34<=1 & 1<=p34]]] U ~ [EX [0<=0]]] U ~ [[[p131<=1 & 1<=p131] | [~ [[p132<=0 & 0<=p132]] | [p93<=0 & 0<=p93]]]]] U [[p137<=0 & 0<=p137] | [p62<=1 & 1<=p62]]] & AG [[[AX [[[[p191<=0 & 0<=p191] & [p107<=0 & 0<=p107]] & [[p174<=0 & 0<=p174] & [p120<=1 & 1<=p120]]]] | [AF [[p203<=0 & 0<=p203]] & [[p175<=1 & 1<=p175] & [p202<=0 & 0<=p202]]]] | [[[p82<=1 & 1<=p82] & [[p214<=0 & 0<=p214] & [p62<=1 & 1<=p62]]] | [p37<=0 & 0<=p37]]]]]
normalized: [~ [E [true U ~ [[[[[p82<=1 & 1<=p82] & [[p62<=1 & 1<=p62] & [p214<=0 & 0<=p214]]] | [p37<=0 & 0<=p37]] | [[[[p202<=0 & 0<=p202] & [p175<=1 & 1<=p175]] & ~ [EG [~ [[p203<=0 & 0<=p203]]]]] | ~ [EX [~ [[[[p107<=0 & 0<=p107] & [p191<=0 & 0<=p191]] & [[p120<=1 & 1<=p120] & [p174<=0 & 0<=p174]]]]]]]]]]] & [~ [EG [~ [[[p62<=1 & 1<=p62] | [p137<=0 & 0<=p137]]]]] & ~ [E [~ [[[p62<=1 & 1<=p62] | [p137<=0 & 0<=p137]]] U [~ [[[p62<=1 & 1<=p62] | [p137<=0 & 0<=p137]]] & ~ [E [E [~ [EX [~ [[[p34<=1 & 1<=p34] | [p81<=0 & 0<=p81]]]]] U ~ [EX [0<=0]]] U ~ [[[[p93<=0 & 0<=p93] | ~ [[p132<=0 & 0<=p132]]] | [p131<=1 & 1<=p131]]]]]]]]]]

abstracting: (1<=p131)
states: 586,776,213,504 (11)
abstracting: (p131<=1)
states: 1,902,533,481,217 (12)
abstracting: (0<=p132)
states: 1,902,533,481,217 (12)
abstracting: (p132<=0)

before gc: list nodes free: 8480998

after gc: idd nodes used:61493907, unused:2506093; list nodes free:19019881
states: 1,848,118,899,457 (12)
abstracting: (0<=p93)
states: 1,902,533,481,217 (12)
abstracting: (p93<=0)
states: 1,902,533,388,733 (12)
abstracting: (0<=0)
states: 1,902,533,481,217 (12)

before gc: list nodes free: 8790046

after gc: idd nodes used:63067535, unused:932465; list nodes free:12621607

FORMULA BusinessProcesses-PT-02-CTLCardinality-07 CANNOT_COMPUTE

MC time: 1m16.795sec

checking: AG [EF [[p121<=0 & 0<=p121]]]
normalized: ~ [E [true U ~ [E [true U [p121<=0 & 0<=p121]]]]]

abstracting: (0<=p121)
states: 1,902,533,481,217 (12)
abstracting: (p121<=0)
states: 1,301,512,866,265 (12)

before gc: list nodes free: 8825101

after gc: idd nodes used:61517093, unused:2482907; list nodes free:18942686

before gc: list nodes free: 8168290

after gc: idd nodes used:61517093, unused:2482907; list nodes free:18942690

FORMULA BusinessProcesses-PT-02-CTLCardinality-11 CANNOT_COMPUTE

MC time: 6m19.243sec

checking: E [A [[EF [[p180<=1 & 1<=p180]] | [[p14<=0 & 0<=p14] | [p147<=1 & 1<=p147]]] U EX [~ [[p211<=0 & 0<=p211]]]] U EG [EF [~ [[[p142<=0 & 0<=p142] | [p131<=1 & 1<=p131]]]]]]
normalized: E [[~ [EG [~ [EX [~ [[p211<=0 & 0<=p211]]]]]] & ~ [E [~ [EX [~ [[p211<=0 & 0<=p211]]]] U [~ [[[[p147<=1 & 1<=p147] | [p14<=0 & 0<=p14]] | E [true U [p180<=1 & 1<=p180]]]] & ~ [EX [~ [[p211<=0 & 0<=p211]]]]]]]] U EG [E [true U ~ [[[p131<=1 & 1<=p131] | [p142<=0 & 0<=p142]]]]]]

abstracting: (0<=p142)
states: 1,902,533,481,217 (12)
abstracting: (p142<=0)
states: 1,001,224,717,165 (12)
abstracting: (1<=p131)
states: 586,776,213,504 (11)
abstracting: (p131<=1)
states: 1,902,533,481,217 (12)

before gc: list nodes free: 8169837

after gc: idd nodes used:61517093, unused:2482907; list nodes free:18942690

before gc: list nodes free: 8188040

after gc: idd nodes used:61628899, unused:2371101; list nodes free:18470073

FORMULA BusinessProcesses-PT-02-CTLCardinality-04 CANNOT_COMPUTE

MC time: 3m12.692sec

checking: EF [[A [[p195<=1 & 1<=p195] U ~ [[[p188<=0 & 0<=p188] | [p46<=1 & 1<=p46]]]] | E [[[p86<=0 & 0<=p86] | [p128<=1 & 1<=p128]] U AG [[[[p13<=0 & 0<=p13] | [p99<=1 & 1<=p99]] & [p176<=1 & 1<=p176]]]]]]
normalized: E [true U [E [[[p128<=1 & 1<=p128] | [p86<=0 & 0<=p86]] U ~ [E [true U ~ [[[p176<=1 & 1<=p176] & [[p99<=1 & 1<=p99] | [p13<=0 & 0<=p13]]]]]]] | [~ [EG [[[p46<=1 & 1<=p46] | [p188<=0 & 0<=p188]]]] & ~ [E [[[p46<=1 & 1<=p46] | [p188<=0 & 0<=p188]] U [~ [[p195<=1 & 1<=p195]] & [[p46<=1 & 1<=p46] | [p188<=0 & 0<=p188]]]]]]]]

abstracting: (0<=p188)
states: 1,902,533,481,217 (12)
abstracting: (p188<=0)
states: 1,882,636,532,353 (12)
abstracting: (1<=p46)
states: 626,328,443,952 (11)
abstracting: (p46<=1)
states: 1,902,533,481,217 (12)

before gc: list nodes free: 8192119

after gc: idd nodes used:61517093, unused:2482907; list nodes free:18942690
abstracting: (1<=p195)
states: 17,218,636,128 (10)
abstracting: (p195<=1)
states: 1,902,533,481,217 (12)
abstracting: (0<=p188)
states: 1,902,533,481,217 (12)
abstracting: (p188<=0)
states: 1,882,636,532,353 (12)
abstracting: (1<=p46)
states: 626,328,443,952 (11)
abstracting: (p46<=1)
states: 1,902,533,481,217 (12)

before gc: list nodes free: 8165168

after gc: idd nodes used:61529853, unused:2470147; list nodes free:18883056

FORMULA BusinessProcesses-PT-02-CTLCardinality-06 CANNOT_COMPUTE

MC time: 5m44.801sec

totally nodes used: 304709526 (3.0e+08)
number of garbage collections: 29
fire ops cache: hits/miss/sum: 457585214 1976576376 2434161590
used/not used/entry size/cache size: 10986035 56122829 16 1024MB
basic ops cache: hits/miss/sum: 27898110 381541769 409439879
used/not used/entry size/cache size: 0 16777216 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 41306529 530917202 572223731
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 26413897
1 23940340
2 11680268
3 3873044
4 970038
5 193782
6 32269
7 4587
8 559
9 66
>= 10 14

Total processing time: 55m 7.470sec


BK_STOP 1678730136511

--------------------
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.000sec


iterations count:6326 (35), effective:270 (1)

initing FirstDep: 0m 0.000sec

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


sat_reach.icc:155: Timeout: after 258 sec

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


sat_reach.icc:155: Timeout: after 247 sec

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

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

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


sat_reach.icc:155: Timeout: after 290 sec

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

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

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

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

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

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

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