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-167814482700454.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-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 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.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 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 103K 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-30b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678396937609

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=DES-PT-30b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 21:22:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 21:22:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 21:22:19] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-09 21:22:19] [INFO ] Transformed 399 places.
[2023-03-09 21:22:19] [INFO ] Transformed 350 transitions.
[2023-03-09 21:22:19] [INFO ] Found NUPN structural information;
[2023-03-09 21:22:19] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 14) seen :8
FORMULA DES-PT-30b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-09 21:22:20] [INFO ] Computed 65 place invariants in 32 ms
[2023-03-09 21:22:20] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 21:22:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-09 21:22:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2023-03-09 21:22:22] [INFO ] After 1260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 21:22:23] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 3 ms to minimize.
[2023-03-09 21:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-09 21:22:23] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-09 21:22:23] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2023-03-09 21:22:23] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2023-03-09 21:22:23] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 635 ms
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 657 ms
[2023-03-09 21:22:25] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2023-03-09 21:22:25] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2023-03-09 21:22:25] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-09 21:22:25] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 3 ms to minimize.
[2023-03-09 21:22:25] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-09 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 702 ms
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 855 ms
[2023-03-09 21:22:26] [INFO ] After 5094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 698 ms.
[2023-03-09 21:22:27] [INFO ] After 6997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA DES-PT-30b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 535 ms.
Support contains 41 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 388 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 388 transition count 330
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 375 transition count 327
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 372 transition count 327
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 35 place count 372 transition count 319
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 51 place count 364 transition count 319
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 69 place count 346 transition count 301
Iterating global reduction 3 with 18 rules applied. Total rules applied 87 place count 346 transition count 301
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 99 place count 334 transition count 289
Iterating global reduction 3 with 12 rules applied. Total rules applied 111 place count 334 transition count 289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 rules applied. Total rules applied 122 place count 334 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 333 transition count 278
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 237 place count 276 transition count 221
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 247 place count 271 transition count 231
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 271 transition count 230
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 271 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 252 place count 269 transition count 228
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 269 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 256 place count 267 transition count 226
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 259 place count 267 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 260 place count 266 transition count 225
Applied a total of 260 rules in 157 ms. Remains 266 /399 variables (removed 133) and now considering 225/350 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 266/399 places, 225/350 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) seen :1
FORMULA DES-PT-30b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 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 225 rows 266 cols
[2023-03-09 21:22:28] [INFO ] Computed 61 place invariants in 12 ms
[2023-03-09 21:22:28] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 21:22:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:22:28] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 21:22:29] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 21:22:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 21:22:29] [INFO ] After 105ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 21:22:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-09 21:22:29] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-09 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-09 21:22:29] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2023-03-09 21:22:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-09 21:22:29] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-09 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
[2023-03-09 21:22:29] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-09 21:22:29] [INFO ] After 1026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 61 ms.
Support contains 16 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 225/225 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 266 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 265 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 265 transition count 223
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 4 place count 264 transition count 223
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 255 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 254 transition count 211
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 254 transition count 211
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 32 place count 254 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 253 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 252 transition count 208
Applied a total of 35 rules in 52 ms. Remains 252 /266 variables (removed 14) and now considering 208/225 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 252/266 places, 208/225 transitions.
Incomplete random walk after 10000 steps, including 311 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 963475 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 963475 steps, saw 130235 distinct states, run finished after 3002 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 208 rows 252 cols
[2023-03-09 21:22:33] [INFO ] Computed 61 place invariants in 8 ms
[2023-03-09 21:22:33] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 21:22:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-09 21:22:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 48 ms returned sat
[2023-03-09 21:22:33] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 21:22:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 21:22:33] [INFO ] After 88ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 21:22:33] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-09 21:22:33] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-09 21:22:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-09 21:22:33] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-09 21:22:33] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-09 21:22:33] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-09 21:22:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2023-03-09 21:22:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 215 ms
[2023-03-09 21:22:34] [INFO ] After 545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-09 21:22:34] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 74 ms.
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 208/208 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 252/252 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 208/208 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-09 21:22:34] [INFO ] Invariant cache hit.
[2023-03-09 21:22:34] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-09 21:22:34] [INFO ] Invariant cache hit.
[2023-03-09 21:22:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 21:22:34] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-09 21:22:34] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 21:22:34] [INFO ] Invariant cache hit.
[2023-03-09 21:22:34] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 252/252 places, 208/208 transitions.
Graph (complete) has 825 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 208
Applied a total of 2 rules in 14 ms. Remains 251 /252 variables (removed 1) and now considering 208/208 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 208 rows 251 cols
[2023-03-09 21:22:34] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:22:35] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 21:22:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:22:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 21:22:35] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 21:22:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2023-03-09 21:22:35] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-09 21:22:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2023-03-09 21:22:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 120 ms
[2023-03-09 21:22:35] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2023-03-09 21:22:35] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-09 21:22:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-09 21:22:35] [INFO ] After 579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-09 21:22:35] [INFO ] After 868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-09 21:22:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-09 21:22:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 208 transitions and 1072 arcs took 2 ms.
[2023-03-09 21:22:36] [INFO ] Flatten gal took : 52 ms
Total runtime 16896 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: DES_PT_30b
(NrP: 252 NrTr: 208 NrArc: 1072)

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

net check time: 0m 0.000sec

init dd package: 0m 2.687sec


RS generation: 3m54.270sec


-> reachability set: #nodes 645904 (6.5e+05) #states 174,405,875,088,580 (14)



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

checking: AG [[0<=p26 & p26<=0]]
normalized: ~ [E [true U ~ [[0<=p26 & p26<=0]]]]

abstracting: (p26<=0)
states: 168,396,094,296,928 (14)
abstracting: (0<=p26)
states: 174,405,875,088,580 (14)

before gc: list nodes free: 1157184

after gc: idd nodes used:1218357, unused:62781643; list nodes free:275681766
-> the formula is FALSE

FORMULA DES-PT-30b-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m44.821sec

checking: EF [[1<=p43 & p43<=1]]
normalized: E [true U [1<=p43 & p43<=1]]

abstracting: (p43<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p43)
states: 6,336,373,785,278 (12)

before gc: list nodes free: 1219135

after gc: idd nodes used:1318079, unused:62681921; list nodes free:277346666

before gc: list nodes free: 2095963

after gc: idd nodes used:2198570, unused:61801430; list nodes free:275577140
MC time: 17m27.016sec

checking: AG [[[1<=p152 & p152<=1] | [p16<=0 & 0<=p16]]]
normalized: ~ [E [true U ~ [[[p16<=0 & 0<=p16] | [1<=p152 & p152<=1]]]]]

abstracting: (p152<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p152)
states: 25,868,341,361,102 (13)
abstracting: (0<=p16)
states: 174,405,875,088,580 (14)
abstracting: (p16<=0)
states: 168,069,501,303,302 (14)

before gc: list nodes free: 1472495

after gc: idd nodes used:1103564, unused:62896436; list nodes free:280374762

before gc: list nodes free: 2703637

after gc: idd nodes used:2554495, unused:61445505; list nodes free:274012985
MC time: 11m38.005sec

checking: EF [[[[0<=p18 & p18<=0] & [1<=p170 & p170<=1]] & [[[[[1<=p138 & p138<=1] & [0<=p231 & p231<=0]] & [1<=p154 & p154<=1]] | [1<=p33 & p33<=1]] & [[[0<=p143 & p143<=0] & [p122<=1 & 1<=p122]] | [[[0<=p129 & p129<=0] | [1<=p85 & p85<=1]] & [[1<=p172 & p172<=1] | [0<=p107 & p107<=0]]]]]]]
normalized: E [true U [[[[[[0<=p107 & p107<=0] | [1<=p172 & p172<=1]] & [[1<=p85 & p85<=1] | [0<=p129 & p129<=0]]] | [[p122<=1 & 1<=p122] & [0<=p143 & p143<=0]]] & [[1<=p33 & p33<=1] | [[1<=p154 & p154<=1] & [[0<=p231 & p231<=0] & [1<=p138 & p138<=1]]]]] & [[1<=p170 & p170<=1] & [0<=p18 & p18<=0]]]]

abstracting: (p18<=0)
states: 168,069,501,303,302 (14)
abstracting: (0<=p18)
states: 174,405,875,088,580 (14)
abstracting: (p170<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p170)
states: 3,461,492 (6)
abstracting: (p138<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p138)
states: 309,296 (5)
abstracting: (p231<=0)
states: 169,762,327,970,918 (14)
abstracting: (0<=p231)
states: 174,405,875,088,580 (14)
abstracting: (p154<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p154)
states: 25,868,341,361,102 (13)
abstracting: (p33<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p33)
states: 6,336,373,785,278 (12)
abstracting: (p143<=0)
states: 154,549,923,962,998 (14)
abstracting: (0<=p143)
states: 174,405,875,088,580 (14)
abstracting: (1<=p122)
states: 58,151,501,874,846 (13)
abstracting: (p122<=1)
states: 174,405,875,088,580 (14)
abstracting: (p129<=0)
states: 106,147,122,962,444 (14)
abstracting: (0<=p129)
states: 174,405,875,088,580 (14)
abstracting: (p85<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p85)
states: 6,149,297,926,376 (12)
abstracting: (p172<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p172)
states: 32,480,436,356,488 (13)
abstracting: (p107<=0)
states: 168,069,501,303,302 (14)
abstracting: (0<=p107)
states: 174,405,875,088,580 (14)
-> the formula is FALSE

FORMULA DES-PT-30b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.451sec

checking: EF [[1<=p43 & p43<=1]]
normalized: E [true U [1<=p43 & p43<=1]]

abstracting: (p43<=1)
states: 174,405,875,088,580 (14)
abstracting: (1<=p43)
states: 6,336,373,785,278 (12)

before gc: list nodes free: 2285720

after gc: idd nodes used:3006510, unused:60993490; list nodes free:272085441

before gc: list nodes free: 2750344

after gc: idd nodes used:3830121, unused:60169879; list nodes free:268478286

before gc: list nodes free: 1378602

after gc: idd nodes used:4472317, unused:59527683; list nodes free:265607925
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6190864 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097536 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 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

73863 406261 554635 700246 650825 733336 668466 746398 642846 811758 641332 806234 642230 803085 644190 807733 649106 750692 651737 709665
iterations count:2034391 (9780), effective:149855 (720)

initing FirstDep: 0m 0.000sec

1194960
iterations count:132050 (634), effective:8686 (41)
985459 1635552 1801890 1965650
sat_reach.icc:155: Timeout: after 1046 sec

1418514 1859609
sat_reach.icc:155: Timeout: after 697 sec

985459 1635552 1801890 1965650 2191191

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-30b"
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 DES-PT-30b, 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-167814482700454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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