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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 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 963K 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 DLCround-PT-07b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678456366867

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=DLCround-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 13:52:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 13:52:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 13:52:48] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-10 13:52:48] [INFO ] Transformed 2703 places.
[2023-03-10 13:52:48] [INFO ] Transformed 4071 transitions.
[2023-03-10 13:52:48] [INFO ] Found NUPN structural information;
[2023-03-10 13:52:48] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-07b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 15) seen :7
FORMULA DLCround-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 4071 rows 2703 cols
[2023-03-10 13:52:49] [INFO ] Computed 132 place invariants in 38 ms
[2023-03-10 13:52:50] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 13:52:51] [INFO ] [Nat]Absence check using 132 positive place invariants in 89 ms returned sat
[2023-03-10 13:52:54] [INFO ] After 2378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-10 13:52:54] [INFO ] Deduced a trap composed of 107 places in 463 ms of which 6 ms to minimize.
[2023-03-10 13:52:55] [INFO ] Deduced a trap composed of 231 places in 327 ms of which 1 ms to minimize.
[2023-03-10 13:52:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1150 ms
[2023-03-10 13:52:56] [INFO ] Deduced a trap composed of 159 places in 315 ms of which 1 ms to minimize.
[2023-03-10 13:52:56] [INFO ] Deduced a trap composed of 168 places in 283 ms of which 2 ms to minimize.
[2023-03-10 13:52:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 947 ms
[2023-03-10 13:52:57] [INFO ] After 6056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 988 ms.
[2023-03-10 13:52:58] [INFO ] After 8295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA DLCround-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 307 ms.
Support contains 54 out of 2703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Graph (trivial) has 2453 edges and 2703 vertex of which 377 / 2703 are part of one of the 31 SCC in 10 ms
Free SCC test removed 346 places
Drop transitions removed 389 transitions
Reduce isomorphic transitions removed 389 transitions.
Drop transitions removed 1021 transitions
Trivial Post-agglo rules discarded 1021 transitions
Performed 1021 trivial Post agglomeration. Transition count delta: 1021
Iterating post reduction 0 with 1021 rules applied. Total rules applied 1022 place count 2357 transition count 2661
Reduce places removed 1021 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 1080 rules applied. Total rules applied 2102 place count 1336 transition count 2602
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 31 rules applied. Total rules applied 2133 place count 1311 transition count 2596
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 3 with 29 rules applied. Total rules applied 2162 place count 1308 transition count 2570
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 2188 place count 1282 transition count 2570
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 2188 place count 1282 transition count 2554
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 2220 place count 1266 transition count 2554
Discarding 308 places :
Symmetric choice reduction at 5 with 308 rule applications. Total rules 2528 place count 958 transition count 2246
Iterating global reduction 5 with 308 rules applied. Total rules applied 2836 place count 958 transition count 2246
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 124 Pre rules applied. Total rules applied 2836 place count 958 transition count 2122
Deduced a syphon composed of 124 places in 20 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 5 with 248 rules applied. Total rules applied 3084 place count 834 transition count 2122
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 3124 place count 794 transition count 1691
Iterating global reduction 5 with 40 rules applied. Total rules applied 3164 place count 794 transition count 1691
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 3175 place count 794 transition count 1680
Performed 207 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 207 places in 1 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 6 with 414 rules applied. Total rules applied 3589 place count 587 transition count 1467
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3592 place count 587 transition count 1464
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3599 place count 580 transition count 1387
Iterating global reduction 7 with 7 rules applied. Total rules applied 3606 place count 580 transition count 1387
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: -654
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 7 with 146 rules applied. Total rules applied 3752 place count 507 transition count 2041
Drop transitions removed 124 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 7 with 130 rules applied. Total rules applied 3882 place count 507 transition count 1911
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 3895 place count 494 transition count 1612
Iterating global reduction 8 with 13 rules applied. Total rules applied 3908 place count 494 transition count 1612
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 3917 place count 494 transition count 1603
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 3933 place count 486 transition count 1684
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3941 place count 486 transition count 1676
Drop transitions removed 163 transitions
Redundant transition composition rules discarded 163 transitions
Iterating global reduction 10 with 163 rules applied. Total rules applied 4104 place count 486 transition count 1513
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 4112 place count 478 transition count 1398
Iterating global reduction 10 with 8 rules applied. Total rules applied 4120 place count 478 transition count 1398
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4129 place count 478 transition count 1389
Free-agglomeration rule applied 193 times with reduction of 91 identical transitions.
Iterating global reduction 11 with 193 rules applied. Total rules applied 4322 place count 478 transition count 1105
Reduce places removed 193 places and 0 transitions.
Drop transitions removed 246 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 11 with 445 rules applied. Total rules applied 4767 place count 285 transition count 853
Discarding 13 places :
Symmetric choice reduction at 12 with 13 rule applications. Total rules 4780 place count 272 transition count 825
Iterating global reduction 12 with 13 rules applied. Total rules applied 4793 place count 272 transition count 825
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 12 with 108 rules applied. Total rules applied 4901 place count 272 transition count 717
Discarding 17 places :
Symmetric choice reduction at 12 with 17 rule applications. Total rules 4918 place count 255 transition count 683
Iterating global reduction 12 with 17 rules applied. Total rules applied 4935 place count 255 transition count 683
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4937 place count 254 transition count 696
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 4942 place count 254 transition count 691
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 4948 place count 254 transition count 685
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 4951 place count 254 transition count 756
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 13 with 30 rules applied. Total rules applied 4981 place count 251 transition count 729
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 14 with 54 rules applied. Total rules applied 5035 place count 251 transition count 675
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 5038 place count 251 transition count 675
Applied a total of 5038 rules in 672 ms. Remains 251 /2703 variables (removed 2452) and now considering 675/4071 (removed 3396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 251/2703 places, 675/4071 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :1
FORMULA DLCround-PT-07b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 13:52:59] [INFO ] Flow matrix only has 451 transitions (discarded 224 similar events)
// Phase 1: matrix 451 rows 251 cols
[2023-03-10 13:53:00] [INFO ] Computed 102 place invariants in 13 ms
[2023-03-10 13:53:00] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 13:53:00] [INFO ] [Nat]Absence check using 102 positive place invariants in 15 ms returned sat
[2023-03-10 13:53:00] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 13:53:00] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-10 13:53:00] [INFO ] After 112ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 13:53:00] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2023-03-10 13:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-10 13:53:00] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-10 13:53:00] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 51 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 675/675 transitions.
Graph (trivial) has 14 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 250 transition count 672
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 249 transition count 672
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 7 place count 249 transition count 668
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 14 place count 249 transition count 661
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 248 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 248 transition count 658
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 248 transition count 657
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 247 transition count 655
Applied a total of 20 rules in 40 ms. Remains 247 /251 variables (removed 4) and now considering 655/675 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 247/251 places, 655/675 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
FORMULA DLCround-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 13:53:00] [INFO ] Flow matrix only has 434 transitions (discarded 221 similar events)
// Phase 1: matrix 434 rows 247 cols
[2023-03-10 13:53:00] [INFO ] Computed 101 place invariants in 3 ms
[2023-03-10 13:53:00] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 13:53:00] [INFO ] [Nat]Absence check using 101 positive place invariants in 13 ms returned sat
[2023-03-10 13:53:01] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 13:53:01] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-10 13:53:01] [INFO ] After 48ms SMT Verify possible using 113 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 13:53:01] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-10 13:53:01] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 23 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 655/655 transitions.
Graph (trivial) has 68 edges and 247 vertex of which 11 / 247 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 241 transition count 637
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 234 transition count 637
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 15 place count 234 transition count 634
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 21 place count 231 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 230 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 230 transition count 633
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 47 place count 218 transition count 621
Drop transitions removed 22 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 72 place count 218 transition count 596
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 80 place count 210 transition count 579
Iterating global reduction 3 with 8 rules applied. Total rules applied 88 place count 210 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 208 transition count 585
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 100 place count 208 transition count 577
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 123 place count 208 transition count 554
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 130 place count 208 transition count 547
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 633 edges and 201 vertex of which 192 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 30 rules applied. Total rules applied 160 place count 192 transition count 525
Drop transitions removed 8 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 183 place count 192 transition count 502
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 191 transition count 501
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 191 transition count 501
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 197 place count 191 transition count 489
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 202 place count 191 transition count 489
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 205 place count 191 transition count 486
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 6 with 6 rules applied. Total rules applied 211 place count 188 transition count 483
Applied a total of 211 rules in 77 ms. Remains 188 /247 variables (removed 59) and now considering 483/655 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 188/247 places, 483/655 transitions.
Finished random walk after 6707 steps, including 2 resets, run visited all 1 properties in 27 ms. (steps per millisecond=248 )
FORMULA DLCround-PT-07b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13104 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_07b
(NrP: 2703 NrTr: 4071 NrArc: 11073)

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

net check time: 0m 0.001sec

init dd package: 0m 2.717sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6481940 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101704 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.059sec

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="DLCround-PT-07b"
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 DLCround-PT-07b, 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-167814483100694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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