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

About the Execution of Marcie+red for CloudReconfiguration-PT-401

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5551.760 40053.00 59699.00 380.80 TFFFTTTFTTFFFFFF 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.r106-tall-167814482300166.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 CloudReconfiguration-PT-401, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482300166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.8K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 912K 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 CloudReconfiguration-PT-401-ReachabilityCardinality-00
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-01
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-02
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-03
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-04
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-05
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-06
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-07
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-08
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-09
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-10
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-11
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-12
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-13
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-14
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678345274966

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=CloudReconfiguration-PT-401
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 07:01:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 07:01:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:01:16] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-09 07:01:16] [INFO ] Transformed 3554 places.
[2023-03-09 07:01:16] [INFO ] Transformed 4263 transitions.
[2023-03-09 07:01:16] [INFO ] Found NUPN structural information;
[2023-03-09 07:01:16] [INFO ] Parsed PT model containing 3554 places and 4263 transitions and 8889 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 14) seen :2
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 4263 rows 3554 cols
[2023-03-09 07:01:18] [INFO ] Computed 5 place invariants in 59 ms
[2023-03-09 07:01:20] [INFO ] After 1507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 07:01:21] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 31 ms returned sat
[2023-03-09 07:01:26] [INFO ] After 4819ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-09 07:01:30] [INFO ] After 8986ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 2556 ms.
[2023-03-09 07:01:33] [INFO ] After 13278ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 11 different solutions.
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 183 ms.
Support contains 83 out of 3554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3554/3554 places, 4263/4263 transitions.
Graph (trivial) has 3895 edges and 3554 vertex of which 1059 / 3554 are part of one of the 85 SCC in 24 ms
Free SCC test removed 974 places
Drop transitions removed 1192 transitions
Reduce isomorphic transitions removed 1192 transitions.
Graph (complete) has 3443 edges and 2580 vertex of which 2562 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.6 ms
Discarding 18 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 1592 transitions
Trivial Post-agglo rules discarded 1592 transitions
Performed 1592 trivial Post agglomeration. Transition count delta: 1592
Iterating post reduction 0 with 1604 rules applied. Total rules applied 1606 place count 2562 transition count 1455
Reduce places removed 1592 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 1742 rules applied. Total rules applied 3348 place count 970 transition count 1305
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 68 rules applied. Total rules applied 3416 place count 910 transition count 1297
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 3422 place count 907 transition count 1294
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 3425 place count 906 transition count 1292
Reduce places removed 1 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 5 with 68 rules applied. Total rules applied 3493 place count 905 transition count 1225
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 77 rules applied. Total rules applied 3570 place count 838 transition count 1215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3572 place count 836 transition count 1215
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 41 Pre rules applied. Total rules applied 3572 place count 836 transition count 1174
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 3654 place count 795 transition count 1174
Discarding 109 places :
Symmetric choice reduction at 8 with 109 rule applications. Total rules 3763 place count 686 transition count 1065
Iterating global reduction 8 with 109 rules applied. Total rules applied 3872 place count 686 transition count 1065
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 10 rules applied. Total rules applied 3882 place count 686 transition count 1055
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3887 place count 681 transition count 1055
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 9 Pre rules applied. Total rules applied 3887 place count 681 transition count 1046
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 3905 place count 672 transition count 1046
Discarding 71 places :
Symmetric choice reduction at 10 with 71 rule applications. Total rules 3976 place count 601 transition count 975
Iterating global reduction 10 with 71 rules applied. Total rules applied 4047 place count 601 transition count 975
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 10 with 41 rules applied. Total rules applied 4088 place count 601 transition count 934
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 29 rules applied. Total rules applied 4117 place count 581 transition count 925
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 5 rules applied. Total rules applied 4122 place count 577 transition count 924
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 4123 place count 576 transition count 924
Discarding 17 places :
Symmetric choice reduction at 14 with 17 rule applications. Total rules 4140 place count 559 transition count 898
Iterating global reduction 14 with 17 rules applied. Total rules applied 4157 place count 559 transition count 898
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4163 place count 559 transition count 892
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 4169 place count 553 transition count 880
Iterating global reduction 15 with 6 rules applied. Total rules applied 4175 place count 553 transition count 880
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 4179 place count 549 transition count 872
Iterating global reduction 15 with 4 rules applied. Total rules applied 4183 place count 549 transition count 872
Performed 218 Post agglomeration using F-continuation condition with reduction of 93 identical transitions.
Deduced a syphon composed of 218 places in 0 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 15 with 436 rules applied. Total rules applied 4619 place count 331 transition count 561
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 4627 place count 331 transition count 553
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 4631 place count 329 transition count 551
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 4635 place count 329 transition count 547
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 4639 place count 327 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 4643 place count 327 transition count 541
Performed 61 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 18 with 122 rules applied. Total rules applied 4765 place count 266 transition count 607
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 18 with 36 rules applied. Total rules applied 4801 place count 266 transition count 571
Discarding 20 places :
Symmetric choice reduction at 19 with 20 rule applications. Total rules 4821 place count 246 transition count 527
Iterating global reduction 19 with 20 rules applied. Total rules applied 4841 place count 246 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 4844 place count 246 transition count 524
Discarding 3 places :
Symmetric choice reduction at 20 with 3 rule applications. Total rules 4847 place count 243 transition count 518
Iterating global reduction 20 with 3 rules applied. Total rules applied 4850 place count 243 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 4851 place count 243 transition count 517
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 21 with 37 rules applied. Total rules applied 4888 place count 243 transition count 480
Discarding 3 places :
Symmetric choice reduction at 21 with 3 rule applications. Total rules 4891 place count 240 transition count 477
Iterating global reduction 21 with 3 rules applied. Total rules applied 4894 place count 240 transition count 477
Free-agglomeration rule applied 26 times.
Iterating global reduction 21 with 26 rules applied. Total rules applied 4920 place count 240 transition count 451
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 21 with 26 rules applied. Total rules applied 4946 place count 214 transition count 451
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 4950 place count 214 transition count 447
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 4951 place count 214 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 4952 place count 213 transition count 446
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 23 with 15 rules applied. Total rules applied 4967 place count 213 transition count 446
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 4968 place count 213 transition count 445
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 23 with 4 rules applied. Total rules applied 4972 place count 213 transition count 445
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 4974 place count 213 transition count 443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 4975 place count 212 transition count 442
Applied a total of 4975 rules in 519 ms. Remains 212 /3554 variables (removed 3342) and now considering 442/4263 (removed 3821) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 212/3554 places, 442/4263 transitions.
Incomplete random walk after 10000 steps, including 220 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-09 07:01:34] [INFO ] Flow matrix only has 428 transitions (discarded 14 similar events)
// Phase 1: matrix 428 rows 212 cols
[2023-03-09 07:01:34] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-09 07:01:34] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 07:01:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 07:01:34] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 07:01:34] [INFO ] After 56ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:34] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 1 ms to minimize.
[2023-03-09 07:01:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-09 07:01:34] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-09 07:01:35] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 47 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 442/442 transitions.
Graph (trivial) has 111 edges and 212 vertex of which 24 / 212 are part of one of the 11 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 199 transition count 395
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 177 transition count 391
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 177 transition count 387
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 173 transition count 387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 171 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 171 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 171 transition count 383
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 88 place count 158 transition count 370
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 95 place count 158 transition count 363
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 156 transition count 359
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 156 transition count 359
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 105 place count 153 transition count 359
Drop transitions removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 112 place count 153 transition count 352
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 114 place count 151 transition count 348
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 151 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 119 place count 151 transition count 345
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 127 place count 151 transition count 337
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 151 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 150 transition count 336
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 131 place count 148 transition count 334
Iterating global reduction 8 with 2 rules applied. Total rules applied 133 place count 148 transition count 334
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 134 place count 147 transition count 333
Iterating global reduction 8 with 1 rules applied. Total rules applied 135 place count 147 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 136 place count 147 transition count 332
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 9 with 2 rules applied. Total rules applied 138 place count 146 transition count 331
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 141 place count 146 transition count 328
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 145 place count 143 transition count 327
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 146 place count 143 transition count 326
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 147 place count 143 transition count 326
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 148 place count 143 transition count 325
Applied a total of 148 rules in 71 ms. Remains 143 /212 variables (removed 69) and now considering 325/442 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 143/212 places, 325/442 transitions.
Incomplete random walk after 10000 steps, including 376 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1088085 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :{}
Probabilistic random walk after 1088085 steps, saw 191058 distinct states, run finished after 3003 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 07:01:38] [INFO ] Flow matrix only has 311 transitions (discarded 14 similar events)
// Phase 1: matrix 311 rows 143 cols
[2023-03-09 07:01:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 07:01:38] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 07:01:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 07:01:38] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:01:38] [INFO ] After 43ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:38] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-09 07:01:38] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 47 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 143/143 places, 325/325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-09 07:01:38] [INFO ] Flow matrix only has 311 transitions (discarded 14 similar events)
[2023-03-09 07:01:38] [INFO ] Invariant cache hit.
[2023-03-09 07:01:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 07:01:38] [INFO ] Flow matrix only has 311 transitions (discarded 14 similar events)
[2023-03-09 07:01:38] [INFO ] Invariant cache hit.
[2023-03-09 07:01:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:01:38] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [57, 108, 136]
Discarding 3 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 164 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 140/143 places, 324/325 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 139 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 138 transition count 323
Applied a total of 4 rules in 9 ms. Remains 138 /140 variables (removed 2) and now considering 323/324 (removed 1) transitions.
[2023-03-09 07:01:38] [INFO ] Flow matrix only has 309 transitions (discarded 14 similar events)
// Phase 1: matrix 309 rows 138 cols
[2023-03-09 07:01:38] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 07:01:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 07:01:38] [INFO ] Flow matrix only has 309 transitions (discarded 14 similar events)
[2023-03-09 07:01:38] [INFO ] Invariant cache hit.
[2023-03-09 07:01:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:01:38] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/143 places, 323/325 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 334 ms. Remains : 138/143 places, 323/325 transitions.
Incomplete random walk after 10000 steps, including 256 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 948433 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 948433 steps, saw 214841 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 07:01:42] [INFO ] Flow matrix only has 309 transitions (discarded 14 similar events)
[2023-03-09 07:01:42] [INFO ] Invariant cache hit.
[2023-03-09 07:01:42] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 07:01:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 07:01:42] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:01:42] [INFO ] After 44ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:42] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-09 07:01:42] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 47 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 323/323 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 138/138 places, 323/323 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 323/323 transitions.
Applied a total of 0 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 323/323 (removed 0) transitions.
[2023-03-09 07:01:42] [INFO ] Flow matrix only has 309 transitions (discarded 14 similar events)
[2023-03-09 07:01:42] [INFO ] Invariant cache hit.
[2023-03-09 07:01:42] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 07:01:42] [INFO ] Flow matrix only has 309 transitions (discarded 14 similar events)
[2023-03-09 07:01:42] [INFO ] Invariant cache hit.
[2023-03-09 07:01:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 07:01:42] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-09 07:01:42] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-09 07:01:42] [INFO ] Flow matrix only has 309 transitions (discarded 14 similar events)
[2023-03-09 07:01:42] [INFO ] Invariant cache hit.
[2023-03-09 07:01:42] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 138/138 places, 323/323 transitions.
Graph (trivial) has 50 edges and 138 vertex of which 7 / 138 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 17 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 128 transition count 295
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 128 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 128 transition count 292
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 46 place count 128 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 127 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 127 transition count 257
Free-agglomeration rule applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 61 place count 127 transition count 244
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 76 place count 114 transition count 242
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 114 transition count 238
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 114 transition count 236
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 112 transition count 234
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 112 transition count 234
Applied a total of 87 rules in 30 ms. Remains 112 /138 variables (removed 26) and now considering 234/323 (removed 89) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 234 rows 112 cols
[2023-03-09 07:01:42] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-09 07:01:42] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 07:01:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 07:01:42] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:42] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-09 07:01:42] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-09 07:01:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-09 07:01:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 323 transitions and 1005 arcs took 2 ms.
[2023-03-09 07:01:43] [INFO ] Flatten gal took : 58 ms
Total runtime 26778 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: CloudReconfiguration_PT_401
(NrP: 138 NrTr: 323 NrArc: 1005)

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

net check time: 0m 0.000sec

init dd package: 0m 2.764sec


RS generation: 0m 2.726sec


-> reachability set: #nodes 4950 (5.0e+03) #states 12,275,674 (7)



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

checking: EF [[[p1<=1 & 1<=p1] & [[p108<=1 & 1<=p108] & [[[p27<=0 & 0<=p27] & [p78<=1 & 1<=p78]] | [[[[p50<=0 & 0<=p50] & [[p35<=0 & 0<=p35] & [p54<=1 & 1<=p54]]] & [[p126<=0 & 0<=p126] & [[p15<=1 & 1<=p15] & [p44<=0 & 0<=p44]]]] & [[[p19<=0 & 0<=p19] & [[p67<=1 & 1<=p67] & [[p124<=0 & 0<=p124] | [p29<=1 & 1<=p29]]]] & [[[p0<=0 & 0<=p0] | [p116<=1 & 1<=p116]] & [[[p72<=1 & 1<=p72] | [p104<=1 & 1<=p104]] & [[p52<=0 & 0<=p52] | [p69<=0 & 0<=p69]]]]]]]]]]
normalized: E [true U [[p1<=1 & 1<=p1] & [[[[[[[p0<=0 & 0<=p0] | [p116<=1 & 1<=p116]] & [[[p69<=0 & 0<=p69] | [p52<=0 & 0<=p52]] & [[p72<=1 & 1<=p72] | [p104<=1 & 1<=p104]]]] & [[[p67<=1 & 1<=p67] & [[p124<=0 & 0<=p124] | [p29<=1 & 1<=p29]]] & [p19<=0 & 0<=p19]]] & [[[p126<=0 & 0<=p126] & [[p44<=0 & 0<=p44] & [p15<=1 & 1<=p15]]] & [[[p35<=0 & 0<=p35] & [p54<=1 & 1<=p54]] & [p50<=0 & 0<=p50]]]] | [[p78<=1 & 1<=p78] & [p27<=0 & 0<=p27]]] & [p108<=1 & 1<=p108]]]]

abstracting: (1<=p108)
states: 348,720 (5)
abstracting: (p108<=1)
states: 12,275,674 (7)
abstracting: (0<=p27)
states: 12,275,674 (7)
abstracting: (p27<=0)
states: 11,817,202 (7)
abstracting: (1<=p78)
states: 507,728 (5)
abstracting: (p78<=1)
states: 12,275,674 (7)
abstracting: (0<=p50)
states: 12,275,674 (7)
abstracting: (p50<=0)
states: 11,995,498 (7)
abstracting: (1<=p54)
states: 280,176 (5)
abstracting: (p54<=1)
states: 12,275,674 (7)
abstracting: (0<=p35)
states: 12,275,674 (7)
abstracting: (p35<=0)
states: 11,995,498 (7)
abstracting: (1<=p15)
states: 415,924 (5)
abstracting: (p15<=1)
states: 12,275,674 (7)
abstracting: (0<=p44)
states: 12,275,674 (7)
abstracting: (p44<=0)
states: 11,995,498 (7)
abstracting: (0<=p126)
states: 12,275,674 (7)
abstracting: (p126<=0)
states: 11,841,502 (7)
abstracting: (0<=p19)
states: 12,275,674 (7)
abstracting: (p19<=0)
states: 11,859,750 (7)
abstracting: (1<=p29)
states: 458,736 (5)
abstracting: (p29<=1)
states: 12,275,674 (7)
abstracting: (0<=p124)
states: 12,275,674 (7)
abstracting: (p124<=0)
states: 11,841,502 (7)
abstracting: (1<=p67)
states: 596,176 (5)
abstracting: (p67<=1)
states: 12,275,674 (7)
abstracting: (1<=p104)
states: 525,988 (5)
abstracting: (p104<=1)
states: 12,275,674 (7)
abstracting: (1<=p72)
states: 507,728 (5)
abstracting: (p72<=1)
states: 12,275,674 (7)
abstracting: (0<=p52)
states: 12,275,674 (7)
abstracting: (p52<=0)
states: 11,995,498 (7)
abstracting: (0<=p69)
states: 12,275,674 (7)
abstracting: (p69<=0)
states: 11,679,498 (7)
abstracting: (1<=p116)
states: 348,720 (5)
abstracting: (p116<=1)
states: 12,275,674 (7)
abstracting: (0<=p0)
states: 12,275,674 (7)
abstracting: (p0<=0)
states: 11,299,181 (7)
abstracting: (1<=p1)
states: 529,836 (5)
abstracting: (p1<=1)
states: 12,275,674 (7)
-> the formula is TRUE

FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.539sec

checking: EF [[[[[1<=p114 & p114<=1] & [p102<=0 & 0<=p102]] & [[p76<=0 & 0<=p76] & [p59<=1 & 1<=p59]]] & [[[p98<=1 & 1<=p98] & [[[p121<=0 & 0<=p121] | [p41<=0 & 0<=p41]] | [[p13<=1 & 1<=p13] | [[p26<=1 & 1<=p26] & [[p62<=0 & 0<=p62] | [p48<=1 & 1<=p48]]]]]] & [[[p39<=0 & 0<=p39] | [p80<=0 & 0<=p80]] & [[[p7<=0 & 0<=p7] | [[p3<=1 & 1<=p3] | [p79<=1 & 1<=p79]]] | [[[[p128<=1 & 1<=p128] & [p5<=0 & 0<=p5]] & [[p93<=1 & 1<=p93] & [p10<=0 & 0<=p10]]] | [[[[p46<=0 & 0<=p46] & [p49<=0 & 0<=p49]] & [[p14<=1 & 1<=p14] & [p89<=0 & 0<=p89]]] | [[p17<=0 & 0<=p17] & [[p9<=0 & 0<=p9] | [p130<=1 & 1<=p130]]]]]]]]]]
normalized: E [true U [[[[[[[[p10<=0 & 0<=p10] & [p93<=1 & 1<=p93]] & [[p5<=0 & 0<=p5] & [p128<=1 & 1<=p128]]] | [[[p17<=0 & 0<=p17] & [[p130<=1 & 1<=p130] | [p9<=0 & 0<=p9]]] | [[[p89<=0 & 0<=p89] & [p14<=1 & 1<=p14]] & [[p49<=0 & 0<=p49] & [p46<=0 & 0<=p46]]]]] | [[[p79<=1 & 1<=p79] | [p3<=1 & 1<=p3]] | [p7<=0 & 0<=p7]]] & [[p80<=0 & 0<=p80] | [p39<=0 & 0<=p39]]] & [[[[[[p48<=1 & 1<=p48] | [p62<=0 & 0<=p62]] & [p26<=1 & 1<=p26]] | [p13<=1 & 1<=p13]] | [[p41<=0 & 0<=p41] | [p121<=0 & 0<=p121]]] & [p98<=1 & 1<=p98]]] & [[[p59<=1 & 1<=p59] & [p76<=0 & 0<=p76]] & [[p102<=0 & 0<=p102] & [1<=p114 & p114<=1]]]]]

abstracting: (p114<=1)
states: 12,275,674 (7)
abstracting: (1<=p114)
states: 348,720 (5)
abstracting: (0<=p102)
states: 12,275,674 (7)
abstracting: (p102<=0)
states: 11,541,998 (7)
abstracting: (0<=p76)
states: 12,275,674 (7)
abstracting: (p76<=0)
states: 11,767,946 (7)
abstracting: (1<=p59)
states: 595,560 (5)
abstracting: (p59<=1)
states: 12,275,674 (7)
abstracting: (1<=p98)
states: 733,676 (5)
abstracting: (p98<=1)
states: 12,275,674 (7)
abstracting: (0<=p121)
states: 12,275,674 (7)
abstracting: (p121<=0)
states: 11,841,502 (7)
abstracting: (0<=p41)
states: 12,275,674 (7)
abstracting: (p41<=0)
states: 11,816,938 (7)
abstracting: (1<=p13)
states: 415,924 (5)
abstracting: (p13<=1)
states: 12,275,674 (7)
abstracting: (1<=p26)
states: 458,472 (5)
abstracting: (p26<=1)
states: 12,275,674 (7)
abstracting: (0<=p62)
states: 12,275,674 (7)
abstracting: (p62<=0)
states: 12,183,642 (7)
abstracting: (1<=p48)
states: 280,176 (5)
abstracting: (p48<=1)
states: 12,275,674 (7)
abstracting: (0<=p39)
states: 12,275,674 (7)
abstracting: (p39<=0)
states: 11,816,938 (7)
abstracting: (0<=p80)
states: 12,275,674 (7)
abstracting: (p80<=0)
states: 11,767,946 (7)
abstracting: (0<=p7)
states: 12,275,674 (7)
abstracting: (p7<=0)
states: 11,697,454 (7)
abstracting: (1<=p3)
states: 529,836 (5)
abstracting: (p3<=1)
states: 12,275,674 (7)
abstracting: (1<=p79)
states: 507,728 (5)
abstracting: (p79<=1)
states: 12,275,674 (7)
abstracting: (0<=p46)
states: 12,275,674 (7)
abstracting: (p46<=0)
states: 11,995,498 (7)
abstracting: (0<=p49)
states: 12,275,674 (7)
abstracting: (p49<=0)
states: 11,995,498 (7)
abstracting: (1<=p14)
states: 415,924 (5)
abstracting: (p14<=1)
states: 12,275,674 (7)
abstracting: (0<=p89)
states: 12,275,674 (7)
abstracting: (p89<=0)
states: 12,020,698 (7)
abstracting: (0<=p9)
states: 12,275,674 (7)
abstracting: (p9<=0)
states: 11,610,714 (7)
abstracting: (1<=p130)
states: 434,172 (5)
abstracting: (p130<=1)
states: 12,275,674 (7)
abstracting: (0<=p17)
states: 12,275,674 (7)
abstracting: (p17<=0)
states: 11,859,750 (7)
abstracting: (1<=p128)
states: 434,172 (5)
abstracting: (p128<=1)
states: 12,275,674 (7)
abstracting: (0<=p5)
states: 12,275,674 (7)
abstracting: (p5<=0)
states: 11,745,838 (7)
abstracting: (1<=p93)
states: 733,676 (5)
abstracting: (p93<=1)
states: 12,275,674 (7)
abstracting: (0<=p10)
states: 12,275,674 (7)
abstracting: (p10<=0)
states: 11,610,714 (7)
-> the formula is TRUE

FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.777sec

totally nodes used: 1776786 (1.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7690968 22999469 30690437
used/not used/entry size/cache size: 20652083 46456781 16 1024MB
basic ops cache: hits/miss/sum: 598666 1710654 2309320
used/not used/entry size/cache size: 2912824 13864392 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: 25014 62507 87521
used/not used/entry size/cache size: 62363 8326245 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 65582968
1 1314808
2 176210
3 30474
4 3947
5 399
6 53
7 5
8 0
9 0
>= 10 0

Total processing time: 0m10.697sec


BK_STOP 1678345315019

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.000sec


iterations count:98545 (305), effective:2700 (8)

initing FirstDep: 0m 0.000sec


iterations count:59470 (184), effective:1694 (5)

iterations count:11790 (36), effective:288 (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="CloudReconfiguration-PT-401"
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 CloudReconfiguration-PT-401, 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 r106-tall-167814482300166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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