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

About the Execution of Marcie+red for CloudDeployment-PT-5a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5848.483 66107.00 87686.00 625.50 FFFFTFFFTTFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r074-smll-167814400200409.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CloudDeployment-PT-5a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400200409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:57 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:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 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 230K 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 CloudDeployment-PT-5a-CTLCardinality-00
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-01
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-02
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-03
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-04
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-05
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-06
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-07
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-08
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-09
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-10
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-11
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-12
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-13
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-14
FORMULA_NAME CloudDeployment-PT-5a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678494140475

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=CloudDeployment-PT-5a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:22:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:22:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:22:24] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2023-03-11 00:22:24] [INFO ] Transformed 180 places.
[2023-03-11 00:22:24] [INFO ] Transformed 675 transitions.
[2023-03-11 00:22:24] [INFO ] Found NUPN structural information;
[2023-03-11 00:22:24] [INFO ] Parsed PT model containing 180 places and 675 transitions and 3959 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA CloudDeployment-PT-5a-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 595/595 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 176 transition count 595
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 174 transition count 593
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 174 transition count 593
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 63 place count 174 transition count 538
Applied a total of 63 rules in 93 ms. Remains 174 /180 variables (removed 6) and now considering 538/595 (removed 57) transitions.
[2023-03-11 00:22:24] [INFO ] Flow matrix only has 299 transitions (discarded 239 similar events)
// Phase 1: matrix 299 rows 174 cols
[2023-03-11 00:22:24] [INFO ] Computed 26 place invariants in 30 ms
[2023-03-11 00:22:25] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-11 00:22:25] [INFO ] Flow matrix only has 299 transitions (discarded 239 similar events)
[2023-03-11 00:22:25] [INFO ] Invariant cache hit.
[2023-03-11 00:22:25] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-11 00:22:25] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-11 00:22:25] [INFO ] Flow matrix only has 299 transitions (discarded 239 similar events)
[2023-03-11 00:22:25] [INFO ] Invariant cache hit.
[2023-03-11 00:22:26] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/180 places, 538/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1841 ms. Remains : 174/180 places, 538/595 transitions.
Support contains 91 out of 174 places after structural reductions.
[2023-03-11 00:22:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 00:22:26] [INFO ] Flatten gal took : 154 ms
FORMULA CloudDeployment-PT-5a-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:22:26] [INFO ] Flatten gal took : 97 ms
[2023-03-11 00:22:27] [INFO ] Input system was already deterministic with 538 transitions.
Support contains 78 out of 174 places (down from 91) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 54) seen :50
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 00:22:28] [INFO ] Flow matrix only has 299 transitions (discarded 239 similar events)
[2023-03-11 00:22:28] [INFO ] Invariant cache hit.
[2023-03-11 00:22:28] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-11 00:22:28] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:22:28] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-11 00:22:28] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 00:22:28] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-11 00:22:28] [INFO ] After 152ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-11 00:22:28] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-11 00:22:28] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 538/538 transitions.
Graph (trivial) has 191 edges and 174 vertex of which 49 / 174 are part of one of the 15 SCC in 6 ms
Free SCC test removed 34 places
Drop transitions removed 108 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 138 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 134 transition count 400
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 128 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 128 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 127 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 127 transition count 373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 126 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 126 transition count 372
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 26 rules applied. Total rules applied 49 place count 113 transition count 408
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 1 with 69 rules applied. Total rules applied 118 place count 113 transition count 339
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 112 transition count 338
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 112 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 111 transition count 337
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 111 transition count 363
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 132 place count 106 transition count 363
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 106 transition count 363
Applied a total of 133 rules in 257 ms. Remains 106 /174 variables (removed 68) and now considering 363/538 (removed 175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 106/174 places, 363/538 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 551922 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 551922 steps, saw 100296 distinct states, run finished after 3002 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 00:22:32] [INFO ] Flow matrix only has 183 transitions (discarded 180 similar events)
// Phase 1: matrix 183 rows 106 cols
[2023-03-11 00:22:32] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-11 00:22:32] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 11 ms returned sat
[2023-03-11 00:22:32] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:22:32] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 11 ms returned sat
[2023-03-11 00:22:32] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:22:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-11 00:22:33] [INFO ] After 98ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 00:22:33] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-11 00:22:33] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 363/363 transitions.
Applied a total of 0 rules in 23 ms. Remains 106 /106 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 106/106 places, 363/363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 363/363 transitions.
Applied a total of 0 rules in 20 ms. Remains 106 /106 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2023-03-11 00:22:33] [INFO ] Flow matrix only has 183 transitions (discarded 180 similar events)
[2023-03-11 00:22:33] [INFO ] Invariant cache hit.
[2023-03-11 00:22:33] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-11 00:22:33] [INFO ] Flow matrix only has 183 transitions (discarded 180 similar events)
[2023-03-11 00:22:33] [INFO ] Invariant cache hit.
[2023-03-11 00:22:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-11 00:22:33] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-11 00:22:33] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-11 00:22:33] [INFO ] Flow matrix only has 183 transitions (discarded 180 similar events)
[2023-03-11 00:22:33] [INFO ] Invariant cache hit.
[2023-03-11 00:22:34] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1199 ms. Remains : 106/106 places, 363/363 transitions.
Graph (trivial) has 81 edges and 106 vertex of which 35 / 106 are part of one of the 5 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 40 transitions
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 220 transitions.
Ensure Unique test removed 9 places
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 67 transition count 129
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 39 place count 53 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 52 transition count 128
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 40 place count 52 transition count 121
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 54 place count 45 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 58 place count 41 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 41 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 37 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 37 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 74 place count 37 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 36 transition count 92
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 85 place count 36 transition count 83
Free-agglomeration rule applied 4 times with reduction of 22 identical transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 36 transition count 57
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 101 place count 32 transition count 49
Applied a total of 101 rules in 26 ms. Remains 32 /106 variables (removed 74) and now considering 49/363 (removed 314) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 49 rows 32 cols
[2023-03-11 00:22:34] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 00:22:34] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-11 00:22:34] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:22:34] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-11 00:22:34] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:22:34] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 00:22:34] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-11 00:22:34] [INFO ] Flatten gal took : 64 ms
[2023-03-11 00:22:34] [INFO ] Flatten gal took : 62 ms
[2023-03-11 00:22:34] [INFO ] Input system was already deterministic with 538 transitions.
Computed a total of 89 stabilizing places and 368 stable transitions
Graph (complete) has 1614 edges and 174 vertex of which 167 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 165 transition count 535
Applied a total of 12 rules in 15 ms. Remains 165 /174 variables (removed 9) and now considering 535/538 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 165/174 places, 535/538 transitions.
[2023-03-11 00:22:34] [INFO ] Flatten gal took : 43 ms
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 40 ms
[2023-03-11 00:22:35] [INFO ] Input system was already deterministic with 535 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Applied a total of 10 rules in 11 ms. Remains 166 /174 variables (removed 8) and now considering 536/538 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 166/174 places, 536/538 transitions.
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 37 ms
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 40 ms
[2023-03-11 00:22:35] [INFO ] Input system was already deterministic with 536 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 164 transition count 534
Applied a total of 14 rules in 17 ms. Remains 164 /174 variables (removed 10) and now considering 534/538 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 164/174 places, 534/538 transitions.
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 37 ms
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 40 ms
[2023-03-11 00:22:35] [INFO ] Input system was already deterministic with 534 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Graph (trivial) has 196 edges and 174 vertex of which 48 / 174 are part of one of the 15 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 128 transition count 421
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 128 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 127 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 127 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 126 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 126 transition count 419
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 38 place count 126 transition count 398
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 126 transition count 393
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 121 transition count 393
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 117 transition count 389
Applied a total of 56 rules in 67 ms. Remains 117 /174 variables (removed 57) and now considering 389/538 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 117/174 places, 389/538 transitions.
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 19 ms
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 19 ms
[2023-03-11 00:22:35] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Graph (trivial) has 197 edges and 174 vertex of which 50 / 174 are part of one of the 15 SCC in 0 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 125 transition count 405
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 125 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 124 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 124 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 123 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 123 transition count 403
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 39 place count 123 transition count 383
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 123 transition count 378
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 118 transition count 378
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 113 transition count 373
Applied a total of 59 rules in 55 ms. Remains 113 /174 variables (removed 61) and now considering 373/538 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 113/174 places, 373/538 transitions.
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 15 ms
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 18 ms
[2023-03-11 00:22:35] [INFO ] Input system was already deterministic with 373 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 164 transition count 534
Applied a total of 14 rules in 12 ms. Remains 164 /174 variables (removed 10) and now considering 534/538 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 164/174 places, 534/538 transitions.
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 24 ms
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 27 ms
[2023-03-11 00:22:35] [INFO ] Input system was already deterministic with 534 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 164 transition count 534
Applied a total of 14 rules in 11 ms. Remains 164 /174 variables (removed 10) and now considering 534/538 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 164/174 places, 534/538 transitions.
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 22 ms
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 25 ms
[2023-03-11 00:22:35] [INFO ] Input system was already deterministic with 534 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 167 transition count 537
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 167 transition count 537
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 166 transition count 536
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 166 transition count 536
Applied a total of 10 rules in 9 ms. Remains 166 /174 variables (removed 8) and now considering 536/538 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 166/174 places, 536/538 transitions.
[2023-03-11 00:22:35] [INFO ] Flatten gal took : 23 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 25 ms
[2023-03-11 00:22:36] [INFO ] Input system was already deterministic with 536 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 164 transition count 534
Applied a total of 14 rules in 11 ms. Remains 164 /174 variables (removed 10) and now considering 534/538 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 164/174 places, 534/538 transitions.
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 23 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 25 ms
[2023-03-11 00:22:36] [INFO ] Input system was already deterministic with 534 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Applied a total of 10 rules in 6 ms. Remains 166 /174 variables (removed 8) and now considering 536/538 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 166/174 places, 536/538 transitions.
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 22 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 24 ms
[2023-03-11 00:22:36] [INFO ] Input system was already deterministic with 536 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Graph (trivial) has 196 edges and 174 vertex of which 47 / 174 are part of one of the 15 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 129 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 129 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 128 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 127 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 127 transition count 422
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 38 place count 127 transition count 401
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 127 transition count 396
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 122 transition count 396
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 117 transition count 391
Applied a total of 58 rules in 47 ms. Remains 117 /174 variables (removed 57) and now considering 391/538 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 117/174 places, 391/538 transitions.
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 16 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 19 ms
[2023-03-11 00:22:36] [INFO ] Input system was already deterministic with 391 transitions.
Finished random walk after 432 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=144 )
FORMULA CloudDeployment-PT-5a-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Graph (trivial) has 187 edges and 174 vertex of which 49 / 174 are part of one of the 15 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 126 transition count 407
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 126 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 125 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 125 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 124 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 124 transition count 405
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 124 transition count 387
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 40 place count 124 transition count 384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 121 transition count 384
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 116 transition count 379
Applied a total of 53 rules in 48 ms. Remains 116 /174 variables (removed 58) and now considering 379/538 (removed 159) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 116/174 places, 379/538 transitions.
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 17 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 17 ms
[2023-03-11 00:22:36] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Graph (trivial) has 181 edges and 174 vertex of which 47 / 174 are part of one of the 15 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Ensure Unique test removed 6 places
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 131 transition count 425
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 131 transition count 425
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 131 transition count 405
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 131 transition count 401
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 127 transition count 401
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 122 transition count 396
Applied a total of 49 rules in 39 ms. Remains 122 /174 variables (removed 52) and now considering 396/538 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 122/174 places, 396/538 transitions.
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 15 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 18 ms
[2023-03-11 00:22:36] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 538/538 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 538
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 166 transition count 536
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 164 transition count 534
Applied a total of 14 rules in 11 ms. Remains 164 /174 variables (removed 10) and now considering 534/538 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 164/174 places, 534/538 transitions.
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 20 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 22 ms
[2023-03-11 00:22:36] [INFO ] Input system was already deterministic with 534 transitions.
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 23 ms
[2023-03-11 00:22:36] [INFO ] Flatten gal took : 24 ms
[2023-03-11 00:22:36] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-11 00:22:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 538 transitions and 3443 arcs took 5 ms.
Total runtime 12983 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: 174 NrTr: 538 NrArc: 3443)

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

net check time: 0m 0.001sec

init dd package: 0m 3.528sec


RS generation: 0m 7.814sec


-> reachability set: #nodes 7661 (7.7e+03) #states 232,904,700 (8)



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

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

abstracting: (1<=p61)
states: 9,544,512 (6)
abstracting: (p61<=1)
states: 232,904,700 (8)
.
EG iterations: 0
-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.936sec

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

abstracting: (1<=p47)
states: 9,544,512 (6)
abstracting: (p47<=1)
states: 232,904,700 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.034sec

checking: EG [[[0<=p72 & p72<=0] | [p136<=1 & 1<=p136]]]
normalized: EG [[[0<=p72 & p72<=0] | [p136<=1 & 1<=p136]]]

abstracting: (1<=p136)
states: 9,544,507 (6)
abstracting: (p136<=1)
states: 232,904,700 (8)
abstracting: (p72<=0)
states: 223,360,188 (8)
abstracting: (0<=p72)
states: 232,904,700 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CloudDeployment-PT-5a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.309sec

checking: EX [EG [EX [EX [[[p31<=1 & 1<=p31] | [p79<=0 & 0<=p79]]]]]]
normalized: EX [EG [EX [EX [[[p79<=0 & 0<=p79] | [p31<=1 & 1<=p31]]]]]]

abstracting: (1<=p31)
states: 9,544,593 (6)
abstracting: (p31<=1)
states: 232,904,700 (8)
abstracting: (0<=p79)
states: 232,904,700 (8)
abstracting: (p79<=0)
states: 223,360,188 (8)
.......
EG iterations: 5
.-> the formula is TRUE

FORMULA CloudDeployment-PT-5a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.280sec

checking: AG [A [AF [[EF [[[p49<=1 & 1<=p49] | [p96<=0 & 0<=p96]]] & [p53<=1 & 1<=p53]]] U [[p78<=0 & 0<=p78] | [p97<=1 & 1<=p97]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[p97<=1 & 1<=p97] | [p78<=0 & 0<=p78]]]]] & ~ [E [~ [[[p97<=1 & 1<=p97] | [p78<=0 & 0<=p78]]] U [EG [~ [[[p53<=1 & 1<=p53] & E [true U [[p96<=0 & 0<=p96] | [p49<=1 & 1<=p49]]]]]] & ~ [[[p97<=1 & 1<=p97] | [p78<=0 & 0<=p78]]]]]]]]]]

abstracting: (0<=p78)
states: 232,904,700 (8)
abstracting: (p78<=0)
states: 223,360,188 (8)
abstracting: (1<=p97)
states: 9,544,512 (6)
abstracting: (p97<=1)
states: 232,904,700 (8)
abstracting: (1<=p49)
states: 9,544,512 (6)
abstracting: (p49<=1)
states: 232,904,700 (8)
abstracting: (0<=p96)
states: 232,904,700 (8)
abstracting: (p96<=0)
states: 223,360,188 (8)
abstracting: (1<=p53)
states: 9,544,507 (6)
abstracting: (p53<=1)
states: 232,904,700 (8)
.
EG iterations: 1
abstracting: (0<=p78)
states: 232,904,700 (8)
abstracting: (p78<=0)
states: 223,360,188 (8)
abstracting: (1<=p97)
states: 9,544,512 (6)
abstracting: (p97<=1)
states: 232,904,700 (8)
abstracting: (0<=p78)
states: 232,904,700 (8)
abstracting: (p78<=0)
states: 223,360,188 (8)
abstracting: (1<=p97)
states: 9,544,512 (6)
abstracting: (p97<=1)
states: 232,904,700 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.562sec

checking: E [E [AG [[1<=p13 & p13<=1]] U [[p95<=0 & 0<=p95] | [p13<=1 & 1<=p13]]] U AG [EX [~ [[[p74<=0 & 0<=p74] | [p113<=1 & 1<=p113]]]]]]
normalized: E [E [~ [E [true U ~ [[1<=p13 & p13<=1]]]] U [[p13<=1 & 1<=p13] | [p95<=0 & 0<=p95]]] U ~ [E [true U ~ [EX [~ [[[p113<=1 & 1<=p113] | [p74<=0 & 0<=p74]]]]]]]]

abstracting: (0<=p74)
states: 232,904,700 (8)
abstracting: (p74<=0)
states: 223,360,188 (8)
abstracting: (1<=p113)
states: 232,904,455 (8)
abstracting: (p113<=1)
states: 232,904,700 (8)
.abstracting: (0<=p95)
states: 232,904,700 (8)
abstracting: (p95<=0)
states: 223,360,188 (8)
abstracting: (1<=p13)
states: 9,544,512 (6)
abstracting: (p13<=1)
states: 232,904,700 (8)
abstracting: (p13<=1)
states: 232,904,700 (8)
abstracting: (1<=p13)
states: 9,544,512 (6)
-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.354sec

checking: ~ [E [[EX [[[p29<=1 & 1<=p29] | [0<=p65 & p65<=0]]] | AG [[[0<=p12 & p12<=0] | [[p117<=1 & 1<=p117] | [p153<=1 & 1<=p153]]]]] U [p22<=1 & 1<=p22]]]
normalized: ~ [E [[~ [E [true U ~ [[[[p153<=1 & 1<=p153] | [p117<=1 & 1<=p117]] | [0<=p12 & p12<=0]]]]] | EX [[[0<=p65 & p65<=0] | [p29<=1 & 1<=p29]]]] U [p22<=1 & 1<=p22]]]

abstracting: (1<=p22)
states: 9,544,512 (6)
abstracting: (p22<=1)
states: 232,904,700 (8)
abstracting: (1<=p29)
states: 243
abstracting: (p29<=1)
states: 232,904,700 (8)
abstracting: (p65<=0)
states: 223,360,188 (8)
abstracting: (0<=p65)
states: 232,904,700 (8)
.abstracting: (p12<=0)
states: 223,360,188 (8)
abstracting: (0<=p12)
states: 232,904,700 (8)
abstracting: (1<=p117)
states: 9,544,512 (6)
abstracting: (p117<=1)
states: 232,904,700 (8)
abstracting: (1<=p153)
states: 7,962,624 (6)
abstracting: (p153<=1)
states: 232,904,700 (8)
-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.811sec

checking: AG [AX [E [[AX [[1<=p142 & p142<=1]] | ~ [[[p141<=0 & 0<=p141] | [p155<=1 & 1<=p155]]]] U ~ [[~ [[[0<=p125 & p125<=0] | [p46<=1 & 1<=p46]]] & [p163<=1 & 1<=p163]]]]]]
normalized: ~ [E [true U EX [~ [E [[~ [[[p155<=1 & 1<=p155] | [p141<=0 & 0<=p141]]] | ~ [EX [~ [[1<=p142 & p142<=1]]]]] U ~ [[~ [[[p46<=1 & 1<=p46] | [0<=p125 & p125<=0]]] & [p163<=1 & 1<=p163]]]]]]]]

abstracting: (1<=p163)
states: 29,703,888 (7)
abstracting: (p163<=1)
states: 232,904,700 (8)
abstracting: (p125<=0)
states: 223,360,107 (8)
abstracting: (0<=p125)
states: 232,904,700 (8)
abstracting: (1<=p46)
states: 9,544,512 (6)
abstracting: (p46<=1)
states: 232,904,700 (8)
abstracting: (p142<=1)
states: 232,904,700 (8)
abstracting: (1<=p142)
states: 7,962,623 (6)
.abstracting: (0<=p141)
states: 232,904,700 (8)
abstracting: (p141<=0)
states: 224,942,076 (8)
abstracting: (1<=p155)
states: 7,962,624 (6)
abstracting: (p155<=1)
states: 232,904,700 (8)
.-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.066sec

checking: E [AX [[[[0<=p7 & p7<=0] | [p14<=1 & 1<=p14]] & ~ [[[p75<=0 & 0<=p75] | E [[[0<=p92 & p92<=0] | [1<=p82 & p82<=1]] U [p62<=0 & 0<=p62]]]]]] U AG [[EF [[[[1<=p137 & p137<=1] | [0<=p131 & p131<=0]] & [1<=p63 & p63<=1]]] & EX [AG [[p111<=1 & 1<=p111]]]]]]
normalized: E [~ [EX [~ [[~ [[E [[[1<=p82 & p82<=1] | [0<=p92 & p92<=0]] U [p62<=0 & 0<=p62]] | [p75<=0 & 0<=p75]]] & [[p14<=1 & 1<=p14] | [0<=p7 & p7<=0]]]]]] U ~ [E [true U ~ [[EX [~ [E [true U ~ [[p111<=1 & 1<=p111]]]]] & E [true U [[1<=p63 & p63<=1] & [[0<=p131 & p131<=0] | [1<=p137 & p137<=1]]]]]]]]]

abstracting: (p137<=1)
states: 232,904,700 (8)
abstracting: (1<=p137)
states: 13,380,765 (7)
abstracting: (p131<=0)
states: 223,360,188 (8)
abstracting: (0<=p131)
states: 232,904,700 (8)
abstracting: (p63<=1)
states: 232,904,700 (8)
abstracting: (1<=p63)
states: 9,544,512 (6)
abstracting: (1<=p111)
states: 243
abstracting: (p111<=1)
states: 232,904,700 (8)
.abstracting: (p7<=0)
states: 223,360,188 (8)
abstracting: (0<=p7)
states: 232,904,700 (8)
abstracting: (1<=p14)
states: 9,544,512 (6)
abstracting: (p14<=1)
states: 232,904,700 (8)
abstracting: (0<=p75)
states: 232,904,700 (8)
abstracting: (p75<=0)
states: 223,360,188 (8)
abstracting: (0<=p62)
states: 232,904,700 (8)
abstracting: (p62<=0)
states: 223,360,188 (8)
abstracting: (p92<=0)
states: 223,360,188 (8)
abstracting: (0<=p92)
states: 232,904,700 (8)
abstracting: (p82<=1)
states: 232,904,700 (8)
abstracting: (1<=p82)
states: 13,380,765 (7)
.-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.194sec

checking: E [[[1<=p113 & p113<=1] | [p51<=0 & 0<=p51]] U [EG [[AX [[[0<=p128 & p128<=0] | [p134<=1 & 1<=p134]]] | EX [[p50<=1 & 1<=p50]]]] | [EG [AF [[[p90<=0 & 0<=p90] | [p81<=1 & 1<=p81]]]] | E [[[1<=p157 & p157<=1] | [p88<=0 & 0<=p88]] U [~ [AF [[p16<=1 & 1<=p16]]] & ~ [[p84<=0 & 0<=p84]]]]]]]
normalized: E [[[p51<=0 & 0<=p51] | [1<=p113 & p113<=1]] U [[E [[[p88<=0 & 0<=p88] | [1<=p157 & p157<=1]] U [~ [[p84<=0 & 0<=p84]] & EG [~ [[p16<=1 & 1<=p16]]]]] | EG [~ [EG [~ [[[p81<=1 & 1<=p81] | [p90<=0 & 0<=p90]]]]]]] | EG [[EX [[p50<=1 & 1<=p50]] | ~ [EX [~ [[[p134<=1 & 1<=p134] | [0<=p128 & p128<=0]]]]]]]]]

abstracting: (p128<=0)
states: 223,360,188 (8)
abstracting: (0<=p128)
states: 232,904,700 (8)
abstracting: (1<=p134)
states: 9,544,512 (6)
abstracting: (p134<=1)
states: 232,904,700 (8)
.abstracting: (1<=p50)
states: 9,544,512 (6)
abstracting: (p50<=1)
states: 232,904,700 (8)
..
EG iterations: 1
abstracting: (0<=p90)
states: 232,904,700 (8)
abstracting: (p90<=0)
states: 223,360,188 (8)
abstracting: (1<=p81)
states: 9,544,507 (6)
abstracting: (p81<=1)
states: 232,904,700 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p16)
states: 9,544,512 (6)
abstracting: (p16<=1)
states: 232,904,700 (8)
.
EG iterations: 1
abstracting: (0<=p84)
states: 232,904,700 (8)
abstracting: (p84<=0)
states: 245
abstracting: (p157<=1)
states: 232,904,700 (8)
abstracting: (1<=p157)
states: 7,962,624 (6)
abstracting: (0<=p88)
states: 232,904,700 (8)
abstracting: (p88<=0)
states: 223,360,188 (8)
abstracting: (p113<=1)
states: 232,904,700 (8)
abstracting: (1<=p113)
states: 232,904,455 (8)
abstracting: (0<=p51)
states: 232,904,700 (8)
abstracting: (p51<=0)
states: 223,360,188 (8)
-> the formula is TRUE

FORMULA CloudDeployment-PT-5a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.644sec

checking: A [[~ [E [~ [E [[[p58<=0 & 0<=p58] | [p83<=1 & 1<=p83]] U [p152<=1 & 1<=p152]]] U EG [[p124<=0 & 0<=p124]]]] | [~ [EG [E [[p132<=1 & 1<=p132] U [[p100<=0 & 0<=p100] | [p159<=1 & 1<=p159]]]]] & AF [E [~ [[p20<=1 & 1<=p20]] U [[p40<=1 & 1<=p40] & [p97<=1 & 1<=p97]]]]]] U [p9<=1 & 1<=p9]]
normalized: [~ [EG [~ [[p9<=1 & 1<=p9]]]] & ~ [E [~ [[p9<=1 & 1<=p9]] U [~ [[[~ [EG [~ [E [~ [[p20<=1 & 1<=p20]] U [[p97<=1 & 1<=p97] & [p40<=1 & 1<=p40]]]]]] & ~ [EG [E [[p132<=1 & 1<=p132] U [[p159<=1 & 1<=p159] | [p100<=0 & 0<=p100]]]]]] | ~ [E [~ [E [[[p83<=1 & 1<=p83] | [p58<=0 & 0<=p58]] U [p152<=1 & 1<=p152]]] U EG [[p124<=0 & 0<=p124]]]]]] & ~ [[p9<=1 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 9,544,512 (6)
abstracting: (p9<=1)
states: 232,904,700 (8)
abstracting: (0<=p124)
states: 232,904,700 (8)
abstracting: (p124<=0)
states: 223,360,188 (8)
.
EG iterations: 1
abstracting: (1<=p152)
states: 7,962,624 (6)
abstracting: (p152<=1)
states: 232,904,700 (8)
abstracting: (0<=p58)
states: 232,904,700 (8)
abstracting: (p58<=0)
states: 245
abstracting: (1<=p83)
states: 243
abstracting: (p83<=1)
states: 232,904,700 (8)
abstracting: (0<=p100)
states: 232,904,700 (8)
abstracting: (p100<=0)
states: 223,360,188 (8)
abstracting: (1<=p159)
states: 7,962,624 (6)
abstracting: (p159<=1)
states: 232,904,700 (8)
abstracting: (1<=p132)
states: 9,544,512 (6)
abstracting: (p132<=1)
states: 232,904,700 (8)
.
EG iterations: 1
abstracting: (1<=p40)
states: 9,544,512 (6)
abstracting: (p40<=1)
states: 232,904,700 (8)
abstracting: (1<=p97)
states: 9,544,512 (6)
abstracting: (p97<=1)
states: 232,904,700 (8)
abstracting: (1<=p20)
states: 9,544,512 (6)
abstracting: (p20<=1)
states: 232,904,700 (8)
.
EG iterations: 1
abstracting: (1<=p9)
states: 9,544,512 (6)
abstracting: (p9<=1)
states: 232,904,700 (8)
abstracting: (1<=p9)
states: 9,544,512 (6)
abstracting: (p9<=1)
states: 232,904,700 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.530sec

checking: [[[[EG [AX [[0<=p41 & p41<=0]]] & EF [EG [AX [[0<=p137 & p137<=0]]]]] & AG [[[[0<=p168 & p168<=0] | [1<=p165 & p165<=1]] & AG [~ [[1<=p93 & p93<=1]]]]]] & [EG [[0<=p135 & p135<=0]] & ~ [A [[1<=p51 & p51<=1] U [0<=p51 & p51<=0]]]]] | EX [[[[[1<=p106 & p106<=1] & [0<=p53 & p53<=0]] | [[1<=p64 & p64<=1] & [0<=p142 & p142<=0]]] | AG [[[1<=p106 & p106<=1] & [[1<=p35 & p35<=1] | [p154<=0 & 0<=p154]]]]]]]
normalized: [EX [[~ [E [true U ~ [[[[p154<=0 & 0<=p154] | [1<=p35 & p35<=1]] & [1<=p106 & p106<=1]]]]] | [[[0<=p142 & p142<=0] & [1<=p64 & p64<=1]] | [[0<=p53 & p53<=0] & [1<=p106 & p106<=1]]]]] | [[~ [[~ [EG [~ [[0<=p51 & p51<=0]]]] & ~ [E [~ [[0<=p51 & p51<=0]] U [~ [[1<=p51 & p51<=1]] & ~ [[0<=p51 & p51<=0]]]]]]] & EG [[0<=p135 & p135<=0]]] & [~ [E [true U ~ [[~ [E [true U [1<=p93 & p93<=1]]] & [[1<=p165 & p165<=1] | [0<=p168 & p168<=0]]]]]] & [E [true U EG [~ [EX [~ [[0<=p137 & p137<=0]]]]]] & EG [~ [EX [~ [[0<=p41 & p41<=0]]]]]]]]]

abstracting: (p41<=0)
states: 223,360,188 (8)
abstracting: (0<=p41)
states: 232,904,700 (8)
..
EG iterations: 1
abstracting: (p137<=0)
states: 219,523,935 (8)
abstracting: (0<=p137)
states: 232,904,700 (8)
..
EG iterations: 1
abstracting: (p168<=0)
states: 228,769,728 (8)
abstracting: (0<=p168)
states: 232,904,700 (8)
abstracting: (p165<=1)
states: 232,904,700 (8)
abstracting: (1<=p165)
states: 29,703,888 (7)
abstracting: (p93<=1)
states: 232,904,700 (8)
abstracting: (1<=p93)
states: 9,544,512 (6)
abstracting: (p135<=0)
states: 223,360,188 (8)
abstracting: (0<=p135)
states: 232,904,700 (8)
.
EG iterations: 1
abstracting: (p51<=0)
states: 223,360,188 (8)
abstracting: (0<=p51)
states: 232,904,700 (8)
abstracting: (p51<=1)
states: 232,904,700 (8)
abstracting: (1<=p51)
states: 9,544,512 (6)
abstracting: (p51<=0)
states: 223,360,188 (8)
abstracting: (0<=p51)
states: 232,904,700 (8)
abstracting: (p51<=0)
states: 223,360,188 (8)
abstracting: (0<=p51)
states: 232,904,700 (8)
.
EG iterations: 1
abstracting: (p106<=1)
states: 232,904,700 (8)
abstracting: (1<=p106)
states: 9,544,512 (6)
abstracting: (p53<=0)
states: 223,360,193 (8)
abstracting: (0<=p53)
states: 232,904,700 (8)
abstracting: (p64<=1)
states: 232,904,700 (8)
abstracting: (1<=p64)
states: 9,544,512 (6)
abstracting: (p142<=0)
states: 224,942,077 (8)
abstracting: (0<=p142)
states: 232,904,700 (8)
abstracting: (p106<=1)
states: 232,904,700 (8)
abstracting: (1<=p106)
states: 9,544,512 (6)
abstracting: (p35<=1)
states: 232,904,700 (8)
abstracting: (1<=p35)
states: 9,544,512 (6)
abstracting: (0<=p154)
states: 232,904,700 (8)
abstracting: (p154<=0)
states: 224,942,076 (8)
.-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.736sec

checking: A [EG [[[p116<=0 & 0<=p116] | [p85<=1 & 1<=p85]]] U [[[[EF [[[1<=p52 & p52<=1] | [p171<=0 & 0<=p171]]] | ~ [EX [[[1<=p48 & p48<=1] | [p106<=0 & 0<=p106]]]]] | EX [AX [AG [[p113<=0 & 0<=p113]]]]] & [~ [[[[p124<=0 & 0<=p124] | [p66<=1 & 1<=p66]] & [p106<=0 & 0<=p106]]] | AX [[[[p153<=0 & 0<=p153] | [p70<=1 & 1<=p70]] | [[p84<=0 & 0<=p84] | [p60<=1 & 1<=p60]]]]]] & [p93<=1 & 1<=p93]]]
normalized: [~ [EG [~ [[[p93<=1 & 1<=p93] & [[~ [EX [~ [[[[p60<=1 & 1<=p60] | [p84<=0 & 0<=p84]] | [[p70<=1 & 1<=p70] | [p153<=0 & 0<=p153]]]]]] | ~ [[[p106<=0 & 0<=p106] & [[p66<=1 & 1<=p66] | [p124<=0 & 0<=p124]]]]] & [EX [~ [EX [E [true U ~ [[p113<=0 & 0<=p113]]]]]] | [~ [EX [[[p106<=0 & 0<=p106] | [1<=p48 & p48<=1]]]] | E [true U [[p171<=0 & 0<=p171] | [1<=p52 & p52<=1]]]]]]]]]] & ~ [E [~ [[[p93<=1 & 1<=p93] & [[~ [EX [~ [[[[p60<=1 & 1<=p60] | [p84<=0 & 0<=p84]] | [[p70<=1 & 1<=p70] | [p153<=0 & 0<=p153]]]]]] | ~ [[[p106<=0 & 0<=p106] & [[p66<=1 & 1<=p66] | [p124<=0 & 0<=p124]]]]] & [EX [~ [EX [E [true U ~ [[p113<=0 & 0<=p113]]]]]] | [~ [EX [[[p106<=0 & 0<=p106] | [1<=p48 & p48<=1]]]] | E [true U [[p171<=0 & 0<=p171] | [1<=p52 & p52<=1]]]]]]]] U [~ [EG [[[p85<=1 & 1<=p85] | [p116<=0 & 0<=p116]]]] & ~ [[[p93<=1 & 1<=p93] & [[~ [EX [~ [[[[p60<=1 & 1<=p60] | [p84<=0 & 0<=p84]] | [[p70<=1 & 1<=p70] | [p153<=0 & 0<=p153]]]]]] | ~ [[[p106<=0 & 0<=p106] & [[p66<=1 & 1<=p66] | [p124<=0 & 0<=p124]]]]] & [EX [~ [EX [E [true U ~ [[p113<=0 & 0<=p113]]]]]] | [~ [EX [[[p106<=0 & 0<=p106] | [1<=p48 & p48<=1]]]] | E [true U [[p171<=0 & 0<=p171] | [1<=p52 & p52<=1]]]]]]]]]]]]

abstracting: (p52<=1)
states: 232,904,700 (8)
abstracting: (1<=p52)
states: 9,544,512 (6)
abstracting: (0<=p171)
states: 232,904,700 (8)
abstracting: (p171<=0)
states: 203,200,812 (8)
abstracting: (p48<=1)
states: 232,904,700 (8)
abstracting: (1<=p48)
states: 9,544,512 (6)
abstracting: (0<=p106)
states: 232,904,700 (8)
abstracting: (p106<=0)
states: 223,360,188 (8)
.abstracting: (0<=p113)
states: 232,904,700 (8)
abstracting: (p113<=0)
states: 245
..abstracting: (0<=p124)
states: 232,904,700 (8)
abstracting: (p124<=0)
states: 223,360,188 (8)
abstracting: (1<=p66)
states: 9,544,512 (6)
abstracting: (p66<=1)
states: 232,904,700 (8)
abstracting: (0<=p106)
states: 232,904,700 (8)
abstracting: (p106<=0)
states: 223,360,188 (8)
abstracting: (0<=p153)
states: 232,904,700 (8)
abstracting: (p153<=0)
states: 224,942,076 (8)
abstracting: (1<=p70)
states: 9,544,593 (6)
abstracting: (p70<=1)
states: 232,904,700 (8)
abstracting: (0<=p84)
states: 232,904,700 (8)
abstracting: (p84<=0)
states: 245
abstracting: (1<=p60)
states: 9,544,512 (6)
abstracting: (p60<=1)
states: 232,904,700 (8)
.abstracting: (1<=p93)
states: 9,544,512 (6)
abstracting: (p93<=1)
states: 232,904,700 (8)
abstracting: (0<=p116)
states: 232,904,700 (8)
abstracting: (p116<=0)
states: 223,360,188 (8)
abstracting: (1<=p85)
states: 243
abstracting: (p85<=1)
states: 232,904,700 (8)
.
EG iterations: 1
abstracting: (p52<=1)
states: 232,904,700 (8)
abstracting: (1<=p52)
states: 9,544,512 (6)
abstracting: (0<=p171)
states: 232,904,700 (8)
abstracting: (p171<=0)
states: 203,200,812 (8)
abstracting: (p48<=1)
states: 232,904,700 (8)
abstracting: (1<=p48)
states: 9,544,512 (6)
abstracting: (0<=p106)
states: 232,904,700 (8)
abstracting: (p106<=0)
states: 223,360,188 (8)
.abstracting: (0<=p113)
states: 232,904,700 (8)
abstracting: (p113<=0)
states: 245
..abstracting: (0<=p124)
states: 232,904,700 (8)
abstracting: (p124<=0)
states: 223,360,188 (8)
abstracting: (1<=p66)
states: 9,544,512 (6)
abstracting: (p66<=1)
states: 232,904,700 (8)
abstracting: (0<=p106)
states: 232,904,700 (8)
abstracting: (p106<=0)
states: 223,360,188 (8)
abstracting: (0<=p153)
states: 232,904,700 (8)
abstracting: (p153<=0)
states: 224,942,076 (8)
abstracting: (1<=p70)
states: 9,544,593 (6)
abstracting: (p70<=1)
states: 232,904,700 (8)
abstracting: (0<=p84)
states: 232,904,700 (8)
abstracting: (p84<=0)
states: 245
abstracting: (1<=p60)
states: 9,544,512 (6)
abstracting: (p60<=1)
states: 232,904,700 (8)
.abstracting: (1<=p93)
states: 9,544,512 (6)
abstracting: (p93<=1)
states: 232,904,700 (8)
abstracting: (p52<=1)
states: 232,904,700 (8)
abstracting: (1<=p52)
states: 9,544,512 (6)
abstracting: (0<=p171)
states: 232,904,700 (8)
abstracting: (p171<=0)
states: 203,200,812 (8)
abstracting: (p48<=1)
states: 232,904,700 (8)
abstracting: (1<=p48)
states: 9,544,512 (6)
abstracting: (0<=p106)
states: 232,904,700 (8)
abstracting: (p106<=0)
states: 223,360,188 (8)
.abstracting: (0<=p113)
states: 232,904,700 (8)
abstracting: (p113<=0)
states: 245
..abstracting: (0<=p124)
states: 232,904,700 (8)
abstracting: (p124<=0)
states: 223,360,188 (8)
abstracting: (1<=p66)
states: 9,544,512 (6)
abstracting: (p66<=1)
states: 232,904,700 (8)
abstracting: (0<=p106)
states: 232,904,700 (8)
abstracting: (p106<=0)
states: 223,360,188 (8)
abstracting: (0<=p153)
states: 232,904,700 (8)
abstracting: (p153<=0)
states: 224,942,076 (8)
abstracting: (1<=p70)
states: 9,544,593 (6)
abstracting: (p70<=1)
states: 232,904,700 (8)
abstracting: (0<=p84)
states: 232,904,700 (8)
abstracting: (p84<=0)
states: 245
abstracting: (1<=p60)
states: 9,544,512 (6)
abstracting: (p60<=1)
states: 232,904,700 (8)
.abstracting: (1<=p93)
states: 9,544,512 (6)
abstracting: (p93<=1)
states: 232,904,700 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CloudDeployment-PT-5a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.213sec

totally nodes used: 5493496 (5.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 43025034 104161489 147186523
used/not used/entry size/cache size: 53612835 13496029 16 1024MB
basic ops cache: hits/miss/sum: 1598156 3518689 5116845
used/not used/entry size/cache size: 4921379 11855837 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: 49332 136467 185799
used/not used/entry size/cache size: 135415 8253193 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 62154033
1 4480999
2 415934
3 51561
4 5791
5 508
6 30
7 5
8 1
9 1
>= 10 1

Total processing time: 0m48.469sec


BK_STOP 1678494206582

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

2307 7914
iterations count:208135 (386), effective:2439 (4)

initing FirstDep: 0m 0.001sec


iterations count:1423 (2), effective:3 (0)

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

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

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

iterations count:15949 (29), effective:261 (0)

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

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

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

iterations count:14186 (26), effective:139 (0)

iterations count:19189 (35), effective:309 (0)

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

iterations count:4487 (8), effective:33 (0)

iterations count:16991 (31), effective:140 (0)

iterations count:658 (1), effective:6 (0)

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

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

iterations count:976 (1), effective:2 (0)

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

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

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

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

iterations count:13190 (24), effective:168 (0)

iterations count:616 (1), effective:15 (0)

iterations count:13740 (25), effective:132 (0)

iterations count:14760 (27), effective:139 (0)

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

iterations count:855 (1), effective:2 (0)

iterations count:4024 (7), effective:97 (0)

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

iterations count:4024 (7), effective:97 (0)

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

iterations count:15892 (29), effective:143 (0)

iterations count:4024 (7), effective:97 (0)

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

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="CloudDeployment-PT-5a"
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 CloudDeployment-PT-5a, 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 r074-smll-167814400200409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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