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-167814400300438.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-6b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400300438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 14:48 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:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:49 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 4.8M 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-6b-ReachabilityCardinality-00
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-01
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-02
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-03
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-04
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-05
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-06
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-07
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-08
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-09
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-10
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-11
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-12
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-13
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-14
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678507324678

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 04:02:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 04:02:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:02:07] [INFO ] Load time of PNML (sax parser for PT used): 667 ms
[2023-03-11 04:02:08] [INFO ] Transformed 1888 places.
[2023-03-11 04:02:08] [INFO ] Transformed 6804 transitions.
[2023-03-11 04:02:08] [INFO ] Found NUPN structural information;
[2023-03-11 04:02:08] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 839 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 48 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 14) seen :5
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :1
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 6804 rows 1888 cols
[2023-03-11 04:02:10] [INFO ] Computed 25 place invariants in 308 ms
[2023-03-11 04:02:11] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 31 ms returned sat
[2023-03-11 04:02:15] [INFO ] After 4975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:02:16] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 45 ms returned sat
[2023-03-11 04:02:27] [INFO ] After 10417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 04:02:29] [INFO ] After 13309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2122 ms.
[2023-03-11 04:02:32] [INFO ] After 16800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 498 ms.
Support contains 32 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1827 edges and 1888 vertex of which 461 / 1888 are part of one of the 44 SCC in 12 ms
Free SCC test removed 417 places
Drop transitions removed 510 transitions
Reduce isomorphic transitions removed 510 transitions.
Graph (complete) has 4350 edges and 1471 vertex of which 1460 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.30 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Ensure Unique test removed 1 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 668 rules applied. Total rules applied 670 place count 1459 transition count 5622
Reduce places removed 662 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 678 rules applied. Total rules applied 1348 place count 797 transition count 5606
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1363 place count 782 transition count 5606
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 1363 place count 782 transition count 5579
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1417 place count 755 transition count 5579
Discarding 320 places :
Symmetric choice reduction at 3 with 320 rule applications. Total rules 1737 place count 435 transition count 1176
Iterating global reduction 3 with 320 rules applied. Total rules applied 2057 place count 435 transition count 1176
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2087 place count 435 transition count 1146
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 2087 place count 435 transition count 1129
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2121 place count 418 transition count 1129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2125 place count 414 transition count 1125
Iterating global reduction 4 with 4 rules applied. Total rules applied 2129 place count 414 transition count 1125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2132 place count 411 transition count 1122
Iterating global reduction 4 with 3 rules applied. Total rules applied 2135 place count 411 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2137 place count 409 transition count 1120
Iterating global reduction 4 with 2 rules applied. Total rules applied 2139 place count 409 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2140 place count 408 transition count 1119
Iterating global reduction 4 with 1 rules applied. Total rules applied 2141 place count 408 transition count 1119
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 2327 place count 315 transition count 1026
Performed 36 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 2399 place count 279 transition count 1197
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 2412 place count 279 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2413 place count 278 transition count 1163
Iterating global reduction 5 with 1 rules applied. Total rules applied 2414 place count 278 transition count 1163
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2426 place count 272 transition count 1223
Drop transitions removed 111 transitions
Redundant transition composition rules discarded 111 transitions
Iterating global reduction 5 with 111 rules applied. Total rules applied 2537 place count 272 transition count 1112
Free-agglomeration rule applied 69 times with reduction of 29 identical transitions.
Iterating global reduction 5 with 69 rules applied. Total rules applied 2606 place count 272 transition count 1014
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 99 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 5 with 238 rules applied. Total rules applied 2844 place count 203 transition count 845
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2846 place count 201 transition count 830
Iterating global reduction 6 with 2 rules applied. Total rules applied 2848 place count 201 transition count 830
Drop transitions removed 139 transitions
Redundant transition composition rules discarded 139 transitions
Iterating global reduction 6 with 139 rules applied. Total rules applied 2987 place count 201 transition count 691
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2993 place count 201 transition count 712
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2999 place count 195 transition count 712
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 3003 place count 195 transition count 712
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3004 place count 194 transition count 711
Applied a total of 3004 rules in 1392 ms. Remains 194 /1888 variables (removed 1694) and now considering 711/6804 (removed 6093) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1393 ms. Remains : 194/1888 places, 711/6804 transitions.
Incomplete random walk after 10000 steps, including 278 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 6) seen :2
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 04:02:34] [INFO ] Flow matrix only has 428 transitions (discarded 283 similar events)
// Phase 1: matrix 428 rows 194 cols
[2023-03-11 04:02:34] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-11 04:02:34] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-11 04:02:34] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 04:02:34] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 8 ms returned sat
[2023-03-11 04:02:34] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 04:02:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 04:02:35] [INFO ] After 94ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 04:02:35] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-11 04:02:35] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 14 ms.
Support contains 23 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 711/711 transitions.
Graph (trivial) has 75 edges and 194 vertex of which 4 / 194 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 192 transition count 705
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 190 transition count 705
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 184 transition count 699
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 184 transition count 698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 182 transition count 697
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 182 transition count 696
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 61 place count 182 transition count 658
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 182 transition count 656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 180 transition count 656
Applied a total of 65 rules in 101 ms. Remains 180 /194 variables (removed 14) and now considering 656/711 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 180/194 places, 656/711 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 372730 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 372730 steps, saw 73353 distinct states, run finished after 3006 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 04:02:38] [INFO ] Flow matrix only has 373 transitions (discarded 283 similar events)
// Phase 1: matrix 373 rows 180 cols
[2023-03-11 04:02:38] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-11 04:02:38] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-11 04:02:39] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 04:02:39] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 14 ms returned sat
[2023-03-11 04:02:39] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 04:02:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:02:39] [INFO ] After 168ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 04:02:39] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-11 04:02:40] [INFO ] After 912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 23 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 656/656 transitions.
Applied a total of 0 rules in 20 ms. Remains 180 /180 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 180/180 places, 656/656 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 656/656 transitions.
Applied a total of 0 rules in 21 ms. Remains 180 /180 variables (removed 0) and now considering 656/656 (removed 0) transitions.
[2023-03-11 04:02:40] [INFO ] Flow matrix only has 373 transitions (discarded 283 similar events)
[2023-03-11 04:02:40] [INFO ] Invariant cache hit.
[2023-03-11 04:02:40] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-11 04:02:40] [INFO ] Flow matrix only has 373 transitions (discarded 283 similar events)
[2023-03-11 04:02:40] [INFO ] Invariant cache hit.
[2023-03-11 04:02:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:02:41] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned [0, 2, 25, 28, 47, 53, 73, 75, 97, 102, 120, 122]
Discarding 12 places :
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 1520 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 168/180 places, 644/656 transitions.
Applied a total of 0 rules in 14 ms. Remains 168 /168 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1557 ms. Remains : 168/180 places, 644/656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :1
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:02:42] [INFO ] Flow matrix only has 361 transitions (discarded 283 similar events)
// Phase 1: matrix 361 rows 168 cols
[2023-03-11 04:02:42] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-11 04:02:42] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-11 04:02:42] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:02:42] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-11 04:02:42] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:02:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:02:42] [INFO ] After 71ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:02:42] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 04:02:42] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 18 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 644/644 transitions.
Graph (trivial) has 59 edges and 168 vertex of which 4 / 168 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 0 with 8 rules applied. Total rules applied 9 place count 162 transition count 636
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 162 transition count 633
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 162 transition count 626
Applied a total of 19 rules in 32 ms. Remains 162 /168 variables (removed 6) and now considering 626/644 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 162/168 places, 626/644 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 544204 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 544204 steps, saw 84186 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:02:46] [INFO ] Flow matrix only has 337 transitions (discarded 289 similar events)
// Phase 1: matrix 337 rows 162 cols
[2023-03-11 04:02:46] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-11 04:02:46] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-11 04:02:46] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:02:46] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-11 04:02:46] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:02:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:02:46] [INFO ] After 61ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:02:46] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 04:02:46] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 18 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 626/626 transitions.
Applied a total of 0 rules in 13 ms. Remains 162 /162 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 162/162 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 626/626 transitions.
Applied a total of 0 rules in 13 ms. Remains 162 /162 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2023-03-11 04:02:46] [INFO ] Flow matrix only has 337 transitions (discarded 289 similar events)
[2023-03-11 04:02:46] [INFO ] Invariant cache hit.
[2023-03-11 04:02:46] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-11 04:02:46] [INFO ] Flow matrix only has 337 transitions (discarded 289 similar events)
[2023-03-11 04:02:46] [INFO ] Invariant cache hit.
[2023-03-11 04:02:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:02:47] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2023-03-11 04:02:47] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-11 04:02:47] [INFO ] Flow matrix only has 337 transitions (discarded 289 similar events)
[2023-03-11 04:02:47] [INFO ] Invariant cache hit.
[2023-03-11 04:02:47] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1263 ms. Remains : 162/162 places, 626/626 transitions.
Graph (trivial) has 118 edges and 162 vertex of which 35 / 162 are part of one of the 6 SCC in 1 ms
Free SCC test removed 29 places
Drop transitions removed 45 transitions
Ensure Unique test removed 289 transitions
Reduce isomorphic transitions removed 334 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 127 transition count 272
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 50 place count 107 transition count 269
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 105 transition count 268
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 53 place count 105 transition count 256
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 77 place count 93 transition count 256
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 90 transition count 253
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 90 transition count 253
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 87 transition count 250
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 87 transition count 250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 84 transition count 232
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 84 transition count 232
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 131 place count 84 transition count 196
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 4 with 10 rules applied. Total rules applied 141 place count 79 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 79 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 78 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 78 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 77 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 77 transition count 182
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 159 place count 77 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 76 transition count 176
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 178 place count 76 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 179 place count 76 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 180 place count 75 transition count 158
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 75 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 184 place count 73 transition count 156
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 185 place count 73 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 186 place count 72 transition count 186
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 187 place count 72 transition count 186
Applied a total of 187 rules in 74 ms. Remains 72 /162 variables (removed 90) and now considering 186/626 (removed 440) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 186 rows 72 cols
[2023-03-11 04:02:48] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 04:02:48] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-11 04:02:48] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 04:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 04:02:48] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:02:48] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:02:48] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-11 04:02:48] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:02:48] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:02:48] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-11 04:02:48] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:02:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-11 04:02:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 162 places, 626 transitions and 4934 arcs took 13 ms.
[2023-03-11 04:02:49] [INFO ] Flatten gal took : 201 ms
Total runtime 41915 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: CloudDeployment_PT_6b
(NrP: 162 NrTr: 626 NrArc: 4934)

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

net check time: 0m 0.000sec

init dd package: 0m 3.248sec


RS generation: 0m25.853sec


-> reachability set: #nodes 59991 (6.0e+04) #states 8,961,062,001 (9)



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

checking: EF [[[[1<=p28 & p28<=1] & [1<=p111 & p111<=1]] & [[1<=p38 & p38<=1] & [0<=p88 & p88<=0]]]]
normalized: E [true U [[[1<=p28 & p28<=1] & [1<=p111 & p111<=1]] & [[1<=p38 & p38<=1] & [0<=p88 & p88<=0]]]]

abstracting: (p88<=0)
states: 8,441,808,693 (9)
abstracting: (0<=p88)
states: 8,961,062,001 (9)
abstracting: (p38<=1)
states: 8,961,062,001 (9)
abstracting: (1<=p38)
states: 846,655,488 (8)
abstracting: (p111<=1)
states: 8,961,062,001 (9)
abstracting: (1<=p111)
states: 555,549,960 (8)
abstracting: (p28<=1)
states: 8,961,062,001 (9)
abstracting: (1<=p28)
states: 523,111,092 (8)
-> the formula is TRUE

FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.202sec

checking: AG [[[[0<=p43 & p43<=0] | [1<=p71 & p71<=1]] | [[0<=p60 & p60<=0] | [p82<=1 & 1<=p82]]]]
normalized: ~ [E [true U ~ [[[[p82<=1 & 1<=p82] | [0<=p60 & p60<=0]] | [[1<=p71 & p71<=1] | [0<=p43 & p43<=0]]]]]]

abstracting: (p43<=0)
states: 8,544,580,173 (9)
abstracting: (0<=p43)
states: 8,961,062,001 (9)
abstracting: (p71<=1)
states: 8,961,062,001 (9)
abstracting: (1<=p71)
states: 320,831,616 (8)
abstracting: (p60<=0)
states: 8,482,060,233 (9)
abstracting: (0<=p60)
states: 8,961,062,001 (9)
abstracting: (1<=p82)
states: 296,742,180 (8)
abstracting: (p82<=1)
states: 8,961,062,001 (9)
-> the formula is TRUE

FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.261sec

checking: AG [[[[0<=p26 & p26<=0] | [p14<=1 & 1<=p14]] | [[1<=p63 & p63<=1] | [[0<=p6 & p6<=0] | [[[1<=p90 & p90<=1] & [0<=p83 & p83<=0]] & [[[p105<=1 & 1<=p105] | [p40<=0 & 0<=p40]] & [[p18<=0 & 0<=p18] | [1<=p74 & p74<=1]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[1<=p74 & p74<=1] | [p18<=0 & 0<=p18]] & [[p40<=0 & 0<=p40] | [p105<=1 & 1<=p105]]] & [[0<=p83 & p83<=0] & [1<=p90 & p90<=1]]] | [0<=p6 & p6<=0]] | [1<=p63 & p63<=1]] | [[p14<=1 & 1<=p14] | [0<=p26 & p26<=0]]]]]]

abstracting: (p26<=0)
states: 8,437,950,909 (9)
abstracting: (0<=p26)
states: 8,961,062,001 (9)
abstracting: (1<=p14)
states: 581,830,596 (8)
abstracting: (p14<=1)
states: 8,961,062,001 (9)
abstracting: (p63<=1)
states: 8,961,062,001 (9)
abstracting: (1<=p63)
states: 515,446,040 (8)
abstracting: (p6<=0)
states: 8,594,397,297 (9)
abstracting: (0<=p6)
states: 8,961,062,001 (9)
abstracting: (p90<=1)
states: 8,961,062,001 (9)
abstracting: (1<=p90)
states: 519,253,308 (8)
abstracting: (p83<=0)
states: 7,223,360,625 (9)
abstracting: (0<=p83)
states: 8,961,062,001 (9)
abstracting: (1<=p105)
states: 555,549,960 (8)
abstracting: (p105<=1)
states: 8,961,062,001 (9)
abstracting: (0<=p40)
states: 8,961,062,001 (9)
abstracting: (p40<=0)
states: 6,538,478,369 (9)
abstracting: (0<=p18)
states: 8,961,062,001 (9)
abstracting: (p18<=0)
states: 4,480,531,065 (9)
abstracting: (p74<=1)
states: 8,961,062,001 (9)
abstracting: (1<=p74)
states: 320,831,616 (8)
-> the formula is FALSE

FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.980sec

totally nodes used: 6395049 (6.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 35334391 103387811 138722202
used/not used/entry size/cache size: 54100410 13008454 16 1024MB
basic ops cache: hits/miss/sum: 2392992 6094104 8487096
used/not used/entry size/cache size: 8092709 8684507 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: 141916 411582 553498
used/not used/entry size/cache size: 403387 7985221 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 61533022
1 4883592
2 582353
3 94722
4 13470
5 1544
6 143
7 17
8 1
9 0
>= 10 0

Total processing time: 0m52.084sec


BK_STOP 1678507422449

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


initing FirstDep: 0m 0.001sec

19810
iterations count:163961 (261), effective:2464 (3)

initing FirstDep: 0m 0.001sec


iterations count:17819 (28), effective:567 (0)

iterations count:10923 (17), effective:218 (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-6b"
export BK_EXAMINATION="ReachabilityCardinality"
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-6b, examination is ReachabilityCardinality"
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-167814400300438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;