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

About the Execution of Marcie+red for DES-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7728.903 137839.00 150814.00 708.30 TTTTFTFFFTTTTTFT 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-167814482700423.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 DES-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 79K 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 DES-PT-10b-ReachabilityFireability-00
FORMULA_NAME DES-PT-10b-ReachabilityFireability-01
FORMULA_NAME DES-PT-10b-ReachabilityFireability-02
FORMULA_NAME DES-PT-10b-ReachabilityFireability-03
FORMULA_NAME DES-PT-10b-ReachabilityFireability-04
FORMULA_NAME DES-PT-10b-ReachabilityFireability-05
FORMULA_NAME DES-PT-10b-ReachabilityFireability-06
FORMULA_NAME DES-PT-10b-ReachabilityFireability-07
FORMULA_NAME DES-PT-10b-ReachabilityFireability-08
FORMULA_NAME DES-PT-10b-ReachabilityFireability-09
FORMULA_NAME DES-PT-10b-ReachabilityFireability-10
FORMULA_NAME DES-PT-10b-ReachabilityFireability-11
FORMULA_NAME DES-PT-10b-ReachabilityFireability-12
FORMULA_NAME DES-PT-10b-ReachabilityFireability-13
FORMULA_NAME DES-PT-10b-ReachabilityFireability-14
FORMULA_NAME DES-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678389425065

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=DES-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 19:17:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 19:17:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:17:06] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 19:17:06] [INFO ] Transformed 320 places.
[2023-03-09 19:17:06] [INFO ] Transformed 271 transitions.
[2023-03-09 19:17:06] [INFO ] Found NUPN structural information;
[2023-03-09 19:17:06] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 84 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 16) seen :12
FORMULA DES-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 271 rows 320 cols
[2023-03-09 19:17:07] [INFO ] Computed 65 place invariants in 28 ms
[2023-03-09 19:17:07] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 19:17:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-09 19:17:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 19:17:08] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 19:17:08] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 4 ms to minimize.
[2023-03-09 19:17:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-09 19:17:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-09 19:17:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 19:17:09] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2023-03-09 19:17:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2023-03-09 19:17:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-09 19:17:09] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-09 19:17:09] [INFO ] After 1833ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA DES-PT-10b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 112 ms.
Support contains 50 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 309 transition count 256
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 301 transition count 253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 298 transition count 253
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 25 place count 298 transition count 246
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 39 place count 291 transition count 246
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 56 place count 274 transition count 229
Iterating global reduction 3 with 17 rules applied. Total rules applied 73 place count 274 transition count 229
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 86 place count 261 transition count 216
Iterating global reduction 3 with 13 rules applied. Total rules applied 99 place count 261 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 3 with 13 rules applied. Total rules applied 112 place count 261 transition count 203
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 115 place count 259 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 115 place count 259 transition count 201
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 258 transition count 201
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 209 place count 212 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 211 transition count 154
Applied a total of 210 rules in 100 ms. Remains 211 /320 variables (removed 109) and now considering 154/271 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 211/320 places, 154/271 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1103790 steps, run timeout after 3002 ms. (steps per millisecond=367 ) properties seen :{0=1}
Probabilistic random walk after 1103790 steps, saw 166151 distinct states, run finished after 3003 ms. (steps per millisecond=367 ) properties seen :1
FORMULA DES-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 154 rows 211 cols
[2023-03-09 19:17:12] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-09 19:17:13] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 19:17:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2023-03-09 19:17:13] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-09 19:17:13] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 19:17:13] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2023-03-09 19:17:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2023-03-09 19:17:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-09 19:17:13] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-09 19:17:13] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2023-03-09 19:17:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-09 19:17:13] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-09 19:17:13] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 23 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 154/154 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 152
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 209 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 13 place count 204 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 203 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 203 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 202 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 202 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 202 transition count 145
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 52 place count 185 transition count 128
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 3 with 2 rules applied. Total rules applied 54 place count 184 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 182 transition count 126
Applied a total of 56 rules in 42 ms. Remains 182 /211 variables (removed 29) and now considering 126/154 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 182/211 places, 126/154 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1367575 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :{}
Probabilistic random walk after 1367575 steps, saw 182121 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 126 rows 182 cols
[2023-03-09 19:17:16] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 19:17:16] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 19:17:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 19:17:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-09 19:17:17] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 19:17:17] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-09 19:17:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
[2023-03-09 19:17:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-09 19:17:17] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-09 19:17:17] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DES-PT-10b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 126/126 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 1 place count 182 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 181 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 181 transition count 122
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 8 place count 178 transition count 122
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 2 with 26 rules applied. Total rules applied 34 place count 165 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 164 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 164 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 164 transition count 107
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 164 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 162 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 162 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 161 transition count 104
Applied a total of 43 rules in 36 ms. Remains 161 /182 variables (removed 21) and now considering 104/126 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 161/182 places, 104/126 transitions.
Incomplete random walk after 10000 steps, including 374 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1984914 steps, run timeout after 3001 ms. (steps per millisecond=661 ) properties seen :{}
Probabilistic random walk after 1984914 steps, saw 267465 distinct states, run finished after 3003 ms. (steps per millisecond=660 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 161 cols
[2023-03-09 19:17:20] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 19:17:20] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:17:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 19:17:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-09 19:17:20] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:17:20] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 19:17:20] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 161/161 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 104/104 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-09 19:17:20] [INFO ] Invariant cache hit.
[2023-03-09 19:17:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 19:17:20] [INFO ] Invariant cache hit.
[2023-03-09 19:17:21] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-09 19:17:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 19:17:21] [INFO ] Invariant cache hit.
[2023-03-09 19:17:21] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 161/161 places, 104/104 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 104
Applied a total of 1 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 161 cols
[2023-03-09 19:17:21] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 19:17:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:17:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 19:17:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-09 19:17:21] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:17:21] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 19:17:21] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 19:17:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-09 19:17:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 104 transitions and 521 arcs took 2 ms.
[2023-03-09 19:17:21] [INFO ] Flatten gal took : 45 ms
Total runtime 15140 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DES_PT_10b
(NrP: 161 NrTr: 104 NrArc: 521)

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

net check time: 0m 0.000sec

init dd package: 0m 2.712sec


RS generation: 0m21.300sec


-> reachability set: #nodes 177850 (1.8e+05) #states 4,388,813,426,074 (12)



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

checking: AG [[[[[0<=p44 & p44<=0] | [0<=p62 & p62<=0]] | [p53<=0 & 0<=p53]] | [[0<=p12 & p12<=0] | [0<=p156 & p156<=0]]]]
normalized: ~ [E [true U ~ [[[[p53<=0 & 0<=p53] | [[0<=p44 & p44<=0] | [0<=p62 & p62<=0]]] | [[0<=p12 & p12<=0] | [0<=p156 & p156<=0]]]]]]

abstracting: (p156<=0)
states: 3,648,897,490,800 (12)
abstracting: (0<=p156)
states: 4,388,813,426,074 (12)
abstracting: (p12<=0)
states: 3,821,635,110,018 (12)
abstracting: (0<=p12)
states: 4,388,813,426,074 (12)
abstracting: (p62<=0)
states: 3,466,762,768,136 (12)
abstracting: (0<=p62)
states: 4,388,813,426,074 (12)
abstracting: (p44<=0)
states: 2,927,711,489,472 (12)
abstracting: (0<=p44)
states: 4,388,813,426,074 (12)
abstracting: (0<=p53)
states: 4,388,813,426,074 (12)
abstracting: (p53<=0)
states: 2,872,391,792,542 (12)
-> the formula is FALSE

FORMULA DES-PT-10b-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m32.310sec

totally nodes used: 31891950 (3.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 114551460 308345076 422896536
used/not used/entry size/cache size: 66572989 535875 16 1024MB
basic ops cache: hits/miss/sum: 11920320 29851287 41771607
used/not used/entry size/cache size: 15283982 1493234 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: 136840 467994 604834
used/not used/entry size/cache size: 456480 7932128 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 42789854
1 18216528
2 4872937
3 1022375
4 177683
5 25734
6 3312
7 386
8 49
9 5
>= 10 1

Total processing time: 2m 0.291sec


BK_STOP 1678389562904

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

140848 178599
iterations count:203129 (1953), effective:22752 (218)

initing FirstDep: 0m 0.000sec

602946
iterations count:119935 (1153), effective:14280 (137)

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="DES-PT-10b"
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 DES-PT-10b, 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 r106-tall-167814482700423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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