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

About the Execution of Marcie+red for CloudDeployment-PT-3b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9789.815 3600000.00 3644048.00 10668.60 TTFFTFTTTTTTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r074-smll-167814400200391.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-3b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400200391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 14:45 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.5K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 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 308K 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-3b-ReachabilityFireability-00
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-01
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-02
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-03
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-04
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-05
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-06
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-07
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-08
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-09
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-10
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-11
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-12
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-13
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-14
FORMULA_NAME CloudDeployment-PT-3b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678482930400

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 21:15:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 21:15:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:15:33] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-10 21:15:33] [INFO ] Transformed 859 places.
[2023-03-10 21:15:33] [INFO ] Transformed 1152 transitions.
[2023-03-10 21:15:33] [INFO ] Found NUPN structural information;
[2023-03-10 21:15:33] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 102 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 16) seen :4
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1152 rows 859 cols
[2023-03-10 21:15:36] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-10 21:15:38] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 21:15:38] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 14 ms returned sat
[2023-03-10 21:15:42] [INFO ] After 3624ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-10 21:15:45] [INFO ] After 5941ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :8
Attempting to minimize the solution found.
Minimization took 1684 ms.
[2023-03-10 21:15:46] [INFO ] After 8590ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :8
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 177 ms.
Support contains 37 out of 859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Graph (trivial) has 821 edges and 859 vertex of which 205 / 859 are part of one of the 22 SCC in 13 ms
Free SCC test removed 183 places
Drop transitions removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Graph (complete) has 1627 edges and 676 vertex of which 670 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 315 rules applied. Total rules applied 317 place count 670 transition count 610
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 317 rules applied. Total rules applied 634 place count 357 transition count 606
Reduce places removed 2 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 15 rules applied. Total rules applied 649 place count 355 transition count 593
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 662 place count 342 transition count 593
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 662 place count 342 transition count 577
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 694 place count 326 transition count 577
Discarding 94 places :
Symmetric choice reduction at 4 with 94 rule applications. Total rules 788 place count 232 transition count 483
Iterating global reduction 4 with 94 rules applied. Total rules applied 882 place count 232 transition count 483
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 886 place count 232 transition count 479
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 886 place count 232 transition count 471
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 902 place count 224 transition count 471
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 903 place count 223 transition count 470
Iterating global reduction 5 with 1 rules applied. Total rules applied 904 place count 223 transition count 470
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1002 place count 174 transition count 421
Performed 25 Post agglomeration using F-continuation condition with reduction of 34 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1052 place count 149 transition count 488
Drop transitions removed 9 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1063 place count 149 transition count 477
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 1113 place count 149 transition count 427
Free-agglomeration rule applied 26 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1139 place count 149 transition count 400
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 1190 place count 123 transition count 375
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 122 transition count 371
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 122 transition count 371
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1201 place count 122 transition count 362
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1204 place count 122 transition count 362
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1205 place count 122 transition count 361
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1206 place count 121 transition count 360
Applied a total of 1206 rules in 328 ms. Remains 121 /859 variables (removed 738) and now considering 360/1152 (removed 792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 121/859 places, 360/1152 transitions.
Incomplete random walk after 10000 steps, including 299 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :3
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:15:47] [INFO ] Flow matrix only has 296 transitions (discarded 64 similar events)
// Phase 1: matrix 296 rows 121 cols
[2023-03-10 21:15:47] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-10 21:15:47] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:15:47] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-10 21:15:48] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:15:48] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-10 21:15:48] [INFO ] After 81ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:15:48] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-10 21:15:48] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 34 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 360/360 transitions.
Graph (trivial) has 34 edges and 121 vertex of which 4 / 121 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 355
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 118 transition count 355
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 118 transition count 354
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 117 transition count 354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 116 transition count 353
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 116 transition count 352
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 116 transition count 342
Applied a total of 18 rules in 56 ms. Remains 116 /121 variables (removed 5) and now considering 342/360 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 116/121 places, 342/360 transitions.
Incomplete random walk after 10000 steps, including 297 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1095988 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{1=1}
Probabilistic random walk after 1095988 steps, saw 182516 distinct states, run finished after 3002 ms. (steps per millisecond=365 ) properties seen :1
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-10 21:15:51] [INFO ] Flow matrix only has 278 transitions (discarded 64 similar events)
// Phase 1: matrix 278 rows 116 cols
[2023-03-10 21:15:51] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-10 21:15:51] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:15:52] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-10 21:15:52] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:15:52] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-10 21:15:52] [INFO ] After 36ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:15:52] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-10 21:15:52] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 342/342 transitions.
Graph (trivial) has 49 edges and 116 vertex of which 2 / 116 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 4 rules applied. Total rules applied 5 place count 115 transition count 336
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 111 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 111 transition count 335
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 110 transition count 335
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 107 transition count 332
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 104 transition count 345
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 104 transition count 343
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 3 with 31 rules applied. Total rules applied 56 place count 104 transition count 312
Free-agglomeration rule applied 6 times with reduction of 1 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 104 transition count 305
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 81 place count 98 transition count 292
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 90 place count 98 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 97 transition count 282
Applied a total of 91 rules in 64 ms. Remains 97 /116 variables (removed 19) and now considering 282/342 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 97/116 places, 282/342 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1058749 steps, run visited all 1 properties in 2234 ms. (steps per millisecond=473 )
Probabilistic random walk after 1058749 steps, saw 172516 distinct states, run finished after 2234 ms. (steps per millisecond=473 ) properties seen :1
FORMULA CloudDeployment-PT-3b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 21128 ms.
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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: CloudDeployment_PT_3b
(NrP: 859 NrTr: 1152 NrArc: 4030)

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

net check time: 0m 0.001sec

init dd package: 0m 3.629sec


before gc: list nodes free: 1985866

after gc: idd nodes used:1678222, unused:62321778; list nodes free:271616084
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6360720 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101832 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 ReachabilityFireability -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.008sec

241063 482479 473561 1342798 1470021 1526516 1470651 1712291 1602371 1633660

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-3b"
export BK_EXAMINATION="ReachabilityFireability"
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-3b, examination is ReachabilityFireability"
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-167814400200391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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