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.r266-smll-167863540800350.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 NoC3x3-PT-8B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540800350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 09:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:23 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 NoC3x3-PT-8B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679033454603

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=NoC3x3-PT-8B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 06:10:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 06:10:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 06:10:59] [INFO ] Load time of PNML (sax parser for PT used): 869 ms
[2023-03-17 06:10:59] [INFO ] Transformed 9140 places.
[2023-03-17 06:10:59] [INFO ] Transformed 14577 transitions.
[2023-03-17 06:10:59] [INFO ] Found NUPN structural information;
[2023-03-17 06:10:59] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 1201 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 902 ms. (steps per millisecond=11 ) properties (out of 13) seen :3
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 14577 rows 9140 cols
[2023-03-17 06:11:01] [INFO ] Computed 99 place invariants in 277 ms
[2023-03-17 06:11:07] [INFO ] [Real]Absence check using 99 positive place invariants in 183 ms returned sat
[2023-03-17 06:11:07] [INFO ] After 5580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 06:11:12] [INFO ] [Nat]Absence check using 99 positive place invariants in 216 ms returned sat
[2023-03-17 06:11:32] [INFO ] After 18249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-17 06:11:32] [INFO ] After 18275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 06:11:32] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 74 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13501 edges and 9140 vertex of which 2312 / 9140 are part of one of the 30 SCC in 43 ms
Free SCC test removed 2282 places
Drop transitions removed 3638 transitions
Reduce isomorphic transitions removed 3638 transitions.
Graph (complete) has 12416 edges and 6858 vertex of which 6746 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.25 ms
Discarding 112 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 4132 transitions
Trivial Post-agglo rules discarded 4132 transitions
Performed 4132 trivial Post agglomeration. Transition count delta: 4132
Iterating post reduction 0 with 4234 rules applied. Total rules applied 4236 place count 6746 transition count 6626
Reduce places removed 4132 places and 0 transitions.
Ensure Unique test removed 2307 transitions
Reduce isomorphic transitions removed 2307 transitions.
Drop transitions removed 1115 transitions
Trivial Post-agglo rules discarded 1115 transitions
Performed 1115 trivial Post agglomeration. Transition count delta: 1115
Iterating post reduction 1 with 7554 rules applied. Total rules applied 11790 place count 2614 transition count 3204
Reduce places removed 1115 places and 0 transitions.
Ensure Unique test removed 1115 transitions
Reduce isomorphic transitions removed 1115 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 2242 rules applied. Total rules applied 14032 place count 1499 transition count 2077
Reduce places removed 12 places and 0 transitions.
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Iterating post reduction 3 with 137 rules applied. Total rules applied 14169 place count 1487 transition count 1952
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 4 with 224 rules applied. Total rules applied 14393 place count 1362 transition count 1853
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 52 Pre rules applied. Total rules applied 14393 place count 1362 transition count 1801
Deduced a syphon composed of 52 places in 5 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 14497 place count 1310 transition count 1801
Discarding 351 places :
Symmetric choice reduction at 5 with 351 rule applications. Total rules 14848 place count 959 transition count 1450
Iterating global reduction 5 with 351 rules applied. Total rules applied 15199 place count 959 transition count 1450
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 15251 place count 959 transition count 1398
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 59 Pre rules applied. Total rules applied 15251 place count 959 transition count 1339
Deduced a syphon composed of 59 places in 7 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 15369 place count 900 transition count 1339
Discarding 76 places :
Symmetric choice reduction at 6 with 76 rule applications. Total rules 15445 place count 824 transition count 1176
Iterating global reduction 6 with 76 rules applied. Total rules applied 15521 place count 824 transition count 1176
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 15542 place count 824 transition count 1155
Performed 248 Post agglomeration using F-continuation condition.Transition count delta: 248
Deduced a syphon composed of 248 places in 1 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 7 with 496 rules applied. Total rules applied 16038 place count 576 transition count 907
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 16061 place count 576 transition count 884
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 16067 place count 573 transition count 916
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 8 with 59 rules applied. Total rules applied 16126 place count 573 transition count 857
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 16130 place count 571 transition count 888
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 16131 place count 571 transition count 887
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 16134 place count 571 transition count 884
Free-agglomeration rule applied 221 times.
Iterating global reduction 9 with 221 rules applied. Total rules applied 16355 place count 571 transition count 663
Reduce places removed 221 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1047 edges and 350 vertex of which 343 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 233 rules applied. Total rules applied 16588 place count 343 transition count 652
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 16595 place count 343 transition count 645
Drop transitions removed 151 transitions
Redundant transition composition rules discarded 151 transitions
Iterating global reduction 11 with 151 rules applied. Total rules applied 16746 place count 343 transition count 494
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 884 edges and 335 vertex of which 317 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 9 rules applied. Total rules applied 16755 place count 317 transition count 494
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 16773 place count 317 transition count 476
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 13 with 26 rules applied. Total rules applied 16799 place count 317 transition count 476
Applied a total of 16799 rules in 1237 ms. Remains 317 /9140 variables (removed 8823) and now considering 476/14577 (removed 14101) transitions.
// Phase 1: matrix 476 rows 317 cols
[2023-03-17 06:11:33] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-17 06:11:34] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1647 ms. Remains : 317/9140 places, 476/14577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 9) seen :6
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 06:11:34] [INFO ] Invariant cache hit.
[2023-03-17 06:11:34] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:11:34] [INFO ] [Nat]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-17 06:11:35] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:11:35] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-17 06:11:35] [INFO ] After 113ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 06:11:35] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-17 06:11:35] [INFO ] After 783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 34 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 476/476 transitions.
Graph (trivial) has 91 edges and 317 vertex of which 22 / 317 are part of one of the 8 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions removed 26 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 303 transition count 422
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 49 place count 282 transition count 416
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 280 transition count 415
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 52 place count 280 transition count 412
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 277 transition count 412
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 61 place count 274 transition count 409
Iterating global reduction 3 with 3 rules applied. Total rules applied 64 place count 274 transition count 409
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 274 transition count 406
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 87 place count 264 transition count 396
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 89 place count 264 transition count 394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 263 transition count 393
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 263 transition count 393
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 261 transition count 400
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 104 place count 261 transition count 391
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 108 place count 261 transition count 387
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 112 place count 257 transition count 387
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 115 place count 257 transition count 387
Applied a total of 115 rules in 77 ms. Remains 257 /317 variables (removed 60) and now considering 387/476 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 257/317 places, 387/476 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 06:11:35] [INFO ] Flow matrix only has 386 transitions (discarded 1 similar events)
// Phase 1: matrix 386 rows 257 cols
[2023-03-17 06:11:35] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-17 06:11:35] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:11:35] [INFO ] [Nat]Absence check using 58 positive place invariants in 15 ms returned sat
[2023-03-17 06:11:36] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:11:36] [INFO ] State equation strengthened by 174 read => feed constraints.
[2023-03-17 06:11:36] [INFO ] After 73ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 06:11:36] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-17 06:11:36] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 387/387 transitions.
Graph (trivial) has 48 edges and 257 vertex of which 6 / 257 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 254 transition count 370
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 243 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 243 transition count 368
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 26 place count 242 transition count 368
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 240 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 240 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 240 transition count 359
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 234 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 234 transition count 352
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 57 place count 234 transition count 340
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 234 transition count 337
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 64 place count 231 transition count 336
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 66 place count 231 transition count 336
Applied a total of 66 rules in 61 ms. Remains 231 /257 variables (removed 26) and now considering 336/387 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 231/257 places, 336/387 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished Best-First random walk after 3328 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=475 )
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 38323 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: NoC3x3_PT_8B
(NrP: 9140 NrTr: 14577 NrArc: 30726)

parse formulas
formulas created successfully
place and transition orderings generation:0m18.388sec

net check time: 0m 0.009sec

init dd package: 0m 3.381sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7234972 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096868 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 1.590sec

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="NoC3x3-PT-8B"
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 NoC3x3-PT-8B, 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 r266-smll-167863540800350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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